The list of accepted papers for SOCG 2012 has been released. By my admittedly liberal count, 21 of the 44 accepted papers qualify as computational

*topology*. Maybe it's time to add "...and Topology" to the name of the conference!(Ha, ha, only serious.)

- Michal Adamaszek and Juraj Stacho.

Algorithmic complexity of finding cross-cycles in flag complexes - Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen Kobourov and Torsten Ueckerdt.

Computing Cartograms with Optimal Complexity - Therese Biedl and Martin Vatshelle.

The point-set embeddability problem for plane graphs - Jean-Daniel Boissonnat, Ramsay Dyer and Arijit Ghosh.

Stability of Delaunay-type structures for manifolds - Ciprian Borcea, Ileana Streinu, and Shin-Ichi Tanigawa.

Periodic body-and-bar frameworks - Guillermo D. Canas and Steven Gortler.

Duals of Orphan-Free Anisotropic Voronoi Diagrams are Triangulations - Siu-Wing Cheng, Jiongxin Jin, and Man-Kit Lau.

A Fast and Simple Surface Reconstruction Algorithm - Éric Colin De Verdière, Grégory Ginot, and Xavier Goaoc.

Multinerves and Helly numbers of acyclic families - Éric Colin De Verdière and Arnaud De Mesmay.

Testing graph isotopy on surfaces - Herbert Edelsbrunner, Brittany Terese Fasy, and Günter Rote.

Add Isotropic Gaussian Kernels at Own Risk: More and More Resiliant Modes in Higher Dimensions - Herbert Edelsbrunner and Michael Kerber.

Alexander Duality for Functions: the Persistent Behavior of Land and Water and Shore - Jeff Erickson and Amir Nayyeri.

Tracing Compressed Curves in Triangulated Surfaces - Silvia Fernandez, Bernardo M. Abrego, Oswin Aichholzer, Pedro Ramos, and Gelasio Salazar.

The 2-page crossing number of $K_{n}$ - Anna Gundert and Uli Wagner.

On Laplacians of Random Complexes - Sariel Har-Peled, Amir Nayyeri, Mohammad Salavatipour, and Anastasios Sidiropoulos.

How to Walk Your Dog in the Mountains with No Magic Leash - Salman Parsa.

A Deterministic O(m log m) Time Algorithm for the Reeb Graph - Jens M. Schmidt and Pavel Valtr.

Cubic Plane Graphs on a Given Point Set. - Micha Sharir, Adam Sheffer, and Emo Welzl.

Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique - Don Sheehy.

Linear-Size Approximations to the Vietoris-Rips Filtration - Andrew Suk.

Disjoint edges in complete topological graphs - Amit Chattopadhyay, Gert Vegter, and Chee Yap.

Certified Computation of planar Morse-Smale Complexes of Smooth Functions

## Comments