Imagen de Portada

Subexponential Parameterized Algorithms for Hitting Subgraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lokshtanov, Daniel, Panolan, Fahad, Saurabh, Saket, Xue, Jie, Zehavi, Meirav
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
por: Fomin, Fedor V., et al.
Publicado: (2025)

Parameterized Saga of First-Fit and Last-Fit Coloring
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

FPT Approximations for Connected Maximum Coverage
por: Inamdar, Tanmay, et al.
Publicado: (2026)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
por: Jana, Satyabrata, et al.
Publicado: (2025)

Parameterized Algorithms for Minimum Sum Vertex Cover
por: Aute, Shubhada, et al.
Publicado: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Parameterized Geometric Graph Modification with Disk Scaling
por: Fomin, Fedor V., et al.
Publicado: (2024)

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
por: Gupta, Sushmita, et al.
Publicado: (2024)

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
por: Gahlawat, Harmender, et al.
Publicado: (2025)

Treewidth Parameterized by Feedback Vertex Number
por: Molter, Hendrik, et al.
Publicado: (2025)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
por: Chaudhary, Juhi, et al.
Publicado: (2024)

A Parameterized Perspective on Uniquely Restricted Matchings
por: Chaudhary, Juhi, et al.
Publicado: (2025)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
por: Kumar, Mithilesh, et al.
Publicado: (2024)

Hybrid k-Clustering: Blending k-Median and k-Center
por: Fomin, Fedor V., et al.
Publicado: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
por: Gahlawat, Harmender, et al.
Publicado: (2025)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
por: Aute, Shubhada, et al.
Publicado: (2026)

Minimum Temporal Spanners in Happy Graphs
por: Casteigts, Arnaud, et al.
Publicado: (2026)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
por: Bhore, Sujoy, et al.
Publicado: (2025)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
por: Inamdar, Tanmay, et al.
Publicado: (2024)

Fixed-Parameter Tractability of Hedge Cut
por: Fomin, Fedor V., et al.
Publicado: (2024)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
por: Bentert, Matthias, et al.
Publicado: (2026)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
por: Gupta, Sushmita, et al.
Publicado: (2025)

Packing Short Cycles
por: Bentert, Matthias, et al.
Publicado: (2024)

Path Contraction Faster than $2^n$
por: Agrawal, Akanksha, et al.
Publicado: (2025)

Parameterized Approximation of Rectangle Stabbing
por: Chu, Huairui, et al.
Publicado: (2026)

Faster Parameterized Vertex Multicut
por: Chu, Huairui, et al.
Publicado: (2026)

Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
por: Marin, Malory
Publicado: (2025)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
por: Bentert, Matthias, et al.
Publicado: (2024)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
por: Ameli, Afrouz Jabal, et al.
Publicado: (2026)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

How to Make Knockout Tournaments More Popular?
por: Chaudhary, Juhi, et al.
Publicado: (2023)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
por: Gupta, Sushmita, et al.
Publicado: (2024)

Exact Algorithms for Clustered Planarity with Linear Saturators
por: Da Lozzo, Giordano, et al.
Publicado: (2024)

A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
por: Kumar, Mithilesh, et al.
Publicado: (2016)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
por: Kenig, Batya, et al.
Publicado: (2024)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
por: Jacob, Ashwin, et al.
Publicado: (2024)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)