Cover Image

Optimizing Wiggle in Storylines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dobler, Alexander, Hegemann, Tim, Nöllenburg, Martin, Wolff, Alexander
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

Visualizing Treewidth
by: Chiu, Alvin, et al.
Published: (2025)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
by: Caroppo, Susanna, et al.
Published: (2025)

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

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

Optimizing Periodic Operations for Efficient Inland Waterway Lock Management
by: Golak, Julian, et al.
Published: (2025)

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

DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis
by: Narvaez, Alexander
Published: (2026)

Multi-Level Steiner Trees
by: Ahmed, Reyan, et al.
Published: (2018)

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

Improved Time-Space Tradeoffs for 3SUM-Indexing
by: Dinur, Itai, et al.
Published: (2025)

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

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

Optimized 2-Approximation of Treewidth
by: Belbasi, Mahdi, et al.
Published: (2024)

Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
by: Turoczy, Alexander, et al.
Published: (2025)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
by: Armbruster, Alexander, et al.
Published: (2025)

Improving the Threshold for Finding Rank-1 Matrices in a Subspace
by: Dastidar, Jeshu, et al.
Published: (2025)

A Better-Than-$5/4$-Approximation for Two-Edge Connectivity
by: Hommelsheim, Felix, et al.
Published: (2025)

Two-Edge Connectivity via Pac-Man Gluing
by: Garg, Mohit, et al.
Published: (2024)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
by: Jäger, Sven, et al.
Published: (2024)

Insights into $(k,ρ)$-shortcutting algorithms
by: Leonhardt, Alexander, et al.
Published: (2024)

Competitive Policies for Online Collateral Maintenance
by: Almashaqbeh, Ghada, et al.
Published: (2024)

Non-Clairvoyant Scheduling with Progress Bars
by: Benomar, Ziyad, et al.
Published: (2025)

Output-Sparse Matrix Multiplication Using Compressed Sensing
by: Bennett, Huck, et al.
Published: (2025)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
by: Armbruster, Alexander, et al.
Published: (2026)

Online Flow Time Minimization with Gradually Revealed Jobs
by: Lindermayr, Alexander, et al.
Published: (2026)

Approximating Optimum Online for Capacitated Resource Allocation
by: Braun, Alexander, et al.
Published: (2024)

Matrix Multiplication Verification Using Coding Theory
by: Bennett, Huck, et al.
Published: (2023)

IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data
by: Adler, Enno, et al.
Published: (2025)

Approximating $δ$-Covering
by: Hartmann, Tim A., et al.
Published: (2024)

Quartic quantum speedups for community detection
by: Schmidhuber, Alexander, et al.
Published: (2025)

A Little Clairvoyance Is All You Need
by: Gupta, Anupam, et al.
Published: (2025)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
by: Gupta, Anupam, et al.
Published: (2026)

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
by: Atalig, Sunny, et al.
Published: (2024)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
by: Grigoriev, Alexander, et al.
Published: (2025)