Imagen de Portada

Residue Domination in Bounded-Treewidth Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Greilhuber, Jakob, Schepper, Philipp, Wellnitz, Philip
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
por: Greilhuber, Jakob, et al.
Publicado: (2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
por: Focke, Jacob, et al.
Publicado: (2022)

A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth
por: Greilhuber, Jakob, et al.
Publicado: (2026)

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
por: Döring, Simon, et al.
Publicado: (2024)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
por: Esmer, Barış Can, et al.
Publicado: (2024)

Generalized Graph Packing Problems Parameterized by Treewidth
por: Esmer, Barış Can, et al.
Publicado: (2025)

FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
por: Chu, Huairui, et al.
Publicado: (2023)

The Complexity of Finding and Counting Subtournaments
por: Döring, Simon, et al.
Publicado: (2025)

Minimum Stable Cut and Treewidth
por: Lampis, Michael
Publicado: (2021)

The Complexity of Counting Small Sub-Hypergraphs
por: Bressan, Marco, et al.
Publicado: (2025)

Can You Link Up With Treewidth?
por: Curticapean, Radu, et al.
Publicado: (2024)

k-SUM Hardness Implies Treewidth-SETH
por: Lampis, Michael
Publicado: (2025)

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
por: Ganian, Robert, et al.
Publicado: (2026)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2023)

Dominating Set Knapsack: Profit Optimization on Dominating Sets
por: Singh, Sipra
Publicado: (2025)

On $[1,2]$-Domination in Interval and Circle Graphs
por: Meybodi, Mohsen Alambardar, et al.
Publicado: (2024)

Bounded Independence Edge Sampling for Combinatorial Graph Properties
por: Putterman, Aaron, et al.
Publicado: (2026)

On the Complexity of Signed Roman Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Hardness and Algorithmic Results for Roman \{3\}-Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)

Fine-Grained Classification Of Detecting Dominating Patterns
por: Dransfeld, Jonathan, et al.
Publicado: (2025)

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
por: Baril, Ambroise, et al.
Publicado: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
por: Beisegel, Jesse, et al.
Publicado: (2025)

Lower Bounds for Convexity Testing
por: Chen, Xi, et al.
Publicado: (2024)

Kernelization Bounds for Constrained Coloring
por: Haviv, Ishay
Publicado: (2026)

Clustering with Locally Bounded Ignorance
por: Garvardt, Jaroslav, et al.
Publicado: (2026)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Improved Space Bounds for Subset Sum
por: Belova, Tatiana, et al.
Publicado: (2024)

Sensitivity Lower Bounds for Approximaiton Algorithms
por: Fleming, Noah, et al.
Publicado: (2024)

The Structure of In-Place Space-Bounded Computation
por: Cook, James, et al.
Publicado: (2025)

Treedepth Inapproximability and Exponential ETH Lower Bound
por: Bonnet, Édouard, et al.
Publicado: (2025)

Tight Streaming Lower Bounds for Deterministic Approximate Counting
por: Wang, Yichuan
Publicado: (2024)

On the complexity and approximability of Bounded access Lempel Ziv coding
por: Cicalese, Ferdinando, et al.
Publicado: (2024)

Linear Space Streaming Lower Bounds for Approximating CSPs
por: Chou, Chi-Ning, et al.
Publicado: (2021)

Structural Parameterizations for Two Bounded Degree Problems Revisited
por: Lampis, Michael, et al.
Publicado: (2023)

Multi-Pass Streaming Lower Bounds for Uniformity Testing
por: Li, Qian, et al.
Publicado: (2025)

Near-Optimal Space Lower Bounds for Streaming CSPs
por: Fei, Yumou, et al.
Publicado: (2026)

Core Stability in Additively Separable Hedonic Games of Low Treewidth
por: Hanaka, Tesshu, et al.
Publicado: (2024)