Michael Kaufmann

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 123

Top Venues

CoRR

Graph Drawing

J. Graph Algorithms Appl.

Algorithmica

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Carla Binucci, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12 (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. SWAT (2024)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
-planar Drawings of Graphs. J. Graph Algorithms Appl. 28 (2) (2024)
Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster
Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062). Dagstuhl Reports 14 (2) (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. CoRR (2024)
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
Axis-Parallel Right Angle Crossing Graphs. CoRR (2023)
Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. CoRR (2023)
Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
Splitting Vertices in 2-Layer Graph Drawings. CoRR (2023)
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
Axis-Parallel Right Angle Crossing Graphs. ESA (2023)
Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf
On the 2-Layer Window Width Minimization Problem. SOFSEM (2023)
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
k-planar Placement and Packing of Δ-regular Caterpillars. CoRR (2023)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
Lazy Queue Layouts of Posets. Algorithmica 85 (5) (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC (2023)
Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt
The Density Formula: One Lemma to Bound Them All. CoRR (2023)
Michael Kaufmann
The Family of Fan-Planar Graphs. WALCOM (2023)
Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
Linear Layouts of Bipartite Planar Graphs. WADS (2023)
Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
Linear Layouts of Bipartite Planar Graphs. CoRR (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27 (8) (2023)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Min-k-planar Drawings of Graphs. CoRR (2023)
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
k-Planar Placement and Packing of Δ-Regular Caterpillars. Int. J. Found. Comput. Sci. 34 (7) (2023)
Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43 (3) (2023)
Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Nonplanar Graph Drawings with k Vertices per Face. WG (2023)
Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. CCCG (2023)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Min-k-planar Drawings of Graphs. GD (1) (2023)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. Algorithmica 85 (9) (2023)
Carla Binucci, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments. Comput. Graph. Forum 41 (1) (2022)
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister
RAC Drawings of Graphs with Low Degree. MFCS (2022)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
The mixed page number of graphs. Theor. Comput. Sci. 931 (2022)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. CoRR (2022)
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
Graph Product Structure for h-Framed Graphs. CoRR (2022)
Michael Kaufmann, Torsten Ueckerdt
The Density of Fan-Planar Graphs. Electron. J. Comb. 29 (1) (2022)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. CoRR (2022)
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
Graph Product Structure for h-Framed Graphs. ISAAC (2022)
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister
RAC Drawings of Graphs with Low Degree. CoRR (2022)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity of Partial 2-Trees. GD (2022)
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
Recognizing and Embedding Simple Optimal 2-Planar Graphs. CoRR (2021)
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution. Comput. J. 64 (1) (2021)
Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta
Stable visualization of connected components in dynamic graphs. Inf. Vis. 20 (1) (2021)
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25 (2) (2021)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. CoRR (2021)
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
Recognizing and Embedding Simple Optimal 2-Planar Graphs. Graph Drawing (2021)
Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff
Using the Metro-Map Metaphor for Drawing Hypergraphs. SOFSEM (2021)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The number of crossings in multigraphs with no empty lens. J. Graph Algorithms Appl. 25 (1) (2021)
Muhammad Jawaherul Alam, Michael A. Bekos, Vida Dujmovic, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
On dispersable book embeddings. Theor. Comput. Sci. 861 (2021)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
The Mixed Page Number of Graphs. CoRR (2021)
Michael A. Bekos, Mirco Haug, Michael Kaufmann, Julia Männecke
An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs. CoRR (2020)
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Four Pages Are Indeed Necessary for Planar Graphs. J. Comput. Geom. 11 (1) (2020)
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Four Pages Are Indeed Necessary for Planar Graphs. CoRR (2020)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
Queue Layouts of Planar 3-Trees. Algorithmica 82 (9) (2020)
Therese C. Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
Layered Fan-Planar Graph Drawings. MFCS (2020)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. CoRR (2020)
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
The Stub Resolution of 1-Planar Graphs. WALCOM (2020)
Henry Förster, Michael Kaufmann
On Compact RAC Drawings. ESA (2020)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
Lazy Queue Layouts of Posets. Graph Drawing (2020)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. J. Graph Algorithms Appl. 24 (4) (2020)
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
On RAC drawings of graphs with one bend per edge. Theor. Comput. Sci. (2020)
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
Monotone Arc Diagrams with few Biarcs. CoRR (2020)
Therese C. Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
On Layered Fan-Planar Graph Drawings. CoRR (2020)
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. Graph Drawing (2020)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
Lazy Queue Layouts of Posets. CoRR (2020)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. CoRR (2019)
Michael A. Bekos, Henry Förster, Michael Kaufmann
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Algorithmica 81 (5) (2019)
Michael Kaufmann
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge. SOFSEM (2019)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. Graph Drawing (2019)
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
The QuaSEFE Problem. Graph Drawing (2019)
Seok-Hee Hong, Michael Kaufmann, János Pach, Csaba D. Tóth
Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092). Dagstuhl Reports 9 (2) (2019)
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
The QuaSEFE Problem. CoRR (2019)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
On 3D visibility representations of graphs with few crossings per edge. Theor. Comput. Sci. 784 (2019)
Michael A. Bekos, Carla Binucci, Michael Kaufmann, Chrysanthi N. Raftopoulou, Antonios Symvonis, Alessandra Tappini
Coloring outerplanar graphs and planar 3-trees with small monochromatic components. CoRR (2019)
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
On RAC Drawings of Graphs with One Bend per Edge. Graph Drawing (2018)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
On Dispersable Book Embeddings. CoRR (2018)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. ISAAC (2018)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The number of crossings in multigraphs with no empty lens. CoRR (2018)
Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber
Algorithms and insights for RaceTrack. Theor. Comput. Sci. 748 (2018)
Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
Guest Editors' Foreword and Overview. J. Graph Algorithms Appl. 22 (1) (2018)
Patrizio Angelini, Till Bruckdorfer, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella
Small Universal Point Sets for k-Outerplanar Graphs. Discret. Comput. Geom. 60 (2) (2018)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
On Dispersable Book Embeddings. WG (2018)
Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. Graph Drawing (2018)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck
1-Fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723 (2018)
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
On RAC Drawings of Graphs with one Bend per Edge. CoRR (2018)
Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. CoRR (2018)
Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
Queue Layouts of Planar 3-Trees. CoRR (2018)
William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek
Table cartogram. Comput. Geom. 68 (2018)
Till Bruckdorfer, Stefan Felsner, Michael Kaufmann
Planar Bus Graphs. Algorithmica 80 (8) (2018)
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
The Number of Crossings in Multigraphs with No Empty Lens. Graph Drawing (2018)
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution. CoRR (2018)
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution. Graph Drawing (2018)
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM (2018)
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
Queue Layouts of Planar 3-Trees. Graph Drawing (2018)
Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
On Vertex- and Empty-Ply Proximity Drawings. Graph Drawing (2017)
Niklas Heinsohn, Michael Kaufmann
An Interactive Tool to Explore and Improve the Ply Number of Drawings. CoRR (2017)
Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis
Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21 (3) (2017)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
3D Visibility Representations of 1-planar Graphs. CoRR (2017)
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
On Optimal 2- and 3-Planar Graphs. SoCG (2017)
Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou
The Book Thickness of 1-Planar Graphs is Constant. Algorithmica 79 (2) (2017)
Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Konstantinos S. Stavropoulos, Sankar Veeramoni
The maximum k-differential coloring problem. J. Discrete Algorithms 45 (2017)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
Beyond-Planarity: Density Results for Bipartite Graphs. CoRR (2017)
Michael A. Bekos, Henry Förster, Michael Kaufmann
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. CoRR (2017)
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
The planar tree packing theorem. J. Comput. Geom. 8 (2) (2017)
Michael A. Bekos, Henry Förster, Michael Kaufmann
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Graph Drawing (2017)

Michael Kaufmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Kaufmann