ERD

Complexity of the Steiner Network Problem withRespect to the Number of Terminals

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Popular Matching in Roommates Setting is NP-hard

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Slightly Superexponential Parameterized Problems

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Interval Vertex Deletion Admits a Polynomial Kernel

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Covering vectors by spaces: Regular matroids (short version).

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

A Linear-Time Parameterized Algorithm for Node Unique Label Cover.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Packing Cycles Faster Than Erdos-Pósa.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

The Complexity of Independent Set Reconfiguration on Bipartite Graphs

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

The Parameterized Complexity of Finding Point Sets with Hereditary Properties.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Reducing CMSO Model Checking to Highly Connected Graphs

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Improved Results for Minimum Constraint Removal

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

How to Navigate Through Obstacles?

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Periodic Reporting for period 2 - PaPaAlg (Pareto-Optimal Parameterized Algorithms)

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Balanced Judicious Bipartition is FPT.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

On the Parameterized Complexity of Simultaneous Deletion Problems.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Erdös-Pósa Property of Obstructions to Interval Graphs.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Small Resolution Proofs for QBF using Dependency Treewidth

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth.

Project: PaPaAlg

Updated at: 27-04-2024

Show more information

Project acronym PaPaAlg

Resources

Selected filters:

Complexity of the Steiner Network Problem withRespect to the Number of Terminals

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

Popular Matching in Roommates Setting is NP-hard

Slightly Superexponential Parameterized Problems

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

Interval Vertex Deletion Admits a Polynomial Kernel

Covering vectors by spaces: Regular matroids (short version).

A Linear-Time Parameterized Algorithm for Node Unique Label Cover.

Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices.

Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth.

Packing Cycles Faster Than Erdos-Pósa.

The Complexity of Independent Set Reconfiguration on Bipartite Graphs

The Parameterized Complexity of Finding Point Sets with Hereditary Properties.

Reducing CMSO Model Checking to Highly Connected Graphs

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

Improved Results for Minimum Constraint Removal

How to Navigate Through Obstacles?

Periodic Reporting for period 2 - PaPaAlg (Pareto-Optimal Parameterized Algorithms)

Balanced Judicious Bipartition is FPT.

On the Parameterized Complexity of Simultaneous Deletion Problems.

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

Erdös-Pósa Property of Obstructions to Interval Graphs.

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.

Small Resolution Proofs for QBF using Dependency Treewidth

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth.