Your search returned the following 26 documents:

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