default search action
Guido Brückner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Guido Brückner
, Ignaz Rutter
Extending Partial Representations of Circle Graphs in Near-Linear Time. Algorithmica 86(7): 2152-2173 (2024) - 2023
- [j5]Guido Brückner, Ignaz Rutter:
An SPQR-tree-like embedding representation for level planarity. J. Comput. Geom. 14(1): 48-77 (2023) - 2022
- [j4]Guido Brückner
Level-Planar Drawings with Few Slopes. Algorithmica 84(1): 176-196 (2022) - [j3]Guido Brückner, Ignaz Rutter, Peter Stumpf:
Level-Planarity: Transitivity vs. Even Crossings. Electron. J. Comb. 29(4) (2022) - [c9]Guido Brückner, Ignaz Rutter
Extending Partial Representations of Circle Graphs in Near-Linear Time. MFCS 2022: 25:1-25:14 - 2021
- [b1]Guido Brückner:
Planarity Variants for Directed Graphs. Karlsruhe Institute of Technology, Germany, 2021 - [j2]Lukas Barth, Guido Brückner, Paul Jungeblut
Multilevel Planarity. J. Graph Algorithms Appl. 25(1): 151-170 (2021) - [j1]Guido Brückner, Ignaz Rutter:
Radial Level Planarity with Fixed Embedding. J. Graph Algorithms Appl. 25(1): 353-366 (2021) - [c8]Guido Brückner
Drawing Two Posets. SOFSEM 2021: 410-420 - 2020
- [c7]Guido Brückner
An SPQR-Tree-Like Embedding Representation for Level Planarity. ISAAC 2020: 8:1-8:15 - [i7]Guido Brückner, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Level Planarity. CoRR abs/2009.12309 (2020) - [i6]Guido Brückner, Vera Chekan:
Drawing Two Posets. CoRR abs/2010.12928 (2020)
2010 – 2019
- 2019
- [c6]Guido Brückner, Markus Himmel, Ignaz Rutter
An SPQR-Tree-Like Embedding Representation for Upward Planarity. GD 2019: 517-531 - [c5]Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze
Level-Planar Drawings with Few Slopes. GD 2019: 559-572 - [c4]Lukas Barth, Guido Brückner, Paul Jungeblut
Multilevel Planarity. WALCOM 2019: 219-231 - [i5]Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze:
Level-Planar Drawings with Few Slopes. CoRR abs/1907.13558 (2019) - [i4]Guido Brückner, Markus Himmel, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Upward Planarity. CoRR abs/1908.00352 (2019) - 2018
- [c3]Guido Brückner, Ignaz Rutter
Level Planarity: Transitivity vs. Even Crossings. GD 2018: 39-52 - [i3]Guido Brückner, Ignaz Rutter, Peter Stumpf:
Level Planarity: Transitivity vs. Even Crossings. CoRR abs/1808.09931 (2018) - [i2]Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
Multilevel Planarity. CoRR abs/1810.13297 (2018) - 2017
- [c2]Guido Brückner, Ignaz Rutter:
Partial and Constrained Level Planarity. SODA 2017: 2000-2011 - 2014
- [c1]Thomas Bläsius, Guido Brückner, Ignaz Rutter
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. ESA 2014: 161-172 - [i1]Thomas Bläsius, Guido Brückner, Ignaz Rutter:
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. CoRR abs/1405.2300 (2014)
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-12-10 21:44 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: