Filtrer vos résultats
- 32
- 4
- 17
- 16
- 1
- 1
- 1
- 31
- 26
- 5
- 5
- 6
- 3
- 4
- 5
- 2
- 3
- 2
- 1
- 35
- 1
- 26
- 14
- 6
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 36
- 7
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
36 résultats
|
|
|
triés par
|
|
|
Link crossing number is NP-hardJournal of Knot Theory and Its Ramifications, 2020, 29 (06), pp.2050043. ⟨10.1142/S0218216520500431⟩
Article dans une revue
hal-03052885v1
|
||
|
|
Algorithms for Contractibility of Compressed Curves on 3-Manifold BoundariesDiscrete and Computational Geometry, 2022, ⟨10.1007/s00454-022-00411-x⟩
Article dans une revue
hal-03835041v1
|
||
|
|
Constructing monotone homotopies and sweepoutsJournal of Differential Geometry, 2021, 119 (3), ⟨10.4310/jdg/1635368350⟩
Article dans une revue
hal-03679002v1
|
||
|
|
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres38th International Symposium on Computational Geometry (SoCG 2022), Jun 2022, Berlin, Germany. ⟨10.4230/LIPIcs.SoCG.2022.27⟩
Communication dans un congrès
hal-03713060v1
|
||
|
|
A Structural Approach to Tree Decompositions of Knots and Spatial GraphsInternational Symposium on Computational Geometry (SoCG), Jun 2023, Dallas, United States. ⟨10.4230/LIPIcs.SoCG.2023.50⟩
Communication dans un congrès
hal-04235445v1
|
||
|
|
The unbearable hardness of unknottingAdvances in Mathematics, 2021, 35th International Symposium on Computational Geometry (SoCG 2019), 381, pp.107648. ⟨10.1016/j.aim.2021.107648⟩
Article dans une revue
hal-02136935v1
|
||
|
|
On the tree-width of knot diagramsJournal of Computational Geometry, 2019, 10 (1), pp.164-180. ⟨10.20382/jocg.v10i1a6⟩
Article dans une revue
hal-02294742v1
|
||
|
|
Tightening Curves on Surfaces Monotonically with ApplicationsProceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States. pp.747-766, ⟨10.1137/1.9781611975994.46⟩
Communication dans un congrès
hal-03052891v1
|
||
|
|
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface23rd Annual European Symposium on Algorithms, pp.386-398, 2015
Chapitre d'ouvrage
hal-02169505v1
|
||
|
|
Topics in Low-Dimensional Computational TopologyComputational Geometry [cs.CG]. Ecole normale supérieure, 2014. English. ⟨NNT : ⟩
Thèse
tel-04462650v1
|
||
|
|
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded GraphsJournal of the ACM (JACM), 2021, 68 (4), pp.1-26. ⟨10.1145/3450704⟩
Article dans une revue
hal-03432633v1
|
||
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of TerminalsACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.1439-1458
Communication dans un congrès
hal-01649756v1
|
|||
|
|
Almost tight lower bounds for hard cutting problems in embedded graphsSoCG 2019 - 35th International Symposium on Computational Geometry, Jun 2019, Portland, OR, United States
Communication dans un congrès
hal-02136928v1
|
||
Shortest Path Embeddings of Graphs on SurfacesSoCG 2016 - 32nd International Symposium on Computational Geometry, Jun 2016, Boston, MA, United States. pp.43:1--43:16, ⟨10.4230/LIPIcs.SoCG.2016.43⟩
Communication dans un congrès
hal-01355135v1
|
|||
Tightening Curves on Surfaces Via Local MovesACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States
Communication dans un congrès
hal-01649785v1
|
|||
On the complexity of optimal homotopiesACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States
Communication dans un congrès
hal-01649771v1
|
|||
|
|
Finding Non-orientable Surfaces in 3-ManifoldsDiscrete and Computational Geometry, 2017, 58 (4), pp.871--888. ⟨10.1007/s00454-017-9900-0⟩
Article dans une revue
hal-01539682v1
|
||
|
|
Embeddability in R 3 is NP-hardJournal of the ACM (JACM), 2020, 67 (4), pp.1-29. ⟨10.1145/3396593⟩
Article dans une revue
hal-03052877v1
|
||
|
|
Homotopy height, grid-major height and graph-drawing heightGraph Drawing 2019, Sep 2019, Prague, Czech Republic
Communication dans un congrès
hal-02294785v1
|
||
|
|
Fitting Metrics and Ultrametrics with Minimum Disagreements2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), Oct 2022, Denver, United States. pp.301-311, ⟨10.1109/FOCS54457.2022.00035⟩
Communication dans un congrès
hal-04235464v1
|
||
|
|
Short Topological Decompositions of Non-orientable SurfacesDiscrete and Computational Geometry, 2023, ⟨10.1007/s00454-023-00580-3⟩
Article dans une revue
hal-04448733v1
|
||
|
|
Short Topological Decompositions of Non-Orientable Surfaces38th International Symposium on Computational Geometry (SoCG 2022), Jun 2022, Berlin, Germany. ⟨10.4230/LIPIcs.SoCG.2022.41⟩
Communication dans un congrès
hal-03713055v1
|
||
|
|
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries37th International Symposium on Computational Geometry (SoCG 2021), Jun 2021, Buffalo, United States. ⟨10.4230/LIPIcs.SoCG.2021.23⟩
Communication dans un congrès
hal-03432592v1
|
||
|
|
The Bane of Low-Dimensionality ClusteringACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States
Communication dans un congrès
hal-01649763v1
|
||
|
|
Interactions between algorithms, geometry and topology in low dimensionsComputational Geometry [cs.CG]. Paris Est Sup, 2022
HDR
tel-04418597v2
|
||
|
|
Almost tight lower bounds for hard cutting problems in embedded graphsJournal of the ACM (JACM), 2021, 68 (30), pp.1-26. ⟨10.1145/3450704⟩
Article dans une revue
hal-04510609v1
|
||
Embeddability in R^3 is NP-hardACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States
Communication dans un congrès
hal-01649774v1
|
|||
|
|
Exposé Bourbaki 1121 : Nœuds, mouvements de Reidemeister et algorithmes (d'après Lackenby)Asterisque, 2019, 407, pp.27-52. ⟨10.24033/ast.1059⟩
Article dans une revue
hal-02367807v1
|
||
Finding non-orientable surfaces in 3-manifoldsSoCG 2016 - 32nd International Symposium on Computational Geometry, Jun 2016, Boston, MA, United States. pp.24:1--24:15, ⟨10.4230/LIPIcs.SoCG.2016.24⟩
Communication dans un congrès
hal-01355133v1
|
|||
|
|
Shortest path embeddings of graphs on surfacesDiscrete and Computational Geometry, 2017, 58 (4), pp.921--945. ⟨10.1007/s00454-017-9898-3⟩
Article dans une revue
hal-01539791v1
|
- 1
- 2