default search action
Fabian Lipp
Person information
- affiliation: Julius Maximilian University of Würzburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Steven Chaplick
, Krzysztof Fleszar
The Complexity of Drawing Graphs on Few Lines and Few Planes. J. Graph Algorithms Appl. 27(6): 459-488 (2023) - 2021
- [j5]Michael Kaufmann, Jan Kratochvíl
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 625-642 (2021) - [i9]Ilaria Malanchini, Patrick Agostini, Khurshid Alam, Michael Baumgart, Martin Kasparick, Qi Liao, Fabian Lipp, Nikolaj Marchenko, Nicola Michailow, Rastin Pries, Hans D. Schotten, Slawomir Stanczak, Stanislaw Strzyz:
Leveraging Machine Learning for Industrial Wireless Communications. CoRR abs/2105.02051 (2021) - 2020
- [j4]Steven Chaplick
Drawing graphs on few lines and few planes. J. Comput. Geom. 11(1): 433-475 (2020) - [c13]Michael Kaufmann, Jan Kratochvíl
The Stub Resolution of 1-Planar Graphs. WALCOM 2020: 170-182
2010 – 2019
- 2019
- [j3]Steven Chaplick
Compact drawings of 1-planar graphs with right-angle crossings and few bends. Comput. Geom. 84: 50-68 (2019) - [c12]Patrick Kalmbach, David Hock, Fabian Lipp
NOracle: Who is communicating with whom in my network? SIGCOMM Posters and Demos 2019: 48-50 - 2018
- [c11]Michael Kaufmann, Jan Kratochvíl
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM 2018: 214-220 - [c10]Steven Chaplick
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. GD 2018: 137-151 - [i8]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. CoRR abs/1806.10044 (2018) - 2017
- [j2]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp
Block Crossings in Storyline Visualizations. J. Graph Algorithms Appl. 21(5): 873-913 (2017) - [c9]Thomas C. van Dijk, Fabian Lipp
Computing Storyline Visualizations with Few Block Crossings. GD 2017: 365-378 - [c8]Steven Chaplick
The Complexity of Drawing Graphs on Few Lines and Few Planes. WADS 2017: 265-276 - [i7]Thomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff:
Computing Storyline Visualizations with Few Block Crossings. CoRR abs/1709.01055 (2017) - 2016
- [j1]Fabian Lipp
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms 9(3): 53 (2016) - [c7]Steven Chaplick
Drawing Graphs on Few Lines and Few Planes. GD 2016: 166-180 - [c6]Steven Chaplick
Obstructing Visibilities with One Obstacle. GD 2016: 295-308 - [c5]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp
Block Crossings in Storyline Visualizations. GD 2016: 382-398 - [c4]Patrizio Angelini
Simultaneous Orthogonal Planarity. GD 2016: 532-545 - [i6]Steven Chaplick, Fabian Lipp, Ji-won Park, Alexander Wolff:
Obstructing Visibilities with One Obstacle. CoRR abs/1607.00278 (2016) - [i5]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.01196 (2016) - [i4]Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. CoRR abs/1607.06444 (2016) - [i3]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. CoRR abs/1608.08427 (2016) - [i2]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. CoRR abs/1609.00321 (2016) - 2015
- [c3]Fabian Lipp
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. GD 2015: 52-59 - 2014
- [c2]Philipp Kindermann
Luatodonotes: Boundary Labeling for Annotations in Texts. GD 2014: 76-88 - 2012
- [c1]Krzysztof Fleszar, Christian Glaßer, Fabian Lipp
Structural Complexity of Multiobjective NP Search Problems. LATIN 2012: 338-349 - 2011
- [i1]Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek:
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. Electron. Colloquium Comput. Complex. TR11 (2011)
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 23:04 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: