:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	de Berg, Mark, Martínez, Andrés López, Spieksma, Frits
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2504.02369
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Disjoint Tours and the Price of Diversity
por: de Berg, Mark, et al.
Publicado: (2025)

Finding Diverse Minimum s-t Cuts
por: de Berg, Mark, et al.
Publicado: (2023)

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
por: Shih, Yu-Sheng, et al.
Publicado: (2026)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
por: Bentert, Matthias, et al.
Publicado: (2024)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
por: Grüttemeier, Niels, et al.
Publicado: (2025)

Kernelization Complexity of Solution Discovery Problems
por: Grobler, Mario, et al.
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Bounded Independence Edge Sampling for Combinatorial Graph Properties
por: Putterman, Aaron, et al.
Publicado: (2026)

Structural Parameterizations for Two Bounded Degree Problems Revisited
por: Lampis, Michael, et al.
Publicado: (2023)

The Complexity of Finding and Counting Subtournaments
por: Döring, Simon, et al.
Publicado: (2025)

Optimal Parallel Basis Finding in Graphic and Related Matroids
por: Khanna, Sanjeev, et al.
Publicado: (2025)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
por: Bilò, Davide, et al.
Publicado: (2024)

Finding Maximum Common Contractions Between Phylogenetic Networks
por: Marchand, Bertrand, et al.
Publicado: (2024)

Subset Balancing and Generalized Subset Sum via Lattices
por: Gao, Yiming, et al.
Publicado: (2026)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
por: Dey, Palash, et al.
Publicado: (2026)

Finding One Local Optimum Is Easy -- but What About Two?
por: Kobayashi, Yasuaki, et al.
Publicado: (2025)

NP-Hardness and a PTAS for the Pinwheel Problem
por: Kleinberg, Robert, et al.
Publicado: (2026)

Solution independence and self-referential instances
por: Zhou, Guangyan, et al.
Publicado: (2026)

Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies
por: Holtgrefe, Niels, et al.
Publicado: (2026)

Scheduling Problems with Constrained Rejections
por: Davies, Sami, et al.
Publicado: (2025)

String Consensus Problems with Swaps and Substitutions
por: Gabory, Estéban, et al.
Publicado: (2025)

Equivalent Instances for Scheduling and Packing Problems
por: Jansen, Klaus, et al.
Publicado: (2025)

Pseudodeterministic Algorithms for Minimum Cut Problems
por: Agarwala, Aryan, et al.
Publicado: (2025)

Neighborhood-Aware Graph Labeling Problem
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
por: Austrin, Per, et al.
Publicado: (2024)

Generalized Graph Packing Problems Parameterized by Treewidth
por: Esmer, Barış Can, et al.
Publicado: (2025)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
por: Bilò, Davide, et al.
Publicado: (2025)

Complexity of Local Search for Euclidean Clustering Problems
por: Manthey, Bodo, et al.
Publicado: (2023)

On the Complexity of Fundamental Problems for DAG-Compressed Graphs
por: Chudigiewitsch, Florian, et al.
Publicado: (2026)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
por: Maalouly, Nicolas El, et al.
Publicado: (2025)

No Price Tags? No Problem: Query Strategies for Unpriced Information
por: Nadimpalli, Shivam, et al.
Publicado: (2025)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
por: Nederlof, Jesper
Publicado: (2026)

Testing Properties of Edge Distributions
por: Fei, Yumou
Publicado: (2026)

Finding Diverse Strings and Longest Common Subsequences in a Graph
por: Shida, Yuto, et al.
Publicado: (2024)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
por: Lehner, Lisa, et al.
Publicado: (2025)

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
por: Focke, Jacob, et al.
Publicado: (2023)

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
por: Caragiannis, Ioannis, et al.
Publicado: (2026)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming
por: Rohwedder, Lars, et al.
Publicado: (2024)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
por: Esmer, Barış Can, et al.
Publicado: (2024)