Wissenschaftliche Publikationen

Albers, S.: Better bounds for online scheduling. SIAM Journal on Computing 29 (2), S. 459 - 473 (1999)

Arikati, S. R.; Mehlhorn, K.: A Correctness Certificate for the Stoer-Wagner Min-cut Algorithm. Information Processing Letters 70 (5), S. 251 - 254 (1999)

Arya, S.; Golin, M. J.; Mehlhorn, K.: On the Expected Depth of Random Circuits. Combinatorics, Probability and Computing 8 (3), S. 209 - 228 (1999)

Auletta, V.; Dinitz, Y.; Nutov, Z.; Parente, D.: A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. Journal of Algorithms 32 (1), S. 21 - 30 (1999)

Basin, D. A.; Friedrich, S.: Modeling a Hardware Synthesis Methodology in Isabelle. Formal Methods in Systems Design 15 (2), S. 99 - 122 (1999)

Blackburn, P.; Tzakova, M.: Hybrid Languages and Temporal Logic. Logic Journal of the IGPL 7 (1), S. 27 - 54 (1999)

Bockmayr, A.; Eisenbrand, F.; Hartmann, M.; Schulz, A. S.: On the Chvátal Rank of Polytopes in the 0/1 Cube. Discrete applied mathematics 98 (1/2), S. 21 - 27 (1999)

Brooks-Wilson, A.; Marcil, M.; Clee, S. M.; Zhang, L.-H.; Roomp, K.; van Dam, M.; Yu, L.; Brewer, C.; Collins, J. A.; Molhuizen, H.O. et al.; Loubser, O.; Ouelette, B.F.; Fichter, K.; Ashbourne-Excoffon, K.J.; Sensen, C.W.; Scherer, S.; Mott, S.; Denis, M.; Martindale, D.; Frohlich, J.; Morgan, K.; Koop, B.; Pimstone, S.; Kastelein, J.J.P.; Hayden, M. R.: Mutations in ABC1 in Tangier disease and familial high-density lipoprotein. Nature Genetics 22 (4), S. 336 - 45 (1999)

Buchmann, J.; Eisenbrand, F.: On Factor Refinement in Number Fields. Mathematics of Computation 68 (225), S. 345 - 350 (1999)

Cheriyan, J.; Mehlhorn, K.: An Analysis of the Highest-level Selection rule in the Preflow-push Max-flow Algorithm. Information Processing Letters 69 (5), S. 239 - 242 (1999)

Coquillart, S.; Seidel, H.-P.: Editorial. Computer Graphics Forum 18 (4), S. 200 (1999)

Delzanno, G.; Galmiche, D.; Martelli, M.: A specification logic for concurrent object-oriented programming. Mathematical Structures in Computer Science 9 (3), S. 253 - 286 (1999)

Dinitz, Y.; Garg, N.; Goemans, M. X.: On the single-source unsplittable flow problem. Combinatorica 19 (1), S. 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), S. 21 - 30 (1999)

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

Fleischer, R.: Decision trees: old and new results. Information and Computation 152, S. 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), S. 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), S. 7 - 13 (1999)

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

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