default search action
Michael Kaufmann 0001
Person information
- affiliation: Eberhard Karls University of Tübingen, Wilhelm Schickard Institute for Computer Science
Other persons with the same name
- Michael Kaufmann 0002 — Witten/Herdecke University, Department of Human Medicine, Witten, Germany
- Michael Kaufmann 0003 — Ernst-Abbe-Hochschule Jena, Germany
- Michael Kaufmann 0004
(aka: Michael A. Kaufmann, Michael Alexander Kaufmann) — Lucerne University of Applied Sciences and Arts, School of Engineering and Architecture, Horw, Switzerland (and 1 more)
- Michael Kaufmann 0005 — IBM Research Zurich, Switzerland (and 1 more)
- Michael Kaufmann 0006 — University of Passau, Germany (and 1 more)
- Michael Kaufmann 0007 — Swiss Bank Corporation, IT-Camp Basel, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j112]Carla Binucci
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12: 68828-68846 (2024) - [j111]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. J. Graph Algorithms Appl. 28(2): 1-35 (2024) - [c204]Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt:
The Density Formula: One Lemma to Bound Them All. GD 2024: 7:1-7:17 - [c203]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with Few Biarcs. GD 2024: 11:1-11:16 - [c202]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-Planar Graphs Without Short Cycles. GD 2024: 27:1-27:17 - [c201]Aaron Büngener, Michael Kaufmann:
Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs. GD 2024: 29:1-29:22 - [c200]Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani:
On the Complexity of Recognizing k^+-Real Face Graphs. GD 2024: 32:1-32:22 - [c199]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. SWAT 2024: 1:1-1:19 - [i73]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. CoRR abs/2404.09771 (2024) - [i72]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2408.14299 (2024) - [i71]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-planar Graphs without Short Cycles. CoRR abs/2408.16085 (2024) - [i70]Aaron Büngener, Michael Kaufmann:
Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs. CoRR abs/2409.01733 (2024) - [i69]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): 71-94 (2024) - 2023
- [j110]Jawaherul Md. Alam, Michael A. Bekos
Lazy Queue Layouts of Posets. Algorithmica 85(5): 1176-1201 (2023) - [j109]Walter Didimo
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. Algorithmica 85(9): 2605-2666 (2023) - [j108]Abu Reyan Ahmed
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - [j107]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): 875-902 (2023) - [j106]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27(8): 679-719 (2023) - [c198]Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger:
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. CCCG 2023: 89-95 - [c197]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. ESA 2023: 9:1-9:15 - [c196]Carla Binucci
Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52 - [c195]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC 2023: 26:1-26:20 - [c194]Michael A. Bekos
On the 2-Layer Window Width Minimization Problem. SOFSEM 2023: 209-221 - [c193]Henry Förster
Linear Layouts of Bipartite Planar Graphs. WADS 2023: 444-459 - [c192]Michael Kaufmann
The Family of Fan-Planar Graphs. WALCOM 2023: 12-19 - [c191]Carla Binucci
Nonplanar Graph Drawings with k Vertices per Face. WG 2023: 86-100 - [i68]Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-planar Placement and Packing of Δ-regular Caterpillars. CoRR abs/2301.01226 (2023) - [i67]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - [i66]Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou:
Linear Layouts of Bipartite Planar Graphs. CoRR abs/2305.16087 (2023) - [i65]Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger:
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. CoRR abs/2306.15395 (2023) - [i64]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. CoRR abs/2306.17073 (2023) - [i63]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 abs/2308.13401 (2023) - [i62]Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt:
The Density Formula: One Lemma to Bound Them All. CoRR abs/2311.06193 (2023) - 2022
- [j105]Carla Binucci
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments. Comput. Graph. Forum 41(1): 364-376 (2022) - [j104]Michael Kaufmann, Torsten Ueckerdt:
The Density of Fan-Planar Graphs. Electron. J. Comb. 29(1) (2022) - [j103]Jawaherul Md. Alam, Michael A. Bekos
The mixed page number of graphs. Theor. Comput. Sci. 931: 131-141 (2022) - [c190]Walter Didimo
Rectilinear Planarity of Partial 2-Trees. GD 2022: 157-172 - [c189]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. ISAAC 2022: 23:1-23:15 - [c188]Patrizio Angelini
RAC Drawings of Graphs with Low Degree. MFCS 2022: 11:1-11:15 - [e3]Michael A. Bekos
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13453, Springer 2022, ISBN 978-3-031-15913-8 [contents] - [i61]Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. CoRR abs/2204.11495 (2022) - [i60]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2205.07500 (2022) - [i59]Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister:
RAC Drawings of Graphs with Low Degree. CoRR abs/2206.14909 (2022) - [i58]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. CoRR abs/2208.12558 (2022) - 2021
- [j102]Michael A. Bekos, Henry Förster, Christian Geckeler
A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution. Comput. J. 64(1): 7-26 (2021) - [j101]Emilio Di Giacomo, Walter Didimo
Stable visualization of connected components in dynamic graphs. Inf. Vis. 20(1): 3-19 (2021) - [j100]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): 383-396 (2021) - [j99]Michael Kaufmann, Jan Kratochvíl
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 625-642 (2021) - [j98]Muhammad Jawaherul Alam, Michael A. Bekos, Vida Dujmovic, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On dispersable book embeddings. Theor. Comput. Sci. 861: 1-22 (2021) - [c187]Henry Förster
Recognizing and Embedding Simple Optimal 2-Planar Graphs. GD 2021: 87-100 - [c186]Fabian Frank, Michael Kaufmann
Using the Metro-Map Metaphor for Drawing Hypergraphs. SOFSEM 2021: 361-372 - [i57]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
The Mixed Page Number of Graphs. CoRR abs/2107.04993 (2021) - [i56]Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou:
Recognizing and Embedding Simple Optimal 2-Planar Graphs. CoRR abs/2108.00665 (2021) - [i55]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. CoRR abs/2110.00548 (2021) - 2020
- [j97]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. Algorithmica 82(9): 2564-2585 (2020) - [j96]Patrizio Angelini
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. J. Graph Algorithms Appl. 24(4): 573-601 (2020) - [j95]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): 332-353 (2020) - [j94]Patrizio Angelini
On RAC drawings of graphs with one bend per edge. Theor. Comput. Sci. 828-829: 42-54 (2020) - [c185]Henry Förster
On Compact RAC Drawings. ESA 2020: 53:1-53:21 - [c184]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. GD 2020: 55-68 - [c183]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. GD 2020: 436-449 - [c182]Therese Biedl
Layered Fan-Planar Graph Drawings. MFCS 2020: 14:1-14:13 - [c181]Michael Kaufmann, Jan Kratochvíl
The Stub Resolution of 1-Planar Graphs. WALCOM 2020: 170-182 - [i54]Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
On Layered Fan-Planar Graph Drawings. CoRR abs/2002.09597 (2020) - [i53]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2003.05332 (2020) - [i52]Michael A. Bekos, Mirco Haug, Michael Kaufmann, Julia Männecke:
An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs. CoRR abs/2003.09642 (2020) - [i51]Michael A. Bekos, Michael Kaufmann, Fabian Klute
Four Pages Are Indeed Necessary for Planar Graphs. CoRR abs/2004.07630 (2020) - [i50]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2008.03784 (2020) - [i49]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. CoRR abs/2008.10336 (2020)
2010 – 2019
- 2019
- [j93]Michael A. Bekos
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. Algorithmica 81(5): 2046-2071 (2019) - [j92]Patrizio Angelini
On 3D visibility representations of graphs with few crossings per edge. Theor. Comput. Sci. 784: 11-20 (2019) - [c180]Patrizio Angelini
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. GD 2019: 253-267 - [c179]Patrizio Angelini
The QuaSEFE Problem. GD 2019: 268-275 - [c178]Michael Kaufmann:
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge. SOFSEM 2019: 260-271 - [i48]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. CoRR abs/1908.03042 (2019) - [i47]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. CoRR abs/1908.08708 (2019) - [i46]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 abs/1911.10863 (2019) - [i45]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): 123-156 (2019) - 2018
- [j91]Till Bruckdorfer, Stefan Felsner, Michael Kaufmann:
Planar Bus Graphs. Algorithmica 80(8): 2260-2285 (2018) - [j90]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat
Table cartogram. Comput. Geom. 68: 174-185 (2018) - [j89]Patrizio Angelini
Small Universal Point Sets for k-Outerplanar Graphs. Discret. Comput. Geom. 60(2): 430-470 (2018) - [j88]Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
Guest Editors' Foreword and Overview. J. Graph Algorithms Appl. 22(1): 1-10 (2018) - [j87]Patrizio Angelini
1-Fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723: 23-50 (2018) - [j86]Michael A. Bekos
Algorithms and insights for RaceTrack. Theor. Comput. Sci. 748: 2-16 (2018) - [c177]Michael Kaufmann, Jan Kratochvíl
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM 2018: 214-220 - [c176]Patrizio Angelini
On RAC Drawings of Graphs with One Bend per Edge. GD 2018: 123-136 - [c175]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. GD 2018: 213-226 - [c174]Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The Number of Crossings in Multigraphs with No Empty Lens. GD 2018: 242-254 - [c173]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. GD 2018: 271-285 - [c172]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. GD 2018: 509-523 - [c171]Patrizio Angelini
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. ISAAC 2018: 28:1-28:13 - [c170]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. WG 2018: 1-14 - [i44]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. CoRR abs/1803.10030 (2018) - [i43]Patrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann:
On RAC Drawings of Graphs with one Bend per Edge. CoRR abs/1808.10470 (2018) - [i42]Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The number of crossings in multigraphs with no empty lens. CoRR abs/1808.10480 (2018) - [i41]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 abs/1808.10519 (2018) - [i40]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 abs/1808.10536 (2018) - [i39]Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. CoRR abs/1808.10841 (2018) - 2017
- [j85]Michael A. Bekos
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Algorithmica 79(2): 401-427 (2017) - [j84]Michael A. Bekos
The Book Thickness of 1-Planar Graphs is Constant. Algorithmica 79(2): 444-465 (2017) - [j83]Md. Jawaherul Alam
Threshold-coloring and unit-cube contact representation of planar graphs. Discret. Appl. Math. 216: 2-14 (2017) - [j82]Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Konstantinos S. Stavropoulos, Sankar Veeramoni:
The maximum k-differential coloring problem. J. Discrete Algorithms 45: 35-53 (2017) - [j81]Patrizio Angelini
Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21(3): 313-340 (2017) - [j80]Michael A. Bekos
On the Total Number of Bends for Planar Octilinear Drawings. J. Graph Algorithms Appl. 21(4): 709-730 (2017) - [j79]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani
Progress on Partial Edge Drawings. J. Graph Algorithms Appl. 21(4): 757-786 (2017) - [j78]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The planar tree packing theorem. J. Comput. Geom. 8(2): 109-177 (2017) - [c169]Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
On Optimal 2- and 3-Planar Graphs. SoCG 2017: 16:1-16:16 - [c168]Patrizio Angelini
On Vertex- and Empty-Ply Proximity Drawings. GD 2017: 24-37 - [c167]Niklas Heinsohn, Michael Kaufmann:
An Interactive Tool to Explore and Improve the Ply Number of Drawings. GD 2017: 38-51 - [c166]Patrizio Angelini
3D Visibility Representations of 1-planar Graphs. GD 2017: 102-109 - [c165]Michael A. Bekos, Henry Förster, Michael Kaufmann:
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. GD 2017: 169-183 - [c164]Patrizio Angelini
1-Fan-Bundle-Planar Drawings of Graphs. GD 2017: 517-530 - [i38]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck:
1-Fan-Bundle-Planar Drawings of Graphs. CoRR abs/1702.06163 (2017) - [i37]Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou:
On Optimal 2- and 3-Planar Graphs. CoRR abs/1703.06526 (2017) - [i36]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
3D Visibility Representations of 1-planar Graphs. CoRR abs/1708.06196 (2017) - [i35]Michael A. Bekos, Henry Förster, Michael Kaufmann:
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings. CoRR abs/1708.09197 (2017) - [i34]Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr:
On Vertex- and Empty-Ply Proximity Drawings. CoRR abs/1708.09233 (2017) - [i33]Niklas Heinsohn, Michael Kaufmann:
An Interactive Tool to Explore and Improve the Ply Number of Drawings. CoRR abs/1708.09250 (2017) - [i32]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Beyond-Planarity: Density Results for Bipartite Graphs. CoRR abs/1712.09855 (2017) - 2016
- [j77]Daniel Stöckel, Tim Kehl
Multi-omics enrichment analysis using the GeneTrail2 web service. Bioinform. 32(10): 1502-1508 (2016) - [c163]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. SoCG 2016: 41:1-41:15 - [c162]Michael A. Bekos
Algorithms and Insights for RaceTrack. FUN 2016: 6:1-6:14 - [c161]Patrizio Angelini
Low Ply Drawings of Trees. GD 2016: 236-248 - [c160]Michael A. Bekos
On the Density of Non-simple 3-Planar Graphs. GD 2016: 344-356 - [c159]Michael A. Bekos
AVDTC of generalized 3-Halin graphs. IISA 2016: 1-6 - [c158]Michael A. Bekos
On the Total Number of Bends for Planar Octilinear Drawings. LATIN 2016: 152-163 - [c157]Muhammad Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov
On Contact Graphs with Cubes and Proportional Boxes. SOFSEM 2016: 107-120 - [c156]Patrizio Angelini
Vertex-Coloring with Star-Defects. WALCOM 2016: 40-51 - [i31]Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou:
On the Density of 3-Planar Graphs. CoRR abs/1602.04995 (2016) - [i30]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. CoRR abs/1603.07737 (2016) - [i29]Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. CoRR abs/1608.08538 (2016) - [i28]Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, János Pach:
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452). Dagstuhl Reports 6(11): 35-62 (2016) - 2015
- [j76]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov
Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica 71(1): 36-52 (2015) - [j75]Andreas Gerasch, Jan Küntzer, Peter Niermann, Daniel Stöckel, Michael Kaufmann, Oliver Kohlbacher, Hans-Peter Lenhof:
Network-based interactive navigation and analysis of large biological datasets. it Inf. Technol. 57(1): 37-48 (2015) - [j74]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov
Fitting Planar Graphs on Planar Maps. J. Graph Algorithms Appl. 19(1): 413-440 (2015) - [j73]Michael A. Bekos
Planar Octilinear Drawings with One Bend Per Edge. J. Graph Algorithms Appl. 19(2): 657-680 (2015) - [j72]Michael A. Bekos
Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 (2015) - [c155]Michael A. Bekos
1-Planar Graphs have Constant Book Thickness. ESA 2015: 130-141 - [c154]Michael A. Bekos
The Book Embedding Problem from a SAT-Solving Perspective. GD 2015: 125-138 - [c153]Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov
On Embeddability of Buses in Point Sets. GD 2015: 395-408 - [c152]Patrizio Angelini
A Universal Point Set for 2-Outerplanar Graphs. GD 2015: 409-422 - [c151]Till Bruckdorfer, Michael Kaufmann, Simon Leibßle:
PED User Study. GD 2015: 551-553 - [c150]Michael A. Bekos
Sloginsky drawings of graphs. IISA 2015: 1-6 - [c149]Till Bruckdorfer, Michael Kaufmann, Andreas Lauer:
A practical approach for 1/4-SHPEDs. IISA 2015: 1-6 - [c148]Emilio Di Giacomo, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov
Low ply graph drawing. IISA 2015: 1-6 - [c147]Christian Zielke, Michael Kaufmann:
A New Approach to Partial MUS Enumeration. SAT 2015: 387-404 - [c146]Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov
The Maximum k-Differential Coloring Problem. SOFSEM 2015: 115-127 - [c145]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov
Contact Graphs of Circular Arcs. WADS 2015: 1-13 - [c144]Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann, Daniel Neuwirth:
On Bar (1, j)-Visibility Graphs - (Extended Abstract). WALCOM 2015: 246-257 - [c143]Michael A. Bekos
The Effect of Almost-Empty Faces on Planar Kandinsky Drawings. SEA 2015: 352-364 - [i27]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Representations of Sparse Planar Graphs. CoRR abs/1501.00318 (2015) - [i26]Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou:
The Book Thickness of 1-Planar Graphs is Constant. CoRR abs/1503.04990 (2015) - [i25]Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze:
A Universal Point Set for 2-Outerplanar Graphs. CoRR abs/1508.05784 (2015) - [i24]Till Bruckdorfer, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
On Embeddability of Buses in Point Sets. CoRR abs/1508.06760 (2015) - [i23]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov:
On Contact Graphs with Cubes and Proportional Boxes. CoRR abs/1510.02484 (2015) - [i22]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli:
Vertex-Coloring with Star-Defects. CoRR abs/1512.02505 (2015) - [i21]Michael A. Bekos, Michael Kaufmann, Robert Krug:
On the Total Number of Bends for Planar Octilinear Drawings. CoRR abs/1512.04866 (2015) - 2014
- [j71]Patrizio Angelini
On the area requirements of Euclidean minimum spanning trees. Comput. Geom. 47(2): 200-213 (2014) - [j70]Stefan Felsner, Michael Kaufmann, Pavel Valtr:
Bend-optimal orthogonal graph drawing in the general position model. Comput. Geom. 47(3): 460-468 (2014) - [j69]Michael A. Bekos
A note on maximum differential coloring of planar graphs. J. Discrete Algorithms 29: 1-7 (2014) - [j68]Till Bruckdorfer, Michael Kaufmann, Fabrizio Montecchiani
1-Bend Orthogonal Partial Edge Drawing. J. Graph Algorithms Appl. 18(1): 111-131 (2014) - [j67]Fabrizio Frati
On the Upward Planarity of Mixed Plane Graphs. J. Graph Algorithms Appl. 18(2): 253-279 (2014) - [j66]Patrizio Angelini
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. J. Graph Algorithms Appl. 18(3): 313-324 (2014) - [j65]Michael A. Bekos
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations. J. Graph Algorithms Appl. 18(3): 459-489 (2014) - [j64]William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. J. Graph Algorithms Appl. 18(5): 721-739 (2014) - [c142]Andreas Gerasch, Michael Kaufmann, Oliver Kohlbacher:
Rebuilding KEGG Maps: Algorithms and Benefits. PacificVis 2014: 97-104 - [c141]Niklas Heinsohn, Andreas Gerasch, Michael Kaufmann:
Boundary Labeling Methods for Dynamic Focus Regions. PacificVis 2014: 243-247 - [c140]Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. GD 2014: 198-209 - [c139]Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug:
Planar Octilinear Drawings with One Bend Per Edge. GD 2014: 331-342 - [c138]Michael A. Bekos
Sloggy drawings of graphs. IISA 2014: 82-87 - [c137]Emilio Di Giacomo
Upward-rightward planar drawings. IISA 2014: 145-150 - [c136]Muhammad Jawaherul Alam, Michael A. Bekos
Smooth Orthogonal Drawings of Planar Graphs. LATIN 2014: 144-155 - [c135]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov
Fitting Planar Graphs on Planar Maps. SOFSEM 2014: 52-64 - [i20]Michael Kaufmann, Torsten Ueckerdt:
The Density of Fan-Planar Graphs. CoRR abs/1403.6184 (2014) - [i19]Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug:
Planar Octilinear Drawings with One Bend Per Edge. CoRR abs/1408.5920 (2014) - [i18]Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. CoRR abs/1409.0461 (2014) - [i17]Michael A. Bekos, Stephen G. Kobourov, Michael Kaufmann, Sankar Veeramoni:
The Maximum k-Differential Coloring Problem. CoRR abs/1409.8133 (2014) - 2013
- [j63]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. Algorithmica 67(1): 3-22 (2013) - [j62]Daniel Stöckel, Oliver Müller, Tim Kehl
NetworkTrail - a web service for identifying and visualizing deregulated subnetworks. Bioinform. 29(13): 1702-1703 (2013) - [j61]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta
Approximate proximity drawings. Comput. Geom. 46(6): 604-614 (2013) - [j60]Michael Kaufmann, Tamara Mchedlidze
On upward point set embeddability. Comput. Geom. 46(6): 774-804 (2013) - [j59]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
Computing Cartograms with Optimal Complexity. Discret. Comput. Geom. 50(3): 784-810 (2013) - [j58]Evmorfia N. Argyriou, Michael A. Bekos
Geometric RAC Simultaneous Drawings of Graphs. J. Graph Algorithms Appl. 17(1): 11-34 (2013) - [j57]Michael A. Bekos
Smooth Orthogonal Layouts. J. Graph Algorithms Appl. 17(5): 575-595 (2013) - [c134]Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff:
Universal Point Sets for Planar Graph Drawings with Circular Arcs. CCCG 2013 - [c133]Till Bruckdorfer, Stefan Felsner, Michael Kaufmann:
On the Characterization of Plane Bus Graphs. CIAC 2013: 73-84 - [c132]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
Table Cartograms. ESA 2013: 421-432 - [c131]Fabrizio Frati
On the Upward Planarity of Mixed Plane Graphs. GD 2013: 1-12 - [c130]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg
Many-to-One Boundary Labeling with Backbones. GD 2013: 244-255 - [c129]Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli:
Slanted Orthogonal Drawings. GD 2013: 424-435 - [c128]Johannes Dellert, Christian Zielke, Michael Kaufmann:
MUStICCa: MUS Extraction with Interactive Choice of Candidates. SAT 2013: 408-414 - [c127]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
Planar Packing of Binary Trees. WADS 2013: 353-364 - [c126]Md. Jawaherul Alam, Steven Chaplick
Threshold-Coloring and Unit-Cube Contact Representation of Graphs. WG 2013: 26-37 - [i16]Md. Jawaherul Alam, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold Coloring and Unit-Cube Contact Representation of Graphs. CoRR abs/1302.6183 (2013) - [i15]Aparna Das, Markus Geyer, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni:
Maximum Differential Coloring of Caterpillars and Spiders. CoRR abs/1302.7085 (2013) - [i14]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. CoRR abs/1308.6801 (2013) - [i13]Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff:
Smooth Orthogonal Drawings of Planar Graphs. CoRR abs/1312.3538 (2013) - [i12]William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. CoRR abs/1312.5520 (2013) - 2012
- [j56]Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov
Optimal Polygonal Representation of Planar Graphs. Algorithmica 63(3): 672-691 (2012) - [j55]Cedric Laczny
miRTrail - a comprehensive webserver for analyzing gene and miRNA patterns to enhance the understanding of regulatory mechanisms in diseases. BMC Bioinform. 13: 36 (2012) - [j54]Walter Didimo, Michael Kaufmann, Giuseppe Liotta
Vertex angle and crossing angle resolution of leveled tree drawings. Inf. Process. Lett. 112(16): 630-635 (2012) - [j53]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. J. Graph Algorithms Appl. 16(1): 37-83 (2012) - [j52]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
Proportional Contact Representations of Planar Graphs. J. Graph Algorithms Appl. 16(3): 701-728 (2012) - [c125]Evmorfia N. Argyriou, Michael A. Bekos
Geometric RAC Simultaneous Drawings of Graphs. COCOON 2012: 287-298 - [c124]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
Computing cartograms with optimal complexity. SCG 2012: 21-30 - [c123]Till Bruckdorfer, Michael Kaufmann:
Mad at Edge Crossings? Break the Edges! FUN 2012: 40-50 - [c122]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani
Progress on Partial Edge Drawings. GD 2012: 67-78 - [c121]Michael A. Bekos
Smooth Orthogonal Layouts. GD 2012: 150-161 - [c120]Stephan Kottler, Christian Zielke, Paul Seitz, Michael Kaufmann:
CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation). SAT 2012: 449-455 - [c119]Sebastian Burg, Stephan Kottler, Michael Kaufmann:
Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation). SAT 2012: 471-472 - [i11]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. CoRR abs/1201.0066 (2012) - [i10]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. CoRR abs/1209.0830 (2012) - 2011
- [j51]Ulrik Brandes, Cesim Erten
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [j50]Fabrizio Frati
Polynomial area bounds for MST embeddings of trees. Comput. Geom. 44(9): 529-543 (2011) - [j49]Patrizio Angelini
Straight-Line Rectangular Drawings of Clustered Graphs. Discret. Comput. Geom. 45(1): 88-140 (2011) - [j48]Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati
On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011) - [j47]Katharina Anna Zweig
A systematic approach to the one-mode projection of bipartite graphs. Soc. Netw. Anal. Min. 1(3): 187-218 (2011) - [c118]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov
Approximating Minimum Manhattan Networks in Higher Dimensions. ESA 2011: 49-60 - [c117]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
Proportional Contact Representations of Planar Graphs. GD 2011: 26-38 - [c116]Patrizio Angelini
Small Point Sets for Simply-Nested Planar Graphs. GD 2011: 75-85 - [c115]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta
Approximate Proximity Drawings. GD 2011: 166-178 - [c114]Michael Kaufmann, Tamara Mchedlidze
Upward Point Set Embeddability for Convex Point Sets Is in P. GD 2011: 403-414 - [c113]Evmorfia N. Argyriou, Michael A. Bekos
Combining Problems on RAC Drawings and Simultaneous Graph Drawings. GD 2011: 433-434 - [c112]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations. ISAAC 2011: 281-291 - [c111]Patrizio Angelini
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC 2011: 200-209 - [c110]Michael A. Bekos
Combining Traditional Map Labeling with Boundary Labeling. SOFSEM 2011: 111-122 - [c109]Markus Geyer, Michael Kaufmann, Tamara Mchedlidze
Upward Point-Set Embeddability. SOFSEM 2011: 272-283 - [c108]Patrizio Angelini
On the Area Requirements of Euclidean Minimum Spanning Trees. WADS 2011: 25-36 - [c107]Michael Kaufmann, Stephan Kottler:
Beyond Unit Propagation in SAT Solving. SEA 2011: 267-279 - [i9]Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov:
Optimal Polygonal Representation of Planar Graphs. CoRR abs/1104.1482 (2011) - [i8]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Geometric Simultaneous RAC Drawings of Graphs. CoRR abs/1106.2694 (2011) - [i7]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. CoRR abs/1107.0901 (2011) - [i6]Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Point Set Embeddability for Convex Point Sets is in $P$. CoRR abs/1108.3092 (2011) - [i5]Camil Demetrescu, Michael Kaufmann, Stephen G. Kobourov
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). Dagstuhl Reports 1(5): 47-60 (2011) - 2010
- [j46]Michael A. Bekos
Boundary Labeling with Octilinear Leaders. Algorithmica 57(3): 436-461 (2010) - [j45]Michael A. Bekos
Area-Feature Boundary Labeling. Comput. J. 53(6): 827-841 (2010) - [j44]Kay Nieselt
Visuelle Analytik biologischer Daten. Inform. Spektrum 33(6): 559-568 (2010) - [j43]Henning Fernau
Comparing trees via crossing minimization. J. Comput. Syst. Sci. 76(7): 593-608 (2010) - [j42]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
On Metro-Line Crossing Minimization. J. Graph Algorithms Appl. 14(1): 75-96 (2010) - [c106]Patrizio Angelini
Upward Geometric Graph Embeddings into Point Sets. GD 2010: 25-37 - [c105]Patrizio Angelini
On a Tree and a Path with No Geometric Simultaneous Embedding. GD 2010: 38-49 - [c104]Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann:
Improving Layered Graph Layouts with Edge Bundling. GD 2010: 329-340 - [c103]Markus Geyer, Michael Kaufmann, Robert Krug:
Visualizing Differences between Two Large Graphs. GD 2010: 393-394 - [c102]Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov
Optimal Polygonal Representation of Planar Graphs. LATIN 2010: 417-432 - [c101]Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann:
An automatic layout algorithm for BPEL processes. SOFTVIS 2010: 173-182 - [i4]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. CoRR abs/1001.0555 (2010) - [i3]Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Point-Set Embeddability. CoRR abs/1010.5937 (2010)
2000 – 2009
- 2009
- [j41]Andreas Keller
A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis. Bioinform. 25(21): 2787-2794 (2009) - [j40]Markus Geyer, Michael Kaufmann, Imrich Vrto:
Two trees which are self-intersecting when drawn simultaneously. Discret. Math. 309(7): 1909-1916 (2009) - [j39]Fabrizio Frati
Planar packing of trees and spider trees. Inf. Process. Lett. 109(6): 301-307 (2009) - [j38]Fabrizio Frati
Constrained Simultaneous and Near-Simultaneous Embeddings. J. Graph Algorithms Appl. 13(3): 447-465 (2009) - [c100]Michael Kaufmann:
On Map Labeling with Leaders. Efficient Algorithms 2009: 290-304 - [c99]Michael Kaufmann, Katharina Anna Zweig
Modeling and Designing Real-World Networks. Algorithmics of Large and Complex Networks 2009: 359-379 - [c98]Patrizio Angelini
On the Perspectives Opened by Right Angle Crossing Drawings. GD 2009: 21-32 - [c97]Michael Kaufmann, Stephan Kottler:
Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. GD 2009: 419-420 - [c96]Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler:
Visualization of Complex BPEL Models. GD 2009: 421-423 - [c95]Patrizio Angelini
Straight-Line Rectangular Drawings of Clustered Graphs. WADS 2009: 25-36 - [c94]Philip Effinger, Martin Siebenhaller, Michael Kaufmann:
An Interactive Layout Tool for BPMN. CEC 2009: 399-406 - 2008
- [j37]Amarendran Ramaswami Subramanian, Michael Kaufmann, Burkhard Morgenstern
DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms Mol. Biol. 3 (2008) - [j36]Andreas Keller
GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments. BMC Bioinform. 9 (2008) - [j35]Vida Dujmovic, Henning Fernau
Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2): 313-323 (2008) - [j34]Michael Kaufmann, Dorothea Wagner:
Guest Editor's Foreword. J. Graph Algorithms Appl. 12(1): 3-4 (2008) - [j33]Michael A. Bekos
Efficient Labeling of Collinear Sites. J. Graph Algorithms Appl. 12(3): 357-380 (2008) - [c93]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. GD 2008: 336-347 - [c92]Michael Kaufmann, Marc J. van Kreveld, Bettina Speckmann
Subdivision Drawings of Hypergraphs. GD 2008: 396-407 - [c91]Philip Effinger, Michael Kaufmann, Martin Siebenhaller:
Enhancing Visualizations of Business Processes. GD 2008: 437-438 - [c90]Stephan Kottler, Michael Kaufmann, Carsten Sinz:
Computation of Renameable Horn Backdoors. SAT 2008: 154-160 - [c89]Stephan Kottler, Michael Kaufmann, Carsten Sinz:
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. SAT 2008: 161-167 - [c88]Michael A. Bekos
Boundary Labeling with Octilinear Leaders. SWAT 2008: 234-245 - [i2]Stephen P. Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen G. Kobourov, Anna Lubiw, Dorothea Wagner:
08191 Working Group Report - Visualization of Trajectories. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2007
- [j32]Jan Küntzer, Christina Backes, Torsten Blum, Andreas Gerasch, Michael Kaufmann, Oliver Kohlbacher
BNDB - The Biochemical Network Database. BMC Bioinform. 8 (2007) - [j31]Michael A. Bekos
Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. 36(3): 215-236 (2007) - [c87]Michael A. Bekos
Labeling collinear sites. APVIS 2007: 45-51 - [c86]Dennis Goehlsdorf, Michael Kaufmann, Martin Siebenhaller:
Placing connected components of disconnected graphs. APVIS 2007: 101-108 - [c85]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - [c84]Michael Kaufmann:
Polynomial Area Bounds for MST Embeddings of Trees. GD 2007: 88-100 - [c83]Michael A. Bekos
Line Crossing Minimization on Metro Maps. GD 2007: 231-242 - [c82]Fabrizio Frati
Constrained Simultaneous and Near-Simultaneous Embeddings. GD 2007: 268-279 - [c81]Fabrizio Frati
Packing and Squeezing Subgraphs into Planar Graphs. MFCS 2007: 394-405 - [c80]Ulrike von Luxburg, Sébastien Bubeck, Stefanie Jegelka, Michael Kaufmann:
Consistent Minimization of Clustering Objective Functions. NIPS 2007: 961-968 - [e2]Michael Kaufmann, Dorothea Wagner:
Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers. Lecture Notes in Computer Science 4372, Springer 2007, ISBN 978-3-540-70903-9 [contents] - 2006
- [j30]Katharina Anna Lehmann
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences. Algorithms Mol. Biol. 1 (2006) - [j29]Wolfgang Blochinger, Michael Kaufmann, Martin Siebenhaller:
Visualization aided performance tuning of irregular task-parallel computations. Inf. Vis. 5(2): 81-94 (2006) - [j28]Jan Küntzer, Torsten Blum, Andreas Gerasch, Christina Backes, Andreas Hildebrandt, Michael Kaufmann, Oliver Kohlbacher, Hans-Peter Lenhof:
BN++ - A Biological Information System. J. Integr. Bioinform. 3(2) (2006) - [c79]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Polygon labelling of minimum leader length. APVIS 2006: 15-21 - [c78]Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis
Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2006: 799 - [c77]Michael A. Bekos, Michael Kaufmann, Katerina Potika
Multi-stack Boundary Labeling Problems. FSTTCS 2006: 81-92 - [c76]Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian:
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. SODA 2006: 832-841 - [c75]Martin Siebenhaller, Michael Kaufmann:
Drawing activity diagrams. SOFTVIS 2006: 159-160 - 2005
- [j27]Amarendran Ramaswami Subramanian, Jan Weyer-Menkhoff, Michael Kaufmann, Burkhard Morgenstern
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. BMC Bioinform. 6: 66 (2005) - [j26]Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann:
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. J. Graph Algorithms Appl. 9(3): 305-325 (2005) - [c74]Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann:
A New Approach for Boundary Recognition in Geometric Sensor Networks. CCCG 2005: 84-87 - [c73]Henning Fernau
Comparing Trees Via Crossing Minimization. FSTTCS 2005: 457-469 - [c72]Markus Geyer, Michael Kaufmann, Imrich Vrto:
Two Trees Which Are Self-intersecting When Drawn Simultaneously. GD 2005: 201-210 - [c71]Martin Siebenhaller, Michael Kaufmann:
Mixed Upward Planarization - Fast and Robust. GD 2005: 522-523 - [c70]Katharina Anna Lehmann
Evolutionary algorithms for the self-organized evolution of networks. GECCO 2005: 563-570 - [c69]Michael A. Bekos
Boundary Labelling of Optimal Total Leader Length. Panhellenic Conference on Informatics 2005: 80-89 - [c68]Wolfgang Blochinger, Michael Kaufmann, Martin Siebenhaller:
Visualizing structural properties of irregular parallel computations. SOFTVIS 2005: 125-134 - [p2]Katharina Anna Lehmann
Random Graphs, Small-Worlds and Scale-Free Networks. Peer-to-Peer Systems and Applications 2005: 57-76 - [i1]Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann:
A New Approach for Boundary Recognition in Geometric Sensor Networks. CoRR abs/cs/0508006 (2005) - 2004
- [j25]Martin Schmollinger, Kay Nieselt
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors. BMC Bioinform. 5: 128 (2004) - [j24]Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel
Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. 3(3): 189-208 (2004) - [c67]Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff:
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. GD 2004: 49-59 - [c66]Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann:
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. GD 2004: 155-166 - [p1]Roland Wiese, Markus Eiglsperger, Michael Kaufmann:
yFiles - Visualization and Automatic Layout of Graphs. Graph Drawing Software 2004: 173-191 - 2003
- [j23]Martin Schmollinger, Michael Kaufmann:
Designing Parallel Algorithms for Hierarchical SMP Clusters. Int. J. Found. Comput. Sci. 14(1): 59-78 (2003) - [j22]Markus Eiglsperger, Michael Kaufmann, Frank Eppinger:
An Approach for Mixed Upward Planarization. J. Graph Algorithms Appl. 7(2): 203-220 (2003) - [c65]Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann:
Topic Introduction. Euro-Par 2003: 884 - [c64]Vida Dujmovic, Henning Fernau
Fixed Parameter Algorithms for one-sided crossing minimization Revisited. GD 2003: 332-344 - [c63]Markus Eiglsperger, Michael Kaufmann, Martin Siebenhaller:
A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram. SOFTVIS 2003: 189-198 - 2002
- [j21]Michael Kaufmann, Roland Wiese:
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. J. Graph Algorithms Appl. 6(1): 115-129 (2002) - [j20]Michael Kaufmann:
Guest Editor's Foreword. J. Graph Algorithms Appl. 6(3): 177-178 (2002) - [c62]Marite Sirava, T. Schäfer, Markus Eiglsperger, Michael Kaufmann, Oliver Kohlbacher, Erich Bornberg-Bauer, Hans-Peter Lenhof:
BioMiner - modeling, analyzing, and visualizing biochemical pathways and networks. ECCB 2002: 219-230 - [c61]Thomas Krätschmer, Michael Kaufmann:
Electronic brainstorming with graphical structures of ideas. ECIS 2002: 120-130 - [c60]Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner:
Sketch-Driven Orthogonal Graph Drawing. GD 2002: 1-11 - [c59]Michael Kaufmann, Roland Wiese:
Maintaining the Mental Map for Circular Drawings. GD 2002: 12-22 - [c58]Michael Kaufmann:
Graph Drawing Algorithms for Bioinformatics. GI Jahrestagung (Ergänzungsband) 2002: 65-66 - [c57]Martin Schmollinger, Michael Kaufmann:
Algorithms for SMP-Clusters Dense Matrix-Vector Multiplication. IPDPS 2002 - [c56]Ezekiel F. Adebiyi, Michael Kaufmann:
Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation. WABI 2002: 140-156 - 2001
- [c55]Boris Diebold, Michael Kaufmann:
Usage-based Visualization of Web Locations. InVis.au 2001: 159-164 - [c54]Markus Eiglsperger, Michael Kaufmann:
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. GD 2001: 124-138 - [c53]Roland Wiese, Markus Eiglsperger, Michael Kaufmann:
yFiles: Visualization and Automatic Layout of Graphs. GD 2001: 453-454 - [c52]Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann:
An efficient algorithm for finding short approximate non-tandem repeats. ISMB (Supplement of Bioinformatics) 2001: 5-12 - [c51]Martin Schmollinger, Michael Kaufmann:
kappa NUMA: A Model for Clusters of SMP-Machines. PPAM 2001: 42-50 - [c50]Markus Eiglsperger, Michael Kaufmann:
An Approach for Mixed Upward Planarization. WADS 2001: 352-364 - [e1]Michael Kaufmann, Dorothea Wagner:
Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl Seminar, April 1999). Lecture Notes in Computer Science 2025, Springer 2001, ISBN 3-540-42062-2 [contents] - 2000
- [j19]Ulrich Fößmeier, Michael Kaufmann:
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results. Algorithmica 26(1): 68-99 (2000) - [c49]Markus Eiglsperger, Ulrich Fößmeier, Michael Kaufmann:
Orthogonal graph drawing with constraints. SODA 2000: 3-11
1990 – 1999
- 1999
- [c48]Michael Kaufmann, Roland Wiese:
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. GD 1999: 165-174 - 1998
- [c47]Ulrich Fößmeier, Carsten Heß, Michael Kaufmann:
On Improving Orthogonal Drawings: The 4M-Algorithm. GD 1998: 125-137 - [c46]Björn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt
Visualization of Parallel Execution Graphs. GD 1998: 403-412 - [c45]Roland Wiese, Michael Kaufmann:
Adding Constraints to an Algorithm for Orthogonal Graph Drawing. GD 1998: 462-463 - [c44]Therese Biedl, Michael Kaufmann, Petra Mutzel
Drawing Planar Partitions II: HH-Drawings. WG 1998: 124-136 - 1997
- [j18]Michael Kaufmann, Jop F. Sibeyn:
Randomized Multipacket Routing and Sorting on Meshes. Algorithmica 17(3): 224-244 (1997) - [j17]Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn:
Routing on Meshes with Buses. Algorithmica 18(3): 417-444 (1997) - [j16]Therese Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997) - [j15]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice. Comput. Artif. Intell. 16(2): 107-140 (1997) - [j14]Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. Discret. Comput. Geom. 18(1): 93-109 (1997) - [j13]Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
Deterministic Permutation Routing on Meshes. J. Algorithms 22(1): 111-141 (1997) - [c43]Ulrich Fößmeier, Michael Kaufmann:
Nice Drawings for Planar Bipartite Graphs. CIAC 1997: 122-134 - [c42]Jop F. Sibeyn, Michael Kaufmann:
BSP-Like External-Memory Computation. CIAC 1997: 229-240 - [c41]Ulrich Fößmeier, Michael Kaufmann:
On Exact Solutions for the Rectilinear Steiner Tree Problem. SCG 1997: 436-438 - [c40]Therese C. Biedl, Michael Kaufmann:
Area-Efficient Static and Incremental Graph Drawings. ESA 1997: 37-52 - [c39]Ulrich Fößmeier, Michael Kaufmann:
Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. ESA 1997: 171-185 - [c38]Ulrich Fößmeier, Michael Kaufmann:
Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. GD 1997: 134-145 - [c37]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice. IPPS 1997: 315-319 - 1996
- [j12]Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman:
An Algorithm for Steiner Trees in Grid Graphs and its Application to Homotopic Routing. J. Circuits Syst. Comput. 6(1): 1-14 (1996) - [c36]Ulrich Fößmeier, Goos Kant, Michael Kaufmann:
2-Visibility Drawings of Planar Graphs. GD 1996: 155-168 - 1995
- [j11]Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn:
Routing and Sorting on Reconfigurable Meshes. Parallel Process. Lett. 5: 81-95 (1995) - [c35]Michael Kaufmann, Jop F. Sibeyn, Torsten Suel:
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. ESA 1995: 75-88 - [c34]Ulrich Fößmeier, Michael Kaufmann:
Drawing High Degree Graphs with Low Bend Numbers. GD 1995: 254-266 - [c33]Jop F. Sibeyn, Michael Kaufmann:
Solving Cheap Graph Problems an Meshes. MFCS 1995: 412-422 - 1994
- [j10]Shaodi Gao, Michael Kaufmann:
Channel Routing of Multiterminal Nets. J. ACM 41(4): 791-818 (1994) - [j9]Michael Kaufmann, Kurt Mehlhorn:
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. SIAM J. Comput. 23(2): 227-246 (1994) - [c32]Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky:
Approaching the 5/4-Approximation for Rectilinear Steiner Trees. ESA 1994: 60-71 - [c31]Ulrich Fößmeier, Michael Kaufmann:
On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. GD 1994: 52-63 - [c30]Michael Kaufmann, Harald Lauer, Heiko Schröder:
Fast Deterministic Hot-Potato Routing on Processor Arrays. ISAAC 1994: 333-341 - [c29]Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman:
On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing. ISAAC 1994: 351-359 - [c28]Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
Shorter Queues for Permutation Routing on Meshes. MFCS 1994: 597-607 - [c27]Michael Kaufmann, Jop F. Sibeyn, Torsten Suel:
Derandomizing Algorithms for Routing and Sorting on Meshes. SODA 1994: 669-679 - [c26]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Towards practical permutation routing on meshes. SPDP 1994: 664-671 - [c25]Jop F. Sibeyn, Michael Kaufmann:
Deterministic 1-k Routing on Meshes. STACS 1994: 237-248 - [c24]Therese Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs under the Four-Connectivity Constraint. SWAT 1994: 83-94 - 1993
- [j8]Michael Kaufmann, F. Miller Maley:
Parity Conditions in Homotopic Knock-Knee Routing. Algorithmica 9(1): 47-63 (1993) - [j7]Michael Kaufmann, Gerhard Klär:
Routing in Polygons without Rectilinear Visible Corners. Inf. Comput. 102(2): 218-262 (1993) - [j6]Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis
Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. 22(5): 1035-1052 (1993) - [c23]Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
Randomized Routing on Meshes with Buses. ESA 1993: 333-344 - [c22]Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. ISAAC 1993: 533-542 - [c21]Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn:
Deterministic Permutation Routing on Meshes. SPDP 1993: 284 - 1992
- [j5]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992) - [j4]Michael Kaufmann, Kurt Mehlhorn:
On local routing of two-terminal nets. J. Comb. Theory B 55(1): 33-72 (1992) - [c20]Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn:
Matching the Bisection Bound for Routing and Sorting on the Mesh. SPAA 1992: 31-40 - [c19]Michael Kaufmann, Jop F. Sibeyn:
Deterministic Routing on Circular Arrays. SPDP 1992: 376-383 - [c18]Michael Kaufmann, Paul Molitor
Performance Driven k-Layer Wiring. STACS 1992: 489-500 - [c17]Michael Kaufmann, Jop F. Sibeyn:
Optimal Multi-Packet Routing on the Torus. SWAT 1992: 118-129 - 1991
- [j3]Michael Kaufmann, Paul Molitor
Minimal stretching of a layout to ensure 2-layer wirability. Integr. 12(3): 339-352 (1991) - [c16]Frank Hoffmann, Michael Kaufmann, Klaus Kriegel:
The Art Gallery Theorem for Polygons With Holes. FOCS 1991: 39-48 - [c15]Michael Kaufmann, Gerhard Klär:
A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs. ISA 1991: 336-348 - 1990
- [j2]Michael Kaufmann:
A linear-time algorithm for routing in a convex grid. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(2): 180-184 (1990) - [c14]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG 1990: 281-289 - [c13]Patrik Eklund, Michael Kaufmann:
Hierarchical Wiring in Multigrids. CONPAR 1990: 423-434 - [c12]Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger:
Drawing Graphs in the Plane with High Resolution. FOCS 1990: 86-95 - [c11]Michael Kaufmann:
Zur Physik des Fusionsreaktors. Neue Ergebnisse. Forum Wissenschaft und Technik 1990: 482-499 - [c10]Michael Kaufmann:
Allowing overlaps makes switchbox layouts nice. SPDP 1990: 267-274 - [c9]Frank Hoffmann, Michael Kaufmann:
On the Rectilinear Art Gallery Problem - Algorithmic Aspects. WG 1990: 239-250
1980 – 1989
- 1989
- [c8]Shaodi Gao, Michael Kaufmann, F. Miller Maley:
Advances in Homotopic Layout Compaction. SPAA 1989: 273-282 - 1988
- [c7]Michael Kaufmann, Ioannis G. Tollis:
Channel Routing with Short Wires. AWOC 1988: 226-236 - [c6]Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum:
On Continuous Homotopic One Layer Routing. Workshop on Computational Geometry 1988: 55-70 - [c5]Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling:
On Continuous Homotopic One Layer Routing. SCG 1988: 392-402 - 1987
- [b1]Michael Kaufmann:
Über Lokales Verdrahten von Zwei-Punkt-Netzen. Saarland University, Saarbrücken, Germany, 1987, pp. 1-125 - [c4]Shaodi Gao, Michael Kaufmann:
Channel Routing of Multiterminal Nets. FOCS 1987: 316-325 - [c3]Michael Kaufmann, Kurt Mehlhorn:
On Local Routing of Two-Terminal Nets. STACS 1987: 40-52 - 1986
- [j1]Michael Kaufmann, Kurt Mehlhorn:
Routing Through a Generalized Switchbox. J. Algorithms 7(4): 510-531 (1986) - 1985
- [c2]Michael Kaufmann, Kurt Mehlhorn:
Routing Through a Generalized Switchbox. ICALP 1985: 328-337 - 1984
- [c1]Michael Kaufmann:
Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out. CAAP 1984: 169-180
Coauthor Index
[c202] [c200] [i71] [j110] [j108] [c198] [c197] [c194] [i67] [i65] [i64] [j103] [c189] [c188] [e3] [i61] [i59] [j102] [j98] [i57] [j97] [j96] [j95] [j94] [c184] [i52] [i51] [i49] [j93] [j92] [c180] [i48] [i46] [j88] [j87] [j86] [c176] [c175] [c173] [c171] [c170] [i44] [i43] [i41] [i39] [j85] [j84] [j82] [j81] [j80] [c169] [c166] [c165] [c164] [i38] [i37] [i36] [i35] [i32] [c162] [c161] [c160] [c159] [c158] [c156] [i31] [i29] [j73] [j72] [c155] [c154] [c150] [c146] [c143] [i26] [i22] [i21] [j69] [j65] [c140] [c139] [c138] [c136] [i19] [i18] [i17] [j58] [j57] [c130] [c129] [i14] [i13] [c125] [c121] [c113] [c110] [i8] [j46] [j45] [j42] [j33] [c93] [c88] [j31] [c87] [c83] [c79] [c77] [c69] [c67]
Therese Biedl
aka: Therese C. Biedl
aka: Therese C. Biedl
[j108] [c194] [i67] [c186] [c179] [i47] [j90] [j83] [j82] [j81] [c168] [i34] [c161] [c157] [i29] [i28] [j76] [j74] [c153] [c148] [c146] [c145] [i27] [i24] [i23] [j69] [c136] [c135] [i17] [j63] [j59] [j57] [c132] [c126] [i16] [i15] [i13] [j56] [j52] [c124] [c121] [i11] [j51] [c118] [c117] [c112] [i9] [i7] [i5] [c102] [j38] [i2] [c85] [c82]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: