Xavier Goaoc
60
Documents
Presentation
Professor, Laboratoire d'informatique Gaspard Monge, Université Paris Est Marne-la-Vallée
Publications
- 12
- 11
- 10
- 8
- 8
- 8
- 7
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 3
- 4
- 2
- 3
- 3
- 5
- 1
- 5
- 2
- 3
- 2
- 4
- 7
- 3
- 3
- 2
- 1
- 3
- 1
- 8
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
Convexité combinatoireBook sections hal-03130356v1 |
|
Bounding Helly Numbers via Betti NumbersMartin Loebl, Jaroslav Nešetřil, Robin Thomas. A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek , Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp.407-447, 2017, ⟨10.1007/978-3-319-44479-6_17⟩
Book sections
hal-01744167v1
|
|
|
Some Discrete Properties of the Space of Line Transversals to Disjoint BallsI. Emiris, F. Sottile and T. Theobald. Non-linear Computational Geometry, 151, Springer New York, pp.51-84, 2008, The IMA Volumes in Mathematics and its Applications, 978-1-4419-0998-5 (Print) 978-1-4419-0999-2 (Online). ⟨10.1007/978-1-4419-0999-2_3⟩
Book sections
inria-00335946v1
|
A Stepping-Up Lemma for Topological Set SystemsSoCG 2021 - 37th International Symposium on Computational Geometry, Jun 2021, Buffalo/virtual, United States. pp.40:1--40:17, ⟨10.4230/LIPIcs.SoCG.2021.40⟩
Conference papers
hal-03341599v1
|
|
Convex Hulls of Random Order TypesSoCG 2020 - 36th International Symposium on Computational Geometry, Jun 2020, Zürich / Virtual, Switzerland. pp.49:1--49:15, ⟨10.4230/LIPIcs.SoCG.2020.49⟩
Conference papers
hal-02879289v1
|
|
An experimental study of forbidden patterns in geometric permutations by combinatorial lifting35th International Symposium on Computational Geometry, 2019, Portland, United States. ⟨10.4230/LIPIcs.SoCG.2019.40⟩
Conference papers
hal-02050539v1
|
|
Shellability is NP-completeInternational Symposium on Computational Geometry, 2018, Budapest, Hungary
Conference papers
hal-01744101v1
|
|
Consistent Sets of Lines with no Colorful IncidenceSoCG 2018 - 34thInternational Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.1-20
Conference papers
hal-01744125v1
|
|
|
The Number of Holes in the Union of Translates of a Convex Set in Three DimensionsSoCG 2016, Jun 2016, Boston, United States. pp.10:1-10:16
Conference papers
hal-01393017v1
|
Limits of order typesSymposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. pp.876, ⟨10.4230/LIPIcs.SOCG.2015.300⟩
Conference papers
hal-01172466v1
|
|
|
On the smoothed complexity of convex hullsProceedings of the 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. pp.224-238, ⟨10.4230/LIPIcs.SOCG.2015.224⟩
Conference papers
hal-01144473v2
|
|
On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-type Nonembeddability Result31st International Symposium on Computational Geometry (SoCG’15), Jun 2015, Eindhoven, Netherlands. pp.476-490, ⟨10.4230/LIPIcs.SOCG.2015.476⟩
Conference papers
hal-01393019v1
|
Bounding Helly Numbers via Betti NumbersInternational Symposium on Computational Geometry, 2015, Eindhoven, Netherlands. pp.507--521, ⟨10.4230/LIPIcs.SOCG.2015.507⟩
Conference papers
hal-01577897v1
|
|
|
Complexity Analysis of Random Geometric Structures Made Simpler29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩
Conference papers
hal-00833774v1
|
Simplifying inclusion-exclusion formulasEuropean Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy
Conference papers
hal-00764182v1
|
|
|
Multinerves and Helly Numbers of Acyclic FamiliesSymposium on Computational Geometry - SoCG '12, Jun 2012, Chapel Hill, United States. pp.209-218, ⟨10.1145/2261250.2261282⟩
Conference papers
hal-00752073v1
|
|
Admissible Linear Map Models of Linear Cameras23rd IEEE Conference on Computer Vision and Pattern Recognition - CVPR 2010, Jun 2010, San Francisco, United States. pp.1578 - 1585, ⟨10.1109/CVPR.2010.5539784⟩
Conference papers
inria-00517899v1
|
Set Systems and Families of Permutations with Small Traces (abstract)8th French Combinatorial Conference, 2010, France
Conference papers
hal-00620460v1
|
|
|
Computing Direct Shadows Cast by Convex Polyhedra25th European Workshop on Computational Geometry - EuroCG 2009, Mar 2009, Brussels, Belgium
Conference papers
inria-00431544v1
|
|
Lower Bounds for Pinning Lines by Balls (Extended Abstract)European Conference on Combinatorics, Graph Theory and Applications - EuroComb 2009, Sep 2009, Bordeaux, France. pp.567-571, ⟨10.1016/j.endm.2009.07.094⟩
Conference papers
inria-00431437v1
|
|
Helly-type theorems for approximate coveringSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128
Conference papers
inria-00331435v1
|
|
Empty-ellipse graphs19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256
Conference papers
inria-00176204v1
|
|
There are arbitrary large minimal 2-pinning configurationsThe First Asian Association for Algorithms and Computation Annual Meeting - AAAC 08, Apr 2008, Hong-Kong, China
Conference papers
inria-00431768v1
|
|
Moving vertices to make drawings plane15th International Symposium on Graph Drawing, Sep 2007, Sydney, Australia. pp.101-112, ⟨10.1007/978-3-540-77537-9_13⟩
Conference papers
inria-00181775v1
|
|
Line transversals to disjoint balls23rd Annual ACM Symposium on Computational Geometry 2007 - SoCG'07, 2007, Gyeongju, South Korea. pp.245-254, ⟨10.1145/1247069.1247115⟩
Conference papers
inria-00176201v1
|
|
Helly-type Theorems for Line transversals to Disjoint Unit Balls (Extended abstract)European Workshop on Computational Geometry, Mar 2006, Delphi, Greece. pp.87--89
Conference papers
inria-00189019v1
|
|
Hadwiger and Helly-type theorems for disjoint unit spheres in R321st Annual ACM Symposium on Computational Geometry 2005 (SoCG'05 ), Jun 2005, Pisa, Italy. pp.10-15, ⟨10.1145/1064092.1064097⟩
Conference papers
inria-00000206v1
|
|
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3DProceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
Conference papers
inria-00103995v1
|
|
Disjoint Unit Spheres Admit At Most Two Line Transversals11th Annual European Symposium on Algorithms - ESA 2003, Sep 2003, Budapest, Hungary. pp.127-135, ⟨10.1007/b13632⟩
Conference papers
inria-00103857v1
|
|
On the worst-case complexity of the silhouette of a polytope15th Canadian Conference on Computational Geometry - CCCG 2003, 2003, Halifax, Canada, 4 p
Conference papers
inria-00099478v1
|
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
Conference papers
inria-00099449v1
|
|
Transversal Helly numbers, pinning theorems and projection of simplicial complexesComputational Geometry [cs.CG]. Université Henri Poincaré - Nancy I, 2011
Habilitation à diriger des recherches
tel-00650204v2
|