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

Soeren Terziadis (né Nickel)

Address:
Soeren Terziadis
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Email: sterziadis@ac.tuwien.ac.at
Web: http://www.ac.tuwien.ac.at/people/sterziadis/

15 results
2025
[15]Planarizing Graphs and their Drawings by Vertex Splitting
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
J. Computational Geometry, volume 16, number 1, pages 333–372, 2025.
[bibtex] [doi]
[14]Constrained Boundary Labeling
Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger
Comput. Geom. Theory Appl., volume 129, pages 102191, 2025.
[bibtex] [doi]
[13]Network Navigation with Online Delays is PSPACE-complete
Thomas Depian, Christoph Kern, Sebastian Röder, Soeren Terziadis, Markus Wallinger
Chapter in Studierendenkonferenz Informatik (SKILL 2023), pages 195–206, 2025, Gesellschaft für Informatik e.V..
[bibtex] [doi]
2024
[12]Computing Data-driven Multilinear Metro Maps
Martin Nöllenburg, Soeren Terziadis
The Cartographic Journal, pages 1–16, 2024.
[bibtex] [doi]
[11]Constrained Boundary Labeling
Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger
Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[10]Boundary Labeling in a Circular Orbit
Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 22:1–22:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
2023
[9]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]
2022
[8]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]
[7]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]
[6]Removing Popular Faces in Curve Arrangements
Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote
CoRR, volume abs/2202.12175, 2022.
[bibtex] [pdf]
[5]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.), volume 248 of LIPIcs, pages 34:1–34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
2021
[4]Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer.
[bibtex] [pdf] [doi]
2020
[3]Towards Data-Driven Multilinear Metro Maps
Soeren Nickel, Martin Nöllenburg
Diagrammatic Representation and Inference (DIAGRAMS'20) (Ahti-Veikko Pietarinen, Peter Chapman, Leonie Bosveld de Smet, Valeria Giardino, James Corter, Sven Linker, eds.), volume 12169 of LNAI, pages 153–161, 2020, Springer.
[bibtex] [pdf] [doi]
2019
[2]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]
[1]Maximizing Ink in Partial Edge Drawings of k-plane Graphs
Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 323–336, 2019, Springer.
[bibtex] [pdf] [doi]
  • Doris Brazda
  • Maria Bresich
  • Jiehua Chen
  • Alexis de Colnet
  • Thomas Depian
  • Sara Di Bartolomeo
  • Alexander Dobler
  • Jan Dreier
  • Martin Durand
  • Simon Dominik Fink
  • Alexander Firbas
  • Robert Ganian
  • Christian Hatschka
  • Phuc Hung Hoang
  • Marc Huber
  • Enrico Iurlano
  • Liana Khazaliya
  • Markus Kirchweger
  • Viktoria Korchemna
  • Martin Kronegger
  • Fionn Aidan Mc Inerney
  • Martin Nöllenburg
  • Tomáš Peitl
  • Vaidyanathan P. R.
  • Günther Raidl
  • Franz Xaver Reichl
  • Mathis Rocton
  • Andre Schidler
  • Sofia Simola
  • Frank Sommer
  • Manuel Sorge
  • Johannes Strasser
  • Stefan Szeider
  • Laurenz Tomandl
  • Johannes Varga
  • Florentina Voboril
  • Markus Wallinger
  • Simon Wietheger
  • Hai Xia
  • Tianwei Zhang
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.