| 2008 |
|---|
| 60 | EE | David Avis,
Patrick Hayden,
Ivan Savov:
Multiparty Distributed Compression of Quantum Information.
ICQNM 2008: 90-97 |
| 59 | EE | 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) |
| 58 | EE | David Avis,
Bohdan Kaluzny:
Computing monotone disjoint paths on polytopes.
J. Comb. Optim. 16(4): 328-343 (2008) |
| 57 | EE | 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) |
| 2007 |
|---|
| 56 | EE | David Avis,
Tsuyoshi Ito:
Comparison of two bounds of the quantum correlation set.
ICQNM 2007: 2 |
| 55 | EE | David Avis,
Tsuyoshi Ito:
New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities.
Discrete Applied Mathematics 155(13): 1689-1699 (2007) |
| 54 | EE | David Avis,
Tomokazu Imamura:
A list heuristic for vertex cover.
Oper. Res. Lett. 35(2): 201-204 (2007) |
| 2006 |
|---|
| 53 | EE | David Avis,
Naoki Katoh,
Makoto Ohsaki,
Ileana Streinu,
Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks.
COCOON 2006: 205-215 |
| 52 | EE | David Avis,
Antoine Deza:
Un des "problèmes plaisans et délectables" de Claude Berge.
Discrete Mathematics 306(19-20): 2299-2302 (2006) |
| 51 | EE | 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) |
| 2005 |
|---|
| 50 | EE | 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) |
| 2002 |
|---|
| 49 | EE | David Avis:
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities.
JCDCG 2002: 51-59 |
| 2001 |
|---|
| 48 | | David Avis,
Antoine Deza:
On the binary solitaire cone.
Discrete Applied Mathematics 115(1-3): 3-14 (2001) |
| 47 | EE | 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) |
| 2000 |
|---|
| 46 | | David Avis,
Caterina De Simone,
Paolo Nobili:
Two Conjectures on the Chromatic Polynomial.
LATIN 2000: 154-162 |
| 45 | EE | David Avis,
Luc Devroye:
Estimating the number of vertices of a polyhedron.
Inf. Process. Lett. 73(3-4): 137-143 (2000) |
| 1998 |
|---|
| 44 | | David Avis:
Living with lrs.
JCDCG 1998: 47-56 |
| 43 | | David Avis,
Kiyoshi Hosono,
Masatsugu Urabe:
On the Existence of a Point Subset with 4 or 5 Interior Points.
JCDCG 1998: 57-64 |
| 42 | EE | David MacDonald,
David Avis,
Alan C. Evans:
Proximity Constraints in Deformable Models for Cortical Surface Identification.
MICCAI 1998: 650-659 |
| 41 | | 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) |
| 1997 |
|---|
| 40 | EE | David Avis,
David Bremner,
Raimund Seidel:
How Good Are Convex Hull Algorithms?.
Comput. Geom. 7: 265-301 (1997) |
| 1996 |
|---|
| 39 | | David Avis,
Chiu Ming Kong:
Generating Rooted Triangulations with Minimum Degree Four.
CCCG 1996: 56-61 |
| 38 | EE | 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 |
| 37 | EE | 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 |
| 36 | | David Avis:
Generating Rooted Triangulations Without Repetitions.
Algorithmica 16(6): 618-632 (1996) |
| 35 | EE | David Avis,
Komei Fukuda:
Reverse Search for Enumeration.
Discrete Applied Mathematics 65(1-3): 21-46 (1996) |
| 1995 |
|---|
| 34 | EE | David Avis,
David Bremner:
How Good are Convex Hull Algorithms?
Symposium on Computational Geometry 1995: 20-28 |
| 33 | | David Avis,
Michael E. Houle:
Computational aspects of Helly's theorem and its relatives.
Int. J. Comput. Geometry Appl. 5(4): 357-367 (1995) |
| 1994 |
|---|
| 32 | EE | David Avis,
Hiroshi Maehara:
Metric extensions and the L1 hierarchy.
Discrete Mathematics 131(1-3): 17-28 (1994) |
| 1993 |
|---|
| 31 | EE | David Avis:
The m-core properly contains the m-divisible points in space.
Pattern Recognition Letters 14(9): 703-705 (1993) |
| 1992 |
|---|
| 30 | | 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) |
| 29 | | David Avis,
Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
Discrete & Computational Geometry 8: 295-313 (1992) |
| 1991 |
|---|
| 28 | EE | David Avis,
Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
Symposium on Computational Geometry 1991: 98-104 |
| 27 | | 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) |
| 26 | EE | David Avis:
Preface.
Discrete Applied Mathematics 31(2): 79 (1991) |
| 1990 |
|---|
| 25 | | David Avis:
On the Complexity of Isometric Embedding in the Hypercube.
SIGAL International Symposium on Algorithms 1990: 348-357 |
| 24 | EE | David Avis,
Mike Doskas:
Algorithms for high dimensional stabbing problems.
Discrete Applied Mathematics 27(1-2): 39-48 (1990) |
| 23 | | David Avis,
Hiroshi Imai:
Locating a Robot with Angle Mathematics.
J. Symb. Comput. 10(3/4): 311-326 (1990) |
| 1989 |
|---|
| 22 | | 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) |
| 21 | | David Avis,
J. M. Robert,
Rephael Wenger:
Lower Bounds for Line Stabbing.
Inf. Process. Lett. 33(2): 59-62 (1989) |
| 1988 |
|---|
| 20 | | David Avis,
Rephael Wenger:
Polyhedral Line transversals in Space.
Discrete & Computational Geometry 3: 257-265 (1988) |
| 19 | | David Avis,
C. W. Lai:
The Probabilistic Analysis of a Heuristic for the Assignment Problem.
SIAM J. Comput. 17(4): 732-741 (1988) |
| 18 | | David Avis,
Binay K. Bhattacharya,
Hiroshi Imai:
Computing the volume of the union of spheres.
The Visual Computer 3(6): 323-328 (1988) |
| 1987 |
|---|
| 17 | EE | David Avis,
Rephael Wenger:
Algorithms for Line Transversals in Space.
Symposium on Computational Geometry 1987: 300-307 |
| 16 | | David Avis,
Hossam A. ElGindy:
Triangulating Point Sets in Space.
Discrete & Computational Geometry 2: 99-111 (1987) |
| 15 | | Arun K. Somani,
Vinod K. Agarwal,
David Avis:
A Generalized Theory for System Level Diagnosis.
IEEE Trans. Computers 36(5): 538-546 (1987) |
| 1986 |
|---|
| 14 | EE | David Avis,
Hossam A. ElGindy:
Triangulating Simplicial Point Sets in Space.
Symposium on Computational Geometry 1986: 133-141 |
| 13 | | David Avis:
diameter Partitioning.
Discrete & Computational Geometry 1: 265-276 (1986) |
| 12 | | David Avis,
Teren Gum,
Godfried T. Toussaint:
Visibility between two edges of a simple polygon.
The Visual Computer 2(6): 342-357 (1986) |
| 1985 |
|---|
| 11 | | David Avis:
Space Partitioning and its Application to Generalized Retrieval Problems.
FODO 1985: 237-248 |
| 10 | EE | Jin Akiyama,
Kiyoshi Ando,
David Avis:
Eccentric graphs.
Discrete Mathematics 56(1): 1-6 (1985) |
| 1984 |
|---|
| 9 | | David Avis:
Non-Partitionable Point Sets.
Inf. Process. Lett. 19(3): 125-129 (1984) |
| 1983 |
|---|
| 8 | | David Avis,
Hossam A. ElGindy:
A combinational approach to polygon similarity.
IEEE Transactions on Information Theory 29(1): 148- (1983) |
| 1982 |
|---|
| 7 | EE | 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) |
| 1981 |
|---|
| 6 | | 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) |
| 5 | | Hossam A. ElGindy,
David Avis:
A Linear Algorithm for Computing the Visibility Polygon from a Point.
J. Algorithms 2(2): 186-197 (1981) |
| 4 | EE | David Avis,
Godfried T. Toussaint:
An efficient algorithm for decomposing a polygon into star-shaped polygons.
Pattern Recognition 13(6): 395-398 (1981) |
| 1980 |
|---|
| 3 | | David Avis:
Comments on a Lower Bound for Convex Hull Determination.
Inf. Process. Lett. 11(3): 126 (1980) |
| 1979 |
|---|
| 2 | | Duncan McCallum,
David Avis:
A Linear Algorithm for Finding the Convex Hull of a Simple Polygon.
Inf. Process. Lett. 9(5): 201-206 (1979) |
| 1977 |
|---|
| 1 | | 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 |
