David Avis

发表

Space Partitioning and its Application to Generalized Retrieval Problems

David Avis, D. Avis, 1985, FODO.

Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching

J. Michael Steele, David Avis, Burgess Davis, 1988, Probability in the Engineering and Informational Sciences.

Optimized open pit mine design, pushbacks and the gap problem—a review

David Avis, Conor Meagher, Roussos Dimitrakopoulos, 2014, Journal of Mining Science.

Eccentric graphs

David Avis, Jin Akiyama, Kiyoshi Ando, 1985, Discret. Math..

Algorithms for line transversals in space

David Avis, Rephael Wenger, D. Avis, 1987, SCG '87.

On minimal 5-chromatic triangle-free graphs

David Avis, D. Avis, 1979, J. Graph Theory.

Lower Bounds for Line Stabbing

David Avis, Rephael Wenger, J. M. Robert, 1989, Inf. Process. Lett..

The m-core properly contains the m-divisible points in space

David Avis, 1993, Pattern Recognit. Lett..

George Dantzig: father of the simplex method

David Avis, 2015, Bull. EATCS.

On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes

David Avis, Yoshikazu Aoshima, Theresa Deering, 2012, Discret. Appl. Math..

Enumerating Constrained Non-crossing Minimally Rigid Frameworks

Makoto Ohsaki, David Avis, Shin-ichi Tanigawa, 2008, Discret. Comput. Geom..

On the sectional area of convex polytopes

Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, 1996, SCG '96.

Polynomial size linear programs for problems in P

Hans Raj Tiwary, Osamu Watanabe, David Avis, 2014, Discret. Appl. Math..

A generalization of extension complexity that captures P

Hans Raj Tiwary, David Avis, 2015, Inf. Process. Lett..

On the fractional chromatic index of a graph and its complement

Bruce A. Reed, Caterina De Simone, David Avis, 2005, Oper. Res. Lett..

SET COVERING PROBLEMS

David Avis, David Avis, D. Avis, 1980 .

Triangulating point sets in space

David Avis, Hossam A. ElGindy, 1987, Discret. Comput. Geom..

How good are convex hull algorithms?

David Avis, David Bremner, D. Avis, 1995, SCG '95.

Computing monotone disjoint paths on polytopes

David Avis, Bohdan Kaluzny, 2008, J. Comb. Optim..

mts: a light framework for parallelizing tree search codes pdf

David Avis, Charles Jordan, D. Avis, 2017, Optim. Methods Softw..

A combinational approach to polygon similarity

David Avis, Hossam A. ElGindy, D. Avis, 1983, IEEE Trans. Inf. Theory.

A Generalized Theory for System Level Diagnosis

Vinod K. Agarwal, David Avis, Arun K. Somani, 1987, IEEE Transactions on Computers.

Repeated distances in space

Paul Erdös, János Pach, David Avis, 1988, Graphs Comb..

Metric extensions and the L1 hierarchy

David Avis, Hiroshi Maehara, D. Avis, 1994, Discret. Math..

An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge

Godfried T. Toussaint, David Avis, D. Avis, 1981, IEEE Transactions on Computers.

Un des "problèmes plaisans et délectables" de Claude Berge

David Avis, Antoine Deza, 2006, Discret. Math..

Families of polytopal digraphs that do not satisfy the shelling property

David Avis, Sonoko Moriyama, Hiroyuki Miyata, 2013, Comput. Geom..

Computing Waiting Times in GI/E sub k/c Queueing Systems.

David Avis, 1976 .

Generating rooted triangulations without repetitions

David Avis, D. Avis, 1996, Algorithmica.

Unoriented Theta-Maxima in the Plane: Complexity and Algorithms

Luc Devroye, Binhai Zhu, David Avis, 1998, SIAM J. Comput..

New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities

Tsuyoshi Ito, David Avis, D. Avis, 2007, Discret. Appl. Math..

Stronger linear programming relaxations of max-cut

David Avis, Jun Umemoto, D. Avis, 2002, Math. Program..

All the Facets of the Six-point Hamming Cone

David Avis, Mutt, D. Avis, 1989, Eur. J. Comb..

A package for triangulations

