Imagen de Portada

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abrahamsen, Mikkel, Miltzow, Tillmann, Seiferth, Nadja
Formato:	Preprint
Publicado:	2020
Materias:	Computational Geometry Computational Complexity Discrete Mathematics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Classifying Continuous Constraint Satisfaction Problems
por: Miltzow, Tillmann, et al.
Publicado: (2021)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
por: Förster, Henry, et al.
Publicado: (2023)

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
por: Hengeveld, Simon, et al.
Publicado: (2020)

Beyond Bits: An Introduction to Computation over the Reals
por: Miltzow, Tillmann
Publicado: (2026)

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
por: Dakhno, Grigorii, et al.
Publicado: (2024)

On the parameterized complexity of Broadcast Independence and Broadcast Packing
por: Dumont, Joanne, et al.
Publicado: (2026)

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

Recognizing Sumsets is NP-Complete
por: Abboud, Amir, et al.
Publicado: (2024)

Second Price Matching with Complete Allocation and Degree Constraints
por: Pinchasi, Rom, et al.
Publicado: (2025)

Alphabet Reduction for Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2024)

The Days On Days Off Scheduling Problem
por: Nießen, Fabien, et al.
Publicado: (2024)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
por: Dorfer, Joseph
Publicado: (2026)

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

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
por: Hirahara, Shuichi, et al.
Publicado: (2023)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
por: DeHaan, Ian, et al.
Publicado: (2025)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

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

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2023)

Graph Search Trees and the Intermezzo Problem
por: Beisegel, Jesse, et al.
Publicado: (2024)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
por: Haviv, Ishay
Publicado: (2022)

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

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

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
por: Hsieh, Jun-Ting, et al.
Publicado: (2024)

A note on approximating the average degree of bounded arboricity graphs
por: Eden, Talya, et al.
Publicado: (2026)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
por: Fei, Yumou, et al.
Publicado: (2025)

Relative-error unateness testing
por: Chen, Xi, et al.
Publicado: (2025)

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

Parameterised distance to local irregularity
por: Fioravantes, Foivos, et al.
Publicado: (2023)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
por: Shao, Shuai, et al.
Publicado: (2023)

Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
por: Hirahara, Shuichi, et al.
Publicado: (2024)

On Approximate Reconfigurability of Label Cover
por: Ohsaka, Naoto
Publicado: (2023)

Counting Locally Optimal Tours in the TSP
por: Manthey, Bodo, et al.
Publicado: (2024)

Relative-error testing of conjunctions and decision lists
por: Chen, Xi, et al.
Publicado: (2025)

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

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

Placing Green Bridges Optimally, with a Multivariate Analysis
por: Fluschnik, Till, et al.
Publicado: (2021)

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

Relative-error monotonicity testing
por: Chen, Xi, et al.
Publicado: (2024)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
por: Johnson, Matthew, et al.
Publicado: (2022)