Imagen de Portada

Fine-grained Meta-Theorems for Vertex Integrity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lampis, Michael, Mitsou, Valia
Formato:	Preprint
Publicado:	2021
Materias:	Computational Complexity Data Structures and Algorithms Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

First Order Logic on Pathwidth Revisited Again
por: Lampis, Michael
Publicado: (2022)

Parameterized Vertex Integrity Revisited
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Parameterized Capacitated Vertex Cover Revisited
por: Lampis, Michael, et al.
Publicado: (2026)

Fair Vertex Problems Parameterized by Cluster Vertex Deletion
por: Masařík, Tomáš, et al.
Publicado: (2025)

Parameterized Max Min Feedback Vertex Set
por: Lampis, Michael, et al.
Publicado: (2023)

Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
por: Barto, Libor, et al.
Publicado: (2026)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Broadcasting under Structural Restrictions
por: Egami, Yudai, et al.
Publicado: (2025)

Enumeration and updates for conjunctive linear algebra queries through expressibility
por: Muñoz, Thomas, et al.
Publicado: (2023)

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

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

The Primal Pathwidth SETH
por: Lampis, Michael
Publicado: (2024)

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
por: Černý, Marek, et al.
Publicado: (2025)

Transductive Learning Is Compact
por: Asilis, Julian, et al.
Publicado: (2024)

On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition
por: Černý, Marek
Publicado: (2026)

Polynomial Logical Zonotope: A Set Representation for Reachability Analysis of Logical Systems
por: Alanwar, Amr, et al.
Publicado: (2023)

A faster FPRAS for #NFA
por: Meel, Kuldeep S., et al.
Publicado: (2023)

Smaller Circuits for Bit Addition
por: Goncharov, Mikhail, et al.
Publicado: (2025)

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

Structural Parameterizations for Induced and Acyclic Matching
por: Lampis, Michael, et al.
Publicado: (2025)

Parameterized Maximum Node-Disjoint Paths
por: Lampis, Michael, et al.
Publicado: (2024)

Finding hardness reductions automatically using SAT solvers
por: Bergold, Helena, et al.
Publicado: (2024)

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

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
por: Nederlof, Jesper
Publicado: (2026)

The Ideal Membership Problem and Abelian Groups
por: Bulatov, Andrei A., et al.
Publicado: (2022)

Satisfactory Budget Division
por: Gourvès, Laurent, et al.
Publicado: (2025)

Bandwidth Parameterized by Cluster Vertex Deletion Number
por: Gima, Tatsuya, et al.
Publicado: (2023)

Exact Algorithms for Distance to Unique Vertex Cover
por: Fioravantes, Foivos, et al.
Publicado: (2025)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
por: Dey, Palash, et al.
Publicado: (2024)

On the Complexity of 2-club Cluster Editing with Vertex Splitting
por: Abu-Khzam, Faisal N., et al.
Publicado: (2024)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
por: Clinch, Katie, et al.
Publicado: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
por: Lehner, Lisa, et al.
Publicado: (2025)

On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
por: Firbas, Alexander, et al.
Publicado: (2024)

Structural Parameters for Steiner Orientation
por: Hanaka, Tesshu, et al.
Publicado: (2025)

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

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
por: Tale, Prafullkumar
Publicado: (2025)

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

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
por: Gaikwad, Ajinkya, et al.
Publicado: (2025)

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
por: Larrauri, Alberto
Publicado: (2025)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
por: Dey, Palash, et al.
Publicado: (2026)