Cover Image

Eliminating Crossings in Ordered Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Agrawal, Akanksha, Cabello, Sergio, Kaufmann, Michael, Saurabh, Saket, Sharma, Roohani, Uno, Yushi, Wolff, Alexander
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
by: Agrawal, Akanksha, et al.
Published: (2024)

Balanced Substructures in Bicolored Graphs
by: Ardra, P. S., et al.
Published: (2024)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
by: Bandyapadhyay, Sayan, et al.
Published: (2023)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
by: de Berg, Mark, et al.
Published: (2025)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
by: Lokshtanov, Daniel, et al.
Published: (2024)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels
by: Blažej, Václav, et al.
Published: (2024)

Parameterized Geometric Graph Modification with Disk Scaling
by: Fomin, Fedor V., et al.
Published: (2024)

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

Searching in Euclidean Spaces with Predictions
by: Cabello, Sergio, et al.
Published: (2024)

Visualization of Event Graphs for Train Schedules
by: Hartleb, Johann, et al.
Published: (2025)

MaxMin Separation Problems: FPT Algorithms for $st$-Separator and Odd Cycle Transversal
by: Gaikwad, Ajinkya, et al.
Published: (2025)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
by: Cabello, Sergio, et al.
Published: (2025)

The Complexity of Drawing Graphs on Few Lines and Few Planes
by: Chaplick, Steven, et al.
Published: (2016)

Recognizing 2-Layer and Outer $k$-Planar Graphs
by: Kobayashi, Yasuaki, et al.
Published: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
by: Lokshtanov, Daniel, et al.
Published: (2024)

Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
by: Honorato-Droguett, Nicolás, et al.
Published: (2025)

Adjacency Graphs of Polyhedral Surfaces
by: Arseneva, Elena, et al.
Published: (2021)

Long Plane Trees
by: Cabello, Sergio, et al.
Published: (2021)

Grounded String Representations of Series-Parallel Graphs without Transitive Edges
by: Cornelsen, Sabine, et al.
Published: (2026)

Hybrid k-Clustering: Blending k-Median and k-Center
by: Fomin, Fedor V., et al.
Published: (2024)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
by: Fomin, Fedor V., et al.
Published: (2026)

Morphing Graph Drawings in the Presence of Point Obstacles
by: Firman, Oksana, et al.
Published: (2023)

Packing d-dimensional balls into a d+1-dimensional container
by: Alt, Helmut, et al.
Published: (2021)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)

Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)

The Price of Connectivity Augmentation on Planar Graphs
by: Akitaya, Hugo A., et al.
Published: (2025)

Stability conditions on crepant resolutions of quotients of product varieties
by: Perry, Alexander, et al.
Published: (2024)

Multivariate Exploration of Metric Dilation
by: Banik, Aritra, et al.
Published: (2025)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
by: Bentert, Matthias, et al.
Published: (2025)

Min-$k$-planar Drawings of Graphs
by: Binucci, Carla, et al.
Published: (2023)

Better Late than Never: the Complexity of Arrangements of Polyhedra
by: Aronov, Boris, et al.
Published: (2025)

Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors
by: Dujmović, Vida, et al.
Published: (2024)

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

Delaunay Triangulations with Predictions
by: Cabello, Sergio, et al.
Published: (2026)

Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022)

Connected Matchings
by: Aichholzer, Oswin, et al.
Published: (2024)

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
by: Ágoston, Péter, et al.
Published: (2024)

Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)

On the Complexity of the Ordered Covering Problem in Distance Geometry
by: Souza, Michael, et al.
Published: (2025)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
by: Cabello, Sergio, et al.
Published: (2021)