David Avis

David Avis, Hiroyuki Miyata, Sonoko Moriyama: Families of polytopal digraphs that do not satisfy the shelling property. Comput. Geom. 46(3): 382-393 (2013)

David Avis, Hans Raj Tiwary: On the extension complexity of combinatorial polytopes. CoRR abs/1302.2340 (2013)

Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto, Sonoko Moriyama: On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes. Discrete Applied Mathematics 160(15): 2104-2115 (2012)

David Avis, Kazuo Iwama, Daichi Paku: Reputation Games for Undirected Graphs. CoRR abs/1205.6683 (2012)

David Avis, Kazuo Iwama, Daichi Paku: Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. ISAAC 2011: 415-424

Marco Cuturi, David Avis: Ground Metric Learning. CoRR abs/1110.2306 (2011)

Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto, Sonoko Moriyama: Worst-case Behaviour of History Based Pivot Rules on Acyclic Unique Sink Orientations of Hypercubes. CoRR abs/1110.3014 (2011)

David Avis, Hiroyuki Miyata, Sonoko Moriyama: Families of polytopal digraphs that do not satisfy the shelling property. CoRR abs/1110.3078 (2011)

David Avis: Those ubiquitous cut polyhedra. CCCG 2010: 25

David Avis, Sonoko Moriyama, Masaki Owari: From Bell Inequalities to Tsirelson's Theorem. IEICE Transactions 92-A(5): 1254-1267 (2009)

David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa: Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discrete & Computational Geometry 40(1): 31-46 (2008)

David Avis, Bohdan Kaluzny, David Titley-Péloquin: Visualizing and Constructing Cycles in the Simplex Method. Operations Research 56(2): 512-518 (2008)

David Avis, Bohdan Kaluzny: Computing monotone disjoint paths on polytopes. J. Comb. Optim. 16(4): 328-343 (2008)

David Avis, Hiroshi Imai, Tsuyoshi Ito: Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. 112(2): 303-325 (2008)

David Avis, Patrick Hayden, Ivan Savov: Multiparty Distributed Compression of Quantum Information. ICQNM 2008: 90-97

David Avis, Tsuyoshi Ito: New classes of facets of the cut polytope and tightness of I_mm22 Bell inequalities. Discrete Applied Mathematics 155(13): 1689-1699 (2007)

David Avis, Tomokazu Imamura: A list heuristic for vertex cover. Oper. Res. Lett. 35(2): 201-204 (2007)

David Avis, Tsuyoshi Ito: Comparison of two bounds of the quantum correlation set. ICQNM 2007: 2

David Avis, Antoine Deza: Un des "problèmes plaisans et délectables" de Claude Berge. Discrete Mathematics 306(19-20): 2299-2302 (2006)

David Avis, Jun Hasegawa, Yosuke Kikuchi, Yuuya Sasaki: A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs. IEICE Transactions 89-A(5): 1378-1381 (2006)

David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa: Enumerating Non-crossing Minimally Rigid Frameworks. COCOON 2006: 205-215

David Avis, Caterina De Simone, Bruce A. Reed: On the fractional chromatic index of a graph and its complement. Oper. Res. Lett. 33(4): 385-388 (2005)

David Avis, Bohdan Kaluzny: Solving Inequalities and Proving Farkas's Lemma Made Easy. The American Mathematical Monthly 111(2): 152-157 (2004)

David Avis, Jun Umemoto: Stronger linear programming relaxations of max-cut. Math. Program. 97(3): 451-469 (2003)

David Avis, Caterina De Simone, Paolo Nobili: On the chromatic polynomial of a graph. Math. Program. 92(3): 439-452 (2002)

David Avis: On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. JCDCG 2002: 51-59

David Avis, Antoine Deza: On the binary solitaire cone. Discrete Applied Mathematics 115(1-3): 3-14 (2001)

David Avis, Kiyoshi Hosono, Masatsugu Urabe: On the existence of a point subset with a specified number of interior points. Discrete Mathematics 241(1-3): 33-40 (2001)

David Avis, Luc Devroye: Estimating the number of vertices of a polyhedron. Inf. Process. Lett. 73(3-4): 137-143 (2000)

David Avis, Caterina De Simone, Paolo Nobili: Two Conjectures on the Chromatic Polynomial. LATIN 2000: 154-162

David Avis, Bryan Beresford-Smith, Luc Devroye, Hossam A. ElGindy, Eric Guévremont, Ferran Hurtado, Binhai Zhu: Unoriented Theta-Maxima in the Plane: Complexity and Algorithms. SIAM J. Comput. 28(1): 278-296 (1998)

David Avis: Living with lrs. JCDCG 1998: 47-56

David Avis, Kiyoshi Hosono, Masatsugu Urabe: On the Existence of a Point Subset with 4 or 5 Interior Points. JCDCG 1998: 57-64

David MacDonald, David Avis, Alan C. Evans: Proximity Constraints in Deformable Models for Cortical Surface Identification. MICCAI 1998: 650-659

David Avis, David Bremner, Raimund Seidel: How Good Are Convex Hull Algorithms?. Comput. Geom. 7: 265-301 (1997)

David Avis: Generating Rooted Triangulations Without Repetitions. Algorithmica 16(6): 618-632 (1996)

David Avis, Komei Fukuda: Reverse Search for Enumeration. Discrete Applied Mathematics 65(1-3): 21-46 (1996)

David Avis, Chiu Ming Kong: Generating Rooted Triangulations with Minimum Degree Four. CCCG 1996: 56-61

David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink: On the Sectional Area of Convex Polytopes. Symposium on Computational Geometry 1996: C-11-C-12

Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis: A Package for Triangulations. Symposium on Computational Geometry 1996: V-17-V-18

David Avis, Michael E. Houle: Computational aspects of Helly's theorem and its relatives. Int. J. Comput. Geometry Appl. 5(4): 357-367 (1995)

David Avis, David Bremner: How Good are Convex Hull Algorithms? Symposium on Computational Geometry 1995: 20-28

David Avis, Hiroshi Maehara: Metric extensions and the L¹ hierarchy. Discrete Mathematics 131(1-3): 17-28 (1994)

David Avis: The m-core properly contains the m-divisible points in space. Pattern Recognition Letters 14(9): 703-705 (1993)

David Avis, Viatcheslav P. Grishukhin: A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. Comput. Geom. 2: 241-254 (1992)

David Avis, Komei Fukuda: A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. Discrete & Computational Geometry 8: 295-313 (1992)

David Avis, Paul Erdös, János Pach: Distinct Distances Determined By Subsets of a Point Set in Space. Comput. Geom. 1: 1-11 (1991)

David Avis: Preface. Discrete Applied Mathematics 31(2): 79 (1991)

David Avis, Michel Deza: The cut cone, L¹ embeddability, complexity, and multicommodity flows. Networks 21(6): 595-617 (1991)

David Avis, Komei Fukuda: A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. Symposium on Computational Geometry 1991: 98-104

David Avis, Mike Doskas: Algorithms for high dimensional stabbing problems. Discrete Applied Mathematics 27(1-2): 39-48 (1990)

David Avis, Hiroshi Imai: Locating a Robot with Angle Mathematics. J. Symb. Comput. 10(3/4): 311-326 (1990)

David Avis: On the Complexity of Isometric Embedding in the Hypercube. SIGAL International Symposium on Algorithms 1990: 348-357

David Avis, J. M. Robert, Rephael Wenger: Lower Bounds for Line Stabbing. Inf. Process. Lett. 33(2): 59-62 (1989)

Arun K. Somani, Vinod K. Agarwal, David Avis: On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems. IEEE Trans. Computers 38(2): 195-201 (1989)

David Avis, Rephael Wenger: Polyhedral Line transversals in Space. Discrete & Computational Geometry 3: 257-265 (1988)

David Avis, Paul Erdös, János Pach: Repeated distances in space. Graphs and Combinatorics 4(1): 207-217 (1988)

David Avis, C. W. Lai: The Probabilistic Analysis of a Heuristic for the Assignment Problem. SIAM J. Comput. 17(4): 732-741 (1988)

David Avis, Binay K. Bhattacharya, Hiroshi Imai: Computing the volume of the union of spheres. The Visual Computer 3(6): 323-328 (1988)

David Avis, Hossam A. ElGindy: Triangulating Point Sets in Space. Discrete & Computational Geometry 2: 99-111 (1987)

Arun K. Somani, Vinod K. Agarwal, David Avis: A Generalized Theory for System Level Diagnosis. IEEE Trans. Computers 36(5): 538-546 (1987)

David Avis, Rephael Wenger: Algorithms for Line Transversals in Space. Symposium on Computational Geometry 1987: 300-307

David Avis: diameter Partitioning. Discrete & Computational Geometry 1: 265-276 (1986)

David Avis, Teren Gum, Godfried T. Toussaint: Visibility between two edges of a simple polygon. The Visual Computer 2(6): 342-357 (1986)

David Avis, Hossam A. ElGindy: Triangulating Simplicial Point Sets in Space. Symposium on Computational Geometry 1986: 133-141

Jin Akiyama, Kiyoshi Ando, David Avis: Eccentric graphs. Discrete Mathematics 56(1): 1-6 (1985)

David Avis: On the partitionability of point sets in space (preliminary report). Symposium on Computational Geometry 1985: 116-120

David Avis, David Rappaport: Computing the largest empty convex subset of a set of points. Symposium on Computational Geometry 1985: 161-167

David Avis: Space Partitioning and its Application to Generalized Retrieval Problems. FODO 1985: 237-248

David Avis: Non-Partitionable Point Sets. Inf. Process. Lett. 19(3): 125-129 (1984)

Hossam A. ElGindy, David Avis, Godfried T. Toussaint: Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing 31(3): 191-202 (1983)

David Avis: A survey of heuristics for the weighted matching problem. Networks 13(4): 475-493 (1983)

David Avis, Hossam A. ElGindy: A combinational approach to polygon similarity. IEEE Transactions on Information Theory 29(1): 148-150 (1983)

Godfried T. Toussaint, David Avis: On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition 15(1): 23-29 (1982)

Hossam A. ElGindy, David Avis: A Linear Algorithm for Computing the Visibility Polygon from a Point. J. Algorithms 2(2): 186-197 (1981)

David Avis, Godfried T. Toussaint: An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition 13(6): 395-398 (1981)

David Avis, Godfried T. Toussaint: An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge. IEEE Trans. Computers 30(12): 910-914 (1981)

David Avis: Comments on a Lower Bound for Convex Hull Determination. Inf. Process. Lett. 11(3): 126 (1980)

Duncan McCallum, David Avis: A Linear Algorithm for Finding the Convex Hull of a Simple Polygon. Inf. Process. Lett. 9(5): 201-206 (1979)

Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest: An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem. STOC 1977: 11-17