:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Bingwei, Yap, Chee
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2602.00162
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
por: Gribanov, Dmitry, et al.
Publicado: (2022)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
por: Clinch, Katie, et al.
Publicado: (2025)

Exact Algorithms for Distance to Unique Vertex Cover
por: Fioravantes, Foivos, et al.
Publicado: (2025)

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

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

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

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

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

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

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

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
por: Tate, Elise, et al.
Publicado: (2025)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
por: Gaspers, Serge, et al.
Publicado: (2025)

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

Improved Algorithm for Permutation Testing
por: Zhang, Xiaojin
Publicado: (2020)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
por: Dey, Palash, et al.
Publicado: (2024)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
por: Focke, Jacob, et al.
Publicado: (2022)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
por: Sato, Atsuki, et al.
Publicado: (2024)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

A Simple Proof that Ricochet Robots is PSPACE-Complete
por: Balanza-Martinez, Jose, et al.
Publicado: (2024)

Fourier Analysis of Iterative Algorithms
por: Jones, Chris, et al.
Publicado: (2024)

Parameterized Capacitated Vertex Cover Revisited
por: Lampis, Michael, et al.
Publicado: (2026)

Matching and Edge Cover in Temporal Graphs
por: Cioni, Lapo, et al.
Publicado: (2025)

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

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

Forest Covers and Bounded Forest Covers
por: Gaur, Daya Ram, et al.
Publicado: (2024)

Efficient Catalytic Graph Algorithms
por: Cook, James, et al.
Publicado: (2025)

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

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)

A New Information Complexity Measure for Multi-pass Streaming with Applications
por: Braverman, Mark, et al.
Publicado: (2024)

Parameterized Complexity of Vehicle Routing
por: Döring, Michelle, et al.
Publicado: (2025)

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

On the Parameterized Complexity of Odd Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2025)

On the Complexity of Signed Roman Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)

On the Space Complexity of Online Convolution
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Computational Complexity in Property Testing
por: Pinto Jr., Renato Ferreira, et al.
Publicado: (2025)

Algorithms and Hardness for Estimating Statistical Similarity
por: Bhattacharyya, Arnab, et al.
Publicado: (2025)

Sensitivity Lower Bounds for Approximaiton Algorithms
por: Fleming, Noah, et al.
Publicado: (2024)