default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Gleißner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j11]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
- [j10]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) - 2016
- [j9]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) - [j8]Franz J. Brandenburg, Andreas Gleißner:
Ranking chain sum orders. Theor. Comput. Sci. 636: 66-76 (2016) - 2015
- [j7]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) - [j6]Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber:
1-Planarity of Graphs with a Rotation System. J. Graph Algorithms Appl. 19(1): 67-86 (2015) - [j5]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
- [j4]Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
Comparing and Aggregating Partial Orders with Kendall tau Distances. Discret. Math. Algorithms Appl. 5(2) (2013) - [j3]Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders. J. Comb. Optim. 26(2): 310-332 (2013) - [j2]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. J. Graph Algorithms Appl. 17(4): 541-565 (2013) - [c13]Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer:
Characterizing Planarity by the Splittable Deque. GD 2013: 25-36 - [c12]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 - [c11]Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
On Maximum Rank Aggregation Problems. IWOCA 2013: 14-27 - 2012
- [j1]Christian Bachmaier, Wolfgang Brunner, Andreas Gleißner:
Grid sifting: Leveling and crossing reduction. ACM J. Exp. Algorithmics 17(1) (2012) - [c10]Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber:
On the Density of Maximal 1-Planar Graphs. GD 2012: 327-338 - [c9]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber:
Optical Graph Recognition. GD 2012: 529-540 - [c8]Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer:
On Sparse Maximal 2-Planar Graphs. GD 2012: 555-556 - [c7]Christopher Auer, Andreas Gleißner, Kathrin Hanauer, Sebastian Vetter:
Testing Planarity by Switching Trains. GD 2012: 557-558 - [c6]Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
Comparing and Aggregating Partial Orders with Kendall Tau Distances. WALCOM 2012: 88-99 - [c5]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
- [c4]Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders. FAW-AAIM 2011: 352-363 - [c3]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner:
Classification of Planar Upward Embedding. GD 2011: 415-426 - [c2]Christopher Auer, Andreas Gleißner:
Characterizations of Deque and Queue Graphs. WG 2011: 35-46 - 2010
- [c1]Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner:
Plane Drawings of Queue and Deque Graphs. GD 2010: 68-79
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-24 22:59 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:
