The following pages link to Éric Colin de Verdière (Q280916):
Displayed 41 items.
- On the complexity of immersed normal surfaces (Q280918) (← links)
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- Conforming Delaunay triangulations in 3D (Q598238) (← links)
- Splitting (complicated) surfaces is hard (Q934027) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- Tutte's barycenter method applied to isotopies (Q1395577) (← links)
- (Q1773895) (redirect page) (← links)
- Optimal system of loops on an orientable surface (Q1773896) (← links)
- Hardness of minimum barrier shrinkage and minimum installation path (Q2192386) (← links)
- Embeddability of arrangements of pseudocircles and graphs on surfaces (Q2197691) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Testing graph isotopy on surfaces (Q2441582) (← links)
- Helly numbers of acyclic families (Q2445970) (← links)
- Irreducible triangulations of surfaces with boundary (Q2637719) (← links)
- Testing graph isotopies on surfaces (Q2874574) (← links)
- Multinerves and helly numbers of acyclic families (Q2874582) (← links)
- A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane (Q2961538) (← links)
- Finding shortest non-trivial cycles in directed graphs on surfaces (Q2970447) (← links)
- Shortest vertex-disjoint two-face paths in planar graphs (Q3189001) (← links)
- Finding Cycles with Topological Properties in Embedded Graphs (Q3225142) (← links)
- Optimal pants decompositions and shortest homotopic cycles on an orientable surface (Q3546339) (← links)
- Tightening non-simple paths and cycles on surfaces (Q3581530) (← links)
- Shortest Cut Graph of a Surface with Prescribed Vertex Set (Q3586387) (← links)
- (Q3601568) (← links)
- Walking your dog in the woods in polynomial time (Q3602907) (← links)
- Conforming Delaunay triangulations in 3D (Q4557555) (← links)
- Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold (Q4575928) (← links)
- (Q4607984) (← links)
- (Q4910718) (← links)
- Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (Q5056419) (← links)
- (Q5115795) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Approximating connectivity domination in weighted bounded-genus graphs (Q5361863) (← links)
- A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane (Q5367029) (← links)
- Tightening Nonsimple Paths and Cycles on Surfaces (Q5390615) (← links)
- Output-sensitive algorithm for the edge-width of an embedded graph (Q5405877) (← links)
- Finding shortest non-trivial cycles in directed graphs on surfaces (Q5405878) (← links)
- Centroidal Voronoi diagrams for isotropic surface remeshing (Q5463312) (← links)
- (Q5881549) (← links)
- Graph Drawing (Q5896916) (← links)