| Publication | Date of Publication | Type |
|---|
Untangling graphs on surfaces | 2024-11-28 | Paper |
scientific article; zbMATH DE number 7662167 (Why is no real title available?) | 2023-03-10 | Paper |
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs Journal of the ACM | 2022-12-08 | Paper |
A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals SIAM Journal on Computing | 2021-02-08 | Paper |
Embeddability of arrangements of pseudocircles and graphs on surfaces Discrete \& Computational Geometry | 2020-09-01 | Paper |
Embedding graphs into two-dimensional simplicial complexes | 2020-08-18 | Paper |
Hardness of minimum barrier shrinkage and minimum installation path Theoretical Computer Science | 2020-08-17 | Paper |
Conforming Delaunay triangulations in 3D Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Deciding contractibility of a non-simple curve on the boundary of a 3-manifold Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Discrete systolic inequalities and decompositions of triangulated surfaces Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals | 2018-03-15 | Paper |
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
Multicuts in planar and bounded-genus graphs with bounded number of terminals Algorithmica | 2017-10-10 | Paper |
Approximating connectivity domination in weighted bounded-genus graphs Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Finding shortest non-trivial cycles in directed graphs on surfaces | 2017-03-30 | Paper |
A direct proof of the strong Hanani-Tutte theorem on the projective plane Lecture Notes in Computer Science | 2017-02-21 | Paper |
On the complexity of immersed normal surfaces Geometry \& Topology | 2016-05-10 | Paper |
Multicuts in planar and bounded-genus graphs with bounded number of terminals Lecture Notes in Computer Science | 2015-11-19 | Paper |
Discrete systolic inequalities and decompositions of triangulated surfaces Discrete \& Computational Geometry | 2015-06-18 | Paper |
Shortest vertex-disjoint two-face paths in planar graphs ACM Transactions on Algorithms | 2014-09-09 | Paper |
Multinerves and Helly numbers of acyclic families Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Testing graph isotopies on surfaces Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Helly numbers of acyclic families Advances in Mathematics | 2014-04-15 | Paper |
Finding shortest non-trivial cycles in directed graphs on surfaces Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Output-sensitive algorithm for the edge-width of an embedded graph Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Testing graph isotopy on surfaces Discrete \& Computational Geometry | 2014-03-25 | Paper |
Irreducible triangulations of surfaces with boundary Graphs and Combinatorics | 2014-02-14 | Paper |
scientific article; zbMATH DE number 6146454 (Why is no real title available?) | 2013-03-19 | Paper |
Algorithms for the edge-width of an embedded graph Computational Geometry | 2012-05-18 | Paper |
Finding cycles with topological properties in embedded graphs SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Tightening nonsimple paths and cycles on surfaces SIAM Journal on Computing | 2011-04-04 | Paper |
Shortest cut graph of a surface with prescribed vertex set Algorithms – ESA 2010 | 2010-09-06 | Paper |
Tightening non-simple paths and cycles on surfaces Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time Computational Geometry | 2009-11-16 | Paper |
Graph Drawing Lecture Notes in Computer Science | 2009-08-11 | Paper |
Walking your dog in the woods in polynomial time Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5506234 (Why is no real title available?) | 2009-02-10 | Paper |
Optimal pants decompositions and shortest homotopic cycles on an orientable surface Journal of the ACM | 2008-12-21 | Paper |
Splitting (complicated) surfaces is hard Computational Geometry | 2008-07-29 | Paper |
Centroidal Voronoi diagrams for isotropic surface remeshing Graphical Models | 2005-08-03 | Paper |
Optimal system of loops on an orientable surface Discrete \& Computational Geometry | 2005-04-28 | Paper |
Conforming Delaunay triangulations in 3D Computational Geometry | 2004-08-06 | Paper |
Tutte's barycenter method applied to isotopies Computational Geometry | 2003-07-01 | Paper |
Computing shortest closed curves on non-orientable surfaces | N/A | Paper |