The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michael Kaufmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boris Diebold, Michael Kaufmann
    Usage-based Visualization of Web Locations. [Citation Graph (0, 0)][DBLP]
    InVis.au, 2001, pp:159-164 [Conf]
  2. Michael Kaufmann, Ioannis G. Tollis
    Channel Routing with Short Wires. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:226-236 [Conf]
  3. Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann
    A New Approach for Boundary Recognition in Geometric Sensor Networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:84-87 [Conf]
  4. Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum
    On Continuous Homotopic One Layer Routing. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1988, pp:55-70 [Conf]
  5. Jop F. Sibeyn, Michael Kaufmann
    BSP-Like External-Memory Computation. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:229-240 [Conf]
  6. Ulrich Fößmeier, Michael Kaufmann
    Nice Drawings for Planar Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:122-134 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:281-289 [Conf]
  8. Ulrich Fößmeier, Michael Kaufmann
    On Exact Solutions for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:436-438 [Conf]
  9. Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling
    On Continuous Homotopic One Layer Routing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:392-402 [Conf]
  10. Patrik Eklund, Michael Kaufmann
    Hierarchical Wiring in Multigrids. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1990, pp:423-434 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    ECCB, 2002, pp:219-230 [Conf]
  12. Thomas Krätschmer, Michael Kaufmann
    Electronic brainstorming with graphical structures of ideas. [Citation Graph (0, 0)][DBLP]
    ECIS, 2002, pp:- [Conf]
  13. Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
    Approaching the 5/4-Approximation for Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:60-71 [Conf]
  14. Therese C. Biedl, Michael Kaufmann
    Area-Efficient Static and Incremental Graph Drawings. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:37-52 [Conf]
  15. Ulrich Fößmeier, Michael Kaufmann
    Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:171-185 [Conf]
  16. Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
    Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:75-88 [Conf]
  17. Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
    Randomized Routing on Meshes with Buses. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:333-344 [Conf]
  18. Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann
    Topic Introduction. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:884- [Conf]
  19. Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis
    Topic 12: Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:799- [Conf]
  20. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:86-95 [Conf]
  21. Shaodi Gao, Michael Kaufmann
    Channel Routing of Multiterminal Nets [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:316-325 [Conf]
  22. Frank Hoffmann, Michael Kaufmann, Klaus Kriegel
    The Art Gallery Theorem for Polygons With Holes [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:39-48 [Conf]
  23. Michael Kaufmann
    Zur Physik des Fusionsreaktions. Neue Ergebnisse. [Citation Graph (0, 0)][DBLP]
    Forum Wissenschaft und Technik, 1990, pp:482-499 [Conf]
  24. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
    Multi-stack Boundary Labeling Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:81-92 [Conf]
  25. Henning Fernau, Michael Kaufmann, Mathias Poths
    Comparing Trees Via Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:457-469 [Conf]
  26. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
    Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:49-59 [Conf]
  27. Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner
    Sketch-Driven Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:1-11 [Conf]
  28. Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann
    An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:155-166 [Conf]
  29. Markus Eiglsperger, Michael Kaufmann
    Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:124-138 [Conf]
  30. Ulrich Fößmeier, Carsten Heß, Michael Kaufmann
    On Improving Orthogonal Drawings: The 4M-Algorithm. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:125-137 [Conf]
  31. Ulrich Fößmeier, Michael Kaufmann
    On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:52-63 [Conf]
  32. Ulrich Fößmeier, Michael Kaufmann
    Drawing High Degree Graphs with Low Bend Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:254-266 [Conf]
  33. Ulrich Fößmeier, Michael Kaufmann
    Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:134-145 [Conf]
  34. Ulrich Fößmeier, Goos Kant, Michael Kaufmann
    2-Visibility Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:155-168 [Conf]
  35. Vida Dujmovic, Henning Fernau, Michael Kaufmann
    Fixed Parameter Algorithms for one-sided crossing minimization Revisited. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:332-344 [Conf]
  36. Markus Geyer, Michael Kaufmann, Imrich Vrto
    Two Trees Which Are Self-intersecting When Drawn Simultaneously. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:201-210 [Conf]
  37. Michael Kaufmann, Roland Wiese
    Maintaining the Mental Map for Circular Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:12-22 [Conf]
  38. Michael Kaufmann, Roland Wiese
    Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:165-174 [Conf]
  39. Martin Siebenhaller, Michael Kaufmann
    Mixed Upward Planarization - Fast and Robust. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:522-523 [Conf]
  40. Björn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel
    Visualization of Parallel Execution Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:403-412 [Conf]
  41. Roland Wiese, Markus Eiglsperger, Michael Kaufmann
    yFiles: Visualization and Automatic Layout of Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:453-454 [Conf]
  42. Roland Wiese, Michael Kaufmann
    Adding Constraints to an Algorithm for Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:462-463 [Conf]
  43. Katharina Anna Lehmann, Michael Kaufmann
    Evolutionary algorithms for the self-organized evolution of networks. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:563-570 [Conf]
  44. Michael Kaufmann
    Graph Drawing Algorithms for Bioinformatics. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (Ergänzungsband), 2002, pp:65-65 [Conf]
  45. Michael Kaufmann, Kurt Mehlhorn
    Routing Through a Generalized Switchbox. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:328-337 [Conf]
  46. Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
    Matrix Transpose on Meshes: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:315-319 [Conf]
  47. Martin Schmollinger, Michael Kaufmann
    Algorithms for SMP-Clusters Dense Matrix-Vector Multiplication. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  48. Michael Kaufmann, Gerhard Klär
    A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:336-348 [Conf]
  49. Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
    Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:533-542 [Conf]
  50. Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman
    On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:351-359 [Conf]
  51. Michael Kaufmann, Harald Lauer, Heiko Schröder
    Fast Deterministic Hot-Potato Routing on Processor Arrays. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:333-341 [Conf]
  52. Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann
    An efficient algorithm for finding short approximate non-tandem repeats. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2001, pp:5-12 [Conf]
  53. Jop F. Sibeyn, Michael Kaufmann
    Solving Cheap Graph Problems an Meshes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:412-422 [Conf]
  54. Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
    Shorter Queues for Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:597-607 [Conf]
  55. Katharina Anna Lehmann, Michael Kaufmann
    Random Graphs, Small-Worlds and Scale-Free Networks. [Citation Graph (0, 0)][DBLP]
    Peer-to-Peer Systems and Applications, 2005, pp:57-76 [Conf]
  56. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
    Boundary Labelling of Optimal Total Leader Length. [Citation Graph (0, 0)][DBLP]
    Panhellenic Conference on Informatics, 2005, pp:80-89 [Conf]
  57. Martin Schmollinger, Michael Kaufmann
    kappa NUMA: A Model for Clusters of SMP-Machines. [Citation Graph (0, 0)][DBLP]
    PPAM, 2001, pp:42-50 [Conf]
  58. Markus Eiglsperger, Ulrich Fößmeier, Michael Kaufmann
    Orthogonal graph drawing with constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:3-11 [Conf]
  59. Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran R. Subramanian
    Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:832-841 [Conf]
  60. Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
    Derandomizing Algorithms for Routing and Sorting on Meshes. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:669-679 [Conf]
  61. Wolfgang Blochinger, Michael Kaufmann, Martin Siebenhaller
    Visualizing structural properties of irregular parallel computations. [Citation Graph (0, 0)][DBLP]
    SOFTVIS, 2005, pp:125-134 [Conf]
  62. Markus Eiglsperger, Michael Kaufmann, Martin Siebenhaller
    A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram. [Citation Graph (0, 0)][DBLP]
    SOFTVIS, 2003, pp:189-198 [Conf]
  63. Shaodi Gao, Michael Kaufmann, F. Miller Maley
    Advances in Homotopic Layout Compaction. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:273-282 [Conf]
  64. Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn
    Matching the Bisection Bound for Routing and Sorting on the Mesh. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:31-40 [Conf]
  65. Michael Kaufmann, Jop F. Sibeyn
    Deterministic Routing on Circular Arrays. [Citation Graph (0, 0)][DBLP]
    SPDP, 1992, pp:376-383 [Conf]
  66. Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn
    Deterministic Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:284- [Conf]
  67. Michael Kaufmann, Kurt Mehlhorn
    On Local Routing of Two-Terminal Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:40-52 [Conf]
  68. Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang
    Performance Driven k-Layer Wiring. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:489-500 [Conf]
  69. Jop F. Sibeyn, Michael Kaufmann
    Deterministic 1-k Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:237-248 [Conf]
  70. Therese C. Biedl, Goos Kant, Michael Kaufmann
    On Triangulating Planar Graphs under the Four-Connectivity Constraint. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:83-94 [Conf]
  71. Michael Kaufmann, Jop F. Sibeyn
    Optimal Multi-Packet Routing on the Torus. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:118-129 [Conf]
  72. Ezekiel F. Adebiyi, Michael Kaufmann
    Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:140-156 [Conf]
  73. Markus Eiglsperger, Michael Kaufmann
    An Approach for Mixed Upward Planarization. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:352-364 [Conf]
  74. Therese C. Biedl, Michael Kaufmann, Petra Mutzel
    Drawing Planar Partitions II: HH-Drawings. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:124-136 [Conf]
  75. Frank Hoffmann, Michael Kaufmann
    On the Rectilinear Art Gallery Problem - Algorithmic Aspects. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:239-250 [Conf]
  76. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:391-406 [Journal]
  77. Therese C. Biedl, Goos Kant, Michael Kaufmann
    On Triangulating Planar Graphs Under the Four-Connectivity Constraint. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:427-446 [Journal]
  78. Ulrich Fößmeier, Michael Kaufmann
    On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:68-99 [Journal]
  79. Michael Kaufmann, F. Miller Maley
    Parity Conditions in Homotopic Knock-Knee Routing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:1, pp:47-63 [Journal]
  80. Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn
    Routing on Meshes with Buses. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:3, pp:417-444 [Journal]
  81. Michael Kaufmann, Jop F. Sibeyn
    Randomized Multipacket Routing and Sorting on Meshes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:3, pp:224-244 [Journal]
  82. Klaus Reichard, Michael Kaufmann
    EPPS: mining the COG database by an extended phylogenetic patterns search. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:6, pp:784-785 [Journal]
  83. Florian Meereis, Michael Kaufmann
    PCOGR: Phylogenetic COG ranking as an online tool to judge the specificity of COGs with respect to freely definable groups of organisms. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2004, v:5, n:, pp:150- [Journal]
  84. Martin Schmollinger, Kay Nieselt, Michael Kaufmann, Burkhard Morgenstern
    DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2004, v:5, n:, pp:128- [Journal]
  85. Amarendran R. Subramanian, Jan Weyer-Menkhoff, Michael Kaufmann, Burkhard Morgenstern
    DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2005, v:6, n:, pp:66- [Journal]
  86. Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
    Matrix Transpose on Meshes: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1997, v:16, n:2, pp:- [Journal]
  87. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
    Boundary labeling: Models and efficient algorithms for rectangular maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:215-236 [Journal]
  88. Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
    Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:1, pp:93-109 [Journal]
  89. Michael Kaufmann, Gerhard Klär
    Routing in Polygons without Rectilinear Visible Corners [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:102, n:2, pp:218-262 [Journal]
  90. Martin Schmollinger, Michael Kaufmann
    Designing Parallel Algorithms for Hierarchical SMP Clusters. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:1, pp:59-78 [Journal]
  91. Wolfgang Blochinger, Michael Kaufmann, Martin Siebenhaller
    Visualization aided performance tuning of irregular task-parallel computations. [Citation Graph (0, 0)][DBLP]
    Information Visualization, 2006, v:5, n:2, pp:81-94 [Journal]
  92. Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller
    Automatic layout of UML class diagrams in orthogonal style. [Citation Graph (0, 0)][DBLP]
    Information Visualization, 2004, v:3, n:3, pp:189-208 [Journal]
  93. Shaodi Gao, Michael Kaufmann
    Channel Routing of Multiterminal Nets. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:4, pp:791-818 [Journal]
  94. Michael Kaufmann, Kurt Mehlhorn
    Routing Through a Generalized Switchbox. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:4, pp:510-531 [Journal]
  95. Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
    Deterministic Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:111-141 [Journal]
  96. Michael Kaufmann, Kurt Mehlhorn
    On local routing of two-terminal nets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:1, pp:33-72 [Journal]
  97. Michael Kaufmann
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2002, v:6, n:3, pp:177-178 [Journal]
  98. Michael Kaufmann, Roland Wiese
    Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2002, v:6, n:1, pp:115-129 [Journal]
  99. Markus Eiglsperger, Michael Kaufmann, Frank Eppinger
    An Approach for Mixed Upward Planarization. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:2, pp:203-220 [Journal]
  100. Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn
    Routing and Sorting on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:81-95 [Journal]
  101. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:5, pp:1035-1052 [Journal]
  102. Michael Kaufmann, Kurt Mehlhorn
    A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:227-246 [Journal]
  103. Michael Kaufmann
    A linear-time algorithm for routing in a convex grid. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:2, pp:180-184 [Journal]
  104. Ulrik Brandes, Cesim Erten, J. Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, S. Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
    Colored Simultaneous Geometric Embeddings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:254-263 [Conf]
  105. Fabrizio Frati, Markus Geyer, Michael Kaufmann
    Packing and Squeezing Subgraphs into Planar Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:394-405 [Conf]

  106. Polygon labelling of minimum leader length. [Citation Graph (, )][DBLP]


  107. Labeling collinear sites. [Citation Graph (, )][DBLP]


  108. Placing connected components of disconnected graphs. [Citation Graph (, )][DBLP]


  109. On Map Labeling with Leaders. [Citation Graph (, )][DBLP]


  110. Modeling and Designing Real-World Networks. [Citation Graph (, )][DBLP]


  111. Visualization of Complex BPEL Models. [Citation Graph (, )][DBLP]


  112. On the Perspectives Opened by Right Angle Crossing Drawings. [Citation Graph (, )][DBLP]


  113. Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. [Citation Graph (, )][DBLP]


  114. Subdivision Drawings of Hypergraphs. [Citation Graph (, )][DBLP]


  115. Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. [Citation Graph (, )][DBLP]


  116. Line Crossing Minimization on Metro Maps. [Citation Graph (, )][DBLP]


  117. Constrained Simultaneous and Near-Simultaneous Embeddings. [Citation Graph (, )][DBLP]


  118. Polynomial Area Bounds for MST Embeddings of Trees. [Citation Graph (, )][DBLP]


  119. Enhancing Visualizations of Business Processes. [Citation Graph (, )][DBLP]


  120. Optimal Polygonal Representation of Planar Graphs. [Citation Graph (, )][DBLP]


  121. Consistent Minimization of Clustering Objective Functions. [Citation Graph (, )][DBLP]


  122. Computation of Renameable Horn Backdoors. [Citation Graph (, )][DBLP]


  123. A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. [Citation Graph (, )][DBLP]


  124. Drawing activity diagrams. [Citation Graph (, )][DBLP]


  125. Boundary Labeling with Octilinear Leaders. [Citation Graph (, )][DBLP]


  126. Straight-Line Rectangular Drawings of Clustered Graphs. [Citation Graph (, )][DBLP]


  127. An Interactive Layout Tool for BPMN. [Citation Graph (, )][DBLP]


  128. A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis. [Citation Graph (, )][DBLP]


  129. BNDB - The Biochemical Network Database. [Citation Graph (, )][DBLP]


  130. GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments. [Citation Graph (, )][DBLP]


  131. Extension of the COG and arCOG databases by amino acid and nucleotide sequences. [Citation Graph (, )][DBLP]


  132. A New Approach for Boundary Recognition in Geometric Sensor Networks [Citation Graph (, )][DBLP]


  133. On a Tree and a Path with no Geometric Simultaneous Embedding [Citation Graph (, )][DBLP]


  134. Two trees which are self-intersecting when drawn simultaneously. [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002