default search action
Till Bruckdorfer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j7]Till Bruckdorfer, Stefan Felsner, Michael Kaufmann:
Planar Bus Graphs. Algorithmica 80(8): 2260-2285 (2018) - [j6]Patrizio Angelini
, Till Bruckdorfer, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze
Small Universal Point Sets for k-Outerplanar Graphs. Discret. Comput. Geom. 60(2): 430-470 (2018) - [j5]Michael A. Bekos
Algorithms and insights for RaceTrack. Theor. Comput. Sci. 748: 2-16 (2018) - 2017
- [j4]Michael A. Bekos
The Book Thickness of 1-Planar Graphs is Constant. Algorithmica 79(2): 444-465 (2017) - [j3]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani
Progress on Partial Edge Drawings. J. Graph Algorithms Appl. 21(4): 757-786 (2017) - 2016
- [b1]Till Bruckdorfer:
Schematics of Graphs and Hypergraphs. Tübingen University, Germany, 2016 - [c11]Michael A. Bekos
Algorithms and Insights for RaceTrack. FUN 2016: 6:1-6:14 - [c10]Patrizio Angelini
Low Ply Drawings of Trees. GD 2016: 236-248 - [i5]Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. CoRR abs/1608.08538 (2016) - 2015
- [c9]Michael A. Bekos
1-Planar Graphs have Constant Book Thickness. ESA 2015: 130-141 - [c8]Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov
On Embeddability of Buses in Point Sets. GD 2015: 395-408 - [c7]Patrizio Angelini
A Universal Point Set for 2-Outerplanar Graphs. GD 2015: 409-422 - [c6]Till Bruckdorfer, Michael Kaufmann, Simon Leibßle:
PED User Study. GD 2015: 551-553 - [c5]Till Bruckdorfer, Michael Kaufmann, Andreas Lauer:
A practical approach for 1/4-SHPEDs. IISA 2015: 1-6 - [i4]Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou:
The Book Thickness of 1-Planar Graphs is Constant. CoRR abs/1503.04990 (2015) - [i3]Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze:
A Universal Point Set for 2-Outerplanar Graphs. CoRR abs/1508.05784 (2015) - [i2]Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
On Embeddability of Buses in Point Sets. CoRR abs/1508.06760 (2015) - 2014
- [j2]Patrizio Angelini
On the area requirements of Euclidean minimum spanning trees. Comput. Geom. 47(2): 200-213 (2014) - [j1]Till Bruckdorfer, Michael Kaufmann, Fabrizio Montecchiani
1-Bend Orthogonal Partial Edge Drawing. J. Graph Algorithms Appl. 18(1): 111-131 (2014) - 2013
- [c4]Till Bruckdorfer, Stefan Felsner, Michael Kaufmann:
On the Characterization of Plane Bus Graphs. CIAC 2013: 73-84 - 2012
- [c3]Till Bruckdorfer, Michael Kaufmann:
Mad at Edge Crossings? Break the Edges! FUN 2012: 40-50 - [c2]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani
Progress on Partial Edge Drawings. GD 2012: 67-78 - [i1]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. CoRR abs/1209.0830 (2012) - 2011
- [c1]Patrizio Angelini
On the Area Requirements of Euclidean Minimum Spanning Trees. WADS 2011: 25-36
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-04-24 22:54 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: