Computing in Geometry and Topology

Original Research Articles

• Edge Sparsification for Geometric Tour Problems

  Sándor Fekete, Phillip Keldenich, Dominik Krupke, Eike Niehs

  1:1-1:23

  • PDF

• Geometric Spanning Trees Minimizing the Wiener Index

  Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph Mitchell

  2:1-2:15

  • PDF

• Aspect Ratio Universal Rectangular Layouts

  Stefan Felsner, Andrew Nathenson, Csaba D. Toth

  3:1-3:24

  • PDF

• On the Number of Compositions of Two Polycubes

  Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda, Günter Rote

  4:1-4:18

  • PDF

• Realizable Piecewise Linear Paths of Persistence Diagrams with Reeb Graphs

  Rehab Alharbi, Erin Chambers, Liz Munch

  5:1-5:19

  • PDF

• Keeping it sparse: Computing Persistent Homology revisited

  Ulrich Bauer, Talha Bin Masood, Barbara Giunti, Guillaume Houry, Michael Kerber, Abhishek Rathod

  6:1-6:26

  • PDF

• Optimal Algorithms for Separating a Polyhedron from its Single-Part Mold

  Prosenjit Bose, Efi Fogel, Tzvika Geft, Dan Halperin, Shahar Shamai

  7:1-7:19

  • PDF

• StreamTable: An Area Proportional Visualization for Tables with Flowing Streams

  Jared Albert Espenant, Debajyoti Mondal

  8:1-8:18

  • PDF

• The Tripartite-Circle Crossing Number of Graphs With Two Small Partition Classes

  Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White

  9:1-9:21

  • PDF