- Computational Experience with the Reverse Search Vertex Enumeration Algorithm
- lrs: A Revised Implementation of the Reverse Search Vertex Enumeration School of Computer Science
- A bound on kgonality of facets of the hypermetric cone and related complexity problems
- Metric Extensions and the L 1 Hierarchy McGill University
- THE mCORE PROPERLY CONTAINS THE mDIVISIBLE POINTS IN SPACE
- The Locker Problem with Empty Lockers David Avis, Luc Devroye and Kazuo Iwama
- On Combinatorial Properties of Linear Program Digraphs David Avis
- Un des "probl`emes plaisans et delectables" de Claude Berge
- On the binary solitaire cone David Avis a,1 Antoine Deza b,c,2
- How Good are Convex Hull Algorithms? \Lambda David Avis David Bremner y
- Reverse Search for Enumeration David Avis \Lambda
- Lower Bounds for Line Stabbing McGill University
- Computing the volume of the
- On a conjecture of Ba ou and Balinski School of Computer Science
- Generating Rooted Triangulations with Minimum Degree Four David Avis Chiu Ming Kong
- The Cut Cone, L 1 Embeddability, Complexity and Multicommodity David Avis*
- Computing the Largest Empty Convex Subset of a Set of Points
- On the Complexity of Isometric Embedding in the Hypercube School of Computer Science
- SPACE PARTITIONING AND ITS APPLICATION TO GENERALIZED RETRIEVAL PROBLEMS
- On the solitaire cone and its relationship to multicommodity flows
- Solving Inequalities and Proving Farkas's Lemma Made Easy David Avis and Bohdan Kaluzny
- Vasek Chvatal A Very Short Introduction
- On the Fractional Chromatic Index of a Graph and its Complement
- A C Implementation of the Reverse Search Vertex Enumeration School of Computer Science
- REPEATED DISTANCES IN SPACE David Avis*
- Computational Aspects of Helly's Theorem and its Relatives David Avis* and Michael E. Houle**
- DIAMETER PARTITIONING School of Computer Science
- Quantum Correlations: From Bell inequalities to Tsirelson's April 24, 2007
- Economic Theory manuscript No. (will be inserted by the editor)
- Multiparty distributed compression of quantum information avis@cs.mcgill.ca
- Enumerating Planar Minimally Rigid Graphs David Avis1, Naoki Katoh2 , Makoto Ohsaki2,
- ALGORITHMS FOR LINE TRANSVERSALS IN SPACE Preliminary Report
- A Combinatorial Approach to the Solitaire Game David AVIS Antoine DEZA Shmuel ONN
- A List Heuristic for Vertex Cover School of Computer Science, McGill University #
- On the Existence of a Point Subset with a Specified Number of Interior Points
- On the Existence of a Point Subset with 4 or 5 Interior Points
- ALGORITHMS FOR HIGH DIMENSIONAL STABBING Mike Doskas
- The Fourth China-Japan-Korea Joint Symposium on Optimization of Structural and Mechanical Systems Kunming, Nov. 6-9, 2006, China
- Living with lrs School of Computer Science
- A family of polytopal digraphs that do not satisfy the shelling property
- On the Complexity of Testing Hypermetric, Negative Type, k-gonal and Gap Inequalities
- On the Chromatic Polynomial of a Graph David Avis , Caterina De Simone y , Paolo Nobili z
- Polyhedral and semidefinite approaches to classical and quantum Bell inequalities
- Stronger Linear Programming Relaxations of Max-Cut Computer Science, Mcgill University and GERAD
- ESTIMATING THE NUMBER OF VERTICES OF A David Avis*
- All the Facets of the Six Point Hamming Cone School of Computer Science
- A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
- A Package for Triangulations 3 T. Ono y , Y. Kyoda y , T. Masada y , K. Hayase y , T. Shibuya y , M. Inaba y , H. Imai y , K. Imai z and D. Avis x
- How Good are Convex Hull Algorithms? David Avis \Lambda
- DISTINCT DISTANCES DETERMINED BY SUBSETS OF A POINT SET IN SPACE
- StrucOpt manuscript No. (will be inserted by the editor)
- THE PROBABILISTIC ANALYSIS OF A HEURISTIC FOR THE ASSIGNMENT PROBLEM
- Comparison of two bounds of the quantum correlation set
- GENERATING ROOTED TRIANGULATIONS WITHOUT REPETITIONS
- On canonical representations of convex polyhedra David Avis Komei Fukuda Stefano Picozzi
- TRIANGULATING POINT SETS IN SPACE David Avis*
- Mathematical Programming 18 (1980) 138-145. North-Holland Publishing Company