Tomonari Masada, Tsuyoshi Ono, Hiroshi Imai, 1996, SCG '96.

A survey of heuristics for the weighted matching problem

David Avis, D. Avis, 1983, Networks.

Enumerating Non-crossing Minimally Rigid Frameworks

Makoto Ohsaki, David Avis, Shin-ichi Tanigawa, 2006, COCOON.

An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons

Godfried T. Toussaint, David Avis, D. Avis, 1981 .

A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems

David Avis, Viatcheslav P. Grishukhin, 1992, Comput. Geom..

Polynomial size linear programs for non-bipartite matching problems and other problems in P pdf

Osamu Watanabe, Hans Raj Tiwary, David Avis, 2014, ArXiv.

A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

David Avis, Komei Fukuda, D. Avis, 1991, SCG '91.

Balancing signed graphs

David Avis, Jin Akiyama, Vasek Chvátal, 1981, Discret. Appl. Math..

Comparative computational results for some vertex and facet enumeration codes pdf

David Avis, Charles Jordan, 2015, ArXiv.

On the chromatic polynomial of a graph

Caterina De Simone, David Avis, Paolo Nobili, 2002, Math. Program..

A parallel framework for reverse search using mts pdf

David Avis, Charles Jordan, D. Avis, 2016, ArXiv.

Multiparty Distributed Compression of Quantum Information

David Avis, Patrick M. Hayden, Ivan Savov, 2008, Second International Conference on Quantum, Nano and Micro Technologies (ICQNM 2008).

On the binary solitaire cone

David Avis, Antoine Deza, 2001, Discret. Appl. Math..

Those ubiquitous cut polyhedra

David Avis, 2010, CCCG.

Computational aspects of Helly's theorem and its relatives

David Avis, Michael E. Houle, D. Avis, 1995, Int. J. Comput. Geom. Appl..

Locating a Robot with Angle Mathematics

Hiroshi Imai, David Avis, 1990, J. Symb. Comput..

Visualizing and Constructing Cycles in the Simplex Method

David Avis, Bohdan Kaluzny, David Titley-Péloquin, 2008, Oper. Res..

Worst-case Behaviour of History Based Pivot Rules on Acyclic Unique Sink Orientations of Hypercubes pdf

David Avis, Yoshikazu Aoshima, Theresa Deering, 2011, ArXiv.

On the directed cut cone and polytope

David Avis, Conor Meagher, 2016, J. Comb. Optim..

Reverse Search for Enumeration

David Avis, Komei Fukuda, D. Avis, 1996, Discret. Appl. Math..

Sparktope: linear programs from algorithms pdf

David Avis, David Bremner, D. Avis, 2020, Optim. Methods Softw..

From Bell Inequalities to Tsirelson's Theorem

David Avis, Sonoko Moriyama, Masaki Owari, 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Algorithms for high dimensional stabbing problems

David Avis, Mike Doskas, D. Avis, 1990, Discret. Appl. Math..

On the $${\mathcal {H}}$$H-free extension complexity of the TSP

Hans Raj Tiwary, David Avis, 2017, Optim. Lett..

Living with lrs

David Avis, 1998, JCDCG.

Visibility between two edges of a simple polygon

Godfried T. Toussaint, David Avis, Teren Gum, 1986, The Visual Computer.

A method for identifying geometrically simple surfaces from three-dimensional images

Alan C. Evans, David Avis, J. David Macdonald, 1998 .

On the Complexity of Isometric Embedding in the Hypercube

David Avis, 1990, SIGAL International Symposium on Algorithms.

On the solitaire cone and its relationship to multi-commodity flows

David Avis, Antoine Deza, D. Avis, 2001, Math. Program..

Diameter partitioning

David Avis, D. Avis, 1986, Discret. Comput. Geom..

A Linear Algorithm for Finding the Convex Hull of a Simple Polygon

David Avis, Duncan McCallum, D. Avis, 1979, Inf. Process. Lett..

A list heuristic for vertex cover

David Avis, Tomokazu Imamura, D. Avis, 2007, Oper. Res. Lett..

Vašek Chvátal: A Very Short Introduction

Bruce A. Reed, William J. Cook, David Avis, 2007, Graphs Comb..

