Image de couverture de livre

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Depian, Thomas, Fink, Simon D., Ganian, Robert, Surianarayanan, Vaishali
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Peculiarities of Extending Queue Layouts
par: Depian, Thomas, et autres
Publié: (2025)

The Parameterized Complexity of Extending Stack Layouts
par: Depian, Thomas, et autres
Publié: (2024)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
par: S, Ajaykrishnan E, et autres
Publié: (2025)

Exact Algorithms for Clustered Planarity with Linear Saturators
par: Da Lozzo, Giordano, et autres
Publié: (2024)

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
par: Depian, Thomas, et autres
Publié: (2026)

Visualizing Treewidth
par: Chiu, Alvin, et autres
Publié: (2025)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
par: Dobler, Alexander, et autres
Publié: (2024)

Clustered Planarity Variants for Level Graphs
par: Fink, Simon D., et autres
Publié: (2024)

Clustering with Set Outliers and Applications in Relational Clustering
par: Surianarayanan, Vaishali, et autres
Publié: (2025)

Retroactive Monotonic Priority Queues via Range Searching
par: Castro, Lucas, et autres
Publié: (2025)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
par: Park, Seongbin, et autres
Publié: (2026)

A Tight Subexponential-time Algorithm for Two-Page Book Embedding
par: Ganian, Robert, et autres
Publié: (2024)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
par: Deligkas, Argyrios, et autres
Publié: (2026)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Simple Grid Polygon Online Exploration Revisited
par: Brock, Maximilian, et autres
Publié: (2024)

The Complexity of Bayesian Network Learning: Revisiting the Superstructure
par: Ganian, Robert, et autres
Publié: (2026)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
par: Maus, Victor, et autres
Publié: (2026)

Optimal Orthogonal Drawings in Linear Time
par: Didimo, Walter, et autres
Publié: (2025)

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
par: Chandran, L. Sunil, et autres
Publié: (2024)

Ortho-Radial Drawing in Near-Linear Time
par: Chang, Yi-Jun
Publié: (2023)

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
par: Ganian, Robert, et autres
Publié: (2026)

Even Faster Algorithm for the Chamfer Distance
par: Feng, Ying, et autres
Publié: (2025)

Approximation Algorithms for Smallest Intersecting Balls
par: Zheng, Jiaqi, et autres
Publié: (2024)

Online Algorithms for Geometric Independent Set
par: De, Minati, et autres
Publié: (2026)

Fast Algorithms for Minimum Homology Basis
par: Dhar, Amritendu, et autres
Publié: (2021)

Algorithms for Halfplane Coverage and Related Problems
par: Wang, Haitao, et autres
Publié: (2024)

Algorithms for Computing Closest Points for Segments
par: Wang, Haitao
Publié: (2024)

An Optimal Algorithm for Half-plane Hitting Set
par: Liu, Gang, et autres
Publié: (2025)

Dynamic and Streaming Algorithms for Union Volume Estimation
par: Bhore, Sujoy, et autres
Publié: (2026)

Improved Algorithms for Distance Selection and Related Problems
par: Wang, Haitao, et autres
Publié: (2023)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
par: Liu, Shuilian, et autres
Publié: (2025)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
par: Kar, Debajyoti, et autres
Publié: (2025)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2025)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
par: Banik, Aritra, et autres
Publié: (2024)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
par: Cabello, Sergio, et autres
Publié: (2021)

Hardness of High-Dimensional Linear Classification
par: Munteanu, Alexander, et autres
Publié: (2026)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2024)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
par: An, Shinwoo, et autres
Publié: (2024)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)