Copertina

Layered Graph Drawing with Few Gaps and Few Crossings

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dobler, Alexander, Roithinger, Jakob
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
di: Dobler, Alexander, et al.
Pubblicazione: (2024)

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

Top-Down Drawings of Compound Graphs
di: Kasperowski, Maximilian, et al.
Pubblicazione: (2023)

Fair Diversity Maximization with Few Representatives
di: Adriaens, Florian, et al.
Pubblicazione: (2025)

Cut-Query Algorithms with Few Rounds
di: Kenneth-Mordoch, Yotam, et al.
Pubblicazione: (2025)

Streaming Algorithms with Few State Changes
di: Jayaram, Rajesh, et al.
Pubblicazione: (2024)

Optimizing Wiggle in Storylines
di: Dobler, Alexander, et al.
Pubblicazione: (2025)

Coloring Graphs with Few Colors in the Streaming Model
di: Assadi, Sepehr, et al.
Pubblicazione: (2025)

Distance Adjustment of a Graph Drawing Stress Model
di: Onoue, Yosuke
Pubblicazione: (2024)

Simultaneous Drawing of Layered Trees
di: Katheder, Julia, et al.
Pubblicazione: (2023)

Space-Efficient Algorithm for Integer Programming with Few Constraints
di: Rohwedder, Lars, et al.
Pubblicazione: (2024)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
di: Eppstein, David, et al.
Pubblicazione: (2025)

All-Pairs Shortest Paths with Few Weights per Node
di: Abboud, Amir, et al.
Pubblicazione: (2025)

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

Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds
di: Kapralov, Michael, et al.
Pubblicazione: (2022)

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

SS-GUMAP, SL-GUMAP, SSSL-GUMAP: Fast UMAP Algorithms for Large Graph Drawing
di: Meidiana, Amyra, et al.
Pubblicazione: (2025)

Metalearning with Very Few Samples Per Task
di: Aliakbarpour, Maryam, et al.
Pubblicazione: (2023)

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

BH-tsNET, FIt-tsNET, L-tsNET: Fast tsNET Algorithms for Large Graph Drawing
di: Meidiana, Amyra, et al.
Pubblicazione: (2025)

Planar Multiway Cut with Terminals on Few Faces
di: Pandey, Sukanya, et al.
Pubblicazione: (2025)

Few Single-Qubit Measurements Suffice to Certify Any Quantum State
di: Gupta, Meghal, et al.
Pubblicazione: (2025)

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
di: Gahlawat, Harmender, et al.
Pubblicazione: (2025)

Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables
di: Jonsson, Peter, et al.
Pubblicazione: (2025)

Commitment Gap via Correlation Gap
di: Chawla, Shuchi, et al.
Pubblicazione: (2025)

The Complexity of Cluster Vertex Splitting and Company
di: Firbas, Alexander, et al.
Pubblicazione: (2023)

Perfect Matching with Few Link Activations
di: Mirault, Hugo, et al.
Pubblicazione: (2025)

Three Algorithms for Merging Hierarchical Navigable Small World Graphs
di: Ponomarenko, Alexander
Pubblicazione: (2025)

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

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

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

Inapproximability of Maximum Diameter Clustering for Few Clusters
di: Fleischmann, Henry, et al.
Pubblicazione: (2023)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
di: Aubian, Guillaume, et al.
Pubblicazione: (2025)

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

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
di: Lindermayr, Alexander, et al.
Pubblicazione: (2026)

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

Breadth-First Search Trees with Many or Few Leaves
di: Beisegel, Jesse, et al.
Pubblicazione: (2026)

Strassen's algorithm via orbit flip graphs
di: Ikenmeyer, Christian, et al.
Pubblicazione: (2025)

Adaptivity Gaps for Stochastic Probing with Subadditive Functions
di: Li, Jian, et al.
Pubblicazione: (2025)

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