Researcher Portfolio

Kaufmann, Michael

Algorithms and Complexity, MPI for Informatics, Max Planck Society

Researcher Profile

Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society

Researcher ID: https://pure.mpg.de/cone/persons/resource/persons44745

External references

WorldCat Search for Kaufmann, Michael

Google Scholar Search for Kaufmann, Michael

Publications

(1 - 25 of 29)

Prev12Next

: Biedl, T., Kaufmann, M., & Mutzel, P. (1998). Drawing Planar Partitions II: HH-Drawings. In J. Hromkovic, & O. Sykora (Eds.), Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98) (pp. 124-136). Berlin, Germany: Springer. [PubMan] : Sibeyn, J., & Kaufmann, M.(1997). BSP-like external-memory computation (MPI-I-1997-1-001). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Kaufmann, M., Meyer, U., & Sibeyn, J. F. (1997). Matrix Transpose on Meshes: Theory and Practice. Computers and Artificial Intelligence, 16(2), 107-140. [PubMan] : Kaufmann, M., & Sibeyn, J. F. (1997). Randomized Multipacket Routing and Sorting on Meshes. Algorithmica, 17(3), 224-244. [PubMan] : Sibeyn, J., Kaufmann, M., & Chlebus, B. S. (1997). Deterministic Permutation Routing on Meshes. Journal of Algorithms, 22(1), 111-141. doi:10.1006/jagm.1995.0804. [PubMan] : Kaufmann, M., Raman, R., & Sibeyn, J. F. (1997). Routing on Meshes with Buses. Algorithmica, 18(3), 417-444. [PubMan] : Kaufmann, M., Meyer, U., & Sibeyn, J. F. (1997). Matrix Transpose on Meshes: Theory and Practice. In D. G. Feitelson, & L. Rudolph (Eds.), Proceedings of the 11th International Parallel Processing Symposium (IPPS-97) (pp. 315-319). Los Alamitos, USA: IEEE. [PubMan] : Kaufmann, M., & Sibeyn, J. F. (1995). Solving Cheap Graph Problems on Meshes. In P. Hájek, & J. Wiedermann (Eds.), Mathematical Foundations of Computer Science 1995 (pp. 412-422). Berlin: Springer. [PubMan] : Kaufmann, M., Schröder, H., & Sibeyn, J. (1995). Routing and Sorting on Reconfigurable Meshes. Parallel Processing Letters, 5(1), 81-95. doi:10.1142/S0129626495000084. [PubMan] : Kaufmann, M., Sibeyn, J. F., & Suel, T. (1995). Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. In P. Spirakis (Ed.), Algorithms - ESA '95 (pp. 75-88). Berlin, Germany: Springer. [PubMan] : Kaufmann, M., Meyer, U., & Sibeyn, J. F. (1994). Towards Practical Permutation Routing on Meshes. In Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing (pp. 664-671). Los Alamitos, USA: IEEE. [PubMan] : Kaufmann, M., Meyer, U., & Sibeyn, J. F.(1994). Towards practical permutation routing on meshes (MPI-I-94-153). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Kaufmann, M., & Mehlhorn, K. (1994). A Linear-time Algorithm for the Homotopic Routing Problem in Grid Graphs. SIAM Journal on Computing, 23(2), 227-246. doi:10.1137/S0097539789162109. [PubMan] : Sibeyn, J., Kaufmann, M., & Chlebus, B. S.(1993). Deterministic Permutation Routing on Meshes (MIP-9301). Passau, Germany: Universität Passau. [PubMan] : Sibeyn, J., & Kaufmann, M.(1993). Deterministic 1-k routing on meshes with applications to worm-hole routing (MPI-I-93-163). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Alt, H., Fleischer, R., Kaufmann, M., Mehlhorn, K., Näher, S., Schirra, S., & Uhrig, C. (1992). Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica, 8(5-6), 391-408. doi:10.1007/BF01758853. [PubMan] : Kaufmann, M., & Sibeyn, J. F. (1992). Optimal Multi-packet Routing on the Torus. In O. Nurmi (Ed.), Algorithms Theory - SWAT' 92 (pp. 118-128). Berlin, Germany: Springer. [PubMan] : Kaufmann, M., & Mehlhorn, K. (1992). On Local Routing of Two-terminal Nets. Journal of Combinatorial Theory. Series B, 55(1), 33-72. doi:10.1016/0095-8956(92)90031-R. [PubMan] : Alt, H., Fleischer, R., Kaufmann, M., Mehlhorn, K., Näher, S., Schirra, S., & Uhrig, C. (1990). Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. In Computational geometry (SCG-90): 6th annual symposium (pp. 281-289). New York, USA: ACM. [PubMan] : Kaufmann, M., & Mehlhorn, K.(1989). Routing Problems in Grid Graphs (Local-ID: C1256428004B93B8-521B7133DEAC9C5FC125721B004C359E-mehlhorn89). Bonn, Germany: Teubner. [PubMan] : Kaufmann, M., & Mehlhorn, K.(1989). Routing Problems in Grid Graphs (Local-ID: C1256428004B93B8-7C8F10A2625E42DBC12571EF00400013-mehlhorn89z). Bonn: Institut für Ökonometrie und Operations Research. [PubMan] : Gao, S., Jerrum, M., Kaufmann, M., Mehlhorn, K., & Rülling, W. (1988). On Continuous Homotopic One Layer Routing. In Computational geometry (SCG-88): 4th symposium (pp. 392-402). New York, USA: ACM. [PubMan] : Gao, S., Kaufmann, M., Mehlhorn, K., Rülling, W., Storb, C., & Jerrum, M. (1988). On Continuous Homotopic One Layer Routing (Extended Abstract). In Computational geometry and its applications (CG-88): international workshop (pp. 55-70). Berlin, Germany: Springer. [PubMan] : Kaufmann, M., & Mehlhorn, K.(1988). A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs (Local-ID: C1256428004B93B8-A36B8FDC9FECF482C12571EF003FD0BE-mehlhorn88z). Saarbrücken: SFB Sonderforschungsbereich 124, Universität des Saarlandes. [PubMan] : Kaufmann, M., & Mehlhorn, K. (1987). On Local Routing of Two-Terminal Nets. In F. J. Brandenburg, G. Vidal-Naquet, & M. Wirsing (Eds.), STACS 87 (pp. 40-52). Berlin, Germany: Springer. [PubMan]