Copertina

Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bhore, Sujoy, Khazaliya, Liana, Inerney, Fionn Mc
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Computational Complexity Discrete Mathematics Data Structures and Algorithms Machine Learning Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
di: Ganian, Robert, et al.
Pubblicazione: (2025)

Non-Clashing Teaching Maps for Balls in Graphs
di: Chalopin, Jérémie, et al.
Pubblicazione: (2023)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
di: Foucaud, Florent, et al.
Pubblicazione: (2023)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
di: Foucaud, Florent, et al.
Pubblicazione: (2024)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
di: Lucke, Felicia, et al.
Pubblicazione: (2024)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
di: Bartier, Valentin, et al.
Pubblicazione: (2023)

Enumerating minimal solution sets for metric graph problems
di: Bergougnoux, Benjamin, et al.
Pubblicazione: (2023)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
di: Eagling-Vose, Tala, et al.
Pubblicazione: (2025)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
di: Lucke, Felicia, et al.
Pubblicazione: (2023)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
di: Hellmuth, Marc, et al.
Pubblicazione: (2023)

Exact Algorithms for Edge Deletion to Cactus
di: Akhtar, Sheikh Shakil, et al.
Pubblicazione: (2026)

Space Efficient Algorithms for Parameterised Problems
di: Akhtar, Sheikh Shakil, et al.
Pubblicazione: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
di: Haviv, Ishay
Pubblicazione: (2022)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
di: Foucaud, Florent, et al.
Pubblicazione: (2024)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
di: Scheffler, Robert
Pubblicazione: (2025)

Graph Search Trees and the Intermezzo Problem
di: Beisegel, Jesse, et al.
Pubblicazione: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
di: Beisegel, Jesse, et al.
Pubblicazione: (2025)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
di: Cordasco, Gennaro, et al.
Pubblicazione: (2024)

Steiner Forest for $H$-Subgraph-Free Graphs
di: Eagling-Vose, Tala, et al.
Pubblicazione: (2026)

Graph Classes Closed under Self-intersection
di: Dabrowski, Konrad K., et al.
Pubblicazione: (2025)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
di: Le, Hoang-Oanh, et al.
Pubblicazione: (2024)

Computing Subset Vertex Covers in $H$-Free Graphs
di: Brettell, Nick, et al.
Pubblicazione: (2023)

Finding $d$-Cuts in Probe $H$-Free Graphs
di: Dabrowski, Konrad K., et al.
Pubblicazione: (2025)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
di: Ahn, Jungho, et al.
Pubblicazione: (2026)

Solving Problems on Generalized Convex Graphs via Mim-Width
di: Bonomo-Braberman, Flavia, et al.
Pubblicazione: (2020)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
di: Beisegel, Jesse, et al.
Pubblicazione: (2025)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
di: Beisegel, Jesse, et al.
Pubblicazione: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
di: Beisegel, Jesse, et al.
Pubblicazione: (2025)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
di: Gamarnik, David, et al.
Pubblicazione: (2026)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
di: Dhawan, Abhishek, et al.
Pubblicazione: (2026)

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
di: Hsieh, Jun-Ting, et al.
Pubblicazione: (2026)

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
di: Hsieh, Jun-Ting, et al.
Pubblicazione: (2024)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
di: Bedert, Benjamin, et al.
Pubblicazione: (2025)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
di: Mary, Arnaud
Pubblicazione: (2024)

An unconditional lower bound for the active-set method on the hypercube
di: Disser, Yann, et al.
Pubblicazione: (2025)

An unconditional lower bound for the active-set method in convex quadratic maximization
di: Bach, Eleon, et al.
Pubblicazione: (2025)

Computing Hamiltonian Paths with Partial Order Restrictions
di: Beisegel, Jesse, et al.
Pubblicazione: (2024)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
di: Bousquet, Nicolas, et al.
Pubblicazione: (2025)

An efficient uniqueness theorem for overcomplete tensor decomposition
di: Koiran, Pascal
Pubblicazione: (2024)

(Independent) Roman Domination Parameterized by Distance to Cluster
di: Ashok, Pradeesha, et al.
Pubblicazione: (2024)