Mehlhorn, K.; Neumann, A.; Schmidt, J. M.: Certifying 3-Edge-Connectivity. (2013), 29 pages S.

Boissonnat, J.-D.; Dyer, R.; Ghosh, A.: Delaunay Triangulation of Manifolds. (2013)

Boissonnat, J.-D.; Dyer, R.; Ghosh, A.: Delaunay Stability via Perturbations. (2013)

Doerr, B.; Doerr, C.; Moran, S.; Moran, S.: Simple and Optimal Fault-tolerant Rumor Spreading. (2013)

Duan, R.; Mehlhorn, K.: A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market. (2013), 35 S.

Kobel, A.; Sagraloff, M.: Fast Approximate Polynomial Multipoint Evaluation and Applications. (2013), 18 S.

Sun, H.: Counting Hypergraphs in Data Streams. (2013)

Adamaszek, M.: An Upper Bound Theorem for a Class of Flag Weak Pseudomanifolds. (2013)

Kerber, M.: Embedding the Dual Complex of Hyper-rectangular Partitions. (2013)

Alkassar, E.; Böhme, S.; Mehlhorn, K.; Rizkallah, C.: A Framework for the Verification of Certifying Computations. (2013), publ. in JAR S.

Christodoulou, G.; Mehlhorn, K.; Pyrga, E.: Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. (2013), 17 pages, 2 figures, preliminary version appeared at ESA 2011 S.

Alvarez, V.; Bringmann, K.; Ray, S.: A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations. (2013), 38 pages, 48 figures S.

Bhattacharya, S.; Chalermsook, P.; Mehlhorn, K.; Neumann, A.: New Approximability Results for the Robust k-Median Problem. (2013), 19 pages S.

Bringmann, K.; Engels, C.; Manthey, B.; Rao, R. B. V.: Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. (2013)

Byrka, J.; Fleszar, K.; Rybicki, B.; Spoerhase, J.: Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. (2013), 37 S.

Chatzis, N.; Smaragdakis, G.; Feldmann, A.: On the Importance of Internet eXchange Points for Today's Internet Ecosystem. (2013), 10 S.

Crowston, R.; Jones, M.; Muciaccia, G.; Philip, G.; Rai, A.; Saurabh, S.: Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzík Bound. (2013)

Dolev, D.; Heljanko, K.; Järvisalo, M.; Korhonen, J. H.; Lenzen, C.; Rybicki, J.; Suomela, J.; Wieringa, S.: Synchronous Counting and Computational Algorithm Design. (2013), 35 S.

Erdős, D.; Miettinen, P.: Scalable Boolean Tensor Factorizations using Random Walks. (2013)

Fekete, S. P.; Friedrichs, S.; Kröller, A.; Schmidt, C.: Facets for Art Gallery Problems. (2013), 29 pages, 18 figures, 1 table S.