Image de couverture de livre

Eliminating Crossings in Ordered Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Agrawal, Akanksha, Cabello, Sergio, Kaufmann, Michael, Saurabh, Saket, Sharma, Roohani, Uno, Yushi, Wolff, Alexander
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
par: Agrawal, Akanksha, et autres
Publié: (2024)

Balanced Substructures in Bicolored Graphs
par: Ardra, P. S., et autres
Publié: (2024)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
par: Bandyapadhyay, Sayan, et autres
Publié: (2023)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
par: de Berg, Mark, et autres
Publié: (2025)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels
par: Blažej, Václav, et autres
Publié: (2024)

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
par: Fomin, Fedor V., et autres
Publié: (2025)

Searching in Euclidean Spaces with Predictions
par: Cabello, Sergio, et autres
Publié: (2024)

Visualization of Event Graphs for Train Schedules
par: Hartleb, Johann, et autres
Publié: (2025)

MaxMin Separation Problems: FPT Algorithms for $st$-Separator and Odd Cycle Transversal
par: Gaikwad, Ajinkya, et autres
Publié: (2025)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
par: Cabello, Sergio, et autres
Publié: (2025)

The Complexity of Drawing Graphs on Few Lines and Few Planes
par: Chaplick, Steven, et autres
Publié: (2016)

Recognizing 2-Layer and Outer $k$-Planar Graphs
par: Kobayashi, Yasuaki, et autres
Publié: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
par: Honorato-Droguett, Nicolás, et autres
Publié: (2025)

Adjacency Graphs of Polyhedral Surfaces
par: Arseneva, Elena, et autres
Publié: (2021)

Long Plane Trees
par: Cabello, Sergio, et autres
Publié: (2021)

Grounded String Representations of Series-Parallel Graphs without Transitive Edges
par: Cornelsen, Sabine, et autres
Publié: (2026)

Hybrid k-Clustering: Blending k-Median and k-Center
par: Fomin, Fedor V., et autres
Publié: (2024)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
par: Fomin, Fedor V., et autres
Publié: (2026)

Morphing Graph Drawings in the Presence of Point Obstacles
par: Firman, Oksana, et autres
Publié: (2023)

Packing d-dimensional balls into a d+1-dimensional container
par: Alt, Helmut, et autres
Publié: (2021)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
par: Firman, Oksana, et autres
Publié: (2024)

Maximum Matchings in Geometric Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2019)

The Price of Connectivity Augmentation on Planar Graphs
par: Akitaya, Hugo A., et autres
Publié: (2025)

Stability conditions on crepant resolutions of quotients of product varieties
par: Perry, Alexander, et autres
Publié: (2024)

Multivariate Exploration of Metric Dilation
par: Banik, Aritra, et autres
Publié: (2025)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
par: Bentert, Matthias, et autres
Publié: (2025)

Min-$k$-planar Drawings of Graphs
par: Binucci, Carla, et autres
Publié: (2023)

Better Late than Never: the Complexity of Arrangements of Polyhedra
par: Aronov, Boris, et autres
Publié: (2025)

Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors
par: Dujmović, Vida, et autres
Publié: (2024)

Algorithms for Distance Problems in Continuous Graphs
par: Cabello, Sergio, et autres
Publié: (2025)

Delaunay Triangulations with Predictions
par: Cabello, Sergio, et autres
Publié: (2026)

Morphing Planar Graph Drawings Through 3D
par: Buchin, Kevin, et autres
Publié: (2022)

Connected Matchings
par: Aichholzer, Oswin, et autres
Publié: (2024)

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
par: Ágoston, Péter, et autres
Publié: (2024)

Near-Optimal Euclidean Locality-Sensitive Orderings
par: Gao, Zhimeng, et autres
Publié: (2023)

On the Complexity of the Ordered Covering Problem in Distance Geometry
par: Souza, Michael, et autres
Publié: (2025)

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