Image de couverture de livre

Structural Parameterizations for Two Bounded Degree Problems Revisited

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lampis, Michael, Vasilakis, Manolis
Format:	Preprint
Publié:	2023
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

Parameterized Capacitated Vertex Cover Revisited
par: Lampis, Michael, et autres
Publié: (2026)

Structural Parameterizations for Induced and Acyclic Matching
par: Lampis, Michael, et autres
Publié: (2025)

Parameterized Maximum Node-Disjoint Paths
par: Lampis, Michael, et autres
Publié: (2024)

Parameterized Vertex Integrity Revisited
par: Hanaka, Tesshu, et autres
Publié: (2024)

Parameterized Max Min Feedback Vertex Set
par: Lampis, Michael, et autres
Publié: (2023)

Parameterized Critical Node Cut Revisited
par: Knop, Dušan, et autres
Publié: (2025)

Structural Parameters for Steiner Orientation
par: Hanaka, Tesshu, et autres
Publié: (2025)

Bandwidth Parameterized by Cluster Vertex Deletion Number
par: Gima, Tatsuya, et autres
Publié: (2023)

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

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

First Order Logic on Pathwidth Revisited Again
par: Lampis, Michael
Publié: (2022)

k-SUM Hardness Implies Treewidth-SETH
par: Lampis, Michael
Publié: (2025)

The Primal Pathwidth SETH
par: Lampis, Michael
Publié: (2024)

Minimum Stable Cut and Treewidth
par: Lampis, Michael
Publié: (2021)

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

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
par: Grüttemeier, Niels, et autres
Publié: (2025)

Near-Optimal Bounds for Parameterized Euclidean k-means
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

On the Parameterized Complexity of Odd Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2025)

Parameterized complexity of reconfiguration of atoms
par: Cooper, Alexandre, et autres
Publié: (2021)

Parameterized Restless Temporal Path
par: Cauvi, Justine, et autres
Publié: (2025)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
par: Foucaud, Florent, et autres
Publié: (2023)

The Structure of In-Place Space-Bounded Computation
par: Cook, James, et autres
Publié: (2025)

On the Parameterized Complexity of Min-Sum-Radii
par: Kumar, Pankaj, et autres
Publié: (2026)

The Parameterized Landscape of Labeled Graph Contractions
par: Lafond, Manuel, et autres
Publié: (2025)

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

Parameterized Algorithms for Editing to Uniform Cluster Graph
par: Gaikwad, Ajinkya, et autres
Publié: (2024)

Detecting Low-Degree Truncation
par: De, Anindya, et autres
Publié: (2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
par: Oostveen, Jelle J., et autres
Publié: (2022)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
par: Banik, Aritra, et autres
Publié: (2025)

Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems
par: Hu, Bingbing, et autres
Publié: (2024)

Quantum Property Testing for Bounded-Degree Directed Graphs
par: Peng, Pan, et autres
Publié: (2026)

The Quasi-Polynomial Low-Degree Conjecture is False
par: Buhai, Rares-Darius, et autres
Publié: (2025)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
par: Bodlaender, Hans L., et autres
Publié: (2026)

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

Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches
par: Pintér, József, et autres
Publié: (2026)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
par: Bai, Tian, et autres
Publié: (2026)

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

Fine-grained Meta-Theorems for Vertex Integrity
par: Lampis, Michael, et autres
Publié: (2021)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
par: Maalouly, Nicolas El, et autres
Publié: (2025)