:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Retschmeier, Lukas
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2506.17485
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Parameterized Complexity of Coloring Mixed Graphs
par: Lauerbach, Antonio, et autres
Publié: (2026)

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

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
par: Cordasco, Gennaro, et autres
Publié: (2024)

Uniformity within Parameterized Circuit Classes
par: Hegeman, Steef, et autres
Publié: (2025)

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

The Parameterized Complexity of Computing the Linear Vertex Arboricity
par: Erhardt, Alexander, et autres
Publié: (2025)

Parameterized Complexity of Fair Many-to-One Matchings
par: Javadi, Ramin, et autres
Publié: (2024)

The Parameterized Complexity of Geometric 1-Planarity
par: Firbas, Alexander
Publié: (2026)

Parameterized Complexity of Segment Routing
par: Bazgan, Cristina, et autres
Publié: (2025)

Second-Order Parameterizations for the Complexity Theory of Integrable Functions
par: Bacho, Aras, et autres
Publié: (2025)

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

A Parameterized-Complexity Framework for Finding Local Optima
par: Ganian, Robert, et autres
Publié: (2026)

The Parameterized Complexity of Terminal Monitoring Set
par: Aravind, N. R., et autres
Publié: (2024)

A Parameterized Study of Secluded Structures in Directed Graphs
par: Schmidt, Jonas, et autres
Publié: (2025)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

On the Parameterized Complexity of Odd Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2025)

(Independent) Roman Domination Parameterized by Distance to Cluster
par: Ashok, Pradeesha, et autres
Publié: (2024)

Parameterized Complexity of Caching in Networks
par: Ganian, Robert, et autres
Publié: (2024)

Parameterized Complexity Of Representing Models Of MSO Formulas
par: Kučera, Petr, et autres
Publié: (2026)

On the Parameterized Complexity of Min-Sum-Radii
par: Kumar, Pankaj, et autres
Publié: (2026)

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

Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study
par: Komusiewicz, Christian, et autres
Publié: (2024)

Structure in Communication Complexity and Constant-Cost Complexity Classes
par: Hatami, Hamed, et autres
Publié: (2024)

The Parameterized Landscape of Labeled Graph Contractions
par: Lafond, Manuel, et autres
Publié: (2025)

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

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
par: Eriksson, Leif, et autres
Publié: (2026)

Explaining Decisions in ML Models: a Parameterized Complexity Analysis
par: Ordyniak, Sebastian, et autres
Publié: (2024)

The Complexity of Logarithmic Space Bounded Counting Classes
par: Vijayaraghavan, T. C.
Publié: (2025)

Generalized Graph Packing Problems Parameterized by Treewidth
par: Esmer, Barış Can, et autres
Publié: (2025)

Parameterized Algorithms for Editing to Uniform Cluster Graph
par: Gaikwad, Ajinkya, et autres
Publié: (2024)

Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies
par: Gajulapalli, Karthik, et autres
Publié: (2025)

On Formally Undecidable Propositions of Nondeterministic Complexity and Related Classes
par: Kolář, Martin
Publié: (2026)

Computational Social Choice: Parameterized Complexity and Challenges
par: Chen, Jiehua, et autres
Publié: (2024)

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

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)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
par: Oostveen, Jelle J., et autres
Publié: (2022)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
par: Aute, Shubhada, et autres
Publié: (2026)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
par: Frei, Fabian, et autres
Publié: (2025)