Copertina

The Computational Complexity of Positive Non-Clashing Teaching in Graphs

Fuente: arXiv

Salvato in:

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

Documenti analoghi

Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
di: Bhore, Sujoy, et al.
Pubblicazione: (2026)

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)

The Complexity of Transitively Orienting Temporal Graphs
di: Mertzios, George B., et al.
Pubblicazione: (2021)

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

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
di: Dreier, Jan, et al.
Pubblicazione: (2026)

A Unified Approach to Submodular Maximization Under Noise
di: Bhawalkar, Kshipra, et al.
Pubblicazione: (2025)

Total Variation Distance Meets Probabilistic Inference
di: Bhattacharyya, Arnab, et al.
Pubblicazione: (2023)

The Complexity of Cluster Vertex Splitting and Company
di: Firbas, Alexander, et al.
Pubblicazione: (2023)

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

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)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
di: Oostveen, Jelle J., et al.
Pubblicazione: (2022)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
di: Aute, Shubhada, et al.
Pubblicazione: (2026)

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

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
di: Antoniadis, Antonios, et al.
Pubblicazione: (2025)

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

A Dichotomy for Maximum PCSPs on Graphs
di: Nakajima, Tamio-Vesa, et al.
Pubblicazione: (2024)

Randomized Communication and Implicit Graph Representations
di: Harms, Nathaniel, et al.
Pubblicazione: (2021)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
di: Vroon, Mats, et al.
Pubblicazione: (2025)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
di: Conrado, Giovanna K., et al.
Pubblicazione: (2023)

Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity
di: Zhan, Yongjian
Pubblicazione: (2026)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
di: Hanaka, Tesshu, et al.
Pubblicazione: (2023)

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

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
di: Kratochvíl, Jan, et al.
Pubblicazione: (2020)

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)

Breadth-First Search Trees with Many or Few Leaves
di: Beisegel, Jesse, et al.
Pubblicazione: (2026)

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

Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity
di: Gajjar, Kshitij, et al.
Pubblicazione: (2026)

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)

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

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

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

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

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

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

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