Result 1 to 20 of 76 total
Algorithms for the edge-width of an embedded graph. (English)
Comput. Geom. 45, No. 5-6, 215-224 (2012).
1
Essential self-adjointness for combinatorial Schrödinger operators. II. Metrically non complete graphs. (English)
Math. Phys. Anal. Geom. 14, No. 1, 21-38 (2011).
2
Finding cycles with topological properties in embedded graphs. (English)
SIAM J. Discrete Math. 25, No. 4, 1600-1614 (2011).
3
Essential self-adjointness for combinatorial Schrödinger operators. III: Magnetic fields. (English)
Ann. Fac. Sci. Toulouse, Math. (6) 20, No. 3, 599-611 (2011).
4
Introduction to GPGPU, a hardware and software background. (English)
C. R., Méc., Acad. Sci. Paris 339, No. 2-3, 78-89 (2011).
5
Irreducible triangulations of surfaces with boundary. (English)
Comput. Res. Repos. 2011, Article No. 1103.5364 (2011).
6
Helly numbers of acyclic families. (English)
Comput. Res. Repos. 2011, Article No. 1101.6006 (2011).
7
Shortest vertex-disjoint two-face paths in planar graphs (English)
ACM Transactions on Algorithms 7, No. 2, 19 (2011).
8
Tightening nonsimple paths and cycles on surfaces. (English)
SIAM J. Comput. 39, No. 8, 3784-3813 (2010).
9
Shortest cut graph of a surface with prescribed vertex set. (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-15780-6/pbk). Lecture Notes in Computer Science 6347, 100-111 (2010).
10
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. (English)
Comput. Geom. 43, No. 3, 295-311 (2010).
11
Shortest cut graph of a surface with prescribed vertex set (English)
ESA (2), 100-111 (2010).
12
Output-sensitive algorithm for the edge-width of an embedded graph (English)
Symposium on Computational Geometry, 147-155 (2010).
13
Finding shortest non-trivial cycles in directed graphs on surfaces (English)
Symposium on Computational Geometry, 156-165 (2010).
14
Semiclassical analysis and passive imaging. (English)
Nonlinearity 22, No. 6, R45-R75 (2009).
15
Walking your dog in the woods in polynomial time. (English)
Proceedings of the twenty-fourth annual symposium on computational geometry 2008 (SCG’08), College Park, MD, USA, June 09‒11, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-071-5). 101-109 (2008).
16
Shortest vertex-disjoint two-face paths in planar graphs. (English)
Comput. Res. Repos. 2008, Article No. 0802.2845 (2008).
17
Splitting (complicated) surfaces is hard. (English)
Comput. Geom. 41, No. 1-2, 94-110 (2008).
18
Symplectic geometry, minors and graph Laplacians (English)
Electronic Notes in Discrete Mathematics 31, 219-220 (2008).
19
Walking your dog in the Woods in polynomial time (English)
Symposium on Computational Geometry, 101-109 (2008).
20
Result 1 to 20 of 76 total
Start
Contact
Print
General Help
