Reachability by paths of bounded curvature in convex polygons. - Hee-Kap Ahn; Otfried Cheong; Jirí Matousek 001; Antoine Vigneron (SCG, 2000)

An algorithm for finding a k-median in a directed tree. - Antoine Vigneron; Lixin Gao; Mordecai J. Golin; Giuseppe F. Italiano; Bo Li 001 (Inf. Process. Lett., 2000)

An elementary algorithm for reporting intersections of red/blue curve segments. - Jean-Daniel Boissonnat; Antoine Vigneron (Comput. Geom., 2002)

Reporting intersections among thick objects. - Antoine Vigneron (Inf. Process. Lett., 2003)

Computing farthest neighbors on a convex polytope. - Otfried Cheong; Chan-Su Shin; Antoine Vigneron (Theor. Comput. Sci., 2003)

Polynomial time algorithms for three-label point labeling. - Rob Duncan; Jianbo Qian; Antoine Vigneron; Binhai Zhu (Theor. Comput. Sci., 2003)

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. - Hee-Kap Ahn; Peter Braß; Otfried Cheong; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (COCOON, 2004)

Packing two disks into a polygonal environment. - Prosenjit Bose; Pat Morin; Antoine Vigneron (J. Discrete Algorithms, 2004)

A practical approach to approximating diameter of point-set in low dimensions. - Kumar Gaurav Bijay; Antoine Vigneron (CCCG, 2005)

Sparse Geometric Graphs with Small Dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Antoine Vigneron (ISAAC, 2005)

The Voronoi Diagram of Curved Objects. - Helmut Alt; Otfried Cheong; Antoine Vigneron (Discret. Comput. Geom., 2005)

Lower Bounds for Geometric Diameter Problems. - Hervé Fournier; Antoine Vigneron (LATIN, 2006)

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. - Hee-Kap Ahn; Peter Braß; Otfried Cheong; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2006)

Motorcycle Graphs and Straight Skeletons. - Siu-Wing Cheng; Antoine Vigneron (Algorithmica, 2007)

A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. - Hervé Fournier; Antoine Vigneron (Algorithmica, 2007)

Maximizing the overlap of two planar convex sets under rigid motions. - Hee-Kap Ahn; Otfried Cheong; Chong-Dae Park; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2007)

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. - Sunil Arya; David M. Mount; Antoine Vigneron; Jian Xia (ESA, 2008)

Sparse geometric graphs with small dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Michiel H. M. Smid; Antoine Vigneron (Comput. Geom., 2008)

Approximate Shortest Paths in Anisotropic Regions. - Siu-Wing Cheng; Hyeon-Suk Na; Antoine Vigneron; Yajun Wang 001 (SIAM J. Comput., 2008)

Computing k-Centers On a Line - Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (CoRR, 2009)

Querying Approximate Shortest Paths in Anisotropic Regions. - Siu-Wing Cheng; Hyeon-Suk Na; Antoine Vigneron; Yajun Wang 001 (SIAM J. Comput., 2010)

Generating Realistic Roofs over a Rectilinear Polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (ISAAC, 2011)

Fitting a Step Function to a Point Set. - Hervé Fournier; Antoine Vigneron (Algorithmica, 2011)

The Aligned k-Center Problem. - Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2011)

Reverse Nearest Neighbor Queries in Fixed Dimension. - Otfried Cheong; Antoine Vigneron; Juyoung Yon (Int. J. Comput. Geom. Appl., 2011)

Reachability by paths of bounded curvature in a convex polygon. - Hee-Kap Ahn; Otfried Cheong; Jirí Matousek 001; Antoine Vigneron (Comput. Geom., 2012)

Computing the Discrete FRéChet Distance with Imprecise Input. - Hee-Kap Ahn; Christian Knauer; Marc Scherfenberg; Lena Schlipf; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2012)

Approximate Shortest Homotopic Paths in Weighted Regions. - Siu-Wing Cheng; Jiongxin Jin; Antoine Vigneron; Yajun Wang 001 (Int. J. Comput. Geom. Appl., 2012)

Realistic roofs over a rectilinear polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

Covering and piercing disks with two centers. - Hee-Kap Ahn; Sang-Sub Kim 001; Christian Knauer; Lena Schlipf; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

A deterministic algorithm for fitting a step function to a weighted point-set. - Hervé Fournier; Antoine Vigneron (Inf. Process. Lett., 2013)

A Generalization of the Convex Kakeya Problem. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson; Takeshi Tokuyama; Antoine Vigneron (Algorithmica, 2014)

A Faster Algorithm for Computing Motorcycle Graphs. - Antoine Vigneron; Lie Yan (Discret. Comput. Geom., 2014)

Guest Editors' Foreword. - Hee-Kap Ahn; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2014)

Geometric optimization and sums of algebraic functions. - Antoine Vigneron (ACM Trans. Algorithms, 2014)

A New Trajectory Similarity Measure for GPS Data. - Anas Ismail; Antoine Vigneron (IWGS, 2015)

Triangulation Refinement and Approximate Shortest Paths in Weighted Regions. - Siu-Wing Cheng; Jiongxin Jin; Antoine Vigneron (SODA, 2015)

Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons. - Sang Won Bae 001; Chan-Su Shin; Antoine Vigneron (CoRR, 2015)

Computing the Gromov hyperbolicity of a discrete metric space. - Hervé Fournier; Anas Ismail; Antoine Vigneron (Inf. Process. Lett., 2015)

A Faster Algorithm for Computing Straight Skeletons. - Siu-Wing Cheng; Liam Mencel; Antoine Vigneron (ACM Trans. Algorithms, 2016)

Reachability in a Planar Subdivision with Direction Constraints. - Daniel Binham; Pedro Machado Manhães de Castro; Antoine Vigneron (SoCG, 2017)

Navigating Weighted Regions with Scattered Skinny Tetrahedra. - Siu-Wing Cheng; Man-Kwun Chiu; Jiongxin Jin; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2017)

Finding Largest Common Point Sets. - Juyoung Yon; Siu-Wing Cheng; Otfried Cheong; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2017)

Faster algorithms for growing prioritized disks and rectangles. - Hee-Kap Ahn; Sang Won Bae 001; Jong Min Choi; Matias Korman; Wolfgang Mulzer; Eunjin Oh 001; Ji-won Park; André van Renssen; Antoine Vigneron (Comput. Geom., 2019)

Tight bounds for beacon-based coverage in simple rectilinear polygons. - Sang Won Bae 001; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2019)

Approximating a planar convex set using a sparse grid. - Aditya Bhaskara; Antoine Vigneron (Inf. Process. Lett., 2019)

A Simulated Annealing Approach to Coordinated Motion Planning (CG Challenge). - Hyeyun Yang; Antoine Vigneron (SoCG, 2021)

Pattern Matching in Doubling Spaces. - Corentin Allair; Antoine Vigneron (WADS, 2021)

Matching sets of line segments. - Hyeyun Yang; Antoine Vigneron (Theor. Comput. Sci., 2021)

Coordinated Path Planning through Local Search and Simulated Annealing. - Hyeyun Yang; Antoine Vigneron (ACM J. Exp. Algorithmics, 2022)

Maximum Coverage by k Lines. - Chaeyoon Chung; Antoine Vigneron; Hee-Kap Ahn (Symmetry, 2024)

Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces. - Eunku Park; Antoine Vigneron (Comput. Geom., 2025)