Dey, T. K.; Mehlhorn, K.; Ramos, E. A.: Curve reconstruction: Connecting dots with good reason. Computational Geometry: Theory and Applications 15 (4), pp. 229 - 244 (2000)

Djidjev, H. N.; Pantziou, G. E.; Zaroliagis, C.: Improved algorithms for dynamic shortest paths. Algorithmica 28 (4), pp. 367 - 389 (2000)

El Kahoui, M.: Deciding Hopf bifurcations by quantifier elimination in a software-component architecture. Journal of Symbolic Computation 30 (2), pp. 161 - 179 (2000)

Fabri, A.; Giezeman, G.-J.; Kettner, L.; Schirra, S.; Schönherr, S.: On the Design of CGAL, a computational geometry algorithms library. Software - Practice and Experience 30 (11), pp. 1167 - 1202 (2000)

Fatourou, P.; Spirakis, P. G.: Efficient Scheduling of Strict Multithreaded Computations. Theory of Computing Systems 33 (3), pp. 173 - 232 (2000)

Feldmann, A.: BLT: Bi-Layer Tracing of HTTP and TCP/IP. Computer Networks 33 (1-6), pp. 321 - 335 (2000)

Fellner, D. W.; Haber, J.; Havemann, S.; Kobbelt, L.; Lensch, H. P. A.; Müller, G.; Peter, I.; Schneider, R.; Seidel, H.-P.; Straßer, W.: Beiträge der Computergraphik zur Realisierung eines verallgemeinerten Dokumentbegriffs. Information technology 42 (6), pp. 8 - 18 (2000)

Ganzinger, H.; Jacquemard, F.; Veanes, M.: Rigid Reachability: The Non-Symmetric Form of Rigid E-unification. International Journal of Foundations of Computer Science 11 (1), pp. 3 - 27 (2000)

Garg, N.; Konjevod, G.; Ravi, R.: Approximation algorithm for the group Steiner tree problem. Journal of Algorithms 37 (1), pp. 66 - 84 (2000)

Goldberg, L. A.; MacKenzie, P. D.; Paterson, M.; Srinivasan, A.: Contention resolution with constant expected delay. Journal of the ACM 42 (6), pp. 1048 - 1096 (2000)

Hagerup, T.: Dynamic algorithms for graphs of bounded treewidth. Algorithmica 27 (3/4), pp. 292 - 315 (2000)

Hagerup, T.: Parallel preprocessing for path queries without concurrent reading. Information and Computation 158 (1), pp. 18 - 28 (2000)

Jaeger, M.: On the complexity of inference about probabilistic relational models. Artificial Intelligence 117, pp. 297 - 308 (2000)

Jung, B.; Lenhof, H.-P.; Müller, P.; Rüb, C.: Simulating synthetic polymer chains in parallel. Future Generation Computer Systems 16 (5), pp. 513 - 522 (2000)

Kececioglu, J.; Lenhof, H.-P.; Mehlhorn, K.; Mutzel, P.; Reinert, K.; Vingron, M.: A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics 104, pp. 143 - 186 (2000)

Khachiyan, L.; Porkolab, L.: Integer optimization on convex semialgebraic sets. Discrete & Computational Geometry 23 (2), pp. 207 - 224 (2000)

Kim, M.-S.; Seidel, H.-P.: Special Issue on Pacific Graphics '99 in Graphical Models. Graphical Models 62 (6), p. 389 (2000)

Kobbelt, L.: Discrete fairing and variational subdivision for freeform surface design. The Visual Computer 16 (3/4), pp. 142 - 158 (2000)

Kohlbacher, O.; Lenhof, H.-P.: BALL - Rapid Software Prototyping in Computational Molecular Biology. Bioinformatics 16 (9), pp. 815 - 824 (2000)

Kontogiannis, S.; Pantziou, G. E.; Spirakis, P. G.; Yung, M.: Robust Parallel Computations through Randomization. Theory of Computing Systems 33 (5/6), pp. 427 - 464 (2000)