Garg, J.; Mehta, R.; Vazirani, V. V.; Yazdanbod, S.: Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness. (2014), 25 pp.

Kim, J.; Sarrar, N.; Feldmann, A.: Watching the IPv6 Takeoff from an IXP's Viewpoint. (2014)

Koutra, D.; Kang, U.; Vreeken, J.; Faloutsos, C.: VoG: Summarizing and Understanding Large Graphs. (2014), 13 pp.

Kozlov, Y.; Esturo, J. M.; Seidel, H.-P.; Weinkauf, T.: Regularized Harmonic Surface Deformation. (2014), 9 pp.

Lenzen, C.; Patt-Shamir, B.: Fast Partial Distance Estimation and Applications. (2014), 19 pp.

Pourmiri, A.: Balanced Allocation on Graphs: A Random Walk Approach. (2014), 20 pp.

Senina, A.; Rohrbach, M.; Qiu, W.; Friedrich, A.; Amin, S.; Andriluka, M.; Pinkal, M.; Schiele, B.: Coherent Multi-sentence Video Description with Variable Level of Detail. (2014), 10 pp.

Guo, Z.; Sun, H.: Gossip vs. Markov Chains, and Randomness-efficient Rumor Spreading. (2013), 41 pages, 1 figure. arXiv admin note: substantial text overlap with arXiv:1304.1359 pp.

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

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 pp.

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

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 pp.

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 pp.

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