Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03) (pp. 705–715).https://doi.org/10.1007/978-3-540-24587-2_72 
LibreCat: /record/18196
DOI: 10.1007/978-3-540-24587-2_72

Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, &; Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science (Vol. 2748). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-45078-8_13 
LibreCat: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

Dellnitz, M., &; Preis, R. (2003). Congestion and Almost Invariant Sets in Dynamical Systems. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45084-x_8 
LibreCat: /record/16543
DOI: 10.1007/3-540-45084-x_8

Schütze, O. (2003). A New Data Structure for the Nondominance Problem in Multi-objective Optimization. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-36970-8_36 
LibreCat: /record/16664
DOI: 10.1007/3-540-36970-8_36

Schütze, O., Mostaghim, S., Dellnitz, M., &; Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-36970-8_9 
LibreCat: /record/16665
DOI: 10.1007/3-540-36970-8_9

Böttcher, S., &; Steinmetz, R. (2003). Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients. In Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003 (pp. 400–410). Springer.https://doi.org/10.1007/978-3-540-39403-7_30 
LibreCat: /record/15077
DOI: 10.1007/978-3-540-39403-7_30

Böttcher, S., &; Steinmetz, R. (2003). A DTD Graph Based XPath Query Subsumption Test. In Database and XML Technologies, First International XML Database Symposium, XSym 2003 (pp. 85–99). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-39429-7_6 
LibreCat: /record/15078
DOI: 10.1007/978-3-540-39429-7_6

Steiger, C., Walder, H., &; Platzner, M. (2003). Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL) (pp. 575–584). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-45234-8_56 
LibreCat: /record/13615
DOI: 10.1007/978-3-540-45234-8_56

Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG) (pp. 413–420). Berlin, Heidelberg.https://doi.org/10.1007/3-540-36379-3_36 
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

Grünewald, M., Lukovszki, T., Schindelhauer, C., &; Volbert, K. (2002). Distributed Maintenance of Resource Efficient Wireless Network Topologies. Proceedings of the 8th International Euro-Par Conference.https://doi.org/10.1007/3-540-45706-2_134 
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

Hahn, O., Koyro, M., &; Meschut, G. (2002). Lipirea în combinatie cu îmbinarile obtinute prin deformare. Sudura, 2, 10–13.
LibreCat: /record/21050

Adler, M., Räcke, H., Sivadasan, N., Sohler, C., &; Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45465-9_77 
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., &; Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45706-2_133 
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

Meschut, G. (2001). Hybridfügen – Grundlagen, Technologie, Anwendungen. In DVM-Bericht 668 (Vol. 668, pp. 119–134). Berlin.
LibreCat: /record/21009

Czumaj, A., &; Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 493–505.https://doi.org/10.1007/3-540-48224-5_41 
LibreCat: /record/18749
DOI: 10.1007/3-540-48224-5_41

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