Publications
In Journals
- "Approximating
the balanced minimum evolution problem", with Gwenaël
Joret, Operations Research Letters, accepted for publication
- "The polyhedron of
all representations of a semiorder", with Barry Balof and
Jean-Paul Doignon, Order, accepted
- "The
Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth
Graphs", with Jean Cardinal, Erik Demaine, Gwenaël Joret, Ilan
Newman and Oren Weimann, Journal of Combinatorial
Optimization, accepted
- "Minimum Entropy
Combinatorial Optimization Problems", with Jean Cardinal and
Gwenaël Joret, Theoretical Computer Science, accepted
- "The VPN problem with concave costs", with Gianpaolo Oriolo,
Laura Sanità and Dirk Oliver Theis, SIAM Journal on
Discrete Mathematics, in press
- A closest
vector problem arising in radiation therapy planning, with
Céline Engelbeen and Antje Kiesel, Journal of Combinatorial
Optimization, in press
- "An efficient
algorithm for partial order production", with Jean Cardinal,
Gwenaël Joret, Raphaël Junger and Ian Munro, SIAM Journal on
Computation, in press
- "The
Stackelberg minimum spanning tree game", with Jean Cardinal,
Erik Demaine, Gwenaël Joret, Stefan Langerman, Ilan Newman and
Oren Weimann, Algorithmica, in press
- "On the feedback vertex set polytope of a series-parallel graph", with
Odile Marcotte, Discrete Optimization, Vol. 6, pages 271-287, 2009.
- "Constrained
decompositions of integer matrices and their applications to
intensity modulated radiation therapy", with Céline Engelbeen,
Networks, Vol. 55, pages 138-148, 2010
- "Weighted graphs defining
facets: a connection between stable set and linear ordering polytopes",
with Jean-Paul Doignon and Gwenaël Joret, Discrete Optimization,
Vol. 6, pages 1-9, 2009
- "Tight results on minimum entropy
set cover", with Jean Cardinal and Gwenaël Joret, Algorithmica,
Vol. 51, pages 49-60, 2008
- "On a theorem of Sewell
and Trotter", with Gwenaël Joret, European Journal of Combinatorics,
Vol. 30, pages 680-683, 2008
- "Minimum entropy coloring", with
Jean Cardinal and Gwenaël Joret, Journal of Combinatorial Optimization,
Vol. 16, pages 361-377, 2008
- "Minimum Entropy Orientations",
with Jean Cardinal and Gwenaël Joret, Operations Research Letters,
Vol. 36, pages 680-683, 2008
- "Planar graph bipartization in linear time",
with Nadia Hardy, Bruce Reed and Adrian Vetta, Discrete Applied Mathematics,
Vol. 156, pages 1175-1180, 2008
- "Approximate min-max relations for odd
cycles in planar graphs", with Nadia Hardy, Bruce Reed and Adrian
Vetta, Mathematical Programming Series B, Vol. 110, pages 71-91, 2007
- "{0,1/2}-cuts and the linear
ordering problem: surfaces that define facets", SIAM
Journal on Discrete Mathematics, Vol. 20/4, pages 893-912, 2006
(talk)
- "A note on the precedence-constrained class
sequencing problem", with José Correa and Nicolás Stier-Moses, Discrete
Applied Mathematics, Vol. 155/3, pages 257-259, 2006
- "Facets of the linear ordering polytope: a
unification for the fence family through weighted graphs", with
Jean-Paul Doignon and Gwenaël Joret, Journal of Mathematical
Psychology, Vol. 50/3, pages 251-262, 2006
- "How to recycle your facets",
Discrete Optimization, Vol. 3/2, pages 136-153, 2006
- "The biorder polytope", with Julie
Christophe and Jean-Paul Doignon, Order,
Vol. 21/1, pages 61-82, 2004
- "The facets and the symmetries of the
approval-voting polytope", with Jean-Paul Doignon,
Journal of Combinatorial Theory (Series B),
Vol. 92/1, pages 1-12, 2004
- "A short proof of a theorem of Falmagne",
Journal of Mathematical Psychology,
Vol. 48/1, pages 80-82, 2004
- "Weak order polytopes", with Peter Fishburn,
Discrete Mathematics, Vol. 275/1-3, pages 111-127, 2004
- "Extendability of cyclic orders",
with Peter Fishburn, Order, Vol. 20/2, pages
151-171, 2003
- "Counting biorders", with Julie
Christophe and Jean-Paul Doignon, Journal of Integer Sequences,
Vol. 6/4, article 03.4.3, 2003
- "Facets of linear signed order polytopes",
with Peter Fishburn, Discrete Applied Mathematics,
Vol. 131/3, pages 597-610, 2003
- "The approval-voting polytope:
combinatorial interpretation of the facets", with Jean-Paul Doignon,
Mathematiques et Sciences Humaines, Vol. 161,
pages 29-39, 2003. [version of March 3, 2003]
- "A combinatorial study of partial order
polytopes", European Journal of Combinatorics,
Vol. 24/2, pages 149-159, 2003
- "Facets of the weak order polytope
derived from the induced partition projection", with
Jean-Paul Doignon, SIAM journal on Discrete Mathematics,
Vol. 15/1, pages 112-121, 2002
- "Determining the automorphism group of the
linear ordering polytope", Discrete Applied Mathematics,
Vol. 112/1-3, pages 121-128, 2001
In Conferences
- "Optimal Algorithms For Segment Minimization With Small Maximal
Value", with Therese Biedl, Stephane Durocher, Céline Engelbeen
and Maxwell Young, WADS 2011
- "Hitting
diamonds and growing cacti", with Gwenaël Joret and Ugo
Pietropaoli, IPCO 2010
- Sorting
under partial information (without the ellipsoid algorithm),
with Jean Cardinal, Gwenael Joret, Raphael Jungers and Ian Munro,
STOC 2010
- "The Stackelberg Minimum Spanning Tree Game on Planar and
Bounded-Treewidth Graphs", with Jean Cardinal, Erik Demaine,
Gwenael Joret, Ilan Newman and Oren Weimann, WINE 2009
- "An efficient algorithm for partial order production", with Jean Cardinal,
Gwenaël Joret, Raphaël Jungers and J. Ian Munro, STOC 2009
- "The Stackelberg Minimum Spanning Tree Game", with Jean Cardinal,
Erik D. Demaine, Gwenaël Joret, Stefan Langerman, Ilan Newman and
Oren Weimann, WADS 2007
- "Tight results on minimum entropy set cover", with Jean Cardinal and
Gwenaël Joret, APPROX-RANDOM 2006
- "Minimum Entropy Coloring", with Jean Cardinal and Gwenaël Joret,
ISAAC 2005
- "Approximate min-max relations for odd cycles in planar graphs", with Nadia
Hardy, Bruce Reed and Adrian Vetta, IPCO 2005
(talk)
- "Planar graph bipartization in linear time", with Nadia
Hardy, Bruce Reed and Adrian Vetta, GRACO 2005
- "On minimum entropy graph colorings", with Jean Cardinal and
Gilles Van Assche, ISIT 2004
Submitted papers
To be submitted
PhD thesis