Amaldi, E.; Iuliano, C.; Jurkiewicz, T.; Mehlhorn, K.; Rizzi, R.: Improved Minimum Cycle Bases Algorithms by Restriction to Isometric Cycles. (2011)

Arora, D.; Bienkowski, M.; Feldmann, A.; Schaffrath, G.; Schmid, S.: Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks. (2011), 13 S.

Gao, P.; Su, Y.; Wormald, N.: Induced Subgraphs in Sparse Random Graphs with Given Degree Sequence. (2010), 31 pages, 11 figures S.

Andres, B.; Kappes, J. H.; Koethe, U.; Hamprecht, F. A.: The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search. (2010), 20 S.

Fountoulakis, N.; Panagiotou, K.; Steger, A.: On the Insertion Time of Cuckoo Hashing. (2010), 27 pages, final version accepted by the SIAM Journal on Computing S.

Andres, B.; Koethe, U.; Kroeger, T.; Hamprecht, F. A.: Runtime-flexible Multi-dimensional Arrays and Views for C++98 and C++0x. (2010)

Andres, B.; Koethe, U.; Kroeger, T.; Hamprecht, F. A.: How to Extract the Geometry and Topology from Very Large 3D Segmentations. (2010)

Arora, D.; Feldmann, A.; Schaffrath, G.; Schmid, S.: On the Benefit of Virtualization: Strategies for Flexible Server Allocation. (2010), 10 S.

Gao, P.; Wormald, N.: Orientability Thresholds for Random Hypergraphs. (2010), 47 pages, 1 figures, the journal version of [16] S.

Schaffrath, G.; Schmid, S.; Feldmann, A.: Generalized and Resource-Efficient VNet Embeddings with Migrations. (2010), 11 S.

Hemmer, M.: Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4. (2009)

Sarma, A. D.; Nanongkai, D.; Pandurangan, G.; Tetali, P.: Efficient Distributed Random Walks with Applications. (2009), 27 S.

Boros, E.; Elbassioni, K.; Gurvich, V.; Tiwary, H. R.: Characterization of the Vertices and Extreme Directions of the Negative Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra. (2008), Title typo fixed S.

Elbassioni, K.; Tiwary, H. R.: On Computing the Vertex Centroid of a Polyhedron. (2008)

Elmasry, A.: The Violation Heap: A Relaxed Fibonacci-Like Heap. (2008), 10 pages S.

Fountoulakis, N.: Percolation on sparse random graphs with given degree sequence. (2007), 20 pages S.

Hebbinghaus, N.: Discrepancy of Sums of two Arithmetic Progressions. (2007), 15 pages, 0 figures S.

Cooper, J.; Doerr, B.; Spencer, J.; Tardos, G.: Deterministic Random Walks on the Integers. (2006), 27 S.

Mehlhorn, K.; Michail, D.: Network Problems with Non-Polynomial Weights And Applications. (2005)

Mehlhorn, K.: A Remark on the Sign Variation Method for Real Root Isolation. (2001)