Michael Kaufmann
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
162
Venues
27
Active years
1985–2025
Best venue rank
A*
Where they publish
- AGD73 papers
- AESA10 papers
- BSOFSEM8 papers
- BISAAC7 papers
- BWADS6 papers
- ASAT6 papers
- BWG5 papers
- BMFCS5 papers
- ASTACS4 papers
- BWALCOM4 papers
- CDATA4 papers
- BLATIN3 papers
- CCIAC3 papers
- A*SODA3 papers
- A*FOCS3 papers
- BGI2 papers
- BAVI2 papers
- NationalFUN2 papers
- NationalCOCOON2 papers
- BEuroPar2 papers
- BSPAA2 papers
- AGECCO1 paper
- CECCB1 paper
- CWABI1 paper
- AISMB1 paper
- NationalPPAM1 paper
- A*ICALP1 paper
Papers
162 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | GD | The Price of Connectivity Augmentation on Planar Graphs. | Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tth, Torsten Ueckerdt |
| 2025 | GD | The Page Number of Monotone Directed Acyclic Outerplanar Graphs Is Four or Five. | Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann |
| 2025 | GD | Approximating Barnette's Conjecture. | Michael A. Bekos, Michael Kaufmann, Maximilian Pfister |
| 2025 | STACS | Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs. | Julia Katheder, Michael Kaufmann, Sergey Pupyrev, Torsten Ueckerdt |
| 2024 | GD | The Density Formula: One Lemma to Bound Them All. | Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schrder, Torsten Ueckerdt |
| 2024 | GD | On k-Planar Graphs Without Short Cycles. | Michael A. Bekos, Prosenjit Bose, Aaron Bngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger |
| 2024 | GD | On the Complexity of Recognizing k^+-Real Face Graphs. | Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani |
| 2024 | GD | Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs. | Aaron Bngener, Michael Kaufmann |
| 2024 | GD | Monotone Arc Diagrams with Few Biarcs. | Steven Chaplick, Henry Frster, Michael Hoffmann, Michael Kaufmann |
| 2023 | ESA | Axis-Parallel Right Angle Crossing Graphs. | Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt |
| 2023 | GD | Min-k-planar Drawings of Graphs. | Carla Binucci, Aaron Bngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini |
| 2023 | ISAAC | Rectilinear-Upward Planarity Testing of Digraphs. | Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani |
| 2023 | SOFSEM | On the 2-Layer Window Width Minimization Problem. | Michael A. Bekos, Henry Frster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf |
| 2023 | WADS | Linear Layouts of Bipartite Planar Graphs. | Henry Frster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou |
| 2023 | WALCOM | The Family of Fan-Planar Graphs. | Michael Kaufmann |
| 2023 | WG | Nonplanar Graph Drawings with k Vertices per Face. | Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini |
| 2022 | GD | Rectilinear Planarity of Partial 2-Trees. | Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali |
| 2022 | ISAAC | Graph Product Structure for h-Framed Graphs. | Michael A. Bekos, Giordano Da Lozzo, Petr Hlinen, Michael Kaufmann |
| 2022 | MFCS | RAC Drawings of Graphs with Low Degree. | Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister |
| 2021 | GD | Recognizing and Embedding Simple Optimal 2-Planar Graphs. | Henry Frster, Michael Kaufmann, Chrysanthi N. Raftopoulou |
| 2021 | SOFSEM | Using the Metro-Map Metaphor for Drawing Hypergraphs. | Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff |
| 2020 | ESA | On Compact RAC Drawings. | Henry Frster, Michael Kaufmann |
| 2020 | GD | Lazy Queue Layouts of Posets. | Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev |
| 2020 | GD | Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. | Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali |
| 2020 | MFCS | Layered Fan-Planar Graph Drawings. | Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nllenburg, Chrysanthi N. Raftopoulou |
| 2020 | WALCOM | The Stub Resolution of 1-Planar Graphs. | Michael Kaufmann, Jan Kratochvl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr |
| 2019 | GD | Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. | Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck |
| 2019 | GD | The QuaSEFE Problem. | Patrizio Angelini, Henry Frster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani |
| 2019 | GI | Mira: Sharing Resources for Distributed Analytics at Small Timescales. | Michael Kaufmann, Kornilios Kourtis, Adrian Schpbach, Martina Zitterbart |
| 2019 | SOFSEM | On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge. | Michael Kaufmann |
| 2018 | DATA | No Target Function Classifier - Fast Unsupervised Text Categorization using Semantic Spaces. | Tobias Eljasik-Swoboda, Michael Kaufmann, Matthias L. Hemmje |
| 2018 | DATA | Concept Extraction with Convolutional Neural Networks. | Andreas Waldis, Luca Mazzola, Michael Kaufmann |
| 2018 | DATA | Concept Recognition with Convolutional Neural Networks to Optimize Keyphrase Extraction. | Andreas Waldis, Luca Mazzola, Michael Kaufmann |
| 2018 | GD | The Number of Crossings in Multigraphs with No Empty Lens. | Michael Kaufmann, Jnos Pach, Gza Tth, Torsten Ueckerdt |
| 2018 | GD | Queue Layouts of Planar 3-Trees. | Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev |
| 2018 | GD | On RAC Drawings of Graphs with One Bend per Edge. | Patrizio Angelini, Michael A. Bekos, Henry Frster, Michael Kaufmann |
| 2018 | GD | Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. | Evmorfia N. Argyriou, Sabine Cornelsen, Henry Frster, Michael Kaufmann, Martin Nllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff |
| 2018 | GD | A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution. | Michael A. Bekos, Henry Frster, Christian Geckeler, Lukas Hollnder, Michael Kaufmann, Amadus M. Spallek, Jan Splett |
| 2018 | ISAAC | Beyond-Planarity: Turn-Type Results for Non-Planar Bipartite Graphs. | Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt |
| 2018 | WG | On Dispersable Book Embeddings. | Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev |
| 2017 | DATA | Modeling and Qualitative Evaluation of a Management Canvas for Big Data Applications. | Michael Kaufmann, Tobias Eljasik-Swoboda, Christian Nawroth, Kevin Berwind, Marco X. Bornschlegl, Matthias L. Hemmje |
| 2017 | GD | 1-Fan-Bundle-Planar Drawings of Graphs. | Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck |
| 2017 | GD | 3D Visibility Representations of 1-planar Graphs. | Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani |
| 2017 | GD | On Vertex- and Empty-Ply Proximity Drawings. | Patrizio Angelini, Steven Chaplick, Felice De Luca, Jir Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvl, Pavel Valtr |
| 2017 | GD | On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. | Michael A. Bekos, Henry Frster, Michael Kaufmann |
| 2017 | GD | An Interactive Tool to Explore and Improve the Ply Number of Drawings. | Niklas Heinsohn, Michael Kaufmann |
| 2016 | AVI | IVIS4BigData: A Reference Model for Advanced Visual Interfaces Supporting Big Data Analysis in Virtual Research Environments. | Marco X. Bornschlegl, Kevin Berwind, Michael Kaufmann, Felix C. Engel, Paul Walsh, Matthias L. Hemmje, Ruben Riestra |
| 2016 | AVI | Toward Interactive Visualization of Results from Domain-Specific Text Analytics. | Tobias Swoboda, Christian Nawroth, Michael Kaufmann, Matthias L. Hemmje |
| 2016 | FUN | Algorithms and Insights for RaceTrack. | Michael A. Bekos, Till Bruckdorfer, Henry Frster, Michael Kaufmann, Simon Poschenrieder, Thomas Stber |
| 2016 | GD | Low Ply Drawings of Trees. | Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr |
| 2016 | GD | On the Density of Non-simple 3-Planar Graphs. | Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou |
| 2016 | LATIN | On the Total Number of Bends for Planar Octilinear Drawings. | Michael A. Bekos, Michael Kaufmann, Robert Krug |
| 2016 | SOFSEM | On Contact Graphs with Cubes and Proportional Boxes. | Muhammad Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov |
| 2016 | WALCOM | Vertex-Coloring with Star-Defects. | Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli |
| 2015 | ESA | 1-Planar Graphs have Constant Book Thickness. | Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou |
| 2015 | GD | A Universal Point Set for 2-Outerplanar Graphs. | Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze |
| 2015 | GD | The Book Embedding Problem from a SAT-Solving Perspective. | Michael A. Bekos, Michael Kaufmann, Christian Zielke |
| 2015 | GD | On Embeddability of Buses in Point Sets. | Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev |
| 2015 | GD | PED User Study. | Till Bruckdorfer, Michael Kaufmann, Simon Leible |
| 2015 | SAT | A New Approach to Partial MUS Enumeration. | Christian Zielke, Michael Kaufmann |
| 2015 | SOFSEM | The Maximum k-Differential Coloring Problem. | Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni |
| 2015 | WADS | Contact Graphs of Circular Arcs. | Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, Andr Schulz, Torsten Ueckerdt |
| 2015 | WALCOM | On Bar (1, j)-Visibility Graphs - (Extended Abstract). | Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann, Daniel Neuwirth |
| 2014 | GD | On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. | Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann |
| 2014 | GD | Planar Octilinear Drawings with One Bend Per Edge. | Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug |
| 2014 | LATIN | Smooth Orthogonal Drawings of Planar Graphs. | Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff |
| 2014 | SOFSEM | Fitting Planar Graphs on Planar Maps. | Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze |
| 2013 | CIAC | On the Characterization of Plane Bus Graphs. | Till Bruckdorfer, Stefan Felsner, Michael Kaufmann |
| 2013 | ESA | Table Cartograms. | William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek |
| 2013 | GD | Many-to-One Boundary Labeling with Backbones. | Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nllenburg, Ignaz Rutter, Antonios Symvonis |
| 2013 | GD | Slanted Orthogonal Drawings. | Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Nher, Vincenzo Roselli |
| 2013 | GD | On the Upward Planarity of Mixed Plane Graphs. | Fabrizio Frati, Michael Kaufmann, Jnos Pach, Csaba D. Tth, David R. Wood |
| 2013 | SAT | MUStICCa: MUS Extraction with Interactive Choice of Candidates. | Johannes Dellert, Christian Zielke, Michael Kaufmann |
| 2013 | WADS | Planar Packing of Binary Trees. | Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tth |
| 2013 | WG | Threshold-Coloring and Unit-Cube Contact Representation of Graphs. | Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev |
| 2012 | COCOON | Geometric RAC Simultaneous Drawings of Graphs. | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis |
| 2012 | FUN | Mad at Edge Crossings? Break the Edges! | Till Bruckdorfer, Michael Kaufmann |
| 2012 | GD | Smooth Orthogonal Layouts. | Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis |
| 2012 | GD | Progress on Partial Edge Drawings. | Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nllenburg, Alexander Wolff |
| 2012 | SAT | Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation). | Sebastian Burg, Stephan Kottler, Michael Kaufmann |
| 2012 | SAT | CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation). | Stephan Kottler, Christian Zielke, Paul Seitz, Michael Kaufmann |
| 2011 | ESA | Approximating Minimum Manhattan Networks in Higher Dimensions. | Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff |
| 2011 | GD | Proportional Contact Representations of Planar Graphs. | Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov |
| 2011 | GD | Small Point Sets for Simply-Nested Planar Graphs. | Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella |
| 2011 | GD | Combining Problems on RAC Drawings and Simultaneous Graph Drawings. | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis |
| 2011 | GD | Approximate Proximity Drawings. | William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner |
| 2011 | GD | Upward Point Set Embeddability for Convex Point Sets Is in P. | Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis |
| 2011 | ISAAC | Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations. | Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov |
| 2011 | SOFSEM | Combining Traditional Map Labeling with Boundary Labeling. | Michael A. Bekos, Michael Kaufmann, Dimitrios Papadopoulos, Antonios Symvonis |
| 2011 | SOFSEM | Upward Point-Set Embeddability. | Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis |
| 2011 | WADS | On the Area Requirements of Euclidean Minimum Spanning Trees. | Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella |
| 2010 | GD | Upward Geometric Graph Embeddings into Point Sets. | Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis |
| 2010 | GD | On a Tree and a Path with No Geometric Simultaneous Embedding. | Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth |
| 2010 | GD | Visualizing Differences between Two Large Graphs. | Markus Geyer, Michael Kaufmann, Robert Krug |
| 2010 | GD | Improving Layered Graph Layouts with Edge Bundling. | Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann |
| 2010 | LATIN | Optimal Polygonal Representation of Planar Graphs. | Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov |
| 2009 | GD | Visualization of Complex BPEL Models. | Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler |
| 2009 | GD | On the Perspectives Opened by Right Angle Crossing Drawings. | Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis |
| 2009 | GD | Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. | Michael Kaufmann, Stephan Kottler |
| 2009 | WADS | Straight-Line Rectangular Drawings of Clustered Graphs. | Patrizio Angelini, Fabrizio Frati, Michael Kaufmann |
| 2008 | GD | Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis |
| 2008 | GD | Enhancing Visualizations of Business Processes. | Philip Effinger, Michael Kaufmann, Martin Siebenhaller |
| 2008 | GD | Subdivision Drawings of Hypergraphs. | Michael Kaufmann, Marc J. van Kreveld, Bettina Speckmann |
| 2008 | SAT | Computation of Renameable Horn Backdoors. | Stephan Kottler, Michael Kaufmann, Carsten Sinz |
| 2008 | SAT | A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. | Stephan Kottler, Michael Kaufmann, Carsten Sinz |
| 2007 | COCOON | Colored Simultaneous Geometric Embeddings. | 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 | GD | Line Crossing Minimization on Metro Maps. | Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis |
| 2007 | GD | Constrained Simultaneous and Near-Simultaneous Embeddings. | Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov |
| 2007 | GD | Polynomial Area Bounds for MST Embeddings of Trees. | Michael Kaufmann |
| 2007 | MFCS | Packing and Squeezing Subgraphs into Planar Graphs. | Fabrizio Frati, Markus Geyer, Michael Kaufmann |
| 2006 | EuroPar | Topic 12: Theory and Algorithms for Parallel Computation. | Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis |
| 2006 | SODA | Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. | Michael Kaufmann, Jan Kratochvl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian |
| 2005 | GD | Two Trees Which Are Self-intersecting When Drawn Simultaneously. | Markus Geyer, Michael Kaufmann, Imrich Vrto |
| 2005 | GD | Mixed Upward Planarization - Fast and Robust. | Martin Siebenhaller, Michael Kaufmann |
| 2005 | GECCO | Evolutionary algorithms for the self-organized evolution of networks. | Katharina Anna Lehmann, Michael Kaufmann |
| 2004 | GD | Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. | Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff |
| 2004 | GD | An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. | Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann |
| 2003 | EuroPar | Topic Introduction. | Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann |
| 2003 | GD | Fixed Parameter Algorithms for one-sided crossing minimization Revisited. | Vida Dujmovic, Henning Fernau, Michael Kaufmann |
| 2002 | ECCB | BioMiner - modeling, analyzing, and visualizing biochemical pathways and networks. | Marite Sirava, T. Schfer, Markus Eiglsperger, Michael Kaufmann, Oliver Kohlbacher, Erich Bornberg-Bauer, Hans-Peter Lenhof |
| 2002 | GD | Sketch-Driven Orthogonal Graph Drawing. | Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner |
| 2002 | GD | Maintaining the Mental Map for Circular Drawings. | Michael Kaufmann, Roland Wiese |
| 2002 | GI | Graph Drawing Algorithms for Bioinformatics. | Michael Kaufmann |
| 2002 | WABI | Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation. | Ezekiel F. Adebiyi, Michael Kaufmann |
| 2001 | GD | Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. | Markus Eiglsperger, Michael Kaufmann |
| 2001 | GD | yFiles: Visualization and Automatic Layout of Graphs. | Roland Wiese, Markus Eiglsperger, Michael Kaufmann |
| 2001 | ISMB | An efficient algorithm for finding short approximate non-tandem repeats. | Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann |
| 2001 | PPAM | kappa NUMA: A Model for Clusters of SMP-Machines. | Martin Schmollinger, Michael Kaufmann |
| 2001 | WADS | An Approach for Mixed Upward Planarization. | Markus Eiglsperger, Michael Kaufmann |
| 2000 | SODA | Orthogonal graph drawing with constraints. | Markus Eiglsperger, Ulrich Fmeier, Michael Kaufmann |
| 1999 | GD | Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. | Michael Kaufmann, Roland Wiese |
| 1998 | GD | On Improving Orthogonal Drawings: The 4M-Algorithm. | Ulrich Fmeier, Carsten He, Michael Kaufmann |
| 1998 | GD | Visualization of Parallel Execution Graphs. | Bjrn Steckelbach, Till Bubeck, Ulrich Fmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel |
| 1998 | GD | Adding Constraints to an Algorithm for Orthogonal Graph Drawing. | Roland Wiese, Michael Kaufmann |
| 1998 | WG | Drawing Planar Partitions II: HH-Drawings. | Therese Biedl, Michael Kaufmann, Petra Mutzel |
| 1997 | CIAC | Nice Drawings for Planar Bipartite Graphs. | Ulrich Fmeier, Michael Kaufmann |
| 1997 | CIAC | BSP-Like External-Memory Computation. | Jop F. Sibeyn, Michael Kaufmann |
| 1997 | ESA | Area-Efficient Static and Incremental Graph Drawings. | Therese C. Biedl, Michael Kaufmann |
| 1997 | ESA | Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. | Ulrich Fmeier, Michael Kaufmann |
| 1997 | GD | Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. | Ulrich Fmeier, Michael Kaufmann |
| 1996 | GD | 2-Visibility Drawings of Planar Graphs. | Ulrich Fmeier, Goos Kant, Michael Kaufmann |
| 1995 | ESA | Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. | Michael Kaufmann, Jop F. Sibeyn, Torsten Suel |
| 1995 | GD | Drawing High Degree Graphs with Low Bend Numbers. | Ulrich Fmeier, Michael Kaufmann |
| 1995 | MFCS | Solving Cheap Graph Problems an Meshes. | Jop F. Sibeyn, Michael Kaufmann |
| 1994 | ESA | Approaching the 5/4-Approximation for Rectilinear Steiner Trees. | Piotr Berman, Ulrich Fmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky |
| 1994 | GD | On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. | Ulrich Fmeier, Michael Kaufmann |
| 1994 | ISAAC | On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing. | Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman |
| 1994 | ISAAC | Fast Deterministic Hot-Potato Routing on Processor Arrays. | Michael Kaufmann, Harald Lauer, Heiko Schrder |
| 1994 | MFCS | Shorter Queues for Permutation Routing on Meshes. | Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann |
| 1994 | SODA | Derandomizing Algorithms for Routing and Sorting on Meshes. | Michael Kaufmann, Jop F. Sibeyn, Torsten Suel |
| 1994 | STACS | Deterministic 1-k Routing on Meshes. | Jop F. Sibeyn, Michael Kaufmann |
| 1993 | ESA | Randomized Routing on Meshes with Buses. | Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman |
| 1993 | ISAAC | Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. | Ulrich Fmeier, Michael Kaufmann, Alexander Zelikovsky |
| 1992 | STACS | Performance Driven k-Layer Wiring. | Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang |
| 1992 | SPAA | Matching the Bisection Bound for Routing and Sorting on the Mesh. | Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn |
| 1991 | FOCS | The Art Gallery Theorem for Polygons With Holes | Frank Hoffmann, Michael Kaufmann, Klaus Kriegel |
| 1990 | FOCS | Drawing Graphs in the Plane with High Resolution | Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger |
| 1990 | WG | On the Rectilinear Art Gallery Problem - Algorithmic Aspects. | Frank Hoffmann, Michael Kaufmann |
| 1989 | SPAA | Advances in Homotopic Layout Compaction. | Shaodi Gao, Michael Kaufmann, F. Miller Maley |
| 1987 | FOCS | Channel Routing of Multiterminal Nets | Shaodi Gao, Michael Kaufmann |
| 1987 | STACS | On Local Routing of Two-Terminal Nets. | Michael Kaufmann, Kurt Mehlhorn |
| 1985 | ICALP | Routing Through a Generalized Switchbox. | Michael Kaufmann, Kurt Mehlhorn |