Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDBoris Klemz
Person information
- affiliation: University of Würzburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j3]Boris Klemz
, Günter Rote:
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. Algorithmica 84(4): 1064-1080 (2022)- [i11]Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink:
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. CoRR abs/2202.11604 (2022) - [i10]Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff:
Outside-Obstacle Representations with All Vertices on the Outer Face. CoRR abs/2202.13015 (2022) - 2021
- [c11]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. SoCG 2021: 11:1-11:17 - [c10]Boris Klemz:
Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing. ESA 2021: 57:1-57:15 - [c9]Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder:
Simplifying Non-simple Fan-Planar Drawings. Graph Drawing 2021: 57-71 - [i9]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. CoRR abs/2103.09803 (2021) - [i8]Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder:
Simplifying Non-Simple Fan-Planar Drawings. CoRR abs/2108.13345 (2021)
2010 – 2019
- 2019
- [j2]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-increasing morphs of planar graphs. Comput. Geom. 84: 69-88 (2019) - [j1]Boris Klemz, Günter Rote:
Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity. ACM Trans. Algorithms 15(4): 53:1-53:25 (2019) - [c8]Michael Hoffmann, Boris Klemz:
Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian. ESA 2019: 58:1-58:14 - [c7]Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber:
On the Edge-Vertex Ratio of Maximal Thrackles. Graph Drawing 2019: 482-495 - [i7]Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber:
On the edge-vertex ratio of maximal thrackles. CoRR abs/1908.08857 (2019) - 2018
- [c6]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. WG 2018: 318-330 - [i6]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. CoRR abs/1802.06579 (2018) - [i5]Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz:
The Partition Spanning Forest Problem. CoRR abs/1809.02710 (2018) - 2017
- [c5]Boris Klemz, Günter Rote:
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. Graph Drawing 2017: 440-453 - [c4]Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow:
Obedient Plane Drawings for Disk Intersection Graphs. WADS 2017: 73-84 - [i4]Boris Klemz, Günter Rote:
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. CoRR abs/1708.07428 (2017) - [i3]Boris Klemz, Günter Rote:
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. CoRR abs/1711.04496 (2017) - 2016
- [c3]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. SoCG 2016: 37:1-37:15 - [i2]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. CoRR abs/1601.01598 (2016) - 2015
- [c2]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing Weighted Disk Contact Graphs. Graph Drawing 2015: 433-446 - [i1]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing Weighted Disk Contact Graphs. CoRR abs/1509.00720 (2015) - 2014
- [c1]Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg:
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. SWAT 2014: 265-276
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-05-16 22:45 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
