Imagen de Portada

A Tight Subexponential-time Algorithm for Two-Page Book Embedding

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ganian, Robert, Mueller, Haiko, Ordyniak, Sebastian, Paesani, Giacomo, Rychlicki, Mateusz
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Geometry F.2; G.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Backdoors for Quantified Boolean Formulas
por: Eriksson, Leif, et al.
Publicado: (2026)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
por: Deligkas, Argyrios, et al.
Publicado: (2026)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
por: Dabrowski, Konrad K., et al.
Publicado: (2024)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
por: Kumar, Nikhil, et al.
Publicado: (2025)

Exact Algorithms for Clustered Planarity with Linear Saturators
por: Da Lozzo, Giordano, et al.
Publicado: (2024)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
por: Kumar, Nikhil, et al.
Publicado: (2025)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
por: Le, Hung, et al.
Publicado: (2023)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
por: Haeupler, Bernhard, et al.
Publicado: (2024)

A Framework for Algorithm Stability
por: Meulemans, Wouter, et al.
Publicado: (2017)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
por: Fomin, Fedor V., et al.
Publicado: (2025)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
por: Gálvez, Waldo, et al.
Publicado: (2025)

Algorithms for Distance Problems in Continuous Graphs
por: Cabello, Sergio, et al.
Publicado: (2025)

Approximation Algorithms for Action-Reward Query-Commit Matching
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
por: Balzotti, Lorenzo
Publicado: (2020)

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
por: Høgemo, Svein
Publicado: (2024)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
por: Haeupler, Bernhard, et al.
Publicado: (2023)

Fast and Simple Sorting Using Partial Information
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
por: Le, Hung, et al.
Publicado: (2021)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
por: Buchin, Kevin, et al.
Publicado: (2026)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
por: Fekete, Sándor P., et al.
Publicado: (2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
por: Fekete, Sándor P., et al.
Publicado: (2025)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
por: Brankovic, Milutin, et al.
Publicado: (2021)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

Online Maximum Independent Set of Hyperrectangles
por: Advani, Rishi, et al.
Publicado: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
por: Grandoni, Fabrizio, et al.
Publicado: (2024)

Structure and Independence in Hyperbolic Uniform Disk Graphs
por: Bläsius, Thomas, et al.
Publicado: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Guarding Polyominoes Under $k$-Hop Visibility
por: Filtser, Omrit, et al.
Publicado: (2023)

Sliding Squares in Parallel
por: Akitaya, Hugo A., et al.
Publicado: (2024)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Guarding Offices with Maximum Dispersion
por: Fekete, Sándor P., et al.
Publicado: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
por: Fekete, Sándor P., et al.
Publicado: (2024)

Planar Network Diversion
por: Bentert, Matthias, et al.
Publicado: (2025)

A Tight Lower Bound for Comparison-Based Quantile Summaries
por: Cormode, Graham, et al.
Publicado: (2019)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
por: Elbassioni, Khaled
Publicado: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
por: Jansson, Jesper, et al.
Publicado: (2024)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
por: Bergougnoux, Benjamin, et al.
Publicado: (2026)

A Piecewise Approach for the Analysis of Exact Algorithms
por: Clinch, Katie, et al.
Publicado: (2024)