Document Open Access Logo

Chunky Chains: Graph Drawing on Narrow Screens (Poster Abstract)

Authors Tim Hegemann , Dominik Jilg , Marie Diana Sieper , Samuel Wolf

PDF

File

Thumbnail PDF
PDF
LIPIcs.GD.2026.47.pdf
  • Filesize: 5.68 MB
  • 5 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Human-centered computing → Graph drawings
Keywords
  • Hybrid visualization
  • chord-link
  • chord diagram
  • chunky chains
  • bucketwidth
  • bandwidth
  • bucket integrity
  • experimental analysis

Metrics

Abstract

We introduce Chunky Chains, a graph drawing style with fixed width. A Chunky Chain consists of a chain of chord diagrams, called buckets, and is bounded by a given capacity c that limits the number of vertices in each bucket. Edges whose endpoints lie in the same or in adjacent buckets are short. Edges that are "skipping" at least one bucket are long, and we draw them only partially. The goal is to minimize the number of long edges.
We study the complexity of this problem, give exact and parameterized algorithms, and describe (and implement) a practical drawing pipeline.

Cite As Get BibTex

Tim Hegemann, Dominik Jilg, Marie Diana Sieper, and Samuel Wolf. Chunky Chains: Graph Drawing on Narrow Screens (Poster Abstract). In 34th International Symposium on Graph Drawing and Network Visualization (GD 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 396, pp. 47:1-47:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.GD.2026.47

Author Details

Tim Hegemann
  • Universität Würzburg, Germany
Dominik Jilg
  • Universität Würzburg, Germany
Marie Diana Sieper
  • Universität Würzburg, Germany
Samuel Wolf
  • Universität Würzburg, Germany

Supplementary Materials

References

  1. Chandan Dubey, Uriel Feige, and Walter Unger. Hardness results for approximating the bandwidth. J. Comput. Syst. Sci., 77(1):62-90, 2011. URL: https://doi.org/10.1016/j.jcss.2010.06.006.
  2. Uriel Feige and Kunal Talwar. Approximating the bandwidth of caterpillars. In Chandra Chekuri, Klaus Jansen, José D. P. Rolim, and Luca Trevisan, editors, Approximation Algorithms for Combinatorial Optimization Problems & Randomization and Computation (APPROX/RANDOM), volume 3624 of Lecture Notes in Comput. Sci., pages 62-73. Springer, 2005. URL: https://doi.org/10.1007/11538462_6.
  3. Uriel Feige and Kunal Talwar. Approximating the bandwidth of caterpillars. Algorithmica, 55(1):190-204, 2009. URL: https://doi.org/10.1007/s00453-007-9002-0.
  4. Martin Fürer, Serge Gaspers, and Shiva Prasad Kasiviswanathan. An exponential time 2-approximation algorithm for bandwidth. In Jianer Chen and Fedor V. Fomin, editors, Parameterized and Exact Computation (IPEC), volume 5917 of Lecture Notes in Comput. Sci., pages 173-184. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-11269-0_14.
  5. Martin Fürer, Serge Gaspers, and Shiva Prasad Kasiviswanathan. An exponential time 2-approximation algorithm for bandwidth. Theoret. Comput. Sci., 511:23-31, 2013. URL: https://doi.org/10.1016/j.tcs.2013.03.024.
  6. Tim Hegemann, Dominik Jilg, Marie Diana Sieper, and Samuel Wolf. Sample Gallery of Chunky Chain Visualizations. Collection, version 1.0. (visited on 2026-09-16). URL: https://chunkychains.github.io
    full metadata available at: https://doi.org/10.4230/artifacts.27963
  7. Tim Hegemann, Dominik Jilg, Marie Diana Sieper, and Samuel Wolf. Chunky chains: Graph drawings on small screens. CoRR, 2026. URL: https://arxiv.org/abs/2607.06029.
  8. Jonathan Klawitter. Algorithms for crossing minimisation in book drawings. Master’s thesis, Karlsruhe Institute of Technology, 2016. URL: https://algo.iti.kit.edu/_media/teaching/theses/jonathan.pdf.
  9. Jonathan Klawitter, Tamara Mchedlidze, and Martin Nöllenburg. Experimental evaluation of book drawing algorithms. In Fabrizio Frati and Kwan-Liu Ma, editors, Graph Drawing & Network Visualization (GD), volume 10692 of Lecture Notes in Comput. Sci., pages 224-238. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-73915-1_19.
  10. Walter Unger. The complexity of the approximation of the bandwidth problem. In Foundations of Computer Science (FOCS), pages 82-91. IEEE Computer Society, 1998. URL: https://doi.org/10.1109/SFCS.1998.743431.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact