Imagen de Portada

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dobler, Alexander, Jünger, Michael, Jünger, Paul J., Meffert, Julian, Mutzel, Petra, Nöllenburg, Martin
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team
por: Jünger, Michael, et al.
Publicado: (2024)

Optimizing Wiggle in Storylines
por: Dobler, Alexander, et al.
Publicado: (2025)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
por: Bartlmae, Simon, et al.
Publicado: (2024)

On Minimizing Wiggle in Stacked Area Charts
por: Dobler, Alexander, et al.
Publicado: (2025)

Accelerating Graph Similarity Search through Integer Linear Programming
por: D'Ascenzo, Andrea, et al.
Publicado: (2025)

Visualizing Treewidth
por: Chiu, Alvin, et al.
Publicado: (2025)

Layered Graph Drawing with Few Gaps and Few Crossings
por: Dobler, Alexander, et al.
Publicado: (2025)

The Peculiarities of Extending Queue Layouts
por: Depian, Thomas, et al.
Publicado: (2025)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

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

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

On Planar Straight-Line Dominance Drawings
por: Angelini, Patrizio, et al.
Publicado: (2025)

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

Upward-Planar Drawings with Bounded Span
por: Angelini, Patrizio, et al.
Publicado: (2026)

Optimal Orthogonal Drawings in Linear Time
por: Didimo, Walter, et al.
Publicado: (2025)

Unit-length Rectangular Drawings of Graphs
por: Alegria, Carlos, et al.
Publicado: (2022)

Ortho-Radial Drawing in Near-Linear Time
por: Chang, Yi-Jun
Publicado: (2023)

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

Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting
por: Gribanov, Dmitry, et al.
Publicado: (2026)

TGLib: An Open-Source Library for Temporal Graph Analysis
por: Oettershagen, Lutz, et al.
Publicado: (2022)

Simple Grid Polygon Online Exploration Revisited
por: Brock, Maximilian, et al.
Publicado: (2024)

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

One-Sided Local Crossing Minimization
por: Giannopoulos, Panos, et al.
Publicado: (2025)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
por: Bekos, Michael A., et al.
Publicado: (2025)

Simple Compact Monotone Tree Drawings
por: Oikonomou, Anargyros, et al.
Publicado: (2017)

Maintaining Light Spanners via Minimal Updates
por: Khodabandeh, Hadi, et al.
Publicado: (2024)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
por: Maus, Victor, et al.
Publicado: (2026)

Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities
por: Evans, William, et al.
Publicado: (2023)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
por: Park, Seongbin, et al.
Publicado: (2026)

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

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
por: Depian, Thomas, et al.
Publicado: (2026)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
por: Di Battista, Giuseppe, et al.
Publicado: (2021)

Dynamic Connectivity in Disk Graphs
por: Baumann, Alexander, et al.
Publicado: (2021)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
por: Beines, Arne, et al.
Publicado: (2024)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
por: Gudmundsson, Joachim, et al.
Publicado: (2022)

Feature-aware manifold meshing and remeshing of point clouds and polyhedral surfaces with guaranteed smallest edge length
por: Lipschütz, Henriette, et al.
Publicado: (2023)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
por: Herold, Martin G., et al.
Publicado: (2025)

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

The Complexity of Extending Storylines with Minimum Local Crossing Number
por: Dobler, Alexander, et al.
Publicado: (2026)

Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
por: Nekrich, Yakov, et al.
Publicado: (2026)