Computational Topology

All Items

• 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

• Keeping it sparse: Computing Persistent Homology revisited

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

  6:1-6:26

• Realizable Piecewise Linear Paths of Persistence Diagrams with Reeb Graphs

  Rehab Alharbi, Erin Chambers, Liz Munch

  5:1-5:19

• On Optimal Beyond-Planar Graphs

  Franz Brandenburg

  3:1-3:15

• Embedding Graphs into Two-Dimensional Simplicial Complexes

  Éric Colin de Verdière, Thomas Magnard, Bojan Mohar

  6:1-6:23

• On the Pathwidth of Hyperbolic 3-Manifolds

  Kristóf Huszár

  1:1-1:19