default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoeren Terziadis
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. J. Graph Algorithms Appl. 28(2): 47-82 (2024)- [c11]Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms:
Boundary Labeling in a Circular Orbit. GD 2024: 22:1-22:17 - [c10]Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger:
Constrained Boundary Labeling. ISAAC 2024: 26:1-26:16 - [c9]Philipp Kindermann, Fabian Klute, Soeren Terziadis:
The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization. IPEC 2024: 26:1-26:20 - [c8]Henry Förster
, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) 2024: 336-349 - [i12]Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger:
Constrained Boundary Labeling. CoRR abs/2402.12245 (2024) - [i11]Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms:
On Orbital Labeling with Circular Contours. CoRR abs/2403.19052 (2024) - 2023
- [c7]Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. GD (2) 2023: 18-33 - [i10]Thomas Depian, Christoph Kern, Sebastian Röder, Soeren Terziadis, Markus Wallinger:
Network Navigation with Online Delays is PSPACE-complete. CoRR abs/2308.12265 (2023) - [i9]Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber:
Geometric Thickness of Multigraphs is ∃R-complete. CoRR abs/2312.05010 (2023) - 2022
- [j2]Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu:
Shape-Guided Mixed Metro Map Layout. Comput. Graph. Forum 41(7): 495-506 (2022) - [j1]Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Multicriteria Optimization for Dynamic Demers Cartograms. IEEE Trans. Vis. Comput. Graph. 28(6): 2376-2387 (2022) - [c6]Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms:
Planarizing Graphs and Their Drawings by Vertex Splitting. GD 2022: 232-246 - [c5]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. ISAAC 2022: 34:1-34:14 - [i8]Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. CoRR abs/2202.12175 (2022) - [i7]Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms:
Planarizing Graphs and their Drawings by Vertex Splitting. CoRR abs/2202.12293 (2022) - [i6]Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu:
Shape-Guided Mixed Metro Map Layout. CoRR abs/2208.14261 (2022) - [i5]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. CoRR abs/2209.14804 (2022) - 2021
- [c4]Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg:
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. GD 2021: 304-317 - [i4]Sujoy Bhore, Soeren Nickel, Martin Nöllenburg:
Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs. CoRR abs/2103.08416 (2021) - 2020
- [c3]Soeren Nickel, Martin Nöllenburg:
Towards Data-Driven Multilinear Metro Maps. Diagrams 2020: 153-161
2010 – 2019
- 2019
- [c2]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. GD 2019: 46-60 - [c1]Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg:
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. GD 2019: 323-336 - [i3]Soeren Nickel, Martin Nöllenburg:
Drawing k-linear Metro Maps. CoRR abs/1904.03039 (2019) - [i2]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. CoRR abs/1908.07291 (2019) - [i1]Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg:
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. CoRR abs/1908.08905 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