Comments on a Lower Bound for Convex Hull Determination

David Avis, D. Avis, 1980, Inf. Process. Lett..

Enumerating Non-crossing Minimally Rigid Frameworks

Makoto Ohsaki, David Avis, Shin-ichi Tanigawa, 2007, Graphs Comb..

Multiple surface identification and matching in magnetic resonance images

Alan C. Evans, David Avis, David MacDonald, 1994, Other Conferences.

A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

David Avis, Komei Fukuda, 1992, Discret. Comput. Geom..

mplrs: A scalable parallel vertex/facet enumeration code

David Avis, Charles Jordan, D. Avis, 2015, Math. Program. Comput..

Solving Inequalities and Proving Farkas's Lemma Made Easy

David Avis, Bohdan Kaluzny, D. Avis, 2002, Am. Math. Mon..

Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992

David Avis, 1992, Symposium on Computational Geometry.

Reputation games for undirected graphs pdf

David Avis, Kazuo Iwama, Daichi Paku, 2014, Discret. Appl. Math..

A Portable Parallel Implementation of the lrs Vertex Enumeration Code

David Avis, Gary Roumanis, D. Avis, 2013, COCOA.

An exponential lower bound for Cunningham’s rule

David Avis, Oliver Friedmann, 2017, Math. Program..

On the existence of a point subset with a specified number of interior points

David Avis, Kiyoshi Hosono, Masatsugu Urabe, 2001, Discret. Math..

On the partitionability of point sets in space (preliminary report)

David Avis, D. Avis, 1985, SCG '85.

Comparison of two bounds of the quantum correlation set

