:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Černý, Marek
Format:	Preprint
Publié:	2026
Sujets:	Discrete Mathematics Computational Complexity Data Structures and Algorithms Logic in Computer Science
Accès en ligne:	https://arxiv.org/abs/2601.09506
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
par: Černý, Marek, et autres
Publié: (2025)

Smaller Circuits for Bit Addition
par: Goncharov, Mikhail, et autres
Publié: (2025)

Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number
par: Majewski, Konrad, et autres
Publié: (2021)

The Iteration Number of the Weisfeiler-Leman Algorithm
par: Grohe, Martin, et autres
Publié: (2023)

Elementary first-order model checking for sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2024)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
par: Grohe, Martin, et autres
Publié: (2023)

Flipper games for monadically stable graph classes
par: Gajarský, Jakub, et autres
Publié: (2023)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
par: Lyon, Tim S., et autres
Publié: (2023)

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

Graph classes through the lens of logic
par: Pilipczuk, Michał
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)

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
par: Hsieh, Jun-Ting, et autres
Publié: (2026)

The Complexity of Transitively Orienting Temporal Graphs
par: Mertzios, George B., et autres
Publié: (2021)

A Dichotomy for Maximum PCSPs on Graphs
par: Nakajima, Tamio-Vesa, et autres
Publié: (2024)

Randomized Communication and Implicit Graph Representations
par: Harms, Nathaniel, et autres
Publié: (2021)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
par: Vroon, Mats, et autres
Publié: (2025)

Formal Primal-Dual Algorithm Analysis
par: Abdulaziz, Mohammad, et autres
Publié: (2026)

Color Refinement for Relational Structures
par: Scheidt, Benjamin, et autres
Publié: (2024)

On classes of bounded tree rank, their interpretations, and efficient sparsification
par: Gajarský, Jakub, et autres
Publié: (2024)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
par: Koh, Zhuan Khye, et autres
Publié: (2021)

Solving Partial Dominating Set and Related Problems Using Twin-Width
par: Balabán, Jakub, et autres
Publié: (2025)

SDPs and Robust Satisfiability of Promise CSP
par: Brakensiek, Joshua, et autres
Publié: (2022)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
par: Hamm, Thekla, et autres
Publié: (2026)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
par: Conrado, Giovanna K., et autres
Publié: (2023)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
par: Dreier, Jan, et autres
Publié: (2026)

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
par: Kratochvíl, Jan, et autres
Publié: (2020)

On merge-models
par: Buffière, Hector, et autres
Publié: (2026)

CNFs and DNFs with Exactly $k$ Solutions
par: Chandran, L. Sunil, et autres
Publié: (2025)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
par: Lucke, Felicia, et autres
Publié: (2024)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
par: Eagling-Vose, Tala, et autres
Publié: (2025)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems
par: Faber, Daniel, et autres
Publié: (2024)

Graph Search Trees and the Intermezzo Problem
par: Beisegel, Jesse, et autres
Publié: (2024)

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

Steiner Forest for $H$-Subgraph-Free Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2026)

Graph Classes Closed under Self-intersection
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Computing Subset Vertex Covers in $H$-Free Graphs
par: Brettell, Nick, et autres
Publié: (2023)

Finding $d$-Cuts in Probe $H$-Free Graphs
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
par: Ahn, Jungho, et autres
Publié: (2026)

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

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