Image de couverture de livre

One-Sided Local Crossing Minimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Giannopoulos, Panos, Goetze, Miriam, Gutowski, Grzegorz, Löffler, Maarten, Nöllenburg, Martin, Okada, Yuto, Rollin, Jonathan, Vogtenhuber, Birgit, Wolff, Alexander
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Minimizing Wiggle in Stacked Area Charts
par: Dobler, Alexander, et autres
Publié: (2025)

Optimizing Wiggle in Storylines
par: Dobler, Alexander, et autres
Publié: (2025)

weberknecht -- a One-Sided Crossing Minimization solver
par: Rauch, Johannes
Publié: (2024)

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

Quantum Algorithms for One-Sided Crossing Minimization
par: Caroppo, Susanna, et autres
Publié: (2024)

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

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

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
par: Löffler, Maarten, et autres
Publié: (2026)

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

Min-1-Planarity is NP-Hard
par: Okada, Yuto
Publié: (2026)

Parallel Algorithms for the One Sided Crossing Minimization Problem
par: Popa, Bogdan-Ioan, et autres
Publié: (2025)

Structural Parameterizations of $k$-Planarity
par: Gima, Tatsuya, et autres
Publié: (2025)

2-Layer Fan-Planarity in Polynomial Time
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
par: Hanaka, Tesshu, et autres
Publié: (2025)

Sequentially Swapping Tokens: Further on Graph Classes
par: Kiya, Hironori, et autres
Publié: (2022)

Finding Colorings in One-Sided Expanders
par: Buhai, Rares-Darius, et autres
Publié: (2025)

Online Coloring of Short Intervals
par: Chybowska-Sokół, Joanna, et autres
Publié: (2018)

PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team
par: Jünger, Michael, et autres
Publié: (2024)

Dichotomies for Tree Minor Containment with Structural Parameters
par: Gima, Tatsuya, et autres
Publié: (2023)

Hitting Geodesic Intervals in Structurally Restricted Graphs
par: Gima, Tatsuya, et autres
Publié: (2025)

Treewidth of the $n \times n$ toroidal grid
par: Gima, Tatsuya, et autres
Publié: (2026)

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)

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

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
par: Förster, Henry, et autres
Publié: (2023)

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs
par: Gharan, Shayan Oveis, et autres
Publié: (2025)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
par: Caroppo, Susanna, et autres
Publié: (2025)

Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
par: Nikolov, Aleksandar, et autres
Publié: (2026)

Online Flow Time Minimization with Gradually Revealed Jobs
par: Lindermayr, Alexander, et autres
Publié: (2026)

Spectral Clustering with Side Information
par: Fichtenberger, Hendrik, et autres
Publié: (2025)

Minimizing the Minimizers via Alphabet Reordering
par: Verbeek, Hilde, et autres
Publié: (2024)

Fast Computation of $k$-Runs, Parameterized Squares, and Other Generalised Squares
par: Nakashima, Yuto, et autres
Publié: (2025)

Tight bounds for the sensitivity of CDAWGs with left-end edits
par: Fujimaru, Hiroto, et autres
Publié: (2023)

Sensitivity of Repetitiveness Measures to String Reversal
par: Bannai, Hideo, et autres
Publié: (2026)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
par: Bampis, Evripidis, et autres
Publié: (2024)

Layered Graph Drawing with Few Gaps and Few Crossings
par: Dobler, Alexander, et autres
Publié: (2025)

Hardening Confidential Federated Compute against Side-channel Attacks
par: Bell-Clark, James, et autres
Publié: (2026)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
par: Fujie, Yuto, et autres
Publié: (2025)

LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
par: Shibata, Hiroki, et autres
Publié: (2025)

Faster Space-Efficient STR-IC-LCS Computation
par: Yonemoto, Yuki, et autres
Publié: (2022)