Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. - Boris Klemz; Tamara Mchedlidze; Martin Nöllenburg (SWAT, 2014)

Recognizing Weighted Disk Contact Graphs. - Boris Klemz; Martin Nöllenburg; Roman Prutkin (GD, 2015)

Strongly Monotone Drawings of Planar Graphs. - Stefan Felsner; Alexander Igamberdiev; Philipp Kindermann; Boris Klemz; Tamara Mchedlidze; Manfred Scheucher (SoCG, 2016)

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity. - Boris Klemz; Günter Rote (GD, 2017)

Obedient Plane Drawings for Disk Intersection Graphs. - Bahareh Banyassady; Michael Hoffmann 001; Boris Klemz; Maarten Löffler; Tillmann Miltzow (WADS, 2017)

The Partition Spanning Forest Problem. - Philipp Kindermann; Boris Klemz; Ignaz Rutter; Patrick Schnider; André Schulz 001 (CoRR, 2018)

Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian. - Michael Hoffmann 001; Boris Klemz (ESA, 2019)

On the Edge-Vertex Ratio of Maximal Thrackles. - Oswin Aichholzer; Linda Kleist; Boris Klemz; Felix Schröder; Birgit Vogtenhuber (GD, 2019)

Convexity-increasing morphs of planar graphs. - Linda Kleist; Boris Klemz; Anna Lubiw; Lena Schlipf; Frank Staals; Darren Strash (Comput. Geom., 2019)

Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity. - Boris Klemz; Günter Rote (ACM Trans. Algorithms, 2019)

Facets of Planar Graph Drawing - Boris Klemz (2020)

Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing. - Boris Klemz (ESA, 2021)

Outside-Obstacle Representations with All Vertices on the Outer Face. - Oksana Firman; Philipp Kindermann; Jonathan Klawitter; Boris Klemz; Felix Klesen; Alexander Wolff 001 (GD, 2022)

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. - Ina Goeßmann; Jonathan Klawitter; Boris Klemz; Felix Klesen; Stephen G. Kobourov; Myroslav Kryven; Alexander Wolff 001; Johannes Zink 001 (WG, 2022)

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. - Boris Klemz; Günter Rote (Algorithmica, 2022)

Recognizing weighted and seeded disk graphs. - Boris Klemz; Martin Nöllenburg; Roman Prutkin (J. Comput. Geom., 2022)

The Complexity of Finding Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2023)

Deciding the Feasibility and Minimizing the Height of Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

Simplifying Non-Simple Fan-Planar Drawings. - Boris Klemz; Kristin Knorr; Meghana M. Reddy; Felix Schröder (J. Graph Algorithms Appl., 2023)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels. - Václav Blazej; Boris Klemz; Felix Klesen; Marie Diana Sieper; Alexander Wolff 001; Johannes Zink 001 (SoCG, 2024)

The Density Formula: One Lemma to Bound Them All. - Michael Kaufmann 001; Boris Klemz; Kristin Knorr; Meghana M. Reddy; Felix Schröder; Torsten Ueckerdt (GD, 2024)

Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number. - Boris Klemz; Marie Diana Sieper (ICALP, 2024)

Morphing Graph Drawings in the Presence of Point Obstacles. - Oksana Firman; Tim Hegemann; Boris Klemz; Felix Klesen; Marie Diana Sieper; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Adjacency Graphs of Polyhedral Surfaces. - Elena Arseneva; Linda Kleist; Boris Klemz; Maarten Löffler; André Schulz 001; Birgit Vogtenhuber; Alexander Wolff 001 (Discret. Comput. Geom., 2024)