Imagen de Portada

Dynamic programming on bipartite tree decompositions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jaffke, Lars, Morelle, Laure, Sau, Ignasi, Thilikos, Dimitrios M.
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms 05C85, 68R10, 05C75, 05C83, 05C75, 05C69 F.2.2; G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
por: Morelle, Laure, et al.
Publicado: (2025)

Vertex identification to a forest
por: Morelle, Laure, et al.
Publicado: (2024)

Faster parameterized algorithms for modification problems to minor-closed classes
por: Morelle, Laure, et al.
Publicado: (2022)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
por: Sau, Ignasi, et al.
Publicado: (2024)

Finding irrelevant vertices in linear time on bounded-genus graphs
por: Golovach, Petr A., et al.
Publicado: (2019)

Excluding Pinched Spheres
por: Morelle, Laure, et al.
Publicado: (2025)

Obstructions to Erdős-Pósa Dualities for Minors
por: Paul, Christophe, et al.
Publicado: (2024)

Optimal Bounds for the k-Disjoint Paths Problem
por: Cavallaro, Dario, et al.
Publicado: (2026)

Colorful Minors
por: Protopapas, Evangelos, et al.
Publicado: (2025)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
por: Sau, Ignasi, et al.
Publicado: (2026)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
por: Paul, Christophe, et al.
Publicado: (2024)

The Local Structure Theorem for Graph Minors with finite index
por: Paul, Christophe, et al.
Publicado: (2025)

Approximating branchwidth on parametric extensions of planarity
por: Thilikos, Dimitrios M., et al.
Publicado: (2023)

Excluding surfaces as minors in graphs
por: Thilikos, Dimitrios M., et al.
Publicado: (2026)

Identification to Subclasses of Chordal Graphs
por: Golovach, Petr A., et al.
Publicado: (2026)

A Constant-factor Approximation for Weighted Bond Cover
por: Kim, Eun Jung, et al.
Publicado: (2021)

An Overview of Universal Obstructions for Graph Parameters
por: Paul, Christophe, et al.
Publicado: (2023)

Quickly excluding an annotated planar graph
por: Gorsky, Maximilian, et al.
Publicado: (2026)

The price of homogeneity is polynomial
por: Gorsky, Maximilian, et al.
Publicado: (2026)

Excluding a Forest Induced Minor
por: Bonnet, Édouard, et al.
Publicado: (2025)

Killing a Vortex
por: Thilikos, Dimitrios M., et al.
Publicado: (2022)

On treewidth and maximum cliques
por: Chudnovsky, Maria, et al.
Publicado: (2024)

W-state graphs: Structure and Algorithms
por: Gajjala, Rishikesh, et al.
Publicado: (2026)

Catching Rats in $H$-minor-free Graphs
por: Gorsky, Maximilian, et al.
Publicado: (2025)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
por: Choi, Mujin, et al.
Publicado: (2025)

Polynomial Bounds for the Graph Minor Structure Theorem
por: Gorsky, Maximilian, et al.
Publicado: (2025)

The Directed Disjoint Paths Problem with Congestion
por: Bentert, Matthias, et al.
Publicado: (2025)

On Strict Brambles
por: Lardas, Emmanouil, et al.
Publicado: (2022)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
por: Gartland, Peter, et al.
Publicado: (2023)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
por: Koutsoutis, Alex, et al.
Publicado: (2025)

Tree-independence number VI. Thetas and pyramids
por: Chudnovsky, Maria, et al.
Publicado: (2025)

On the parameterized complexity of computing good edge-labelings
por: de Andrade, Davi, et al.
Publicado: (2024)

Prime vertex-minors of a prime graph
por: Kim, Donggyu, et al.
Publicado: (2022)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
por: Chudnovsky, Maria, et al.
Publicado: (2024)

The Minimum Subgraph Complementation Problem
por: Gutiérrez, Juan, et al.
Publicado: (2025)

A New Temporal Interpretation of Cluster Editing
por: Bocci, Cristiano, et al.
Publicado: (2022)

Excluding an induced wheel minor in graphs without large induced stars
por: Choi, Mujin, et al.
Publicado: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
por: Bessy, Stéphane, et al.
Publicado: (2023)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
por: Bousquet, Nicolas, et al.
Publicado: (2024)

(Even hole, triangle)-free graphs revisited
por: Martins, Beatriz, et al.
Publicado: (2026)