David Avis
According to our database^{1},
David Avis
authored at least 91 papers
between 1977 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at id.loc.gov

at isni.org
On csauthors.net:
Bibliography
2018
mplrs: A scalable parallel vertex/facet enumeration code.
Math. Program. Comput., 2018
2017
On the ℋfree extension complexity of the TSP.
Optimization Letters, 2017
An exponential lower bound for Cunningham's rule.
Math. Program., 2017
2016
On the directed cut cone and polytope.
J. Comb. Optim., 2016
2015
A generalization of extension complexity that captures P.
Inf. Process. Lett., 2015
George Dantzig: father of the simplex method.
Bulletin of the EATCS, 2015
2014
Ground metric learning.
Journal of Machine Learning Research, 2014
Reputation games for undirected graphs.
Discrete Applied Mathematics, 2014
2013
Families of polytopal digraphs that do not satisfy the shelling property.
Comput. Geom., 2013
On the Extension Complexity of Combinatorial Polytopes.
Proceedings of the Automata, Languages, and Programming  40th International Colloquium, 2013
A Portable Parallel Implementation of the lrs Vertex Enumeration Code.
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes.
Discrete Applied Mathematics, 2012
2011
Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs.
Proceedings of the Algorithms and Computation  22nd International Symposium, 2011
2010
Those ubiquitous cut polyhedra.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
From Bell Inequalities to Tsirelson's Theorem.
IEICE Transactions, 2009
2008
Generating facets for the cut polytope of a graph by triangular elimination.
Math. Program., 2008
Computing monotone disjoint paths on polytopes.
J. Comb. Optim., 2008
Visualizing and Constructing Cycles in the Simplex Method.
Operations Research, 2008
Enumerating Constrained Noncrossing Minimally Rigid Frameworks.
Discrete & Computational Geometry, 2008
Multiparty Distributed Compression of Quantum Information.
Proceedings of the Second International Conference on Quantum, 2008
2007
A list heuristic for vertex cover.
Oper. Res. Lett., 2007
Vašek Chvátal: A Very Short Introduction.
Graphs and Combinatorics, 2007
Preface.
Graphs and Combinatorics, 2007
New classes of facets of the cut polytope and tightness of I_{mm22} Bell inequalities.
Discrete Applied Mathematics, 2007
Comparison of two bounds of the quantum correlation set.
Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies, 2007
2006
A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs.
IEICE Transactions, 2006
Un des "problèmes plaisans et délectables" de Claude Berge.
Discrete Mathematics, 2006
Enumerating Noncrossing Minimally Rigid Frameworks.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
On the fractional chromatic index of a graph and its complement.
Oper. Res. Lett., 2005
2004
Solving Inequalities and Proving Farkas's Lemma Made Easy.
The American Mathematical Monthly, 2004
2003
Stronger linear programming relaxations of maxcut.
Math. Program., 2003
2002
On the chromatic polynomial of a graph.
Math. Program., 2002
On the Complexity of Testing Hypermetric, Negative Type, kGonal and Gap Inequalities.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
2001
On the solitaire cone and its relationship to multicommodity flows.
Math. Program., 2001
On the existence of a point subset with a specified number of interior points.
Discrete Mathematics, 2001
On the binary solitaire cone.
Discrete Applied Mathematics, 2001
2000
Estimating the number of vertices of a polyhedron.
Inf. Process. Lett., 2000
Two Conjectures on the Chromatic Polynomial.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
1998
Unoriented ThetaMaxima in the Plane: Complexity and Algorithms.
SIAM J. Comput., 1998
Proximity Constraints in Deformable Models for Cortical Surface Identification.
Proceedings of the Medical Image Computing and ComputerAssisted Intervention, 1998
On the Existence of a Point Subset with 4 or 5 Interior Points.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998
Living with lrs.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998
1997
How Good Are Convex Hull Algorithms?.
Comput. Geom., 1997
1996
Reverse Search for Enumeration.
Discrete Applied Mathematics, 1996
Generating Rooted Triangulations Without Repetitions.
Algorithmica, 1996
A Package for Triangulations.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
On the Sectional Area of Convex Polytopes.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
Generating Rooted Triangulations with Minimum Degree Four.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
1995
Computational aspects of Helly's theorem and its relatives.
Int. J. Comput. Geometry Appl., 1995
How Good are Convex Hull Algorithms?
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
1994
Metric extensions and the L^{1} hierarchy.
Discrete Mathematics, 1994
Multiple surface identification and matching in magnetic resonance images.
Proceedings of the Visualization in Biomedical Computing 1994, 1994
1993
The mcore properly contains the mdivisible points in space.
Pattern Recognition Letters, 1993
1992
A Bound on the Kgonality of Facets of the Hypermetric Cone and Related Complexity Problems.
Comput. Geom., 1992
1991
The cut cone, L^{1} embeddability, complexity, and multicommodity flows.
Networks, 1991
Preface.
Discrete Applied Mathematics, 1991
Distinct Distances Determined By Subsets of a Point Set in Space.
Comput. Geom., 1991
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991
1990
Locating a Robot with Angle Mathematics.
J. Symb. Comput., 1990
Algorithms for high dimensional stabbing problems.
Discrete Applied Mathematics, 1990
On the Complexity of Isometric Embedding in the Hypercube.
Proceedings of the Algorithms, 1990
1989
On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems.
IEEE Trans. Computers, 1989
Lower Bounds for Line Stabbing.
Inf. Process. Lett., 1989
All the Facets of the Sixpoint Hamming Cone.
Eur. J. Comb., 1989
1988
Computing the volume of the union of spheres.
The Visual Computer, 1988
The Probabilistic Analysis of a Heuristic for the Assignment Problem.
SIAM J. Comput., 1988
Repeated distances in space.
Graphs and Combinatorics, 1988
Polyhedral Line transversals in Space.
Discrete & Computational Geometry, 1988
1987
A Generalized Theory for System Level Diagnosis.
IEEE Trans. Computers, 1987
Triangulating Point Sets in Space.
Discrete & Computational Geometry, 1987
Algorithms for Line Transversals in Space.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987
1986
Visibility between two edges of a simple polygon.
The Visual Computer, 1986
diameter Partitioning.
Discrete & Computational Geometry, 1986
Triangulating Simplicial Point Sets in Space.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986
1985
Eccentric graphs.
Discrete Mathematics, 1985
Space Partitioning and its Application to Generalized Retrieval Problems.
FODO, 1985
Computing the largest empty convex subset of a set of points.
Proceedings of the First Annual Symposium on Computational Geometry, 1985
On the partitionability of point sets in space (preliminary report).
Proceedings of the First Annual Symposium on Computational Geometry, 1985
1984
NonPartitionable Point Sets.
Inf. Process. Lett., 1984
1983
A combinational approach to polygon similarity.
IEEE Trans. Information Theory, 1983
A survey of heuristics for the weighted matching problem.
Networks, 1983
Applications of a twodimensional hiddenline algorithm to other geometric problems.
Computing, 1983
1982
On a convex hull algorithm for polygons and its application to triangulation problems.
Pattern Recognition, 1982
1981
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge.
IEEE Trans. Computers, 1981
An efficient algorithm for decomposing a polygon into starshaped polygons.
Pattern Recognition, 1981
A Linear Algorithm for Computing the Visibility Polygon from a Point.
J. Algorithms, 1981
Balancing signed graphs.
Discrete Applied Mathematics, 1981
1980
Comments on a Lower Bound for Convex Hull Determination.
Inf. Process. Lett., 1980
1979
On minimal 5chromatic trianglefree graphs.
Journal of Graph Theory, 1979
A Linear Algorithm for Finding the Convex Hull of a Simple Polygon.
Inf. Process. Lett., 1979
1977
An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977