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

Human-centered Algorithm Engineering:
Graph and Map Visualization (Research Project)

Funding Organisation: The Austrian Science Fund, FWF
Project Number: FWF P 31119
Duration: 11/2018 - 04/2022

Project Team

Sujoy Bhore (Postdoc until 03/2020)
Jules Wulms (Postdoc until 09/2021)
Guangping Li (Doctoral Student until 03/2022)
Anaïs Villedieu (Doctoral Student)
Martin Nöllenburg (Professor, Principal Investigator)

Topic

Human-centered algorithm engineering is an unconventional new paradigm in algorithmics that puts, for the first time, human factors into the focus of algorithm engineering, a methodology that is based on a cycle of design, analysis, implementation, and experimental evaluation of algorithms. Unlike other fields in computer science that investigate the interplay of humans and computers, our focus is on the symbiosis of human expert users and computers on the fundamental level of algorithms. We combine the mathematical accuracy and computational power of formal algorithmics with the creative power of the human mind in order to provide more effective and efficient algorithms for currently insufficiently solved and ill-defined algorithmic problems. Human-centered algorithms aim to produce solutions of better quality with faster overall performance, and higher user satisfaction. The project has two main goals: (i) establishing theoretical foundations, models of computation, and suitable evaluation methods and (ii) showing the practicality and benefits of the new paradigm for several prime examples of human-centered algorithmic problems that lack satisfying traditional algorithmic solutions in graph drawing and computational cartography.

Publications

30 results
2023
[30]Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Comput. Geom. Theory Appl., volume 111, 2023.
[bibtex] [doi]
2022
[29]Multi-level Area Balancing of Clustered Graphs
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022.
[bibtex] [doi]
[28]Multicriteria Optimization for Dynamic Demers Cartograms
Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022.
Note: TVCG Replicability Stamp
[bibtex] [doi]
[27]Mixed Labeling: Integrating Internal and External Labels
Ladislav Čmolík, Václav Pavlovec, Hsiang-Yun Wu, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022.
[bibtex] [pdf] [doi]
[26]Shape-Guided Mixed Metro Map Layout
Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu
Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022.
[bibtex] [doi]
[25]An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Sujoy Bhore, Guangping Li, Martin Nöllenburg
ACM J. Experimental Algorithmics, volume 27, pages 1.8:1–1.8:36, 2022.
[bibtex] [doi]
[24]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022.
[bibtex] [doi]
[23]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, 2022, Springer.
[bibtex] [pdf] [doi]
[22]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]
[21]Minimum Link Fencing
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Algorithms and Computation (ISAAC'22) (Sang Won Bae, Heejin Park, eds.), pages 34:1–34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
2021
[20]Geometric Planar Networks on Bichromatic Collinear Points
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Theoretical Computer Science, volume 895, pages 124–136, 2021.
[bibtex] [doi]
[19]Stable Visual Summaries for Trajectory Collections
Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann
Pacific Visualization Symposium (PacificVis'21), pages 61–70, 2021, IEEE.
[bibtex] [doi]
[18]Layered Area-Proportional Rectangle Contact Representation
Martin Nöllenburg, Anaïs Villedieu, Jules Wulms
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 318–326, 2021, Springer.
[bibtex] [doi]
[17]Disjoint Box Covering in a Rectilinear Polygon
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Jules Wulms
European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021.
[bibtex] [pdf]
[16]Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Algorithms and Computation (ISAAC'21) (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 19:1–19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[15]Balanced Independent and Dominating Sets on Colored Interval Graphs
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Theory and Practice of Computer Science (SOFSEM'21) (Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence Wong, eds.), volume 12607 of LNCS, pages 89–103, 2021, Springer.
[bibtex] [doi]
[14]Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM.
[bibtex] [pdf] [doi]
2020
[13]A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives
Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi, Maxwell J. Roberts, Martin Nöllenburg
Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020.
[bibtex] [pdf] [doi]
[12]Route Schematization with Landmarks
Marcelo Galvão, Jakub Krukar, Martin Nöllenburg, Angela Schwering
J. Spatial Information Science, volume 21, 2020.
[bibtex] [pdf] [doi]
[11]Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020.
[bibtex] [doi]
[10]The Turing Test for Graph Drawing Algorithms
Helen C. Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu
Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 466–481, 2020, Springer.
[bibtex] [pdf] [doi]
[9]An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Sujoy Bhore, Guangping Li, Martin Nöllenburg
Algorithms (ESA'20) (Fabrizio Grandoni, Peter Sanders, Grzegorz Herman, eds.), volume 173 of LIPIcs, pages 19:1–19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[8]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer.
[bibtex] [pdf] [doi]
[7]Geometric Planar Networks on Bichromatic Points
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Algorithms and Discrete Applied Mathematics (CALDAM'20) (Manoj Changat, Sandip Das, eds.), volume 12016 of LNCS, pages 79–91, 2020, Springer.
[bibtex] [pdf] [doi]
2019
[6]Metabopolis: scalable network layout for biological pathway diagrams in urban map style
Hsiang-Yun Wu, Martin Nöllenburg, Filipa L. Sousa, Ivan Viola
BMC Bioinformatics, volume 20, pages 187, 2019.
[bibtex] [doi]
[5]Guidelines for Experimental Algorithmics: A Case Study in Network Analysis
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
Algorithms, volume 12, number 7, pages 127:1–127:37, 2019.
[bibtex] [pdf] [doi]
[4]Computing Stable Demers Cartograms
Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 46–60, 2019, Springer.
[bibtex] [pdf] [doi]
[3]Exploring Semi-Automatic Map Labeling
Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt
Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM.
[bibtex] [pdf] [doi]
[2]Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer.
[bibtex] [pdf] [doi]
2018
[1]A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
Eurographics Conference on Visualization (EuroVis'18) – Posters (Anna Puig, Renata Raidou, eds.), pages 57–59, 2018.
[bibtex] [doi]

News

  • New FWF ESPRIT Postdocs

    New FWF ESPRIT Postdocs

    2022-11-09
    Leroy Chew and Alexis de Colnet just joined the Algorithms and Complexity group as PIs of their own FWF ESPRIT …Read More »
  • Best student paper award at DIAGRAMS 2022

    Best student paper award at DIAGRAMS 2022

    2022-10-01
    Alexander Dobler received the Best Student Paper Award at the 13th International Conference on the Theory and Application of Diagrams …Read More »
  • Robert Ganian promoted to Associate Professor

    Robert Ganian promoted to Associate Professor

    2022-07-01
    Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, …Read More »
  • Best paper award at EvoCOP 2022

    Best paper award at EvoCOP 2022

    2022-05-24
    Jonas Mayerhofer, Markus Kirchweger, Marc Huber, and Günther Raidl received the best paper award for their work A Beam Search …Read More »
  • New PhD: Guangping Li

    New PhD: Guangping Li

    2022-05-13
    Guangping Li successfully defended her PhD thesis “An Algorithmic Study of Practical Map Labeling” on May 13, 2022. Congratulations, Dr. …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.