default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Bachmaier
Person information
- affiliation: University of Passau, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Correction to: Outer 1-Planar Graphs. Algorithmica 83(11): 3534-3535 (2021)
2010 – 2019
- 2018
- [j13]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Andreas Gleißner
:
Data Structures and their Planar Graph Layouts. J. Graph Algorithms Appl. 22(2): 207-237 (2018) - 2017
- [j12]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-planar graphs. Discret. Appl. Math. 232: 23-40 (2017) - [i3]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-Planar Graphs. CoRR abs/1701.04375 (2017) - [i2]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer:
A Note on IC-Planar Graphs. CoRR abs/1707.08652 (2017) - 2016
- [j11]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Outer 1-Planar Graphs. Algorithmica 74(4): 1293-1320 (2016) - 2015
- [j10]Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Andreas Hofmeier:
On the hardness of maximum rank aggregation problems. J. Discrete Algorithms 31: 2-13 (2015) - [j9]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer:
Upward planar graphs and their duals. Theor. Comput. Sci. 571: 36-49 (2015) - 2013
- [j8]Christian Bachmaier, Marco Matzeder:
Drawing Unordered Trees on k-Grids. J. Graph Algorithms Appl. 17(2): 103-128 (2013) - [j7]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. J. Graph Algorithms Appl. 17(4): 541-565 (2013) - [c20]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Recognizing Outer 1-Planar Graphs in Linear Time. GD 2013: 107-118 - [c19]Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
On Maximum Rank Aggregation Problems. IWOCA 2013: 14-27 - [c18]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer:
Rolling Upward Planarity Testing of Strongly Connected Graphs. WG 2013: 38-49 - [r1]Christian Bachmaier, Ulrik Brandes, Falk Schreiber:
Biological Networks. Handbook of Graph Drawing and Visualization 2013: 621-651 - 2012
- [j6]Christian Bachmaier, Wolfgang Brunner, Andreas Gleißner:
Grid sifting: Leveling and crossing reduction. ACM J. Exp. Algorithmics 17(1) (2012) - [j5]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp:
Drawing Recurrent Hierarchies. J. Graph Algorithms Appl. 16(2): 151-198 (2012) - [c17]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. GD 2012: 529-540 - [c16]Christian Bachmaier, Marco Matzeder:
Drawing Unordered Trees on k-Grids. WALCOM 2012: 198-210 - [c15]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer:
The Duals of Upward Planar Graphs on Cylinders. WG 2012: 103-113 - 2011
- [j4]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner:
Global k-Level Crossing Reduction. J. Graph Algorithms Appl. 15(5): 631-659 (2011) - [c14]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner:
Classification of Planar Upward Embedding. GD 2011: 415-426 - [c13]Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow:
The Open Graph Archive: A Community-Driven Effort. GD 2011: 435-440 - [i1]Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow:
The Open Graph Archive: A Community-Driven Effort. CoRR abs/1109.1465 (2011) - 2010
- [j3]Christian Bachmaier, Hedi Buchner, Michael Forster, Seok-Hee Hong:
Crossing minimization in extended level drawings of graphs. Discret. Appl. Math. 158(3): 159-179 (2010) - [c12]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner:
Plane Drawings of Queue and Deque Graphs. GD 2010: 68-79 - [c11]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner:
A Global k-Level Crossing Reduction Algorithm. WALCOM 2010: 70-81
2000 – 2009
- 2009
- [c10]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp:
Coordinate Assignment for Cyclic Level Graphs. COCOON 2009: 66-75 - 2008
- [c9]Christian Bachmaier, Wolfgang Brunner:
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs. ESA 2008: 136-147 - [c8]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász:
Cyclic Leveling of Directed Graphs. GD 2008: 348-359 - [c7]Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried:
Tree Drawings on the Hexagonal Grid. GD 2008: 372-383 - 2007
- [j2]Christian Bachmaier:
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information. IEEE Trans. Vis. Comput. Graph. 13(3): 583-594 (2007) - [c6]Christian Bachmaier, Wolfgang Brunner, Christof König:
Cyclic Level Planarity Testing and Embedding. GD 2007: 50-61 - 2005
- [j1]Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster:
Radial Level Planarity Testing and Embedding in Linear Time. J. Graph Algorithms Appl. 9(1): 53-97 (2005) - [c5]Christian Bachmaier, Florian Fischer, Michael Forster:
Radial Coordinate Assignment for Level Graphs. COCOON 2005: 401-410 - [c4]Christian Bachmaier, Ulrik Brandes, Barbara Schlieper:
Drawing Phylogenetic Trees. ISAAC 2005: 1110-1121 - 2004
- [b1]Christian Bachmaier:
Circle planarity of level graphs. University of Passau, Germany, 2004, pp. I-VI, 1-140 - [c3]Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner:
Gravisto: Graph Visualization Toolkit. GD 2004: 502-503 - [c2]Michael Forster, Christian Bachmaier:
Clustered Level Planarity. SOFSEM 2004: 218-228 - 2003
- [c1]Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster:
Radial Level Planarity Testing and Embedding in Linear Time. GD 2003: 393-405
Coauthor Index
aka: Franz J. Brandenburg
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-25 05:40 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:
