Untangling Two Systems of Noncrossing Curves
暂无分享,去创建一个
[1] W. B. R. Lickorish,et al. A Representation of Orientable Combinatorial 3-Manifolds , 1962 .
[2] Stephen G. Kobourov,et al. Simultaneous Embedding of Planar Graphs , 2012, Handbook of Graph Drawing and Visualization.
[3] James R. Munkres,et al. Elements of algebraic topology , 1984 .
[4] Carsten Thomassen,et al. Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.
[5] Anne Verroust-Blondet,et al. Computing a canonical polygonal schema of an orientable triangulated surface , 2001, SCG '01.
[6] Jirí Matousek,et al. Hardness of embedding simplicial complexes in Rd , 2009, SODA.
[7] J. Stillwell. Classical topology and combinatorial group theory , 1980 .
[8] Chee-Keng Yap,et al. Computational complexity of combinatorial surfaces , 1990, SCG '90.
[9] R. Ho. Algebraic Topology , 2022 .
[10] Erik D. Demaine,et al. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.
[11] Benson Farb,et al. A primer on mapping class groups , 2013 .
[12] Marcus Schaefer,et al. Recognizing string graphs in NP , 2002, STOC '02.
[13] J. Hyppolite. At The École Normale Supérieure) , 1962 .
[14] Eric Sedgwick,et al. Decision problems in the space of Dehn fillings , 1998 .
[15] Jeffrey R. Weeks,et al. Conway's ZIP Proof , 1999 .
[16] P. Giblin. Graphs, surfaces, and homology , 1977 .
[17] Jan Kratochvíl,et al. String graphs requiring exponential representations , 1991, J. Comb. Theory, Ser. B.
[18] Benson Farb,et al. A Primer on Mapping Class Groups (Pms-49) , 2011 .
[19] Bojan Mohar,et al. Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs , 2007, Discret. Comput. Geom..
[20] Michael Kaufmann,et al. Journal of Graph Algorithms and Applications Embedding Vertices at Points: Few Bends Suffice for Planar Graphs , 2022 .