Dinitz, Y.; Garg, N.; Goemans, M. X.: On the single-source unsplittable flow problem. Combinatorica 19 (1), pp. 17 - 41 (1999)

Dinitz, Y.; Nutov, Z.: A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs. Journal of Algorithms 32 (1), pp. 21 - 30 (1999)

Eisenbrand, F.: On the Membership Problem for the Elementary Closure of a Polyhedron. Combinatorica 19 (2), pp. 297 - 300 (1999)

Fleischer, R.: Decision trees: old and new results. Information and Computation 152, pp. 44 - 61 (1999)

Gilbert, A. C.; Willinger, W.; Feldmann, A.: Scaling Analysis of Conservative Cascades, with Applications to Network Traffic. IEEE Transactions on Information Theory 45 (3), pp. 971 - 991 (1999)

Gupta, P.; Janardan, R.; Smid, M.: Efficient algorithms for counting and reporting pairwise intersections between convex polygons. Information Processing Letters 69 (1), pp. 7 - 13 (1999)

Gurevich, Y.; Veanes, M.: Logic with Equality: Partisan Corroboration and Shifted Pairing. Information and Computation 152 (2), pp. 205 - 235 (1999)

Hert, S.; Lumelsky, V.: Motion Planning in R3 for Multiple Tethered Robots. IEEE Transactions on Robotics and Automation 15 (4), pp. 623 - 639 (1999)

Hustadt, U.; Schmidt, R. A.: An Empirical Analysis of Modal Theorem Provers. Journal of Applied Non-Classical Logics 9 (4), pp. 479 - 522 (1999)

Kagaris, D.; Pantziou, G. E.; Tragoudas, S.; Zaroliagis, C.: Transmissions in a network with capacities and delays. Networks 33 (3), pp. 167 - 174 (1999)

Kobbelt, L. P.; Vorsatz, J.; Seidel, H.-P.: Multiresolution Hierarchies on Unstructured Triangle Meshes. Computational Geometry: Theory and Applications 14 (1-3), pp. 5 - 24 (1999)

Krysta, P.; Pacholski, L.: The STO problem is NP-complete. Journal of Symbolic Computation 27 (2), pp. 207 - 219 (1999)

Lenhof, H.-P.; Morgenstern, B.; Reinert, K.: An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinformatics 15 (3), pp. 203 - 210 (1999)

Madden, P.; Bundy, A.; Smaill, A.: Recursive Program Optimization Through Inductive Synthesis Proof Transformation. Journal of Automated Reasoning 22 (1), pp. 65 - 115 (1999)

Marcil, M.; Brooks-Wilson, A.; Clee, S. M.; Roomp, K.; Zhang, L.-H.; Yu, L.; Collins, J. A.; van Dam, M.; Molhuizen, H. O.; Loubser, O. et al.; Ouelette, B. F.; Sensen, C. W.; Fichter, K.; Mott, S.; Denis, M.; Boucher, B.; Pimstone, S.; Genest, J.; Kastelein, J. J. P.; Hayden, M. R.: Mutations in the ABC1 gene in familial HDL deficiency with defective cholesterol efflux. The Lancet 354 (9187), pp. 1341 - 6 (1999)

Mehlhorn, K.; Näher, S.; Seel, M.; Seidel, R.; Schilz, T.; Schirra, S.; Uhrig, C.: Checking geometric programs or verification of geometric structures. Computational Geometry: Theory and Applications 12, pp. 85 - 104 (1999)

Mehlhorn, K.; Sack, J.-R.; Urrutia, J.: Editorial. Computational Geometry 12, pp. 153 - 154 (1999)

O'Neil, E. J.; O'Neil, P. E.; Weikum, G.: An Optimality Proof of the LRU-K Page Replacement Algorithm. Journal of the ACM 46 (1), pp. 92 - 112 (1999)

Rathe, U.; Sanders, P.; Knight, P.: A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation. Parallel Computing 25 (5), pp. 525 - 534 (1999)

Sanders, P.: Analysis of nearest neighbor load balancing algorithms for random loads. Parallel Computing 25, pp. 1013 - 1033 (1999)