ERD

Cluster Editing Parameterized Above Modification-Disjoint P3-Packings

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Constant Congestion Brambles

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Constant Congestion Brambles in Directed Graphs

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Flexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Hardness of Metric Dimension in Graphs of Constant Treewidth

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Exact and approximation algorithms for sensor placement against DDoS attacks

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Polynomial Treedepth Bounds in Linear Colorings

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Two lower bounds for p-centered colorings

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Threshold Treewidth and Hypertree Width

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Determining 4-Edge-Connected Components in Linear Time

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Many-visits TSP revisited

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Efficient algorithms for measuring the funnel-likeness of DAGs

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Vertex Deletion into Bipartite Permutation Graphs

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Complexity of the List Homomorphism Problem in Hereditary Graph Classes

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Coloring squares of planar graphs with small maximum degree

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Computing List Homomorphisms in Geometric Intersection Graphs

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Decreasing the Maximum Average Degree by Deleting an Independent Set or a d-Degenerate Subgraph

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

On 3-Coloring of (2P4, C5 )-Free Graphs

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

An Improved FPT Algorithm for Independent Feedback Vertex Set

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Approximating Pathwidth for Graphs of Small Treewidth

Project: CUTACOMBS

Updated at: 27-04-2024

Show more information

Project acronym CUTACOMBS

Resources

Selected filters:

Cluster Editing Parameterized Above Modification-Disjoint P3-Packings

Constant Congestion Brambles

Constant Congestion Brambles in Directed Graphs

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth

Flexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four

Hardness of Metric Dimension in Graphs of Constant Treewidth

On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five

Exact and approximation algorithms for sensor placement against DDoS attacks

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Polynomial Treedepth Bounds in Linear Colorings

On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy

Two lower bounds for p-centered colorings

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory

Threshold Treewidth and Hypertree Width

Determining 4-Edge-Connected Components in Linear Time

Many-visits TSP revisited

Efficient algorithms for measuring the funnel-likeness of DAGs

U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited

Vertex Deletion into Bipartite Permutation Graphs

Complexity of the List Homomorphism Problem in Hereditary Graph Classes

Coloring squares of planar graphs with small maximum degree

Computing List Homomorphisms in Geometric Intersection Graphs

Decreasing the Maximum Average Degree by Deleting an Independent Set or a d-Degenerate Subgraph

On 3-Coloring of (2P4, C5 )-Free Graphs

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

An Improved FPT Algorithm for Independent Feedback Vertex Set

Approximating Pathwidth for Graphs of Small Treewidth