Erin W. Chambers

Guangyu Meng

CoRR, July, 2025

Braiding vineyards.

[BibT_eX]

[DOI]

CoRR, April, 2025

Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs.

[BibT_eX]

[DOI]

CoRR, April, 2025

Drawing Reeb Graphs.

[BibT_eX]

[DOI]

Brittany Terese Fasy

Erfan Hosseini Sereshgi

Maarten Löffler

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

2024

A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Minimum Cuts in Surface Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., February, 2023

Bounding the Interleaving Distance for Geometric Graphs with a Loss Function.

[BibT_eX]

[DOI]

CoRR, 2023

Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Metric and Path-Connectedness Properties of the Fréchet Distance for Paths and Graphs.

[BibT_eX]

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Perceptually grounded quantification of 2D shape complexity.

[BibT_eX]

[DOI]

Vis. Comput., 2022

Comparing Embedded Graphs Using Average Branching Distance.

[BibT_eX]

[DOI]

CoRR, 2022

Topological Simplification of Nested Shapes.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2022

Aggregating community maps.

[BibT_eX]

[DOI]

Moon Duchin

Ranthony A. C. Edmonds

Parker B. Edwards

JN Matthews

Anthony E. Pizzimenti

Chanel Richardson

Parker Rule

Ari Stern

Proceedings of the 30th International Conference on Advances in Geographic Information Systems, 2022

On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class.

[BibT_eX]

[DOI]

Salman Parsa

Hannah Schreiber

Proceedings of the 38th International Symposium on Computational Geometry, 2022

A Cautionary Tale: Burning the Medial Axis Is Unstable (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Reeb Graph Metrics from the Ground Up.

[BibT_eX]

[DOI]

CoRR, 2021

Realizable piecewise linear paths of persistence diagrams with Reeb graphs.

[BibT_eX]

[DOI]

Rehab Alharbi

Elizabeth Munch

CoRR, 2021

Covering a Curve with Subtrajectories.

[BibT_eX]

[DOI]

CoRR, 2021

How to Morph Graphs on the Torus.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A Family of Metrics from the Truncated Smoothing of Reeb Graphs.

[BibT_eX]

[DOI]

Elizabeth Munch

Tim Ophelders

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

To cut or to fill: a global optimization approach to topological simplification.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2020

Low-Stretch Spanning Trees of Graphs with Bounded Width.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Homotopy Height, Grid-Major Height and Graph-Drawing Height.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

On the complexity of optimal homotopies.

[BibT_eX]

[DOI]

Arnaud de Mesmay

Tim Ophelders

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Diversity Across a Decade: A Case Study on Undergraduate Computing Culture at the University of Illinois.

[BibT_eX]

[DOI]

Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Map-matching using shortest paths.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

Some Heuristics for the Homological Simplification Problem.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Burning the Medial Axis.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Global Minimum Cuts in Surface-Embedded Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Erosion thickness on medial axes of 3D shapes.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2016

Homotopy Measures for Representative Trajectories.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Minimum Cycle and Homology Bases of Surface Embedded Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Computing Minimum Area Homologies.

[BibT_eX]

[DOI]

Mikael Vejdemo-Johansson

Comput. Graph. Forum, 2015

Burning the medial axis.

[BibT_eX]

[DOI]

Proceedings of the Special Interest Group on Computer Graphics and Interactive Techniques Conference, 2015

2014

Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs.

[BibT_eX]

[DOI]

Kyle Fox

Discret. Comput. Geom., 2014

Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls.

[BibT_eX]

[DOI]

Glencora Borradaile

Discret. Comput. Geom., 2014

Persistent Homology Over Directed Acyclic Graphs.

[BibT_eX]

[DOI]

David Letscher

CoRR, 2014

2013

Multiple-Source Shortest Paths in Embedded Graphs.

[BibT_eX]

[DOI]

Sergio Cabello

SIAM J. Comput., 2013

Measuring similarity between curves on 2-manifolds via homotopy area.

[BibT_eX]

[DOI]

Yusu Wang

Proceedings of the Symposium on Computational Geometry 2013, 2013

Counting and sampling minimum cuts in genus g graphs.

[BibT_eX]

[DOI]

Kyle Fox

Proceedings of the Symposium on Computational Geometry 2013, 2013

Medial Residues of Piecewise Linear Manifolds.

[BibT_eX]

[DOI]

Tao Ju

David Letscher

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Privacy by Fake Data: A Geometric Approach.

[BibT_eX]

[DOI]

Victor Alvarez

László Kozma

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Unfolding Rectangle-Faced Orthostacks.

[BibT_eX]

[DOI]

Kyle Sykes

Cynthia M. Traub

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Extended grassfire transform on medial axes of 2D shapes.

[BibT_eX]

[DOI]

Comput. Aided Des., 2011

Connecting a Set of Circles with Minimum Sum of Radii.

[BibT_eX]

[DOI]

Sándor P. Fekete

Hella-Franziska Hoffmann

Dimitri Marinakis

Joseph S. B. Mitchell

Srinivasan Venkatesh

Ulrike Stege

Sue Whitesides

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Isotopic Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Vietoris-Rips Complexes of Planar Point Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time.

[BibT_eX]

[DOI]

Éric Colin de Verdière

Comput. Geom., 2010

A simple and robust thinning algorithm on cell complexes.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2010

Connectivity Graphs of Uncertainty Regions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Flows in One-Crossing-Minor-Free Graphs.

[BibT_eX]

[DOI]

David Eppstein

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

Extremal Problems for Roman Domination.

[BibT_eX]

[DOI]

William B. Kinnersley

Noah Prince

Douglas B. West

SIAM J. Discret. Math., 2009

Homology flows, cohomology cuts.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Minimum cuts and shortest homologous cycles.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

On the Height of a Homotopy.

[BibT_eX]

[DOI]

David Letscher

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Computing Interesting Topological Features

[BibT_eX]

[DOI]

PhD thesis, 2008

Pebbling and optimal pebbling in graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

A case study of retention practices at the University of Illinois at Urbana-Champaign.

[BibT_eX]

[DOI]

Tanya L. Crenshaw

Heather Metcalf

Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

Walking your dog in the woods in polynomial time.

[BibT_eX]

[DOI]

Éric Colin de Verdière

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Testing contractibility in planar rips complexes.

[BibT_eX]

[DOI]

Pratik Worah

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Recruitment, Preparation, Retention: A case study of computing culture at the University of Illinois at Urbana-Champaign

[BibT_eX]

[DOI]

CoRR, 2007

Multiple source shortest paths in a genus g graph.

[BibT_eX]

[DOI]

Sergio Cabello

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Splitting (complicated) surfaces is hard.

[BibT_eX]

[DOI]

Éric Colin de Verdière