Image de couverture de livre

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gartland, Peter, Lokshtanov, Daniel, Masařík, Tomáš, Pilipczuk, Marcin, Pilipczuk, Michał, Rzążewski, Paweł
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms 05C69, 05C85 F.2.2; G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
par: Masařík, Tomáš, et autres
Publié: (2026)

Independent Locating-Dominating Sets in Pseudotrees
par: Cáceres, José, et autres
Publié: (2026)

On treewidth and maximum cliques
par: Chudnovsky, Maria, et autres
Publié: (2024)

Finding Diverse Solutions Parameterized by Cliquewidth
par: Drabik, Karolina, et autres
Publié: (2024)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
par: Morelle, Laure, et autres
Publié: (2025)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
par: Koutsoutis, Alex, et autres
Publié: (2025)

Dynamic programming on bipartite tree decompositions
par: Jaffke, Lars, et autres
Publié: (2023)

Finding irrelevant vertices in linear time on bounded-genus graphs
par: Golovach, Petr A., et autres
Publié: (2019)

Faster parameterized algorithms for modification problems to minor-closed classes
par: Morelle, Laure, et autres
Publié: (2022)

Vertex identification to a forest
par: Morelle, Laure, et autres
Publié: (2024)

Finding Diverse Minimum s-t Cuts
par: de Berg, Mark, et autres
Publié: (2023)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
par: Sau, Ignasi, et autres
Publié: (2024)

Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
par: Bonnet, Édouard, et autres
Publié: (2023)

Cluster deletion and clique partitioning in graphs with bounded clique number
par: Galesi, Nicola, et autres
Publié: (2025)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
par: Krishnaswamy, Ravishankar, et autres
Publié: (2014)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2023)

Shortest two disjoint paths in conservative graphs
par: Schlotter, Ildikó
Publié: (2023)

The price of homogeneity is polynomial
par: Gorsky, Maximilian, et autres
Publié: (2026)

Identification to Subclasses of Chordal Graphs
par: Golovach, Petr A., et autres
Publié: (2026)

Optimal Bounds for the k-Disjoint Paths Problem
par: Cavallaro, Dario, et autres
Publié: (2026)

A practical algorithm for 2-admissibility
par: Awofeso, Christine, et autres
Publié: (2025)

Tree-independence number VI. Thetas and pyramids
par: Chudnovsky, Maria, et autres
Publié: (2025)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
par: Bougeret, Marin, et autres
Publié: (2024)

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

Kernelization dichotomies for hitting minors under structural parameterizations
par: Bougeret, Marin, et autres
Publié: (2025)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
par: Agrawal, Akanksha, et autres
Publié: (2024)

On Relaxation of Dominant Sets
par: Koster, Max
Publié: (2022)

Exact Algorithms for MaxCut on Split Graphs
par: Lalovic, Marko
Publié: (2024)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)

Compact Representation of Semilinear and Terrain-like Graphs
par: Cardinal, Jean, et autres
Publié: (2025)

Quickly excluding an annotated planar graph
par: Gorsky, Maximilian, et autres
Publié: (2026)

A note on locating-dominating sets in twin-free graphs
par: Bousquet, Nicolas, et autres
Publié: (2024)

On the parameterized complexity of computing good edge-labelings
par: de Andrade, Davi, et autres
Publié: (2024)

Excluding a Forest Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2025)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
par: Dahlmeier, J Niklas, et autres
Publié: (2025)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
par: Haslebacher, Sebastian
Publié: (2025)

Sparse Induced Subgraphs of Large Treewidth
par: Bonnet, Édouard
Publié: (2024)

A coarse Menger's Theorem for planar and bounded genus graphs
par: Blažej, Václav, et autres
Publié: (2026)