Groupe d’études et de recherche en analyse des décisions

Publications

David Avis

Articles

Ground metric learning
et
Journal of Machine Learning Research, 15, 533–564, 2014 référence BibTeX
On the existence of hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes
, , , et
Discrete Applied Mathematics, 160(15), 2104–2115, 2012 référence BibTeX
Leggett-Garg inequalities and the geometry of the cut polytope
, et
Physical Review A, 82, 2010 référence BibTeX
Enumeration of optimal pin jointed bistable compliant mechanisms with non-crossing members
, , , et
Journal of Structural and Multidisciplinary Optimization, 37, 645–665, 2009 référence BibTeX
From Bell inequalities to Tsirelson’s theorem
, et
Proceedings IECIE, E92-A, 1254–1267, 2009 référence BibTeX
Computing monotone disjoint paths on polytopes
et
Journal of Combinatorial Optimization, 16(4), 328–343, 2008 référence BibTeX
Distributed compression and multiparty squashed entanglement
, et
Journal of Physics, A41(11), 115301–115326, 2008 référence BibTeX
Generating facets of the cut polytope by triangular elimination
, et
Mathematical Programming, 112, 303–325, 2008 référence BibTeX
A list heuristic for vertex cove
et
Operations Research Letters, 35(2), 201–204, 2007 référence BibTeX
Bell inequalities stronger than the CHSH inequality for 3 by 3 isotropic states
, et
Physical Review A, 73(4), 2006 référence BibTeX
On the relationship between convex bodies related to correlation experiments with dichotomic observables
, et
Physical Review A, 39(36), 11283–11299, 2006 référence BibTeX
Un des "problèmes plaisants et délectables" de Claude Berge
et
Discrete Mathematics, 306(19-20), 2299–2302, 2006 référence BibTeX
On the fractional chromatic index of a graph and its complement
, et
Operations Research Letters, 33, 385–388, 2005 référence BibTeX
Solving inequalities and proving Farkas' lemma made easy
et
American Mathematical Monthly, 111, 152–157, 2004 référence BibTeX
Stronger linear-programming relaxations of max-cut
et
Mathematical Programming, 97(3), 451–469, 2003 référence BibTeX

Livres

Chapitres de livre

On combinatorial properties of linear program digraphs
et
Polyhedral Computation, 49, 1–14, 2009 référence BibTeX
On the Complexity of Testing Hypermetric, Negative Type, k-gonal and Gap Inequalities
Discrete and Computational Geometry, Lecture Notes in Computer Science, 2866, 51–59, 2003 référence BibTeX

Actes de conférence

Enumerating hamiltonian paths on acyclic USO cubes with history based pivot rules
, , , et
AAAC 2011, 2011 référence BibTeX
Verifying Nash equilibria in page rank games in undirected web graphs
, et
ISAAC 2011, Tokyo, 415–424, 2011 référence BibTeX
A family of polytopal digraphs that do not satisfy the shelling property
, et
6-th Japanese-Hungarian Symposium, 2009 référence BibTeX
The quantum locker puzzle
et
ICQNM2009, IEEE Digital Library, 2009 référence BibTeX
Comparison of two bounds of the quantum correlation set
et
Proc. ICQNM07, Guadeloupe, 2007 référence BibTeX
Enumerating non-crossing minimally rigid frameworks
, , , et
Computing and Combinatorics, Proceedings Lecture Notes in Computer Science, 4112, 205–215, 2006 référence BibTeX
Enumeration of optimal pin-jointed bistable mechanisms
, , , , et
4th China-Japan-Korea Symposium of Structural and Mechanical Systems, Beijing, Chine, 2006 référence BibTeX
Polyhedral and semidefinite approaches to classical and quantum bell inequalities
et
AQIS 2006, Beijing, Chine, 2006 référence BibTeX