:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Dvořák, Michal, Knop, Dušan, Opler, Michal, Pokorný, Jan, Suchý, Ondřej, Szilágyi, Krisztina
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	https://arxiv.org/abs/2506.22269
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Pathfinding in Self-Deleting Graphs
por: Dvořák, Michal, et al.
Publicado: (2025)

Bears with Hats and Independence Polynomials
por: Blažej, Václav, et al.
Publicado: (2021)

Practical approach to $2$-Euclidean Preferences
por: Dvořák, Michal, et al.
Publicado: (2025)

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
por: Dvořák, Pavel, et al.
Publicado: (2023)

Balancing the Spread of Two Opinions in Sparse Social Networks
por: Knop, Dušan, et al.
Publicado: (2021)

Monadic Second-Order Logic of Permutations
por: Jelínek, Vít, et al.
Publicado: (2025)

Linear clique-width and modular decomposition
por: Brignall, Robert, et al.
Publicado: (2026)

On the Complexity of Target Set Selection in Simple Geometric Networks
por: Dvořák, Michal, et al.
Publicado: (2023)

When Agents Break Down in Multiagent Path Finding
por: Fioravantes, Foivos, et al.
Publicado: (2025)

Optimization with pattern-avoiding input
por: Berendsohn, Benjamin Aram, et al.
Publicado: (2023)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
por: Fioravantes, Foivos, et al.
Publicado: (2024)

The Hierarchy of Hereditary Sorting Operators
por: Jelínek, Vít, et al.
Publicado: (2023)

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

Hedonic Diversity Games: A Complexity Picture with More than Two Colors
por: Ganian, Robert, et al.
Publicado: (2022)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
por: Dvořák, Michal, et al.
Publicado: (2026)

Solving Multiagent Path Finding on Highly Centralized Networks
por: Fioravantes, Foivos, et al.
Publicado: (2024)

A Modular Inductive Proof of the Chen-Raspaud Conjecture via Graph Classification
por: Fiedorowicz, Michał
Publicado: (2024)

Duality and $χ^<$-Boundedness of Ordered Graphs
por: Čertík, Michal, et al.
Publicado: (2023)

Inapproximability of Counting Permutation Patterns
por: Opler, Michal
Publicado: (2026)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
por: Opler, Michal
Publicado: (2024)

On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees
por: Hliněný, Petr, et al.
Publicado: (2021)

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
por: Blažej, Václav, et al.
Publicado: (2024)

Tree-independence number of $P_5$-free graphs with no large bicliques
por: Blažej, Václav, et al.
Publicado: (2026)

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
por: Nederlof, Jesper, et al.
Publicado: (2023)

A note on extendable sets of colorings and rooted minors
por: Dvořák, Zdeněk, et al.
Publicado: (2025)

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

Investigations into the Chen-Raspaud Conjecture for k = 3
por: Fiedorowicz, Michał
Publicado: (2024)

XALP-completeness of Parameterized Problems on Planar Graphs
por: Bodlaender, Hans L., et al.
Publicado: (2024)

Strong odd colorings in graph classes of bounded expansion
por: Pilipczuk, Michał
Publicado: (2025)

CWR sequence of invariants of alternating links and its properties
por: Jablonowski, Michal
Publicado: (2024)

A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank
por: Parnas, Michal, et al.
Publicado: (2025)

11/4-colorability of subcubic triangle-free graphs
por: Dvořák, Zdeněk, et al.
Publicado: (2022)

Compact representations of pattern-avoiding permutations
por: Kozma, László, et al.
Publicado: (2025)

Fast and simple multiplication of bounded twin-width matrices
por: Kozma, László, et al.
Publicado: (2026)

Sparsity of 3-flow critical graphs
por: Dvořák, Zdeněk, et al.
Publicado: (2024)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
por: Dvořák, Zdeněk, et al.
Publicado: (2024)

An identity relating $n$-nacci numbers, partitions, and products of binomial coefficients
por: Dragutinović, Dušan
Publicado: (2026)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
por: Hamm, Thekla, et al.
Publicado: (2026)

The Maker-Breaker percolation game on a random board
por: Dvořák, Vojtěch, et al.
Publicado: (2024)

Complexity Aspects of Homomorphisms of Ordered Graphs
por: Čertík, Michal, et al.
Publicado: (2025)