default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud de Mesmay
Person information
- affiliation: University Gustave Eiffel Marne-la-Vallée, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Jean Chartier, Arnaud de Mesmay
:
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. Discret. Comput. Geom. 71(1): 95-120 (2024)- [j14]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Short Topological Decompositions of Non-orientable Surfaces. Discret. Comput. Geom. 72(2): 783-830 (2024) - [j13]Benjamin A. Burton, Hsien-Chih Chang, Maarten Löffler, Clément Maria, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Jonathan Spreer:
Hard Diagrams of the Unknot. Exp. Math. 33(3): 482-500 (2024) - [c25]Pierre Dehornoy, Corentin Lunel, Arnaud de Mesmay:
Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect. SoCG 2024: 48:1-48:18 - [c24]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang:
A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. SODA 2024: 935-961 - [i28]Maike Buchin, Jean Cardinal, Arnaud de Mesmay, Jonathan Spreer, Alex He:
Triangulations in Geometry and Topology (Dagstuhl Seminar 24072). Dagstuhl Reports 14(2): 120-163 (2024) - 2023
- [j12]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. Discret. Comput. Geom. 70(2): 323-354 (2023) - [j11]Louis Esperet, Sébastien Julliot, Arnaud de Mesmay:
Distributed coloring and the local structure of unit-disk graphs. Theor. Comput. Sci. 944: 113674 (2023) - [c23]Corentin Lunel, Arnaud de Mesmay:
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. SoCG 2023: 50:1-50:16 - [c22]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Degenerate Crossing Number and Signed Reversal Distance. GD (1) 2023: 95-109 - [c21]Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman:
Voting algorithms for unique games on complete graphs. SOSA 2023: 124-136 - [i27]Eunjung Kim, Arnaud de Mesmay, Tillmann Miltzow:
Representing Matroids over the Reals is ∃R-complete. CoRR abs/2301.03221 (2023) - [i26]Corentin Lunel, Arnaud de Mesmay:
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. CoRR abs/2303.07982 (2023) - [i25]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Degenerate crossing number and signed reversal distance. CoRR abs/2308.10666 (2023) - [i24]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang:
A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. CoRR abs/2311.00892 (2023) - [i23]Pierre Dehornoy, Corentin Lunel, Arnaud de Mesmay:
Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect. CoRR abs/2312.09094 (2023) - 2022
- [b2]Arnaud de Mesmay:
Interactions between algorithms, geometry and topology in low dimensions. (Interactions entre les algorithmes, la géométrie et la topologie en basse dimension). University of Paris-Est, Champs-sur-Marne, France, 2022 - [j10]Hsien-Chih Chang, Arnaud de Mesmay:
Tightening Curves on Surfaces Monotonically with Applications. ACM Trans. Algorithms 18(4): 36:1-36:32 (2022) - [c20]Jean Chartier, Arnaud de Mesmay:
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. SoCG 2022: 27:1-27:16 - [c19]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Short Topological Decompositions of Non-Orientable Surfaces. SoCG 2022: 41:1-41:16 - [c18]Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay:
Fitting Metrics and Ultrametrics with Minimum Disagreements. FOCS 2022: 301-311 - [i22]Jean Chartier, Arnaud de Mesmay:
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. CoRR abs/2203.05853 (2022) - [i21]Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Short Topological Decompositions of Non-Orientable Surfaces. CoRR abs/2203.06659 (2022) - [i20]Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay:
Fitting Metrics and Ultrametrics with Minimum Disagreements. CoRR abs/2208.13920 (2022) - [i19]Maike Buchin, Anna Lubiw, Arnaud de Mesmay, Saul Schleimer:
Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062). Dagstuhl Reports 12(2): 17-66 (2022) - 2021
- [j9]Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay:
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. J. ACM 68(4): 30:1-30:26 (2021) - [j8]Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay:
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals. SIAM J. Comput. 50(1): 1-31 (2021) - [c17]Louis Esperet, Sébastien Julliot, Arnaud de Mesmay:
Distributed Coloring and the Local Structure of Unit-Disk Graphs. ALGOSENSORS 2021: 61-75 - [c16]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. SoCG 2021: 23:1-23:16 - [i18]Louis Esperet, Sébastien Julliot, Arnaud de Mesmay:
Distributed coloring and the local structure of unit-disk graphs. CoRR abs/2106.12322 (2021) - [i17]Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman:
Voting algorithms for unique games on complete graphs. CoRR abs/2110.11851 (2021) - 2020
- [j7]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
Embeddability in R3 is NP-hard. J. ACM 67(4): 20:1-20:29 (2020) - [c15]Hsien-Chih Chang, Arnaud de Mesmay:
Tightening Curves on Surfaces Monotonically with Applications. SODA 2020: 747-766 - [i16]Hsien-Chih Chang, Arnaud de Mesmay:
Tightening Curves on Surfaces Monotonically with Applications. CoRR abs/2003.00649 (2020) - [i15]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. CoRR abs/2012.02352 (2020)
2010 – 2019
- 2019
- [j6]Saul Schleimer, Arnaud de Mesmay, Jessica S. Purcell, Eric Sedgwick:
On the tree-width of knot diagrams. J. Comput. Geom. 10(1): 164-180 (2019) - [c14]Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay:
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. SoCG 2019: 27:1-27:16 - [c13]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
The Unbearable Hardness of Unknotting. SoCG 2019: 49:1-49:19 - [c12]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy Height, Grid-Major Height and Graph-Drawing Height. GD 2019: 468-481 - [i14]Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay:
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. CoRR abs/1903.08603 (2019) - [i13]Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick:
Link Crossing Number is NP-hard. CoRR abs/1908.04073 (2019) - [i12]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy height, grid-major height and graph-drawing height. CoRR abs/1908.05706 (2019) - 2018
- [c11]Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann:
Tightening Curves on Surfaces via Local Moves. SODA 2018: 121-135 - [c10]Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman:
The Bane of Low-Dimensionality Clustering. SODA 2018: 441-456 - [c9]Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders:
On the complexity of optimal homotopies. SODA 2018: 1121-1134 - [c8]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
Embeddability in ℝ3 is NP-hard. SODA 2018: 1316-1329 - [c7]Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay:
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. SODA 2018: 1439-1458 - 2017
- [j5]Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding Non-orientable Surfaces in 3-Manifolds. Discret. Comput. Geom. 58(4): 871-888 (2017) - [j4]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. Discret. Comput. Geom. 58(4): 921-945 (2017) - [i11]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
Embeddability in R3 is NP-hard. CoRR abs/1708.07734 (2017) - [i10]Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders:
On the complexity of optimal homotopies. CoRR abs/1711.00788 (2017) - [i9]Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman:
The Bane of Low-Dimensionality Clustering. CoRR abs/1711.01171 (2017) - 2016
- [c6]Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding Non-Orientable Surfaces in 3-Manifolds. SoCG 2016: 24:1-24:15 - [c5]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. SoCG 2016: 43:1-43:16 - [i8]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest path embeddings of graphs on surfaces. CoRR abs/1602.06778 (2016) - [i7]Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding non-orientable surfaces in 3-manifolds. CoRR abs/1602.07907 (2016) - [i6]Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay:
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. CoRR abs/1611.02966 (2016) - 2015
- [j3]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. Discret. Comput. Geom. 53(3): 587-620 (2015) - [c4]Vincent Cohen-Addad, Arnaud de Mesmay:
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. ESA 2015: 386-398 - [i5]Vincent Cohen-Addad, Arnaud de Mesmay:
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. CoRR abs/1507.01688 (2015) - 2014
- [b1]Arnaud de Mesmay:
Topics in Low-Dimensional Computational Topology. (Problèmes de topologie algorithmique en basse dimension). École Normale Supérieure, Paris, France, 2014 - [j2]Éric Colin de Verdière, Arnaud de Mesmay:
Testing Graph Isotopy on Surfaces. Discret. Comput. Geom. 51(1): 171-206 (2014) - [c3]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. SoCG 2014: 335 - [i4]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. CoRR abs/1408.4036 (2014) - [i3]Benjamin A. Burton, Éric Colin de Verdière, Arnaud de Mesmay:
On the Complexity of Immersed Normal Surfaces. CoRR abs/1412.4988 (2014) - 2013
- [j1]James R. Lee, Arnaud de Mesmay, Mohammad Moharrami:
Dimension Reduction for Finite Trees in ℓ 1. Discret. Comput. Geom. 50(4): 977-1032 (2013) - [i2]Éric Colin de Verdière, Arnaud de Mesmay:
Testing Graph Isotopy on Surfaces. CoRR abs/1310.2745 (2013) - 2012
- [c2]Arnaud de Mesmay, Éric Colin de Verdière:
Testing graph isotopies on surfaces. SCG 2012: 141-150 - [c1]James R. Lee, Arnaud de Mesmay, Mohammad Moharrami:
Dimension reduction for finite trees in l1. SODA 2012: 43-50 - 2011
- [i1]James R. Lee, Arnaud de Mesmay, Mohammad Moharrami:
Dimension reduction for finite trees in L_1. CoRR abs/1108.2290 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 02:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
