Accessing the Internal Organization of Data Structures in the JDSL Library. - Michael T. Goodrich; Mark Handy; Benoît Hudson; Roberto Tamassia (ALENEX, 1999)

Effectiveness of Preference Elicitation in Combinatorial Auctions. - Benoît Hudson; Tuomas Sandholm (AMEC, 2002)

Generalizing preference elicitation in combinatorial auctions. - Benoît Hudson; Tuomas Sandholm (AAMAS, 2003)

Using value queries in combinatorial auctions. - Benoît Hudson; Tuomas Sandholm (EC, 2003)

Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions. - Benoît Hudson; Tuomas Sandholm (AAMAS, 2004)

Using bistellar flips for rotations in point location structures. - Benoît Hudson; Gary L. Miller (CCCG, 2004)

Sparse Voronoi Refinement. - Benoît Hudson; Gary L. Miller; Todd Phillips (IMR, 2006)

SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. - Umut A. Acar; Benoît Hudson; Gary L. Miller; Todd Phillips (IMR, 2007)

Sparse parallel Delaunay mesh refinement. - Benoît Hudson; Gary L. Miller; Todd Phillips (SPAA, 2007)

An Efficient Query Structure for Mesh Refinement. - Benoît Hudson; Duru Türkoglu (CCCG, 2008)

Size complexity of volume meshes vs. surface meshes. - Benoît Hudson; Gary L. Miller; Todd Phillips; Don Sheehy (SODA, 2009)

Succinct Representation of Well-Spaced Point Clouds - Benoît Hudson (CoRR, 2009)

Topological inference via meshing. - Benoît Hudson; Gary L. Miller; Steve Oudot; Donald R. Sheehy (SCG, 2010)

Kinetic mesh refinement in 2D. - Umut A. Acar; Benoît Hudson; Duru Türkoglu (SCG, 2011)

Parallelism in dynamic well-spaced point sets. - Umut A. Acar; Andrew Cotter; Benoît Hudson; Duru Türkoglu (SPAA, 2011)

Dynamic well-spaced point sets. - Umut A. Acar; Andrew Cotter; Benoît Hudson; Duru Türkoglu (Comput. Geom., 2013)