Group for Research in Decision Analysis


David Avis


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


Book chapters

On combinatorial properties of linear program digraphs
Polyhedral Computation, 49, 1–14, 2009 BibTeX reference
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 BibTeX reference


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