Tsuyoshi Ito, David Avis, D. Avis, 2007, 2007 First International Conference on Quantum, Nano, and Micro Technologies (ICQNM'07).

Ground metric learning pdf

David Avis, Marco Cuturi, D. Avis, 2011, J. Mach. Learn. Res..

A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs

David Avis, Jun Hasegawa, Yosuke Kikuchi, 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems

Vinod K. Agarwal, David Avis, Arun K. Somani, 1989, IEEE Trans. Computers.

On the extension complexity of combinatorial polytopes

Hans Raj Tiwary, David Avis, 2015, Math. Program..

Estimating the number of vertices of a polyhedron

Luc Devroye, David Avis, 2000, Inf. Process. Lett..

123 Optimal Design of Flexible Structures utilizing Enumeration Algorithms for Rigid Framework

Makoto Ohsaki, Takuya Kinoshita, David Avis, 2006 .

The Probabilistic Analysis of a Heuristic for the Assignment Problem

David Avis, C. W. Lai, 1988, SIAM J. Comput..

The cut cone, L1 embeddability, complexity, and multicommodity flows

David Avis, Michel Deza, D. Avis, 1991, Networks.

Computing the largest empty convex subset of a set of points

David Avis, David Rappaport, D. Avis, 1985, SCG '85.

Preface

David Avis, 1991, Discret. Appl. Math..

Triangulating simplicial point sets in space

David Avis, Hossam A. ElGindy, 1986, SCG '86.

On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities

David Avis, 2002, JCDCG.

Compact linear programs for 2SAT pdf

Hans Raj Tiwary, David Avis, 2019, Eur. J. Comb..

On a convex hull algorithm for polygons and its application to triangulation problems

Godfried T. Toussaint, David Avis, D. Avis, 1982, Pattern Recognit..

Polyhedral line transversals in space

David Avis, Rephael Wenger, D. Avis, 1988, Discret. Comput. Geom..

Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs

David Avis, Kazuo Iwama, Daichi Paku, 2011, ISAAC.

Generating facets for the cut polytope of a graph by triangular elimination

Tsuyoshi Ito, Hiroshi Imai, David Avis, 2008, Math. Program..

Proximity Constraints in Deformable Models for Cortical Surface Identification

Alan C. Evans, David Avis, David MacDonald, 1998, MICCAI.

Distributed compression and multiparty squashed entanglement pdf

David Avis, Patrick M. Hayden, Ivan Savov, 2007, ArXiv.

Two Conjectures on the Chromatic Polynomial

Caterina De Simone, David Avis, Paolo Nobili, 2000, LATIN.

Generating Rooted Triangulations with Minimum Degree Four

David Avis, Chiu Ming Kong, D. Avis, 1996, CCCG.

Computing the volume of the union of spheres

Hiroshi Imai, David Avis, Binay K. Bhattacharya, 1988, The Visual Computer.

An Analysis of Budgeted Parallel Search on Conditional Galton–Watson Trees

Luc Devroye, David Avis, 2019, Algorithmica.

On the Existence of a Point Subset with 4 or 5 Interior Points

David Avis, Kiyoshi Hosono, Masatsugu Urabe, 1998, JCDCG.

Non-Partitionable Point Sets

David Avis, 1984, Inf. Process. Lett..

Preface

David Avis, 2007, Graphs Comb..

On the H-Free Extension Complexity of the TSP pdf

Hans Raj Tiwary, David Avis, 2015, ArXiv.

On the extension complexity of combinatorial polytopes pdf

Hans Raj Tiwary, David Avis, D. Avis, 2013, Math. Program..

Applications of a two-dimensional hidden-line algorithm to other geometric problems

Godfried T. Toussaint, David Avis, Hossam A. ElGindy, 2005, Computing.

A Linear Algorithm for Computing the Visibility Polygon from a Point

David Avis, Hossam A. ElGindy, D. Avis, 1981, J. Algorithms.

How Good Are Convex Hull Algorithms?

Raimund Seidel, David Avis, David Bremner, 1997, Comput. Geom..

Distinct Distances Determined By Subsets of a Point Set in Space

Paul Erdös, János Pach, David Avis, 1991, Comput. Geom..

On the foundations and extremal structure of the holographic entropy cone

David Avis, Sergio Hern'andez-Cuenca, 2021 .

lrsarith: a small fixed/hybrid arithmetic C library pdf

David Avis, Charles Jordan, 2021, ArXiv.

Algorithmic enumeration of surrounding polygons

Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, 2020, Discret. Appl. Math..

Two-party Bell inequalities derived from combinatorics via triangular elimination

Tsuyoshi Ito, Hiroshi Imai, David Avis, 2005 .

Hypermetric Spaces and the Hamming Cone

David Avis, D. Avis, 1981, Canadian Journal of Mathematics.

Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members

Makoto Ohsaki, Takuya Kinoshita, David Avis, 2009 .

Computational experience with the reverse search vertex enumeration algorithm

David Avis, D. Avis, 1998 .

On canonical representations of convex polyhedra

David Avis, Komei Fukuda, D. Avis, 2002 .

Bell inequalities stronger than the Clauser-Horne-Shimony-Holt inequality for three-level isotropic states

Hiroshi Imai, David Avis, Tsuvoshi Ito, 2006 .

A Combinatorial Approach to the Solitaire Game

David Avis, Shmuel Onn, Antoine Deza, 2000 .

Review: Joseph O'Rourke, Art gallery theorems and algorithms

David Avis, 1990 .

An analysis of a decomposition heuristic for the assignment problem

Luc Devroye, David Avis, 1985 .

On the complexity of vertex and facet enumeration for convex polytopes

David Avis, D. Avis, David Bremner, 1998 .

Miscellaneous Properties Of Equi-Eccentric Graphs

David Avis, Jin Akiyama, Kiyoshi Ando, 1984 .

On the multimodality of distances in convex polygons

Godfried T. Toussaint, David Avis, Binay K. Bhattacharya, 1982 .

Bell inequalities stronger than the Clauser-Horne-Shimony-Holt inequality for three-level isotropic states

Tsuyoshi Ito, Hiroshi Imai, David Avis, 2006 .

Computing Monotone Simple Circuits in the Plane

David Avis, David Rappaport, 1988 .

Extremal Metrics Induced by Graphs

David Avis, 1980 .

Enumerating Planar Minimally Rigid Graphs

Makoto Ohsaki, David Avis, Shin-ichi Tanigawa, 2005 .

Deriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes

Tsuyoshi Ito, Hiroshi Imai, David Avis, 2004 .

A C Implementation of the Reverse Search Vertex Enumeration Algorithm(Computational Geometry and Discrete Geometry)

David Avis, 1994 .