The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Avis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Avis, Chiu Ming Kong
    Generating Rooted Triangulations with Minimum Degree Four. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:56-61 [Conf]
  2. David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
    Enumerating Non-crossing Minimally Rigid Frameworks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:205-215 [Conf]
  3. David Avis, David Bremner
    How Good are Convex Hull Algorithms? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:20-28 [Conf]
  4. David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
    On the Sectional Area of Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-11 [Conf]
  5. David Avis, Hossam A. ElGindy
    Triangulating Simplicial Point Sets in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:133-141 [Conf]
  6. David Avis, Komei Fukuda
    A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:98-104 [Conf]
  7. David Avis, Rephael Wenger
    Algorithms for Line Transversals in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:300-307 [Conf]
  8. Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis
    A Package for Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-17 [Conf]
  9. David Avis
    Space Partitioning and its Application to Generalized Retrieval Problems. [Citation Graph (0, 0)][DBLP]
    FODO, 1985, pp:237-248 [Conf]
  10. David Avis
    On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:51-59 [Conf]
  11. David Avis
    Living with lrs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:47-56 [Conf]
  12. David Avis, Kiyoshi Hosono, Masatsugu Urabe
    On the Existence of a Point Subset with 4 or 5 Interior Points. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:57-64 [Conf]
  13. David Avis, Caterina De Simone, Paolo Nobili
    Two Conjectures on the Chromatic Polynomial. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:154-162 [Conf]
  14. David MacDonald, David Avis, Alan C. Evans
    Proximity Constraints in Deformable Models for Cortical Surface Identification. [Citation Graph (0, 0)][DBLP]
    MICCAI, 1998, pp:650-659 [Conf]
  15. David Avis
    On the Complexity of Isometric Embedding in the Hypercube. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:348-357 [Conf]
  16. Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest
    An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:11-17 [Conf]
  17. David Avis
    Generating Rooted Triangulations Without Repetitions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:6, pp:618-632 [Journal]
  18. David Avis, Paul Erdös, János Pach
    Distinct Distances Determined By Subsets of a Point Set in Space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:1-11 [Journal]
  19. David Avis, Viatcheslav P. Grishukhin
    A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:241-254 [Journal]
  20. Emo Welzl, David Avis, David Bremner, Raimund Seidel
    How Good Are Convex Hull Algorithms?. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:265-301 [Journal]
  21. David Avis, Antoine Deza
    On the binary solitaire cone. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:3-14 [Journal]
  22. David Avis, Komei Fukuda
    Reverse Search for Enumeration. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:21-46 [Journal]
  23. David Avis
    diameter Partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:265-276 [Journal]
  24. David Avis, Hossam A. ElGindy
    Triangulating Point Sets in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:99-111 [Journal]
  25. David Avis, Komei Fukuda
    A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:295-313 [Journal]
  26. David Avis, Rephael Wenger
    Polyhedral Line transversals in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:257-265 [Journal]
  27. David Avis, Kiyoshi Hosono, Masatsugu Urabe
    On the existence of a point subset with a specified number of interior points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:33-40 [Journal]
  28. David Avis, Antoine Deza
    Un des "problèmes plaisans et délectables" de Claude Berge. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2299-2302 [Journal]
  29. David Avis, Michael E. Houle
    Computational aspects of Helly's theorem and its relatives. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:4, pp:357-367 [Journal]
  30. David Avis
    Comments on a Lower Bound for Convex Hull Determination. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:3, pp:126- [Journal]
  31. David Avis
    Non-Partitionable Point Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:3, pp:125-129 [Journal]
  32. David Avis, Luc Devroye
    Estimating the number of vertices of a polyhedron. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:3-4, pp:137-143 [Journal]
  33. David Avis, J. M. Robert, Rephael Wenger
    Lower Bounds for Line Stabbing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:2, pp:59-62 [Journal]
  34. Duncan McCallum, David Avis
    A Linear Algorithm for Finding the Convex Hull of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:5, pp:201-206 [Journal]
  35. Hossam A. ElGindy, David Avis
    A Linear Algorithm for Computing the Visibility Polygon from a Point. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:2, pp:186-197 [Journal]
  36. David Avis, Hiroshi Imai
    Locating a Robot with Angle Mathematics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:3/4, pp:311-326 [Journal]
  37. David Avis, Caterina De Simone, Bruce A. Reed
    On the fractional chromatic index of a graph and its complement. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:385-388 [Journal]
  38. David Avis, Tomokazu Imamura
    A list heuristic for vertex cover. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:2, pp:201-204 [Journal]
  39. David Avis, Godfried T. Toussaint
    An efficient algorithm for decomposing a polygon into star-shaped polygons. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1981, v:13, n:6, pp:395-398 [Journal]
  40. Godfried T. Toussaint, David Avis
    On a convex hull algorithm for polygons and its application to triangulation problems. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1982, v:15, n:1, pp:23-29 [Journal]
  41. David Avis
    The m-core properly contains the m-divisible points in space. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1993, v:14, n:9, pp:703-705 [Journal]
  42. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:278-296 [Journal]
  43. David Avis, C. W. Lai
    The Probabilistic Analysis of a Heuristic for the Assignment Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:732-741 [Journal]
  44. David Avis, Godfried T. Toussaint
    An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:12, pp:910-914 [Journal]
  45. Arun K. Somani, Vinod K. Agarwal, David Avis
    A Generalized Theory for System Level Diagnosis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:5, pp:538-546 [Journal]
  46. Arun K. Somani, Vinod K. Agarwal, David Avis
    On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:2, pp:195-201 [Journal]
  47. David Avis, Hossam A. ElGindy
    A combinational approach to polygon similarity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:1, pp:148-0 [Journal]
  48. David Avis, Binay K. Bhattacharya, Hiroshi Imai
    Computing the volume of the union of spheres. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1988, v:3, n:6, pp:323-328 [Journal]
  49. David Avis, Teren Gum, Godfried T. Toussaint
    Visibility between two edges of a simple polygon. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1986, v:2, n:6, pp:342-357 [Journal]
  50. David Avis, Tsuyoshi Ito
    New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:13, pp:1689-1699 [Journal]
  51. Jin Akiyama, Kiyoshi Ando, David Avis
    Eccentric graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:56, n:1, pp:1-6 [Journal]
  52. David Avis, Hiroshi Maehara
    Metric extensions and the L1 hierarchy. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:131, n:1-3, pp:17-28 [Journal]

  53. Those ubiquitous cut polyhedra. [Citation Graph (, )][DBLP]


  54. Computing the largest empty convex subset of a set of points. [Citation Graph (, )][DBLP]


  55. On the partitionability of point sets in space (preliminary report). [Citation Graph (, )][DBLP]


  56. Comparison of two bounds of the quantum correlation set. [Citation Graph (, )][DBLP]


  57. Multiparty Distributed Compression of Quantum Information. [Citation Graph (, )][DBLP]


  58. Applications of a two-dimensional hidden-line algorithm to other geometric problems. [Citation Graph (, )][DBLP]


  59. Preface. [Citation Graph (, )][DBLP]


  60. Algorithms for high dimensional stabbing problems. [Citation Graph (, )][DBLP]


  61. Enumerating Constrained Non-crossing Minimally Rigid Frameworks. [Citation Graph (, )][DBLP]


Search in 0.063secs, Finished in 0.066secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002