MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 26 documents:

  1. Therese Biedl, Michael Kaufmann, and Petra Mutzel
    Drawing Planar Partitions II: HH-Drawings
    In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), Smolenice, June 18-20, 1998, 124-136
  2. Jop F. Sibeyn and Michael Kaufmann
    BSP-Like External-Memory Computation
    In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), Rome, Italy, March 12-14, 1997, 229-240
  3. Jop F. Sibeyn, Michael Kaufmann, and Bogdan S. Chlebus
    Deterministic Permutation Routing on Meshes
    Journal of Algorithms 22 (1): 111-141, 1997
  4. Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
    Matrix Transpose on Meshes: Theory and Practice
    In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), Geneva, Switzerland, April, 1-5, 1997, 315-319
  5. Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
    Matrix Transpose on Meshes: Theory and Practice
    Computers and Artificial Intelligence 16 (2): 107-140, 1997
  6. Jop F. Sibeyn and Michael Kaufmann
    Randomized Multipacket Routing and Sorting on Meshes
    Algorithmica 17: 224-244, 1997
  7. Michael Kaufmann and Jop F. Sibeyn
    Randomized Multipacket Routing and Sorting on Meshes
    Algorithmica 17 (3): 224-244, 1997
  8. Michael Kaufmann, Rajeev Raman, and Jop F. Sibeyn
    Routing on Meshes with Buses
    Algorithmica 18 (3): 417-444, 1997
  9. Michael Kaufmann, Heiko Schröder, and Jop F. Sibeyn
    Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
    Parallel Processing Letters 5 (1): 81-95, 1995
  10. Michael Kaufmann, Jop F. Sibeyn, and Torsten Suel
    Beyond the Worst-Case Bisection Bound: Fast Ranking and Counting on Meshes
    In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 75-88
  11. Michael Kaufmann and Jop F. Sibeyn
    Solving Cheap Graph Problems on Meshes
    In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), Prague, Czech Republic, Augst, 28th - September, 1st, 1995, 412-422
  12. Michael Kaufmann and Kurt Mehlhorn
    A linear-time algorithm for the homotopic routing problem in grid graphs
    SIAM Journal on Computing 23 (2): 227-246, 1994
    [PDF: Download: HomotopicRoutingGridGraphs.pdf]
  13. Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
    Towards Practical Permutation Routing on Meshes
    In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas, October, 26-29, 1994, 656-663
  14. Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
    Algorithmica 8 (5/6): 391-408, 1992. Note: Conference version in Proceedings of 6th ACM Symposium on Computational Geometry, 1990
  15. Michael Kaufmann and Kurt Mehlhorn
    On local routing of two-terminal nets
    Journal of Combinatorial Theory / Series B 55: 33-72, 1992
    [PDF: Download: LocalRoutingTwoTerminalNets.pdf]
  16. Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
    In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 281-289
  17. Michael Kaufmann and Kurt Mehlhorn
    Routing problems in grid graphs
    Institut für Ökonometrie und Operations Research «Bonn», Bonn, 89, 561
  18. Michael Kaufmann and Kurt Mehlhorn
    Routing Problems in Grid Graphs
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 89/05
  19. Michael Kaufmann and Kurt Mehlhorn
    A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 88/17
  20. Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, and Wolfgang Rülling
    On Continuous Homotopic One Layer Routing
    In: Computational geometry (SCG-88) : 4th symposium, Urbana-Champaign, IL, USA, 1988, 392-402
    [PDF: Download: Mehlhorn_a_1988_m.pdf]
  21. Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, and Mark Jerrum
    On Continuous Homotopic One Layer Routing (Extended Abstract)
    In: Computational geometry and its applications (CG-88) : international workshop, Würzburg, FRG, 1988, 55-70
  22. Michael Kaufmann and Kurt Mehlhorn
    On Local Routing of Two-Terminal Nets
    In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, 1987, 40-52
  23. Michael Kaufmann and Kurt Mehlhorn
    On Local Routing of Two-Terminal Nets
    SFB Sonderforschungsbereich.124, Universität des Saarlandes, Saarbrücken/Kaiserslautern, 86/03
  24. Michael Kaufmann and Kurt Mehlhorn
    Routing through a Generalized Switchbox
    Journal of Algorithms 7 (4): 510-531, 1986
    [PDF: Download: RoutingGeneralizedSwitchbox.pdf]
  25. Michael Kaufmann and Kurt Mehlhorn
    Local routing of two-terminal nets is easy
    Universität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 84/12, Extended Abstract
    [PDF: Download: Mehlhorn_SFB_A_84_12.pdf]
  26. Michael Kaufmann and Kurt Mehlhorn
    Routing through a generalized switchbox
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 84/11. Note: Also available as Report in SFB Sonderforschungsbereich 124; Report No 1984/17
    [PDF: Download: Mehlhorn_SFB_124.pdf]