Lukovszki, T., Maheshwari, A., &; Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS.https://doi.org/10.1007/3-540-45294-x_21 
LibreCat: /record/18964
DOI: 10.1007/3-540-45294-x_21

Ziegler, M., &; Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000) (Vol. 2064, pp. 378–388). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45335-0_23 
LibreCat: /record/18152
DOI: 10.1007/3-540-45335-0_23

Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45477-2_2 
LibreCat: /record/16493
DOI: 10.1007/3-540-45477-2_2

Meyer auf der Heide, F., &; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45718-6_68 
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer .https://doi.org/10.1007/3-540-44676-1 
LibreCat: /record/16722
DOI: 10.1007/3-540-44676-1

Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45022-x_22 
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Czumaj, A., Sohler, C., &; Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-45253-2_15 
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

Fromme, J., Ganguin, S., Iske, S., Meister, D. M., &; Sander, U. (Eds.). (2000). Medienbildung und Gesellschaft. VS Verlag.
LibreCat: /record/18121

Ziegler, M., &; Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-44411-4_34 
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

Meyer auf der Heide, F., Kutyowski, M., &; Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/3-540-44520-x_59 
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Simon, J., Reinefeld, A., &; Heinz, O. (1999). Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI. In H. Hellwagner &; A. Reinefeld (Eds.), SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters (Vol. 1734, pp. 367–381). Berlin / Heidelberg: Springer.https://doi.org/10.1007/10704208 
LibreCat: /record/2435
DOI: 10.1007/10704208

Koyro, M., &; Meschut, G. (1999). Eine quasistationäre Meßmethode zur Ermittlung der Wärmeleitfähigkeit polymerer Zwischenschichten in Abhängigkeit von der Temperatur. In Tagungsband zur Veranstaltung Werkstoffprüfung 1999 (pp. 173–184).
LibreCat: /record/20992

Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS (pp. 193–204).https://doi.org/10.1007/3-540-48447-7_20 
LibreCat: /record/18959
DOI: 10.1007/3-540-48447-7_20

Meyer auf der Heide, F., Vöcking, B., &; Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg.https://doi.org/10.1007/3-540-48481-7_9 
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Eisenring, M., Platzner, M., &; Thiele, L. (1999). Communication Synthesis for Reconfigurable Embedded Systems. In Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL) (Vol. 1673, pp. 205–214). Springer.https://doi.org/10.1007/978-3-540-48302-1_21 
LibreCat: /record/13608
DOI: 10.1007/978-3-540-48302-1_21

Fischer, M., Lukovszki, T., &; Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’ 98. Berlin, Heidelberg.https://doi.org/10.1007/3-540-68530-8_14 
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

Meyer auf der Heide, F., &; Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg.https://doi.org/10.1007/bfb0054332 
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Platzner, M., &; De Micheli, G. (1998). Acceleration of satisfiability algorithms by reconfigurable hardware. In Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL)  (pp. 69–78). Berlin, Heidelberg: Springer .https://doi.org/10.1007/bfb0055234 
LibreCat: /record/13606
DOI: 10.1007/bfb0055234

Czumaj, A., &; Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97).https://doi.org/10.1007/3-540-63397-9_9 
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-63397-9_5 
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5