Image de couverture de livre

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bergougnoux, Benjamin, Chekan, Vera, Ganian, Robert, Kanté, Mamadou Moustapha, Mnich, Matthias, Oum, Sang-il, Pilipczuk, Michał, van Leeuwen, Erik Jan
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

A Survey on Graph Problems Parameterized Above and Below Guaranteed Values
par: Gutin, Gregory, et autres
Publié: (2022)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
par: Alecu, Bogdan, et autres
Publié: (2024)

Testing H-freeness on sparse graphs, the case of bounded expansion
par: Humeau, Samuel, et autres
Publié: (2025)

Parameterized and approximation algorithms for coverings points with segments in the plane
par: Kowalska, Katarzyna, et autres
Publié: (2024)

Parameterized dynamic data structure for Split Completion
par: Majewski, Konrad, et autres
Publié: (2024)

Tight Bounds for some Classical Problems Parameterized by Cutwidth
par: Bojikian, Narek, et autres
Publié: (2025)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
par: Oum, Sang-il, et autres
Publié: (2026)

Parameterized Complexity of Efficient Sortation
par: Ganian, Robert, et autres
Publié: (2024)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
par: Ganian, Robert, et autres
Publié: (2024)

A $(\frac32+\frac1{\mathrm{e}})$-Approximation Algorithm for Ordered TSP
par: Armbruster, Susanne, et autres
Publié: (2024)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

Twin‐width of random graphs
par: Jungho Ahn, et autres
Publié: (2024)

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
par: Chalermsook, Parinya, et autres
Publié: (2021)

Parameterized Complexity of MinCSP over the Point Algebra
par: Osipov, George, et autres
Publié: (2023)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Graph classes through the lens of logic
par: Pilipczuk, Michał
Publié: (2025)

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)

Parameterized algorithms for block-structured integer programs with large entries
par: Cslovjecsek, Jana, et autres
Publié: (2023)

Branch-width of connectivity functions is fixed-parameter tractable
par: Korhonen, Tuukka, et autres
Publié: (2026)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
par: Pilipczuk, Michał, et autres
Publié: (2025)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
par: Fischer, David, et autres
Publié: (2022)

Faster diameter computation in graphs of bounded Euler genus
par: Kluk, Kacper, et autres
Publié: (2025)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
par: Eiben, Eduard, et autres
Publié: (2024)

The Parameterized Complexity of Extending Stack Layouts
par: Depian, Thomas, et autres
Publié: (2024)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
par: Kaul, Matthias, et autres
Publié: (2025)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
par: Kaul, Matthias, et autres
Publié: (2024)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
par: Lokshtanov, Daniel, et autres
Publié: (2026)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
par: Oostveen, Jelle J., et autres
Publié: (2022)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
par: Bentert, Matthias, et autres
Publié: (2026)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
par: S, Ajaykrishnan E, et autres
Publié: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

Minor Containment and Disjoint Paths in almost-linear time
par: Korhonen, Tuukka, et autres
Publié: (2024)

Dynamic Detours
par: Dadush, Daniel, et autres
Publié: (2026)

Branch-width of represented matroids in matrix multiplication time
par: Choi, Mujin, et autres
Publié: (2026)

Enumerating minimal solution sets for metric graph problems
par: Bergougnoux, Benjamin, et autres
Publié: (2023)