Pages that link to "Item:Q5167804"

The following pages link to A Faster Parameterized Algorithm for Treedepth (Q5167804):

Displaying 28 items.

• Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
• A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
• Eccentricity queries and beyond using hub labels (Q2166770) (← links)
• Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
• Polynomial treedepth bounds in linear colorings (Q2223702) (← links)
• Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
• How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
• On vertex rankings of graphs and its relatives (Q2342634) (← links)
• FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
• Faster Computation of Path-Width (Q2819521) (← links)
• Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
• Improved Bounds for the Excluded-Minor Approximation of Treedepth (Q4990393) (← links)
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
• Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
• Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
• Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
• (Q5075772) (← links)
• Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
• Uniformly Automatic Classes of Finite Structures (Q5090943) (← links)
• How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
• Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
• On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
• Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
• On the size of minimal separators for treedepth decomposition (Q6558688) (← links)
• Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)
• Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
• Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)