Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Mesmay, Arnaud de
90  Ergebnisse:
Personensuche X
?
1

Short Topological Decompositions of Non-orientable Surfaces:

Fuladi, Niloufar ; Hubard, Alfredo ; de Mesmay, Arnaud
Discrete & Computational Geometry.  , 2023
Link: https://doi.org/10.1007/..
 
?
2

Finding Weakly Simple Closed Quasigeodesics on Polyhedral S..:

Chartier, Jean ; de Mesmay, Arnaud
Discrete & Computational Geometry.  71 (2023)  1 - p. 95-120 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Degenerate Crossing Number and Signed Reversal Distance:

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Fuladi, Niloufar ; Hubard, Alfredo ; de Mesmay, Arnaud - p. 95-109 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Distributed coloring and the local structure of unit-disk g..:

Esperet, Louis ; Julliot, Sébastien ; de Mesmay, Arnaud
Theoretical Computer Science.  944 (2023)  - p. 113674 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Tightening Curves on Surfaces Monotonically with Applicatio..:

Chang, Hsien-Chih ; de Mesmay, Arnaud
ACM Transactions on Algorithms.  18 (2022)  4 - p. 1-32 , 2022
Link: https://doi.org/10.1145/..
 
?
6

Algorithms for Contractibility of Compressed Curves on 3-Ma..:

Chambers, Erin Wolf ; Lazarus, Francis ; de Mesmay, Arnaud.
Discrete & Computational Geometry.  70 (2022)  2 - p. 323-354 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Fitting Metrics and Ultrametrics with Minimum Disagreements:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Cohen-Addad, Vincent ; Fan, Chenglin ; Lee, Euiwoong. - p. 301-311 , 2022
Link: https://doi.org/10.1109/..
 
?
8

Distributed Coloring and the Local Structure of Unit-Disk G..:

, In: Algorithms for Sensor Systems; Lecture Notes in Computer Science,
Esperet, Louis ; Julliot, Sébastien ; de Mesmay, Arnaud - p. 61-75 , 2021
Link: https://doi.org/10.1007/..
 
?
9

The unbearable hardness of unknotting:

de Mesmay, Arnaud ; Rieck, Yo'av ; Sedgwick, Eric.
Advances in Mathematics.  381 (2021)  - p. 107648 , 2021
Link: https://doi.org/10.1016/..
 
?
10

Almost Tight Lower Bounds for Hard Cutting Problems in Embe..:

Cohen-Addad, Vincent ; de Verdière, Éric Colin ; Marx, Dániel.
Journal of the ACM.  68 (2021)  4 - p. 1-26 , 2021
Link: https://doi.org/10.1145/..
 
?
11

A Near-Linear Approximation Scheme for Multicuts of Embedde..:

Cohen-Addad, Vincent ; Colin de Verdière, Éric ; de Mesmay, Arnaud
SIAM Journal on Computing.  50 (2021)  1 - p. 1-31 , 2021
Link: https://doi.org/10.1137/..
 
?
12

Embeddability in R3is NP-hard:

Mesmay, Arnaud de ; Rieck, Yo'av ; Sedgwick, Eric.
Journal of the ACM.  67 (2020)  4 - p. 1-29 , 2020
Link: https://doi.org/10.1145/..
 
?
13

Embeddability in R3 is NP-hard:

Mesmay, Arnaud de ; Rieck, Yo'av ; Sedgwick, Eric.
Journal of the ACM (JACM).  67 (2020)  4 - p. 1-29 , 2020
Link: https://dl.acm.org/doi/1..
 
?
14

Tightening curves on surfaces monotonically with applicatio..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Chang, Hsien-Chih ; de Mesmay, Arnaud - p. 747-766 , 2020
Link: https://dl.acm.org/doi/1..
 
?
15

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

, In: Lecture Notes in Computer Science; Graph Drawing and Network Visualization,
Biedl, Therese ; Chambers, Erin Wolf ; Eppstein, David.. - p. 468-481 , 2019
Link: https://doi.org/10.1007/..
 
1-15