Michael Kaufmann

404 papers A* 10A 95B 46C 5Misc 5Journal 190Unranked 50
YearRankTypeTitle / Venue / Authors
2026 J jnl
Rectilinear-upward planarity testing of digraphs.
J. Comput. Syst. Sci.
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
2025 J jnl
A first view on the density of 5-planar graphs.
CoRR
Aaron Büngener, Jakob Franz, Michael Kaufmann, Maximilian Pfister
2025 A conf
Approximating Barnette's Conjecture.
GD
Michael A. Bekos, Michael Kaufmann, Maximilian Pfister
2025 J jnl
Drawing graphs with k vertices per face: Complexity and algorithms.
Theor. Comput. Sci.
Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani
2025 J jnl
On k-planar Graphs without Short Cycles.
J. Graph Algorithms Appl.
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2025 A conf
The Page Number of Monotone Directed Acyclic Outerplanar Graphs Is Four or Five.
GD
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann
2025 A conf
The Price of Connectivity Augmentation on Planar Graphs.
GD
Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025 J jnl
The Price of Connectivity Augmentation on Planar Graphs.
CoRR
Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025 A conf
Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs.
STACS
Julia Katheder, Michael Kaufmann, Sergey Pupyrev, Torsten Ueckerdt
2024 J jnl
Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062).
Dagstuhl Reports
Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster
2024 — conf
Eliminating Crossings in Ordered Graphs.
SWAT
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
2024 J jnl
Eliminating Crossings in Ordered Graphs.
CoRR
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
2024 J jnl
Graph Product Structure for $h$-Framed Graphs.
Electron. J. Comb.
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
2024 J jnl
Graphs Drawn With Some Vertices per Face: Density and Relationships.
IEEE Access
Carla Binucci, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2024 A conf
Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs.
GD
Aaron Büngener, Michael Kaufmann
2024 J jnl
Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs.
CoRR
Aaron Büngener, Michael Kaufmann
2024 J jnl
Min-
J. Graph Algorithms Appl.
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2024 A conf
Monotone Arc Diagrams with Few Biarcs.
GD
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2024 J jnl
Monotone Arc Diagrams with few Biarcs.
CoRR
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2024 J jnl
On
CoRR
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2024 A conf
On k-Planar Graphs Without Short Cycles.
GD
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2024 A conf
On the Complexity of Recognizing k^+-Real Face Graphs.
GD
Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani
2024 A conf
The Density Formula: One Lemma to Bound Them All.
GD
Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt
2023 A conf
Axis-Parallel Right Angle Crossing Graphs.
ESA
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
2023 J jnl
Axis-Parallel Right Angle Crossing Graphs.
CoRR
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
2023 J jnl
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time.
Algorithmica
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2023 J jnl
Lazy Queue Layouts of Posets.
Algorithmica
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2023 B conf
Linear Layouts of Bipartite Planar Graphs.
WADS
Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
2023 J jnl
Linear Layouts of Bipartite Planar Graphs.
CoRR
Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou
2023 — conf
Min-k-planar Drawings of Graphs.
GD (1)
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2023 J jnl
Min-k-planar Drawings of Graphs.
CoRR
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2023 B conf
Nonplanar Graph Drawings with k Vertices per Face.
WG
Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
2023 B conf
On the 2-Layer Window Width Minimization Problem.
SOFSEM
Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf
2023 — conf
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs.
CCCG
Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger
2023 J jnl
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs.
CoRR
Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger
2023 J jnl
Rectilinear Planarity of Partial 2-Trees.
J. Graph Algorithms Appl.
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2023 B conf
Rectilinear-Upward Planarity Testing of Digraphs.
ISAAC
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
2023 J jnl
Splitting Vertices in 2-Layer Graph Drawings.
IEEE Computer Graphics and Applications
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
2023 J jnl
Splitting Vertices in 2-Layer Graph Drawings.
CoRR
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
2023 J jnl
The Density Formula: One Lemma to Bound Them All.
CoRR
Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt
2023 B conf
The Family of Fan-Planar Graphs.
WALCOM
Michael Kaufmann
2023 J jnl
k-Planar Placement and Packing of Δ-Regular Caterpillars.
Int. J. Found. Comput. Sci.
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
2023 J jnl
k-planar Placement and Packing of Δ-regular Caterpillars.
CoRR
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
2022 J jnl
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time.
CoRR
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2022 B conf
Graph Product Structure for h-Framed Graphs.
ISAAC
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
2022 J jnl
Graph Product Structure for h-Framed Graphs.
CoRR
Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann
2022 B ed.
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers
WG
Michael A. Bekos, Michael Kaufmann
2022 J jnl
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments.
Comput. Graph. Forum
Carla Binucci, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani
2022 B conf
RAC Drawings of Graphs with Low Degree.
MFCS
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister
2022 J jnl
RAC Drawings of Graphs with Low Degree.
CoRR
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister
2022 A conf
Rectilinear Planarity of Partial 2-Trees.
GD
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2022 J jnl
Rectilinear Planarity of Partial 2-Trees.
CoRR
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2022 J jnl
The Density of Fan-Planar Graphs.
Electron. J. Comb.
Michael Kaufmann, Torsten Ueckerdt
2022 J jnl
The mixed page number of graphs.
Theor. Comput. Sci.
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2021 J jnl
A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution.
Comput. J.
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
2021 J jnl
On dispersable book embeddings.
Theor. Comput. Sci.
Muhammad Jawaherul Alam, Michael A. Bekos, Vida Dujmovic, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2021 A conf
Recognizing and Embedding Simple Optimal 2-Planar Graphs.
GD
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
2021 J jnl
Recognizing and Embedding Simple Optimal 2-Planar Graphs.
CoRR
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
2021 J jnl
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs.
CoRR
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2021 J jnl
Stable visualization of connected components in dynamic graphs.
Inf. Vis.
Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta
2021 J jnl
The Mixed Page Number of Graphs.
CoRR
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2021 J jnl
The Stub Resolution of 1-planar Graphs.
J. Graph Algorithms Appl.
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2021 J jnl
The number of crossings in multigraphs with no empty lens.
J. Graph Algorithms Appl.
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2021 B conf
Using the Metro-Map Metaphor for Drawing Hypergraphs.
SOFSEM
Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff
2020 J jnl
An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs.
CoRR
Michael A. Bekos, Mirco Haug, Michael Kaufmann, Julia Männecke
2020 J jnl
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity.
J. Graph Algorithms Appl.
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck
2020 J jnl
Four Pages Are Indeed Necessary for Planar Graphs.
CoRR
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2020 J jnl
Four Pages Are Indeed Necessary for Planar Graphs.
J. Comput. Geom.
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2020 B conf
Layered Fan-Planar Graph Drawings.
MFCS
Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
2020 A conf
Lazy Queue Layouts of Posets.
GD
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2020 J jnl
Lazy Queue Layouts of Posets.
CoRR
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2020 J jnl
Monotone Arc Diagrams with few Biarcs.
CoRR
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2020 A conf
On Compact RAC Drawings.
ESA
Henry Förster, Michael Kaufmann
2020 J jnl
On Layered Fan-Planar Graph Drawings.
CoRR
Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
2020 J jnl
On RAC drawings of graphs with one bend per edge.
Theor. Comput. Sci.
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
2020 J jnl
Queue Layouts of Planar 3-Trees.
Algorithmica
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2020 A conf
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time.
GD
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2020 J jnl
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time.
CoRR
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali
2020 B conf
The Stub Resolution of 1-Planar Graphs.
WALCOM
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2019 J jnl
Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092).
Dagstuhl Reports
Seok-Hee Hong, Michael Kaufmann, János Pach, Csaba D. Tóth
2019 J jnl
Coloring outerplanar graphs and planar 3-trees with small monochromatic components.
CoRR
Michael A. Bekos, Carla Binucci, Michael Kaufmann, Chrysanthi N. Raftopoulou, Antonios Symvonis, Alessandra Tappini
2019 A conf
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity.
GD
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck
2019 J jnl
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity.
CoRR
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck
2019 J jnl
On 3D visibility representations of graphs with few crossings per edge.
Theor. Comput. Sci.
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
2019 B conf
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge.
SOFSEM
Michael Kaufmann
2019 J jnl
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.
Algorithmica
Michael A. Bekos, Henry Förster, Michael Kaufmann
2019 A conf
The QuaSEFE Problem.
GD
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
2019 J jnl
The QuaSEFE Problem.
CoRR
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
2018 J jnl
1-Fan-bundle-planar drawings of graphs.
Theor. Comput. Sci.
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck
2018 A conf
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution.
GD
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
2018 J jnl
A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution.
CoRR
Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann, Amadäus M. Spallek, Jan Splett
2018 J jnl
Algorithms and insights for RaceTrack.
Theor. Comput. Sci.
Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber
2018 B conf
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs.
ISAAC
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
2018 — conf
Bounded Stub Resolution for Some Maximal 1-Planar Graphs.
CALDAM
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2018 J jnl
Guest Editors' Foreword and Overview.
J. Graph Algorithms Appl.
Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
2018 B conf
On Dispersable Book Embeddings.
WG
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2018 J jnl
On Dispersable Book Embeddings.
CoRR
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2018 A conf
On RAC Drawings of Graphs with One Bend per Edge.
GD
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
2018 J jnl
On RAC Drawings of Graphs with one Bend per Edge.
CoRR
Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann
2018 A conf
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.
GD
Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
2018 J jnl
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.
CoRR
Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
2018 J jnl
Planar Bus Graphs.
Algorithmica
Till Bruckdorfer, Stefan Felsner, Michael Kaufmann
2018 A conf
Queue Layouts of Planar 3-Trees.
GD
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2018 J jnl
Queue Layouts of Planar 3-Trees.
CoRR
Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2018 J jnl
Small Universal Point Sets for k-Outerplanar Graphs.
Discret. Comput. Geom.
Patrizio Angelini, Till Bruckdorfer, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella
2018 J jnl
Table cartogram.
Comput. Geom.
William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek
2018 A conf
The Number of Crossings in Multigraphs with No Empty Lens.
GD
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2018 J jnl
The number of crossings in multigraphs with no empty lens.
CoRR
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2017 A conf
1-Fan-Bundle-Planar Drawings of Graphs.
GD
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck
2017 J jnl
1-Fan-Bundle-Planar Drawings of Graphs.
CoRR
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck
2017 A conf
3D Visibility Representations of 1-planar Graphs.
GD
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
2017 J jnl
3D Visibility Representations of 1-planar Graphs.
CoRR
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
2017 A conf
An Interactive Tool to Explore and Improve the Ply Number of Drawings.
GD
Niklas Heinsohn, Michael Kaufmann
2017 J jnl
An Interactive Tool to Explore and Improve the Ply Number of Drawings.
CoRR
Niklas Heinsohn, Michael Kaufmann
2017 J jnl
Beyond-Planarity: Density Results for Bipartite Graphs.
CoRR
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt
2017 A* conf
On Optimal 2- and 3-Planar Graphs.
SoCG
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
2017 J jnl
On Optimal 2- and 3-Planar Graphs.
CoRR
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
2017 A conf
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.
GD
Michael A. Bekos, Henry Förster, Michael Kaufmann
2017 J jnl
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings.
CoRR
Michael A. Bekos, Henry Förster, Michael Kaufmann
2017 A conf
On Vertex- and Empty-Ply Proximity Drawings.
GD
Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
2017 J jnl
On Vertex- and Empty-Ply Proximity Drawings.
CoRR
Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
2017 J jnl
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.
Algorithmica
Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann
2017 J jnl
On the Total Number of Bends for Planar Octilinear Drawings.
J. Graph Algorithms Appl.
Michael A. Bekos, Michael Kaufmann, Robert Krug
2017 J jnl
Progress on Partial Edge Drawings.
J. Graph Algorithms Appl.
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
2017 J jnl
The Book Thickness of 1-Planar Graphs is Constant.
Algorithmica
Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou
2017 J jnl
The maximum k-differential coloring problem.
J. Discrete Algorithms
Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Konstantinos S. Stavropoulos, Sankar Veeramoni
2017 J jnl
The planar tree packing theorem.
J. Comput. Geom.
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2017 J jnl
Threshold-coloring and unit-cube contact representation of planar graphs.
Discret. Appl. Math.
Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter
2017 J jnl
Vertex-Coloring with Defects.
J. Graph Algorithms Appl.
Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis
2016 — conf
AVDTC of generalized 3-Halin graphs.
IISA
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
2016 Misc conf
Algorithms and Insights for RaceTrack.
FUN
Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber
2016 J jnl
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452).
Dagstuhl Reports
Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, János Pach
2016 A conf
Low Ply Drawings of Trees.
GD
Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr
2016 J jnl
Low Ply Drawings of Trees.
CoRR
Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr
2016 J jnl
Multi-omics enrichment analysis using the GeneTrail2 web service.
Bioinform.
Daniel Stöckel, Tim Kehl, Patrick Trampert, Lara Schneider, Christina Backes, Nicole Ludwig, Andreas Gerasch, Michael Kaufmann, Manfred Gessler, Norbert M. Graf, Eckart Meese, Andreas Keller, Hans-Peter Lenhof
2016 B conf
On Contact Graphs with Cubes and Proportional Boxes.
SOFSEM
Muhammad Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov
2016 J jnl
On the Density of 3-Planar Graphs.
CoRR
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
2016 A conf
On the Density of Non-simple 3-Planar Graphs.
GD
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
2016 B conf
On the Total Number of Bends for Planar Octilinear Drawings.
LATIN
Michael A. Bekos, Michael Kaufmann, Robert Krug
2016 A* conf
The Planar Tree Packing Theorem.
SoCG
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2016 J jnl
The Planar Tree Packing Theorem.
CoRR
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2016 B conf
Vertex-Coloring with Star-Defects.
WALCOM
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli
2015 A conf
1-Planar Graphs have Constant Book Thickness.
ESA
Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou
2015 A conf
A New Approach to Partial MUS Enumeration.
SAT
Christian Zielke, Michael Kaufmann
2015 A conf
A Universal Point Set for 2-Outerplanar Graphs.
GD
Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze
2015 J jnl
A Universal Point Set for 2-Outerplanar Graphs.
CoRR
Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze
2015 — conf
A practical approach for 1/4-SHPEDs.
IISA
Till Bruckdorfer, Michael Kaufmann, Andreas Lauer
2015 J jnl
Approximating Minimum Manhattan Networks in Higher Dimensions.
Algorithmica
Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff
2015 B conf
Contact Graphs of Circular Arcs.
WADS
Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt
2015 J jnl
Contact Representations of Sparse Planar Graphs.
CoRR
Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt
2015 J jnl
Fitting Planar Graphs on Planar Maps.
J. Graph Algorithms Appl.
Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze
2015 — conf
Low ply graph drawing.
IISA
Emilio Di Giacomo, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Antonios Symvonis, Hsu-Chun Yen
2015 J jnl
Many-to-One Boundary Labeling with Backbones.
J. Graph Algorithms Appl.
Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
2015 J jnl
Network-based interactive navigation and analysis of large biological datasets.
it Inf. Technol.
Andreas Gerasch, Jan Küntzer, Peter Niermann, Daniel Stöckel, Michael Kaufmann, Oliver Kohlbacher, Hans-Peter Lenhof
2015 B conf
On Bar (1, j)-Visibility Graphs - (Extended Abstract).
WALCOM
Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann, Daniel Neuwirth
2015 J jnl
On Contact Graphs with Cubes and Proportional Boxes.
CoRR
Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov
2015 A conf
On Embeddability of Buses in Point Sets.
GD
Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev
2015 J jnl
On Embeddability of Buses in Point Sets.
CoRR
Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev
2015 J jnl
On the Total Number of Bends for Planar Octilinear Drawings.
CoRR
Michael A. Bekos, Michael Kaufmann, Robert Krug
2015 A conf
PED User Study.
GD
Till Bruckdorfer, Michael Kaufmann, Simon Leibßle
2015 J jnl
Planar Octilinear Drawings with One Bend Per Edge.
J. Graph Algorithms Appl.
Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug
2015 — conf
Sloginsky drawings of graphs.
IISA
Michael A. Bekos, Michael Kaufmann, Robert Krug
2015 A conf
The Book Embedding Problem from a SAT-Solving Perspective.
GD
Michael A. Bekos, Michael Kaufmann, Christian Zielke
2015 J jnl
The Book Thickness of 1-Planar Graphs is Constant.
CoRR
Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou
2015 B conf
The Effect of Almost-Empty Faces on Planar Kandinsky Drawings.
SEA
Michael A. Bekos, Michael Kaufmann, Robert Krug, Martin Siebenhaller
2015 B conf
The Maximum k-Differential Coloring Problem.
SOFSEM
Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni
2015 J jnl
Vertex-Coloring with Star-Defects.
CoRR
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli
2014 J jnl
1-Bend Orthogonal Partial Edge Drawing.
J. Graph Algorithms Appl.
Till Bruckdorfer, Michael Kaufmann, Fabrizio Montecchiani
2014 J jnl
A note on maximum differential coloring of planar graphs.
J. Discrete Algorithms
Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni
2014 J jnl
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.
J. Graph Algorithms Appl.
William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze, Stephen K. Wismath
2014 J jnl
Bend-optimal orthogonal graph drawing in the general position model.
Comput. Geom.
Stefan Felsner, Michael Kaufmann, Pavel Valtr
2014 B conf
Boundary Labeling Methods for Dynamic Focus Regions.
PacificVis
Niklas Heinsohn, Andreas Gerasch, Michael Kaufmann
2014 B conf
Fitting Planar Graphs on Planar Maps.
SOFSEM
Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze
2014 A conf
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.
GD
Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann
2014 J jnl
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.
CoRR
Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann
2014 J jnl
On the Upward Planarity of Mixed Plane Graphs.
J. Graph Algorithms Appl.
Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
2014 J jnl
On the area requirements of Euclidean minimum spanning trees.
Comput. Geom.
Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella
2014 A conf
Planar Octilinear Drawings with One Bend Per Edge.
GD
Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug
2014 J jnl
Planar Octilinear Drawings with One Bend Per Edge.
CoRR
Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug
2014 B conf
Rebuilding KEGG Maps: Algorithms and Benefits.
PacificVis
Andreas Gerasch, Michael Kaufmann, Oliver Kohlbacher
2014 J jnl
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.
J. Graph Algorithms Appl.
Michael A. Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan Näher, Vincenzo Roselli
2014 — conf
Sloggy drawings of graphs.
IISA
Michael A. Bekos, Michael Kaufmann, Robert Krug
2014 B conf
Smooth Orthogonal Drawings of Planar Graphs.
LATIN
Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff
2014 J jnl
The Density of Fan-Planar Graphs.
CoRR
Michael Kaufmann, Torsten Ueckerdt
2014 J jnl
The Maximum k-Differential Coloring Problem.
CoRR
Michael A. Bekos, Stephen G. Kobourov, Michael Kaufmann, Sankar Veeramoni
2014 J jnl
Universal Point Sets for Drawing Planar Graphs with Circular Arcs.
J. Graph Algorithms Appl.
Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff
2014 — conf
Upward-rightward planar drawings.
IISA
Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani
2013 J jnl
Approximate proximity drawings.
Comput. Geom.
William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2013 J jnl
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.
CoRR
William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath
2013 J jnl
Computing Cartograms with Optimal Complexity.
Discret. Comput. Geom.
Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2013 J jnl
Geometric RAC Simultaneous Drawings of Graphs.
J. Graph Algorithms Appl.
Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
2013 J jnl
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations.
Algorithmica
Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
2013 A conf
MUStICCa: MUS Extraction with Interactive Choice of Candidates.
SAT
Johannes Dellert, Christian Zielke, Michael Kaufmann
2013 A conf
Many-to-One Boundary Labeling with Backbones.
GD
Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
2013 J jnl
Many-to-One Boundary Labeling with Backbones.
CoRR
Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
2013 J jnl
Maximum Differential Coloring of Caterpillars and Spiders
CoRR
Aparna Das, Markus Geyer, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni
2013 J jnl
NetworkTrail - a web service for identifying and visualizing deregulated subnetworks.
Bioinform.
Daniel Stöckel, Oliver Müller, Tim Kehl, Andreas Gerasch, Christina Backes, Alexander Rurainski, Andreas Keller, Michael Kaufmann, Hans-Peter Lenhof
2013 C conf
On the Characterization of Plane Bus Graphs.
CIAC
Till Bruckdorfer, Stefan Felsner, Michael Kaufmann
2013 A conf
On the Upward Planarity of Mixed Plane Graphs.
GD
Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
2013 J jnl
On upward point set embeddability.
Comput. Geom.
Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
2013 B conf
Planar Packing of Binary Trees.
WADS
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2013 A conf
Slanted Orthogonal Drawings.
GD
Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli
2013 J jnl
Smooth Orthogonal Drawings of Planar Graphs.
CoRR
Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff
2013 J jnl
Smooth Orthogonal Layouts.
J. Graph Algorithms Appl.
Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis
2013 A conf
Table Cartograms.
ESA
William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek
2013 J jnl
Threshold Coloring and Unit-Cube Contact Representation of Graphs
CoRR
Md. Jawaherul Alam, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev
2013 B conf
Threshold-Coloring and Unit-Cube Contact Representation of Graphs.
WG
Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev
2013 — conf
Universal Point Sets for Planar Graph Drawings with Circular Arcs.
CCCG
Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff
2012 A conf
CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation).
SAT
Stephan Kottler, Christian Zielke, Paul Seitz, Michael Kaufmann
2012 J jnl
Computing Cartograms with Optimal Complexity
CoRR
Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2012 — conf
Computing cartograms with optimal complexity.
SCG
Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2012 A conf
Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation).
SAT
Sebastian Burg, Stephan Kottler, Michael Kaufmann
2012 Misc conf
Geometric RAC Simultaneous Drawings of Graphs.
COCOON
Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
2012 Misc conf
Mad at Edge Crossings? Break the Edges!
FUN
Till Bruckdorfer, Michael Kaufmann
2012 J jnl
On a Tree and a Path with no Geometric Simultaneous Embedding.
J. Graph Algorithms Appl.
Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth
2012 J jnl
Optimal Polygonal Representation of Planar Graphs.
Algorithmica
Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov
2012 J jnl
Progress on Partial Edge Drawings
CoRR
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
2012 A conf
Progress on Partial Edge Drawings.
GD
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
2012 J jnl
Proportional Contact Representations of Planar Graphs.
J. Graph Algorithms Appl.
Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
2012 A conf
Smooth Orthogonal Layouts.
GD
Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis
2012 J jnl
Vertex angle and crossing angle resolution of leveled tree drawings.
Inf. Process. Lett.
Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner
2012 J jnl
miRTrail - a comprehensive webserver for analyzing gene and miRNA patterns to enhance the understanding of regulatory mechanisms in diseases.
BMC Bioinform.
Cedric Laczny, Petra Leidinger, Jan Haas, Nicole Ludwig, Christina Backes, Andreas Gerasch, Michael Kaufmann, Britta Vogel, Hugo A. Katus, Benjamin Meder, Cord Stähler, Eckart Meese, Hans-Peter Lenhof, Andreas Keller
2011 J jnl
A systematic approach to the one-mode projection of bipartite graphs.
Soc. Netw. Anal. Min.
Katharina Anna Zweig, Michael Kaufmann
2011 A conf
Approximate Proximity Drawings.
GD
William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2011 J jnl
Approximating Minimum Manhattan Networks in Higher Dimensions
CoRR
Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff
2011 A conf
Approximating Minimum Manhattan Networks in Higher Dimensions.
ESA
Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff
2011 B conf
Beyond Unit Propagation in SAT Solving.
SEA
Michael Kaufmann, Stephan Kottler
2011 J jnl
Colored Simultaneous Geometric Embeddings and Universal Pointsets.
Algorithmica
Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
2011 A conf
Combining Problems on RAC Drawings and Simultaneous Graph Drawings.
GD
Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
2011 B conf
Combining Traditional Map Labeling with Boundary Labeling.
SOFSEM
Michael A. Bekos, Michael Kaufmann, Dimitrios Papadopoulos, Antonios Symvonis
2011 J jnl
Geometric Simultaneous RAC Drawings of Graphs
CoRR
Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
2011 J jnl
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191).
Dagstuhl Reports
Camil Demetrescu, Michael Kaufmann, Stephen G. Kobourov, Petra Mutzel
2011 — conf
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.
EGC
Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw
2011 B conf
Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations.
ISAAC
Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
2011 B conf
On the Area Requirements of Euclidean Minimum Spanning Trees.
WADS
Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella
2011 J jnl
On the Perspectives Opened by Right Angle Crossing Drawings.
J. Graph Algorithms Appl.
Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis
2011 J jnl
Optimal Polygonal Representation of Planar Graphs
CoRR
Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov
2011 J jnl
Polynomial area bounds for MST embeddings of trees.
Comput. Geom.
Fabrizio Frati, Michael Kaufmann
2011 A conf
Proportional Contact Representations of Planar Graphs.
GD
Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
2011 A conf
Small Point Sets for Simply-Nested Planar Graphs.
GD
Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella
2011 J jnl
Straight-Line Rectangular Drawings of Clustered Graphs.
Discret. Comput. Geom.
Patrizio Angelini, Fabrizio Frati, Michael Kaufmann
2011 A conf
Upward Point Set Embeddability for Convex Point Sets Is in P.
GD
Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
2011 J jnl
Upward Point Set Embeddability for Convex Point Sets is in $P$
CoRR
Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
2011 B conf
Upward Point-Set Embeddability.
SOFSEM
Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
2010 — conf
An automatic layout algorithm for BPEL processes.
SOFTVIS
Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann
2010 J jnl
Area-Feature Boundary Labeling.
Comput. J.
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
2010 J jnl
Boundary Labeling with Octilinear Leaders.
Algorithmica
Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis
2010 J jnl
Comparing trees via crossing minimization.
J. Comput. Syst. Sci.
Henning Fernau, Michael Kaufmann, Mathias Poths
2010 A conf
Improving Layered Graph Layouts with Edge Bundling.
GD
Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann
2010 J jnl
On Metro-Line Crossing Minimization.
J. Graph Algorithms Appl.
Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
2010 A conf
On a Tree and a Path with No Geometric Simultaneous Embedding.
GD
Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth
2010 J jnl
On a Tree and a Path with no Geometric Simultaneous Embedding
CoRR
Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth
2010 B conf
Optimal Polygonal Representation of Planar Graphs.
LATIN
Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov
2010 A conf
Upward Geometric Graph Embeddings into Point Sets.
GD
Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
2010 J jnl
Upward Point-Set Embeddability
CoRR
Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
2010 A conf
Visualizing Differences between Two Large Graphs.
GD
Markus Geyer, Michael Kaufmann, Robert Krug
2010 J jnl
Visuelle Analytik biologischer Daten.
Inform. Spektrum
Kay Nieselt, Michael Kaufmann, Andreas Gerasch, Hans-Peter Lenhof, Marcel Spehr, Stefan Hesse, Stefan Gumhold
2009 J jnl
A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis.
Bioinform.
Andreas Keller, Christina Backes, Andreas Gerasch, Michael Kaufmann, Oliver Kohlbacher, Eckart Meese, Hans-Peter Lenhof
2009 B conf
An Interactive Layout Tool for BPMN.
CEC
Philip Effinger, Martin Siebenhaller, Michael Kaufmann
2009 J jnl
Constrained Simultaneous and Near-Simultaneous Embeddings.
J. Graph Algorithms Appl.
Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov
2009 — conf
Modeling and Designing Real-World Networks.
Algorithmics of Large and Complex Networks
Michael Kaufmann, Katharina A. Zweig
2009 — conf
On Map Labeling with Leaders.
Efficient Algorithms
Michael Kaufmann
2009 A conf
On the Perspectives Opened by Right Angle Crossing Drawings.
GD
Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis
2009 J jnl
Planar packing of trees and spider trees.
Inf. Process. Lett.
Fabrizio Frati, Markus Geyer, Michael Kaufmann
2009 A conf
Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles.
GD
Michael Kaufmann, Stephan Kottler
2009 B conf
Straight-Line Rectangular Drawings of Clustered Graphs.
WADS
Patrizio Angelini, Fabrizio Frati, Michael Kaufmann
2009 J jnl
Two trees which are self-intersecting when drawn simultaneously.
Discret. Math.
Markus Geyer, Michael Kaufmann, Imrich Vrto
2009 A conf
Visualization of Complex BPEL Models.
GD
Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler
2008 — conf
08191 Working Group Report - Visualization of Trajectories.
Graph Drawing with Applications to Bioinformatics and Social Sciences
Stephen P. Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen G. Kobourov, Anna Lubiw, Dorothea Wagner
2008 A conf
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors.
SAT
Stephan Kottler, Michael Kaufmann, Carsten Sinz
2008 — conf
Boundary Labeling with Octilinear Leaders.
SWAT
Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis
2008 A conf
Computation of Renameable Horn Backdoors.
SAT
Stephan Kottler, Michael Kaufmann, Carsten Sinz
2008 J jnl
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment.
Algorithms Mol. Biol.
Amarendran Ramaswami Subramanian, Michael Kaufmann, Burkhard Morgenstern
2008 J jnl
Efficient Labeling of Collinear Sites.
J. Graph Algorithms Appl.
Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
2008 A conf
Enhancing Visualizations of Business Processes.
GD
Philip Effinger, Michael Kaufmann, Martin Siebenhaller
2008 J jnl
Fixed parameter algorithms for one-sided crossing minimization revisited.
J. Discrete Algorithms
Vida Dujmovic, Henning Fernau, Michael Kaufmann
2008 J jnl
GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments.
BMC Bioinform.
Andreas Keller, Christina Backes, Maher Al-Awadhi, Andreas Gerasch, Jan Küntzer, Oliver Kohlbacher, Michael Kaufmann, Hans-Peter Lenhof
2008 J jnl
Guest Editor's Foreword.
J. Graph Algorithms Appl.
Michael Kaufmann, Dorothea Wagner
2008 A conf
Subdivision Drawings of Hypergraphs.
GD
Michael Kaufmann, Marc J. van Kreveld, Bettina Speckmann
2008 A conf
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.
GD
Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
2007 J jnl
BNDB - The Biochemical Network Database.
BMC Bioinform.
Jan Küntzer, Christina Backes, Torsten Blum, Andreas Gerasch, Michael Kaufmann, Oliver Kohlbacher, Hans-Peter Lenhof
2007 J jnl
Boundary labeling: Models and efficient algorithms for rectangular maps.
Comput. Geom.
Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
2007 Misc conf
Colored Simultaneous Geometric Embeddings.
COCOON
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
2007 — conf
Consistent Minimization of Clustering Objective Functions.
NIPS
Ulrike von Luxburg, Sébastien Bubeck, Stefanie Jegelka, Michael Kaufmann
2007 A conf
Constrained Simultaneous and Near-Simultaneous Embeddings.
GD
Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov
2007 A ed.
Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers
GD
Michael Kaufmann, Dorothea Wagner
2007 — conf
Labeling collinear sites.
APVIS
Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
2007 A conf
Line Crossing Minimization on Metro Maps.
GD
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
2007 B conf
Packing and Squeezing Subgraphs into Planar Graphs.
MFCS
Fabrizio Frati, Markus Geyer, Michael Kaufmann
2007 — conf
Placing connected components of disconnected graphs.
APVIS
Dennis Goehlsdorf, Michael Kaufmann, Martin Siebenhaller
2007 A conf
Polynomial Area Bounds for MST Embeddings of Trees.
GD
Michael Kaufmann
2006 J jnl
BN++ - A Biological Information System.
J. Integr. Bioinform.
Jan Küntzer, Torsten Blum, Andreas Gerasch, Christina Backes, Andreas Hildebrandt, Michael Kaufmann, Oliver Kohlbacher, Hans-Peter Lenhof
2006 — conf
Drawing activity diagrams.
SOFTVIS
Martin Siebenhaller, Michael Kaufmann
2006 A* conf
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition.
SODA
Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian
2006 — conf
Multi-stack Boundary Labeling Problems.
FSTTCS
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
2006 J jnl
On the maximal cliques in
Algorithms Mol. Biol.
Katharina Anna Lehmann, Michael Kaufmann, Stephan Steigele, Kay Nieselt
2006 — conf
Polygon labelling of minimum leader length.
APVIS
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
2006 — conf
Topic 12: Theory and Algorithms for Parallel Computation.
Euro-Par
Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis
2006 J jnl
Visualization aided performance tuning of irregular task-parallel computations.
Inf. Vis.
Wolfgang Blochinger, Michael Kaufmann, Martin Siebenhaller
2005 J jnl
A New Approach for Boundary Recognition in Geometric Sensor Networks
CoRR
Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann
2005 — conf
A New Approach for Boundary Recognition in Geometric Sensor Networks.
CCCG
Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann
2005 J jnl
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing.
J. Graph Algorithms Appl.
Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann
2005 — conf
Boundary Labelling of Optimal Total Leader Length.
Panhellenic Conference on Informatics
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
2005 — conf
Comparing Trees Via Crossing Minimization.
FSTTCS
Henning Fernau, Michael Kaufmann, Mathias Poths
2005 J jnl
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment.
BMC Bioinform.
Amarendran Ramaswami Subramanian, Jan Weyer-Menkhoff, Michael Kaufmann, Burkhard Morgenstern
2005 A conf
Evolutionary algorithms for the self-organized evolution of networks.
GECCO
Katharina Anna Lehmann, Michael Kaufmann
2005 A conf
Mixed Upward Planarization - Fast and Robust.
GD
Martin Siebenhaller, Michael Kaufmann
2005 — ch.
Random Graphs, Small-Worlds and Scale-Free Networks.
Peer-to-Peer Systems and Applications
Katharina Anna Lehmann, Michael Kaufmann
2005 A conf
Two Trees Which Are Self-intersecting When Drawn Simultaneously.
GD
Markus Geyer, Michael Kaufmann, Imrich Vrto
2005 — conf
Visualizing structural properties of irregular parallel computations.
SOFTVIS
Wolfgang Blochinger, Michael Kaufmann, Martin Siebenhaller
2004 A conf
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing.
GD
Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann
2004 J jnl
Automatic layout of UML class diagrams in orthogonal style.
Inf. Vis.
Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller
2004 A conf
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps.
GD
Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
2004 J jnl
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors.
BMC Bioinform.
Martin Schmollinger, Kay Nieselt, Michael Kaufmann, Burkhard Morgenstern
2003 — conf
A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram.
SOFTVIS
Markus Eiglsperger, Michael Kaufmann, Martin Siebenhaller
2003 J jnl
An Approach for Mixed Upward Planarization.
J. Graph Algorithms Appl.
Markus Eiglsperger, Michael Kaufmann, Frank Eppinger
2003 J jnl
Designing Parallel Algorithms for Hierarchical SMP Clusters.
Int. J. Found. Comput. Sci.
Martin Schmollinger, Michael Kaufmann
2003 A conf
Fixed Parameter Algorithms for one-sided crossing minimization Revisited.
GD
Vida Dujmovic, Henning Fernau, Michael Kaufmann
2003 — conf
Topic Introduction.
Euro-Par
Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann
2002 A conf
Algorithms for SMP-Clusters Dense Matrix-Vector Multiplication.
IPDPS
Martin Schmollinger, Michael Kaufmann
2002 C conf
BioMiner - modeling, analyzing, and visualizing biochemical pathways and networks.
ECCB
Marite Sirava, T. Schäfer, Markus Eiglsperger, Michael Kaufmann, Oliver Kohlbacher, Erich Bornberg-Bauer, Hans-Peter Lenhof
2002 — conf
Electronic brainstorming with graphical structures of ideas.
ECIS
Thomas Krätschmer, Michael Kaufmann
2002 J jnl
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs.
J. Graph Algorithms Appl.
Michael Kaufmann, Roland Wiese
2002 C conf
Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation.
WABI
Ezekiel F. Adebiyi, Michael Kaufmann
2002 — conf
Graph Drawing Algorithms for Bioinformatics.
GI Jahrestagung (Ergänzungsband)
Michael Kaufmann
2002 J jnl
Guest Editor's Foreword.
J. Graph Algorithms Appl.
Michael Kaufmann
2002 A conf
Maintaining the Mental Map for Circular Drawings.
GD
Michael Kaufmann, Roland Wiese
2002 A conf
Sketch-Driven Orthogonal Graph Drawing.
GD
Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner
2001 B conf
An Approach for Mixed Upward Planarization.
WADS
Markus Eiglsperger, Michael Kaufmann
2001 — conf
An efficient algorithm for finding short approximate non-tandem repeats.
ISMB (Supplement of Bioinformatics)
Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann
2001 — ed.
Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl Seminar, April 1999).
Drawing Graphs
Michael Kaufmann, Dorothea Wagner
2001 A conf
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size.
GD
Markus Eiglsperger, Michael Kaufmann
2001 — conf
Usage-based Visualization of Web Locations.
InVis.au
Boris Diebold, Michael Kaufmann
2001 Misc conf
kappa NUMA: A Model for Clusters of SMP-Machines.
PPAM
Martin Schmollinger, Michael Kaufmann
2001 A conf
yFiles: Visualization and Automatic Layout of Graphs.
GD
Roland Wiese, Markus Eiglsperger, Michael Kaufmann
2000 J jnl
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results.
Algorithmica
Ulrich Fößmeier, Michael Kaufmann
2000 A* conf
Orthogonal graph drawing with constraints.
SODA
Markus Eiglsperger, Ulrich Fößmeier, Michael Kaufmann
1999 A conf
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs.
GD
Michael Kaufmann, Roland Wiese
1998 A conf
Adding Constraints to an Algorithm for Orthogonal Graph Drawing.
GD
Roland Wiese, Michael Kaufmann
1998 B conf
Drawing Planar Partitions II: HH-Drawings.
WG
Therese Biedl, Michael Kaufmann, Petra Mutzel
1998 A conf
On Improving Orthogonal Drawings: The 4M-Algorithm.
GD
Ulrich Fößmeier, Carsten Heß, Michael Kaufmann
1998 A conf
Visualization of Parallel Execution Graphs.
GD
Björn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel
1997 A conf
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings.
GD
Ulrich Fößmeier, Michael Kaufmann
1997 A conf
Area-Efficient Static and Incremental Graph Drawings.
ESA
Therese C. Biedl, Michael Kaufmann
1997 C conf
BSP-Like External-Memory Computation.
CIAC
Jop F. Sibeyn, Michael Kaufmann
1997 J jnl
Deterministic Permutation Routing on Meshes.
J. Algorithms
Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
1997 J jnl
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
Discret. Comput. Geom.
Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
1997 — conf
Matrix Transpose on Meshes: Theory and Practice.
IPPS
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
1997 J jnl
Matrix Transpose on Meshes: Theory and Practice.
Comput. Artif. Intell.
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
1997 C conf
Nice Drawings for Planar Bipartite Graphs.
CIAC
Ulrich Fößmeier, Michael Kaufmann
1997 — conf
On Exact Solutions for the Rectilinear Steiner Tree Problem.
SCG
Ulrich Fößmeier, Michael Kaufmann
1997 J jnl
On Triangulating Planar Graphs Under the Four-Connectivity Constraint.
Algorithmica
Therese Biedl, Goos Kant, Michael Kaufmann
1997 J jnl
Randomized Multipacket Routing and Sorting on Meshes.
Algorithmica
Michael Kaufmann, Jop F. Sibeyn
1997 J jnl
Routing on Meshes with Buses.
Algorithmica
Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn
1997 A conf
Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice.
ESA
Ulrich Fößmeier, Michael Kaufmann
1996 A conf
2-Visibility Drawings of Planar Graphs.
GD
Ulrich Fößmeier, Goos Kant, Michael Kaufmann
1996 J jnl
An Algorithm for Steiner Trees in Grid Graphs and its Application to Homotopic Routing.
J. Circuits Syst. Comput.
Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman
1995 A conf
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.
ESA
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
1995 A conf
Drawing High Degree Graphs with Low Bend Numbers.
GD
Ulrich Fößmeier, Michael Kaufmann
1995 J jnl
Routing and Sorting on Reconfigurable Meshes.
Parallel Process. Lett.
Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn
1995 B conf
Solving Cheap Graph Problems an Meshes.
MFCS
Jop F. Sibeyn, Michael Kaufmann
1994 J jnl
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs.
SIAM J. Comput.
Michael Kaufmann, Kurt Mehlhorn
1994 A conf
Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
ESA
Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
1994 J jnl
Channel Routing of Multiterminal Nets.
J. ACM
Shaodi Gao, Michael Kaufmann
1994 A* conf
Derandomizing Algorithms for Routing and Sorting on Meshes.
SODA
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
1994 A conf
Deterministic 1-k Routing on Meshes.
STACS
Jop F. Sibeyn, Michael Kaufmann
1994 B conf
Fast Deterministic Hot-Potato Routing on Processor Arrays.
ISAAC
Michael Kaufmann, Harald Lauer, Heiko Schröder
1994 A conf
On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs.
GD
Ulrich Fößmeier, Michael Kaufmann
1994 B conf
On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing.
ISAAC
Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman
1994 — conf
On Triangulating Planar Graphs under the Four-Connectivity Constraint.
SWAT
Therese Biedl, Goos Kant, Michael Kaufmann
1994 B conf
Shorter Queues for Permutation Routing on Meshes.
MFCS
Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
1994 — conf
Towards practical permutation routing on meshes.
SPDP
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
1993 — conf
Deterministic Permutation Routing on Meshes.
SPDP
Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn
1993 J jnl
Drawing Graphs in the Plane with High Resolution.
SIAM J. Comput.
Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
1993 B conf
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
ISAAC
Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
1993 J jnl
Parity Conditions in Homotopic Knock-Knee Routing.
Algorithmica
Michael Kaufmann, F. Miller Maley
1993 A conf
Randomized Routing on Meshes with Buses.
ESA
Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
1993 J jnl
Routing in Polygons without Rectilinear Visible Corners
Inf. Comput.
Michael Kaufmann, Gerhard Klär
1992 J jnl
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
Algorithmica
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1992 — conf
Deterministic Routing on Circular Arrays.
SPDP
Michael Kaufmann, Jop F. Sibeyn
1992 B conf
Matching the Bisection Bound for Routing and Sorting on the Mesh.
SPAA
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn
1992 J jnl
On local routing of two-terminal nets.
J. Comb. Theory B
Michael Kaufmann, Kurt Mehlhorn
1992 — conf
Optimal Multi-Packet Routing on the Torus.
SWAT
Michael Kaufmann, Jop F. Sibeyn
1992 A conf
Performance Driven k-Layer Wiring.
STACS
Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang
1991 — conf
A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs.
ISA
Michael Kaufmann, Gerhard Klär
1991 J jnl
Minimal stretching of a layout to ensure 2-layer wirability.
Integr.
Michael Kaufmann, Paul Molitor
1991 A* conf
The Art Gallery Theorem for Polygons With Holes
FOCS
Frank Hoffmann, Michael Kaufmann, Klaus Kriegel
1990 J jnl
A linear-time algorithm for routing in a convex grid.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Michael Kaufmann
1990 — conf
Allowing overlaps makes switchbox layouts nice.
SPDP
Michael Kaufmann
1990 — conf
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures.
SCG
Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
1990 A* conf
Drawing Graphs in the Plane with High Resolution
FOCS
Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
1990 — conf
Hierarchical Wiring in Multigrids.
CONPAR
Patrik Eklund, Michael Kaufmann
1990 B conf
On the Rectilinear Art Gallery Problem - Algorithmic Aspects.
WG
Frank Hoffmann, Michael Kaufmann
1990 — conf
Zur Physik des Fusionsreaktors. Neue Ergebnisse.
Forum Wissenschaft und Technik
Michael Kaufmann
1989 B conf
Advances in Homotopic Layout Compaction.
SPAA
Shaodi Gao, Michael Kaufmann, F. Miller Maley
1988 — conf
Channel Routing with Short Wires.
AWOC
Michael Kaufmann, Ioannis G. Tollis
1988 A* conf
On Continuous Homotopic One Layer Routing.
Workshop on Computational Geometry
Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum
1988 — conf
On Continuous Homotopic One Layer Routing.
SCG
Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling
1987 A* conf
Channel Routing of Multiterminal Nets
FOCS
Shaodi Gao, Michael Kaufmann
1987 A conf
On Local Routing of Two-Terminal Nets.
STACS
Michael Kaufmann, Kurt Mehlhorn
1987 — —
Über Lokales Verdrahten von Zwei-Punkt-Netzen.
Michael Kaufmann
1986 J jnl
Routing Through a Generalized Switchbox.
J. Algorithms
Michael Kaufmann, Kurt Mehlhorn
1985 A* conf
Routing Through a Generalized Switchbox.
ICALP
Michael Kaufmann, Kurt Mehlhorn
1984 — conf
Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out.
CAAP
Michael Kaufmann