Image de couverture de livre

FPT Parameterisations of Fractional and Generalised Hypertree Width

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lanzinger, Matthias, Razgon, Igor, Unterberger, Daniel
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
par: Lanzinger, Matthias, et autres
Publié: (2023)

Parameterised distance to local irregularity
par: Fioravantes, Foivos, et autres
Publié: (2023)

FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
par: Chu, Huairui, et autres
Publié: (2023)

Space Efficient Algorithms for Parameterised Problems
par: Akhtar, Sheikh Shakil, et autres
Publié: (2025)

$O(n +f(k))$: Truly Linear FPT
par: Bumpus, Benjamin Merlin, et autres
Publié: (2026)

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
par: Baril, Ambroise, et autres
Publié: (2025)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Cuts and Gauges for Submodular Width
par: Lanzinger, Matthias
Publié: (2026)

Solving Problems on Generalized Convex Graphs via Mim-Width
par: Bonomo-Braberman, Flavia, et autres
Publié: (2020)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Deterministic Independent Sets in the Semi-Streaming Model
par: Ye, Daniel
Publié: (2025)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

Counting Small Induced Subgraphs: Hardness via Fourier Analysis
par: Curticapean, Radu, et autres
Publié: (2024)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
par: Esmer, Barış Can, et autres
Publié: (2022)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
par: Beisegel, Jesse, et autres
Publié: (2025)

Generalized Graph Packing Problems Parameterized by Treewidth
par: Esmer, Barış Can, et autres
Publié: (2025)

On the Space Complexity of Online Convolution
par: Andersson, Joel Daniel, et autres
Publié: (2025)

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
par: Curticapean, Radu, et autres
Publié: (2025)

Treedepth Inapproximability and Exponential ETH Lower Bound
par: Bonnet, Édouard, et autres
Publié: (2025)

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
par: Döring, Simon, et autres
Publié: (2024)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)

Can You Link Up With Treewidth?
par: Curticapean, Radu, et autres
Publié: (2024)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
par: S., Karthik C., et autres
Publié: (2023)

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
par: Focke, Jacob, et autres
Publié: (2023)

On the Advantage of Adaptivity for Sampling with Cell Probes
par: Byramji, Farzan, et autres
Publié: (2026)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
par: Esmer, Barış Can, et autres
Publié: (2022)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
par: Esmer, Barış Can, et autres
Publié: (2024)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
par: Frei, Fabian, et autres
Publié: (2025)

From Chinese Postman to Salesman and Beyond I: Approximating Shortest Tours $δ$-Covering All Points on All Edges
par: Frei, Fabian, et autres
Publié: (2024)

An alignment problem
par: McDaniel, Emma L., et autres
Publié: (2024)

Colouring $(P_r+P_s)$-Free Graphs
par: Klimošová, Tereza, et autres
Publié: (2018)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
par: Beisegel, Jesse, et autres
Publié: (2024)

Fractional Linear Matroid Matching is in quasi-NC
par: Gurjar, Rohit, et autres
Publié: (2024)

Broadcasting under Structural Restrictions
par: Egami, Yudai, et autres
Publié: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
par: Beisegel, Jesse, et autres
Publié: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
par: Beisegel, Jesse, et autres
Publié: (2025)

The Trichotomy of Regular Property Testing
par: Bathie, Gabriel, et autres
Publié: (2025)

Downward self-reducibility in the total function polynomial hierarchy
par: Gajulapalli, Karthik, et autres
Publié: (2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
par: Fujie, Yuto, et autres
Publié: (2025)

Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
par: Moroie, Gregory
Publié: (2025)