:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Grüne, Christoph, Janßen, Tom
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2605.10607
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Complexity of Graph Exploration Games
par: Fuchs, Janosch, et autres
Publié: (2023)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
par: Grüne, Christoph
Publié: (2022)

A Compendium of Reductions: reductions.network
par: Grüne, Christoph, et autres
Publié: (2025)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
par: Grüne, Christoph, et autres
Publié: (2023)

A Note on the Complexity of Defensive Domination
par: Chaplick, Steven, et autres
Publié: (2025)

The Complexity of Blocking All Solutions
par: Grüne, Christoph, et autres
Publié: (2025)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
par: Grüne, Christoph, et autres
Publié: (2024)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
par: Grüne, Christoph, et autres
Publié: (2026)

The Complexity of Stackelberg Pricing Games
par: Grüne, Christoph, et autres
Publié: (2025)

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
par: Rai, Ashutosh, et autres
Publié: (2026)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
par: Herrmann, Anton, et autres
Publié: (2025)

The Counting General Dominating Set Framework
par: Zheng, Jiayi, et autres
Publié: (2026)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

On the Parameterized Complexity of Semitotal Domination on Graph Classes
par: Retschmeier, Lukas
Publié: (2025)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
par: Scheffler, Robert
Publié: (2025)

Dominating Set Knapsack: Profit Optimization on Dominating Sets
par: Singh, Sipra
Publié: (2025)

Enumerating Minimal Defensive Alliances
par: Feng, Zhidan, et autres
Publié: (2023)

Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
par: Abu-Khzam, Faisal N., et autres
Publié: (2024)

Enumeration With Nice Roman Domination Properties
par: Mann, Kevin
Publié: (2025)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
par: Chakraborty, Dipayan, et autres
Publié: (2024)

On the Complexity of Signed Roman Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

The Interplay Between Domination and Separation in Graphs
par: Chakraborty, Dipayan, et autres
Publié: (2026)

Residue Domination in Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2024)

On Computability of Computable Problems
par: Khaliq, Asad
Publié: (2023)

The Stochastic Arrival Problem
par: Webster, Thomas
Publié: (2022)

A Linear Kernel for Planar Vector Domination
par: Sahili, Mahabba El, et autres
Publié: (2023)

Hardness and Algorithmic Results for Roman \{3\}-Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

Fine-Grained Classification Of Detecting Dominating Patterns
par: Dransfeld, Jonathan, et autres
Publié: (2025)

The Greedy Coin Change Problem
par: Gupta, Shreya, et autres
Publié: (2024)

On the Hardness of the Drone Delivery Problem
par: Bartlmae, Simon, et autres
Publié: (2025)

Temporal Reachability Dominating Sets: contagion in temporal graphs
par: Kutner, David C., et autres
Publié: (2023)

Parameterized Complexity of the Star Decomposition Problem
par: Hajebi, Sahab, et autres
Publié: (2024)

On the Complexity of Problems on Tree-structured Graphs
par: Bodlaender, Hans L., et autres
Publié: (2022)

Reductions Between Code Equivalence Problems
par: Cheraghchi, Mahdi, et autres
Publié: (2025)

Total Search Problems in $\mathsf{ZPP}$
par: Fleming, Noah, et autres
Publié: (2025)

The 2-Attractor Problem is NP-Complete
par: Fuchs, Janosch, et autres
Publié: (2023)

Inverse Intersections for Boolean Satisfiability Problems
par: Homer, Paul W.
Publié: (2025)

On the Exact Matching Problem in Dense Graphs
par: Maalouly, Nicolas El, et autres
Publié: (2024)

Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems
par: Ghosh, Mrinalkanti
Publié: (2025)

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all $\ell_p$ Norms
par: Bennett, Huck, et autres
Publié: (2022)