Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Engineering Linear Ordering Algorithms for Optimizing Data Visualizations (Research Project)

Funding Organisation: Vienna Science and Technology Fund, WWTF
Project Number: ICT19-035
Duration: 07/2020 - 06/2024

Project Team

Alexander Dobler (Doctoral Student)
Markus Wallinger (Doctoral Student)
Jules Wulms (Postdoc, 2021-2022)
Martin Nöllenburg (Professor, Principal Investigator)

Project team members together with the director of WWTF

Alexander Dobler, Michael Stampfer, Martin Nöllenburg at the 20th anniversary of WWTF

Topic

Optimizing linear orderings of objects is a fundamental problem for many types of data visualizations ranging from graph layouts over geospatial data to abstract sets and sequences or time-series data. Yet a systematic investigation of algorithms for solving novel constrained and application-specific ordering problems that go beyond well-studied and NP-hard classic ordering problems is missing. Practical work in visualization often resorts to heuristics without rigorous performance and quality guarantees for solving these algorithmic problems. In this project we will take an algorithmic perspective on several different ordering problems in data visualization. In the algorithm engineering sense we want to cross the gap between fundamental theory and practical applications and aim to bring the benefit of rigorous formal methods into practically relevant implementations and at the same time define new algorithmic challenges inspired by recent visualization problems. On the one hand, we will investigate the complexity of new problem settings with special input configurations, structural constraints on feasible orderings, and dependencies between multiple objects and orderings. On the other hand, we will design and implement new and sufficiently scalable algorithms with formally proven performance guarantees to compute optimal and approximate solutions. We thoroughly evaluate the improvements over existing state-of-the-art heuristics in computational experiments and user studies.

Publications

18 results
2024
[18]On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
J. Computer and Systems Sciences, volume 139, pages 103466, 2024.
[bibtex] [doi]
2023
[17]LinSets.zip: Compressing Linear Set Diagrams
Markus Wallinger, Alexander Dobler, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875–2887, 2023.
[bibtex] [doi]
[16]Faster Edge-Path Bundling Through Graph Spanners
Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen
Computer Graphics Forum, volume 42, number 6, pages e14789, 2023.
[bibtex] [doi]
[15]MosaicSets: Embedding Set Systems into Grid Graphs
Peter Rottmann, Markus Wallinger, Annika Bonerath, Sven Gedicke, Martin Nöllenburg, Jan-Henrik Haunert
IEEE Trans. Visualization and Computer Graphics, 2023.
[bibtex] [pdf]
[14]Splitting Vertices in 2-Layer Graph Drawings
Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
IEEE Computer Graphics and Applications, volume 43, number 3, pages 24–35, 2023.
[bibtex] [doi]
[13]Computing Hive Plots: A Combinatorial Framework
Martin Nöllenburg, Markus Wallinger
Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), 2023, Springer.
Note: To appear
[bibtex] [pdf]
[12]Planarizing Graphs and their Drawings by Vertex Splitting
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer.
[bibtex] [pdf] [doi]
[11]On Families of Planar DAGs with Constant Stack Number
Martin Nöllenburg, Sergey Pupyrev
Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), 2023, Springer.
Note: To appear
[bibtex] [pdf]
[10]The Influence of Dimensions on the Complexity of Computing Decision Trees
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
Conference on Artificial Intelligence (AAAI'23) (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 8343–8350, 2023, AAAI Press.
[bibtex] [doi]
[9]Crossing Minimization in Time Interval Storylines
Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms
European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer, Carlos Seara, eds.), pages 36:1–36:7, 2023.
[bibtex] [pdf]
[8]Block Crossings in One-Sided Tanglegrams
Alexander Dobler, Martin Nöllenburg
Algorithms and Data Structures (WADS'23) (Pat Morin, Subhash Suri, eds.), volume 14079 of LNCS, pages 386–400, 2023, Springer.
[bibtex] [pdf] [doi]
2022
[7]Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen
IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022.
[bibtex] [doi]
[6]Turbocharging Heuristics for Weak Coloring Numbers
Alexander Dobler, Manuel Sorge, Anaïs Villedieu
European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 44:1–44:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[5]On Computing Optimal Linear Diagrams
Alexander Dobler, Martin Nöllenburg
Diagrammatic Representation and Inference (DIAGRAMS'22) (Valeria Giardino, Sven Linker, Richard Burns, Francesco Bellucci, Jean-Michel Boucheix, Petrucio Viana, eds.), volume 13462 of LNAI, pages 20–36, 2022, Springer.
[bibtex] [pdf] [doi]
[4]Multidimensional Manhattan Preferences
Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger
Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer.
[bibtex] [doi]
[3]Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'22) (Artur Czumaj, Qin Xin, eds.), volume 227 of LIPIcs, pages 4:1–4:19, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
2021
[2]On the Readability of Abstract Set Visualizations
Markus Wallinger, Ben Jacobsen, Stephen Kobourov, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021.
[bibtex] [doi]
[1]MetroSets: Visualizing Sets as Metro Maps
Ben Jacobsen, Markus Wallinger, Stephen Kobourov, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021.
[bibtex] [pdf] [doi]

News

  • Informatics Awards 2023

    Informatics Awards 2023

    2023-12-06
    The Algorithms and Complexity group was very successful at the Informatics Awards 2023: André Schiedler won the Best Dissertation Award …Read More »
  • Jiehua Chen: promotion to tenured Associate Professor

    Jiehua Chen: promotion to tenured Associate Professor

    2023-10-18
    After her successful tenure evaluation, our colleague Jiehua Chen has been promoted to an Associate Professor. Hua joined the Algorithms …Read More »
  • Successful Graph Drawing conference 2023 in Palermo

    Successful Graph Drawing conference 2023 in Palermo

    2023-09-23
    The 31st edition of the International Symposium on Graph Drawing and Network Visualization in Palermo, Italy, ended on September 22, …Read More »
  • PhD completed by Anaïs Villedieu

    PhD completed by Anaïs Villedieu

    2023-07-24
    Anaïs Villedieu successfully defended her PhD thesis “Engineering Human-in-the-loop Graph Drawing Algorithms” on July 24, 2023. Congratulations, Dr. Villedieu! Anaïs …Read More »
  • PhD completed by Andre Schidler

    PhD completed by Andre Schidler

    2023-05-31
    Congratulations to André Schidler, who successfully defended his PhD thesis "Scalability for SAT-based combinatorial problem solving" today.   Thanks to …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020, 2021 and 2022.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.