David Avis

ORCID

Publication Activity (10 Years)

Years Active: 1977-2024
Publications (10 Years): 28

Top Venues

Publications

David Avis, Charles Jordan
Parallel Redundancy Removal in lrslib with Application to Projections. CoRR (2024)
David Avis, Sergio Hernández-Cuenca
On the foundations and extremal structure of the holographic entropy cone. Discret. Appl. Math. 328 (2023)
David Avis, Duc A. Hoang
On Reconfiguration Graphs of Independent Sets Under Token Sliding. Graphs Comb. 39 (3) (2023)
David Avis, Duc A. Hoang
Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding. Graphs Comb. 39 (4) (2023)
David Avis, Duc A. Hoang
A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets. CoRR (2023)
David Avis, David Bremner
Sparktope: linear programs from algorithms. Optim. Methods Softw. 37 (3) (2022)
David Avis, Duc A. Hoang
On Reconfiguration Graph of Independent Sets under Token Sliding. CoRR (2022)
David Avis, Charles Jordan
lrsarith: a small fixed/hybrid arithmetic C library. CoRR (2021)
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. 303 (2021)
David Avis, Charles Jordan
mts: a light framework for parallelizing tree search codes. Optim. Methods Softw. 36 (2-3) (2021)
David Avis, David Bremner
Sparktope: linear programs from algorithms. CoRR (2020)
David Avis, Luc Devroye
An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees. Algorithmica 82 (5) (2020)
David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe
Polynomial size linear programs for problems in P. Discret. Appl. Math. 265 (2019)
David Avis, Hans Raj Tiwary
Compact linear programs for 2SAT. Eur. J. Comb. 80 (2019)
David Avis, Charles Jordan
mplrs: A scalable parallel vertex/facet enumeration code. Math. Program. Comput. 10 (2) (2018)
David Avis, Charles Jordan
mts: a light framework for parallelizing tree search codes. CoRR (2017)
David Avis, Oliver Friedmann
An exponential lower bound for Cunningham's rule. Math. Program. 161 (1-2) (2017)
David Avis, Hans Raj Tiwary
Compact linear programs for 2SAT. CoRR (2017)
David Avis, Luc Devroye
An analysis of budgeted parallel search on conditional Galton-Watson trees. CoRR (2017)
David Avis, Hans Raj Tiwary
On the ℋ-free extension complexity of the TSP. Optim. Lett. 11 (3) (2017)
David Avis, Charles Jordan
A parallel framework for reverse search using mts. CoRR (2016)
David Avis, Conor Meagher
On the directed cut cone and polytope. J. Comb. Optim. 31 (4) (2016)
David Avis, Charles Jordan
mplrs: A scalable parallel vertex/facet enumeration code. CoRR (2015)
David Avis, Charles Jordan
Comparative computational results for some vertex and facet enumeration codes. CoRR (2015)
David Avis, Hans Raj Tiwary
On the H-Free Extension Complexity of the TSP. CoRR (2015)
David Avis, Hans Raj Tiwary
On the extension complexity of combinatorial polytopes. Math. Program. 153 (1) (2015)
David Avis, Hans Raj Tiwary
A generalization of extension complexity that captures P. Inf. Process. Lett. 115 (6-8) (2015)
David Avis
George Dantzig: father of the simplex method. Bull. EATCS 116 (2015)
David Avis, Hans Raj Tiwary
A generalization of extension complexity that captures $P$. CoRR (2014)
David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe
Polynomial size linear programs for non-bipartite matching problems and other problems in P. CoRR (2014)
Marco Cuturi, David Avis
Ground metric learning. J. Mach. Learn. Res. 15 (1) (2014)
David Avis, Kazuo Iwama, Daichi Paku
Reputation games for undirected graphs. Discret. Appl. Math. 166 (2014)
David Avis, Hans Raj Tiwary
On the extension complexity of combinatorial polytopes CoRR (2013)
David Avis, Oliver Friedmann
An exponential lower bound for Cunningham's rule CoRR (2013)
David Avis, Hiroyuki Miyata, Sonoko Moriyama
Families of polytopal digraphs that do not satisfy the shelling property. Comput. Geom. 46 (3) (2013)
David Avis, Gary Roumanis
A Portable Parallel Implementation of the lrs Vertex Enumeration Code. COCOA (2013)
David Avis, Hans Raj Tiwary
On the Extension Complexity of Combinatorial Polytopes. ICALP (1) (2013)
David Avis, Kazuo Iwama, Daichi Paku
Reputation Games for Undirected Graphs CoRR (2012)
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. Discret. Appl. Math. 160 (15) (2012)
David Avis, Hiroyuki Miyata, Sonoko Moriyama
Families of polytopal digraphs that do not satisfy the shelling property CoRR (2011)
Marco Cuturi, David Avis
Ground Metric Learning CoRR (2011)
David Avis, Kazuo Iwama, Daichi Paku
Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. ISAAC (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 (2011)
David Avis
Those ubiquitous cut polyhedra. CCCG (2010)
David Avis, Sonoko Moriyama, Masaki Owari
From Bell Inequalities to Tsirelson's Theorem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2009)
David Avis, Patrick M. Hayden, Ivan Savov
Multiparty Distributed Compression of Quantum Information. ICQNM (2008)
David Avis, Bohdan Kaluzny, David Titley-Péloquin
Visualizing and Constructing Cycles in the Simplex Method. Oper. Res. 56 (2) (2008)
David Avis, Hiroshi Imai, Tsuyoshi Ito
Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. 112 (2) (2008)
David Avis, Bohdan Kaluzny
Computing monotone disjoint paths on polytopes. J. Comb. Optim. 16 (4) (2008)
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. 40 (1) (2008)
David Avis
Preface. Graphs Comb. 23 (Supplement-1) (2007)
David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed
Vašek Chvátal: A Very Short Introduction. Graphs Comb. 23 (Supplement-1) (2007)
David Avis, Patrick M. Hayden, Ivan Savov
Distributed Compression and Multiparty Squashed Entanglement. CoRR (2007)
David Avis, Tomokazu Imamura
A list heuristic for vertex cover. Oper. Res. Lett. 35 (2) (2007)
David Avis, Tsuyoshi Ito
Comparison of two bounds of the quantum correlation set. ICQNM (2007)
David Avis, Tsuyoshi Ito
Bell inequalities. Discret. Appl. Math. 155 (13) (2007)
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. 23 (Supplement-1) (2007)
David Avis, Jun Hasegawa, Yosuke Kikuchi, Yuuya Sasaki
A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2006)
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Enumerating Non-crossing Minimally Rigid Frameworks. COCOON (2006)
David Avis, Antoine Deza
Un des "problèmes plaisans et délectables" de Claude Berge. Discret. Math. 306 (19-20) (2006)
David Avis, Caterina De Simone, Bruce A. Reed
On the fractional chromatic index of a graph and its complement. Oper. Res. Lett. 33 (4) (2005)
David Avis, Bohdan Kaluzny
Solving Inequalities and Proving Farkas's Lemma Made Easy. Am. Math. Mon. 111 (2) (2004)
David Avis, Jun Umemoto
Stronger linear programming relaxations of max-cut. Math. Program. 97 (3) (2003)
David Avis
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. JCDCG (2002)
David Avis, Caterina De Simone, Paolo Nobili
On the chromatic polynomial of a graph. Math. Program. 92 (3) (2002)
David Avis, Antoine Deza
On the solitaire cone and its relationship to multi-commodity flows. Math. Program. 90 (1) (2001)
David Avis, Kiyoshi Hosono, Masatsugu Urabe
On the existence of a point subset with a specified number of interior points. Discret. Math. 241 (1-3) (2001)
David Avis, Antoine Deza
On the binary solitaire cone. Discret. Appl. Math. 115 (1-3) (2001)
David Avis, Caterina De Simone, Paolo Nobili
Two Conjectures on the Chromatic Polynomial. LATIN (2000)
David Avis, Luc Devroye
Estimating the number of vertices of a polyhedron. Inf. Process. Lett. 73 (3-4) (2000)
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) (1998)
David Avis, Kiyoshi Hosono, Masatsugu Urabe
On the Existence of a Point Subset with 4 or 5 Interior Points. JCDCG (1998)
David MacDonald, David Avis, Alan C. Evans
Proximity Constraints in Deformable Models for Cortical Surface Identification. MICCAI (1998)
David Avis
. JCDCG (1998)
David Avis, David Bremner, Raimund Seidel
How Good Are Convex Hull Algorithms?. Comput. Geom. 7 (1997)
David Avis, Chiu Ming Kong
Generating Rooted Triangulations with Minimum Degree Four. CCCG (1996)
Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis
A Package for Triangulations. SCG (1996)
David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
On the Sectional Area of Convex Polytopes. SCG (1996)
David Avis, Komei Fukuda
Reverse Search for Enumeration. Discret. Appl. Math. 65 (1-3) (1996)
David Avis
Generating Rooted Triangulations Without Repetitions. Algorithmica 16 (6) (1996)
David Avis, Michael E. Houle
Computational aspects of Helly's theorem and its relatives. Int. J. Comput. Geom. Appl. 5 (4) (1995)
David Avis, David Bremner
How Good are Convex Hull Algorithms? SCG (1995)
David MacDonald, David Avis, Alan C. Evans
Multiple surface identification and matching in magnetic resonance images. VBC (1994)
David Avis, Hiroshi Maehara
hierarchy. Discret. Math. 131 (1-3) (1994)
David Avis
The m-core properly contains the m-divisible points in space. Pattern Recognit. Lett. 14 (9) (1993)
David Avis, Komei Fukuda
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. Discret. Comput. Geom. 8 (1992)
David Avis, Viatcheslav P. Grishukhin
A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. Comput. Geom. 2 (1992)
David Avis
Preface. Discret. Appl. Math. 31 (2) (1991)
David Avis, Komei Fukuda
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. SCG (1991)
David Avis, Paul Erdös, János Pach
Distinct Distances Determined By Subsets of a Point Set in Space. Comput. Geom. 1 (1991)
David Avis, Michel Deza
embeddability, complexity, and multicommodity flows. Networks 21 (6) (1991)
David Avis, Hiroshi Imai
Locating a Robot with Angle Mathematics. J. Symb. Comput. 10 (3/4) (1990)
David Avis, Mike Doskas
Algorithms for high dimensional stabbing problems. Discret. Appl. Math. 27 (1-2) (1990)
David Avis
On the Complexity of Isometric Embedding in the Hypercube. SIGAL International Symposium on Algorithms (1990)
Arun K. Somani, Vinod K. Agarwal, David Avis
On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems. IEEE Trans. Computers 38 (2) (1989)
David Avis, Mutt
All the Facets of the Six-point Hamming Cone. Eur. J. Comb. 10 (4) (1989)
David Avis, J. M. Robert, Rephael Wenger
Lower Bounds for Line Stabbing. Inf. Process. Lett. 33 (2) (1989)
David Avis, Binay K. Bhattacharya, Hiroshi Imai
Computing the volume of the union of spheres. Vis. Comput. 3 (6) (1988)
David Avis, Rephael Wenger
Polyhedral Line transversals in Space. Discret. Comput. Geom. 3 (1988)
David Avis, Paul Erdös, János Pach
Repeated distances in space. Graphs Comb. 4 (1) (1988)

David Avis.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David Avis