default search action
Marcel Radermacher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j6]Marcel Radermacher
, Ignaz Rutter
Inserting an edge into a geometric embedding. Comput. Geom. 102: 101843 (2022) - 2021
- [j5]Lukas Barth, Guido Brückner, Paul Jungeblut
Multilevel Planarity. J. Graph Algorithms Appl. 25(1): 151-170 (2021) - 2020
- [b1]Marcel Radermacher:
Geometric Graph Drawing Algorithms - Theory, Engineering and Experiments. Karlsruhe University, Germany, 2020 - [j4]Tamara Mchedlidze
Drawing Clustered Planar Graphs on Disk Arrangements. J. Graph Algorithms Appl. 24(2): 105-131 (2020) - [c10]Marcel Radermacher, Ignaz Rutter
Towards a Characterization of Stretchable Aligned Graphs. GD 2020: 295-307 - [i7]Marcel Radermacher, Ignaz Rutter, Peter Stumpf:
Towards a characterization of stretchable aligned graphs. CoRR abs/2008.06300 (2020)
2010 – 2019
- 2019
- [j3]Marcel Radermacher, Klara Reichard, Ignaz Rutter
Geometric Heuristics for Rectilinear Crossing Minimization. ACM J. Exp. Algorithmics 24(1): 1.12:1-1.12:21 (2019) - [j2]Thomas Bläsius
How to Draw a Planarization. J. Graph Algorithms Appl. 23(4): 653-682 (2019) - [c9]Marcel Radermacher, Ignaz Rutter
Geometric Crossing-Minimization - A Scalable Randomized Approach. ESA 2019: 76:1-76:16 - [c8]Tamara Mchedlidze
Drawing Clustered Graphs on Disk Arrangements. WALCOM 2019: 160-171 - [c7]Lukas Barth, Guido Brückner, Paul Jungeblut
Multilevel Planarity. WALCOM 2019: 219-231 - [i6]Marcel Radermacher, Ignaz Rutter:
Geometric Crossing-Minimization - A Scalable Randomized Approach. CoRR abs/1907.01243 (2019) - 2018
- [j1]Tamara Mchedlidze
Aligned Drawings of Planar Graphs. J. Graph Algorithms Appl. 22(3): 401-429 (2018) - [c6]Marcel Radermacher, Klara Reichard, Ignaz Rutter
A Geometric Heuristic for Rectilinear Crossing Minimization. ALENEX 2018: 129-138 - [c5]Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze
A Greedy Heuristic for Crossing-Angle Maximization. GD 2018: 286-299 - [c4]Marcel Radermacher, Ignaz Rutter
Inserting an Edge into a Geometric Embedding. GD 2018: 402-415 - [i5]Almut Demel, Dominik Dürrschnabel
A Greedy Heuristic for Crossing-Angle Maximization. CoRR abs/1807.09483 (2018) - [i4]Marcel Radermacher, Ignaz Rutter:
Inserting an Edge into a Geometric Embedding. CoRR abs/1807.11711 (2018) - [i3]Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
Multilevel Planarity. CoRR abs/1810.13297 (2018) - [i2]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
Drawing Clustered Graphs on Disk Arrangements. CoRR abs/1811.00785 (2018) - 2017
- [c3]Tamara Mchedlidze
Aligned Drawings of Planar Graphs. GD 2017: 3-16 - [c2]Thomas Bläsius
How to Draw a Planarization. SOFSEM 2017: 295-308 - [i1]Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter:
Aligned Drawings of Planar Graphs. CoRR abs/1708.08778 (2017) - 2013
- [c1]Moritz Kobitzsch, Marcel Radermacher, Dennis Schieferdecker:
Evolution and Evaluation of the Penalty Method for Alternative Graphs. ATMOS 2013: 94-107
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 2024-05-08 21:00 CEST 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: