Imagen de Portada

Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Majewski, Konrad, Pilipczuk, Michał, Sokołowski, Marek
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Discrete Mathematics 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

Elementary first-order model checking for sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2024)

Graph classes through the lens of logic
por: Pilipczuk, Michał
Publicado: (2025)

Flipper games for monadically stable graph classes
por: Gajarský, Jakub, et al.
Publicado: (2023)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

On classes of bounded tree rank, their interpretations, and efficient sparsification
por: Gajarský, Jakub, et al.
Publicado: (2024)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
por: Marx, Dániel, et al.
Publicado: (2026)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
por: Korhonen, Tuukka, et al.
Publicado: (2024)

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

Foundations for an Abstract Proof Theory in the Context of Horn Rules
por: Lyon, Tim S., et al.
Publicado: (2023)

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

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
por: Koh, Zhuan Khye, et al.
Publicado: (2021)

Formal Primal-Dual Algorithm Analysis
por: Abdulaziz, Mohammad, et al.
Publicado: (2026)

Color Refinement for Relational Structures
por: Scheidt, Benjamin, et al.
Publicado: (2024)

The Iteration Number of the Weisfeiler-Leman Algorithm
por: Grohe, Martin, et al.
Publicado: (2023)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
por: Grohe, Martin, et al.
Publicado: (2023)

Solving Partial Dominating Set and Related Problems Using Twin-Width
por: Balabán, Jakub, et al.
Publicado: (2025)

SDPs and Robust Satisfiability of Promise CSP
por: Brakensiek, Joshua, et al.
Publicado: (2022)

Coarse Balanced Separators in Fat-Minor-Free Graphs
por: Bonnet, Édouard, et al.
Publicado: (2026)

On merge-models
por: Buffière, Hector, et al.
Publicado: (2026)

CNFs and DNFs with Exactly $k$ Solutions
por: Chandran, L. Sunil, et al.
Publicado: (2025)

Bounding $\varepsilon$-scatter dimension via metric sparsity
por: Bourneuf, Romain, et al.
Publicado: (2024)

Merge-width and First-Order Model Checking
por: Dreier, Jan, et al.
Publicado: (2025)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems
por: Faber, Daniel, et al.
Publicado: (2024)

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

Max Weight Independent Set in sparse graphs with no long claws
por: Abrishami, Tara, et al.
Publicado: (2023)

Variants of Merge-Width and Applications
por: Drabik, Karolina, et al.
Publicado: (2026)

A polynomial kernel for vertex deletion into bipartite permutation graphs
por: Derbisz, Jan
Publicado: (2021)

Redundancy Is All You Need (for CSP Sparsification)
por: Brakensiek, Joshua, et al.
Publicado: (2024)

A survey of Chernoff and Hoeffding bounds
por: Gerbessiotis, Alexandros V.
Publicado: (2025)

Packing $K_r$s in bounded degree graphs
por: McKay, Michael, et al.
Publicado: (2022)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
por: Bourneuf, Romain, et al.
Publicado: (2025)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
por: Paul-Pena, Daniel, et al.
Publicado: (2025)

Markovian protocols and an upper bound on the extension complexity of the matching polytope
por: Szusterman, M.
Publicado: (2026)

Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
por: Gawrychowski, Paweł, et al.
Publicado: (2024)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

Parameterized dynamic data structure for Split Completion
por: Majewski, Konrad, et al.
Publicado: (2024)

Circular-arc graphs and the Helly property
por: Derbisz, Jan, et al.
Publicado: (2024)

A Polynomial Coreset for Furthest Neighbor in Planar Metrics
por: Kluk, Kacper, et al.
Publicado: (2026)

The complexity of strong conflict-free vertex-connection $k$-colorability
por: Hsieh, Sun-Yuan, et al.
Publicado: (2024)

Clique-free t-matchings in degree-bounded graphs
por: Paluch, Katarzyna, et al.
Publicado: (2024)