Imagen de Portada

Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bojikian, Narek, Kratsch, Stefan
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms 05C85 F.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tight Bounds for Feedback Vertex Set Parameterized by Clique-width
por: Bojikian, Narek, et al.
Publicado: (2025)

Tight Bounds for some Classical Problems Parameterized by Cutwidth
por: Bojikian, Narek, et al.
Publicado: (2025)

A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width
por: Bojikian, Narek, et al.
Publicado: (2023)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Finding Diverse Solutions Parameterized by Cliquewidth
por: Drabik, Karolina, et al.
Publicado: (2024)

Steiner Tree Parameterized by Multiway Cut and Even Less
por: Jansen, Bart M. P., et al.
Publicado: (2024)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
por: Bergougnoux, Benjamin, et al.
Publicado: (2026)

A practical algorithm for 2-admissibility
por: Awofeso, Christine, et al.
Publicado: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
por: Bougeret, Marin, et al.
Publicado: (2024)

Finding Diverse Minimum s-t Cuts
por: de Berg, Mark, et al.
Publicado: (2023)

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

Improved Outerplanarity Bounds for Planar Graphs
por: Biedl, Therese, et al.
Publicado: (2024)

Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
por: Bonnet, Édouard, et al.
Publicado: (2023)

A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees
por: Jaffke, Lars, et al.
Publicado: (2025)

Conformality of Minimal Transversals of Maximal Cliques
por: Boros, Endre, et al.
Publicado: (2024)

From Hop Reduction to Sparsification for Negative Length Shortest Paths
por: Quanrud, Kent, et al.
Publicado: (2025)

Spanning Trees with a Small Vertex Cover: the Complexity on Specific Graph Classes
por: Kokai, Toranosuke, et al.
Publicado: (2025)

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
por: Atherton, William, et al.
Publicado: (2024)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

$t$-sails and sparse hereditary classes of unbounded tree-width
por: Cocks, Daniel
Publicado: (2023)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
por: Huber, Michael Kiran
Publicado: (2024)

Kernelization dichotomies for hitting minors under structural parameterizations
por: Bougeret, Marin, et al.
Publicado: (2025)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
por: Masařík, Tomáš, et al.
Publicado: (2026)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
por: Krishnaswamy, Ravishankar, et al.
Publicado: (2014)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
por: Patzner, Julian, et al.
Publicado: (2024)

Correlation Clustering with Vertex Splitting
por: Bentert, Matthias, et al.
Publicado: (2024)

Exact Algorithms for MaxCut on Split Graphs
por: Lalovic, Marko
Publicado: (2024)

Shortest two disjoint paths in conservative graphs
por: Schlotter, Ildikó
Publicado: (2023)

The Upper Clique Transversal Problem
por: Milanič, Martin, et al.
Publicado: (2023)

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
por: Baste, Julien, et al.
Publicado: (2019)

The Complexity of Distance-$r$ Dominating Set Reconfiguration
por: Banerjee, Niranka, et al.
Publicado: (2023)

On the Complexity of the Bilevel Shortest Path Problem
por: Henke, Dorothee, et al.
Publicado: (2024)

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

Traffic-Oblivious Multi-Commodity Flow Network Design
por: Chimani, Markus, et al.
Publicado: (2025)

A simple quadratic kernel for Token Jumping on surfaces
por: Cranston, Daniel W., et al.
Publicado: (2024)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
por: Bojikian, Narek, et al.
Publicado: (2025)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
por: Oum, Sang-il, et al.
Publicado: (2026)

Cluster deletion and clique partitioning in graphs with bounded clique number
por: Galesi, Nicola, et al.
Publicado: (2025)

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
por: Boros, Endre, et al.
Publicado: (2023)

A $4/3$ Approximation for $2$-Vertex-Connectivity
por: Bosch-Calvo, Miguel, et al.
Publicado: (2023)