default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Avis
Person information
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i21]David Avis, Charles Jordan:
Parallel Redundancy Removal in lrslib with Application to Projections. CoRR abs/2406.00065 (2024)- 2023
- [j78]David Avis, Sergio Hernández-Cuenca
:
On the foundations and extremal structure of the holographic entropy cone. Discret. Appl. Math. 328: 16-39 (2023) - [j77]David Avis, Duc A. Hoang:
On Reconfiguration Graphs of Independent Sets Under Token Sliding. Graphs Comb. 39(3): 59 (2023) - [j76]David Avis, Duc A. Hoang:
Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding. Graphs Comb. 39(4): 88 (2023) - [i20]David Avis, Duc A. Hoang:
A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets. CoRR abs/2301.00317 (2023) - 2022
- [j75]David Avis, David Bremner:
Sparktope: linear programs from algorithms. Optim. Methods Softw. 37(3): 954-981 (2022) - [i19]David Avis, Duc A. Hoang:
On Reconfiguration Graph of Independent Sets under Token Sliding. CoRR abs/2203.16861 (2022) - 2021
- [j74]Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi:
Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. 303: 305-313 (2021) - [j73]David Avis, Charles Jordan:
mts: a light framework for parallelizing tree search codes. Optim. Methods Softw. 36(2-3): 279-300 (2021) - [i18]David Avis, Charles Jordan:
lrsarith: a small fixed/hybrid arithmetic C library. CoRR abs/2101.12425 (2021) - 2020
- [j72]David Avis, Luc Devroye:
An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees. Algorithmica 82(5): 1329-1345 (2020) - [i17]David Avis, David Bremner:
Sparktope: linear programs from algorithms. CoRR abs/2005.02853 (2020)
2010 – 2019
- 2019
- [j71]David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe:
Polynomial size linear programs for problems in P. Discret. Appl. Math. 265: 22-39 (2019) - [j70]David Avis, Hans Raj Tiwary:
Compact linear programs for 2SAT. Eur. J. Comb. 80: 17-22 (2019) - 2018
- [j69]David Avis, Charles Jordan:
mplrs: A scalable parallel vertex/facet enumeration code. Math. Program. Comput. 10(2): 267-302 (2018) - 2017
- [j68]David Avis, Oliver Friedmann:
An exponential lower bound for Cunningham's rule. Math. Program. 161(1-2): 271-305 (2017) - [j67]David Avis, Hans Raj Tiwary:
On the ℋ-free extension complexity of the TSP. Optim. Lett. 11(3): 445-455 (2017) - [i16]David Avis, Hans Raj Tiwary:
Compact linear programs for 2SAT. CoRR abs/1702.06723 (2017) - [i15]David Avis, Luc Devroye:
An analysis of budgeted parallel search on conditional Galton-Watson trees. CoRR abs/1703.10731 (2017) - [i14]David Avis, Charles Jordan:
mts: a light framework for parallelizing tree search codes. CoRR abs/1709.07605 (2017) - 2016
- [j66]David Avis, Conor Meagher:
On the directed cut cone and polytope. J. Comb. Optim. 31(4): 1685-1708 (2016) - [i13]David Avis, Charles Jordan:
A parallel framework for reverse search using mts. CoRR abs/1610.07735 (2016) - 2015
- [j65]David Avis:
George Dantzig: father of the simplex method. Bull. EATCS 116 (2015) - [j64]David Avis, Hans Raj Tiwary:
A generalization of extension complexity that captures P. Inf. Process. Lett. 115(6-8): 588-593 (2015) - [j63]David Avis, Hans Raj Tiwary:
On the extension complexity of combinatorial polytopes. Math. Program. 153(1): 95-115 (2015) - [i12]David Avis, Hans Raj Tiwary:
On the H-Free Extension Complexity of the TSP. CoRR abs/1506.08311 (2015) - [i11]David Avis, Charles Jordan:
Comparative computational results for some vertex and facet enumeration codes. CoRR abs/1510.02545 (2015) - [i10]David Avis, Charles Jordan:
mplrs: A scalable parallel vertex/facet enumeration code. CoRR abs/1511.06487 (2015) - 2014
- [j62]David Avis, Kazuo Iwama, Daichi Paku:
Reputation games for undirected graphs. Discret. Appl. Math. 166: 1-13 (2014) - [j61]Marco Cuturi, David Avis:
Ground metric learning. J. Mach. Learn. Res. 15(1): 533-564 (2014) - [i9]David Avis, Hans Raj Tiwary:
A generalization of extension complexity that captures $P$. CoRR abs/1402.5950 (2014) - [i8]David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe:
Polynomial size linear programs for non-bipartite matching problems and other problems in P. CoRR abs/1408.0807 (2014) - 2013
- [j60]David Avis, Hiroyuki Miyata, Sonoko Moriyama:
Families of polytopal digraphs that do not satisfy the shelling property. Comput. Geom. 46(3): 382-393 (2013) - [c25]David Avis, Gary Roumanis:
A Portable Parallel Implementation of the lrs Vertex Enumeration Code. COCOA 2013: 414-429 - [c24]David Avis, Hans Raj Tiwary:
On the Extension Complexity of Combinatorial Polytopes. ICALP (1) 2013: 57-68 - [i7]David Avis, Hans Raj Tiwary:
On the extension complexity of combinatorial polytopes. CoRR abs/1302.2340 (2013) - [i6]David Avis, Oliver Friedmann:
An exponential lower bound for Cunningham's rule. CoRR abs/1305.3944 (2013) - 2012
- [j59]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): 2104-2115 (2012) - [i5]David Avis, Kazuo Iwama, Daichi Paku:
Reputation Games for Undirected Graphs. CoRR abs/1205.6683 (2012) - 2011
- [c23]David Avis, Kazuo Iwama, Daichi Paku:
Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. ISAAC 2011: 415-424 - [i4]Marco Cuturi, David Avis:
Ground Metric Learning. CoRR abs/1110.2306 (2011) - [i3]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) - [i2]David Avis, Hiroyuki Miyata, Sonoko Moriyama:
Families of polytopal digraphs that do not satisfy the shelling property. CoRR abs/1110.3078 (2011) - 2010
- [c22]David Avis:
Those ubiquitous cut polyhedra. CCCG 2010: 25
2000 – 2009
- 2009
- [j58]David Avis, Sonoko Moriyama, Masaki Owari:
From Bell Inequalities to Tsirelson's Theorem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(5): 1254-1267 (2009) - 2008
- [j57]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. 40(1): 31-46 (2008) - [j56]David Avis, Bohdan Kaluzny, David Titley-Péloquin:
Visualizing and Constructing Cycles in the Simplex Method. Oper. Res. 56(2): 512-518 (2008) - [j55]David Avis, Bohdan Kaluzny:
Computing monotone disjoint paths on polytopes. J. Comb. Optim. 16(4): 328-343 (2008) - [j54]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) - [c21]David Avis, Patrick M. Hayden, Ivan Savov:
Multiparty Distributed Compression of Quantum Information. ICQNM 2008: 90-97 - 2007
- [j53]David Avis, Tsuyoshi Ito:
New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities. Discret. Appl. Math. 155(13): 1689-1699 (2007) - [j52]David Avis:
Preface. Graphs Comb. 23(Supplement-1) (2007) - [j51]David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed:
Vašek Chvátal: A Very Short Introduction. Graphs Comb. 23(Supplement-1): 41-65 (2007) - [j50]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. 23(Supplement-1): 117-134 (2007) - [j49]David Avis, Tomokazu Imamura:
A list heuristic for vertex cover. Oper. Res. Lett. 35(2): 201-204 (2007) - [c20]David Avis, Tsuyoshi Ito:
Comparison of two bounds of the quantum correlation set. ICQNM 2007: 2 - [i1]David Avis, Patrick M. Hayden, Ivan Savov:
Distributed Compression and Multiparty Squashed Entanglement. CoRR abs/0707.2792 (2007) - 2006
- [j48]David Avis, Antoine Deza:
Un des "problèmes plaisans et délectables" de Claude Berge. Discret. Math. 306(19-20): 2299-2302 (2006) - [j47]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. 89-A(5): 1378-1381 (2006) - [c19]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks. COCOON 2006: 205-215 - 2005
- [j46]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) - 2004
- [j45]David Avis, Bohdan Kaluzny:
Solving Inequalities and Proving Farkas's Lemma Made Easy. Am. Math. Mon. 111(2): 152-157 (2004) - 2003
- [j44]David Avis, Jun Umemoto:
Stronger linear programming relaxations of max-cut. Math. Program. 97(3): 451-469 (2003) - 2002
- [j43]David Avis, Caterina De Simone, Paolo Nobili:
On the chromatic polynomial of a graph. Math. Program. 92(3): 439-452 (2002) - [c18]David Avis:
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. JCDCG 2002: 51-59 - 2001
- [j42]David Avis, Antoine Deza:
On the binary solitaire cone. Discret. Appl. Math. 115(1-3): 3-14 (2001) - [j41]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): 33-40 (2001) - [j40]David Avis, Antoine Deza:
On the solitaire cone and its relationship to multi-commodity flows. Math. Program. 90(1): 27-57 (2001) - 2000
- [j39]David Avis, Luc Devroye:
Estimating the number of vertices of a polyhedron. Inf. Process. Lett. 73(3-4): 137-143 (2000) - [c17]David Avis, Caterina De Simone, Paolo Nobili:
Two Conjectures on the Chromatic Polynomial. LATIN 2000: 154-162
1990 – 1999
- 1998
- [j38]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) - [c16]David Avis:
Living with lrs. JCDCG 1998: 47-56 - [c15]David Avis, Kiyoshi Hosono, Masatsugu Urabe:
On the Existence of a Point Subset with 4 or 5 Interior Points. JCDCG 1998: 57-64 - [c14]David MacDonald, David Avis, Alan C. Evans:
Proximity Constraints in Deformable Models for Cortical Surface Identification. MICCAI 1998: 650-659 - 1997
- [j37]David Avis, David Bremner, Raimund Seidel:
How Good Are Convex Hull Algorithms?. Comput. Geom. 7: 265-301 (1997) - 1996
- [j36]David Avis:
Generating Rooted Triangulations Without Repetitions. Algorithmica 16(6): 618-632 (1996) - [j35]David Avis, Komei Fukuda:
Reverse Search for Enumeration. Discret. Appl. Math. 65(1-3): 21-46 (1996) - [c13]David Avis, Chiu Ming Kong:
Generating Rooted Triangulations with Minimum Degree Four. CCCG 1996: 56-61 - [c12]David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. SCG 1996: C-11-C-12 - [c11]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: V-17-V-18 - 1995
- [j34]David Avis, Michael E. Houle:
Computational aspects of Helly's theorem and its relatives. Int. J. Comput. Geom. Appl. 5(4): 357-367 (1995) - [c10]David Avis, David Bremner:
How Good are Convex Hull Algorithms? SCG 1995: 20-28 - 1994
- [j33]David Avis, Hiroshi Maehara:
Metric extensions and the L1 hierarchy. Discret. Math. 131(1-3): 17-28 (1994) - [c9]David MacDonald, David Avis, Alan C. Evans:
Multiple surface identification and matching in magnetic resonance images. VBC 1994 - 1993
- [j32]David Avis:
The m-core properly contains the m-divisible points in space. Pattern Recognit. Lett. 14(9): 703-705 (1993) - 1992
- [j31]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) - [j30]David Avis, Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. Discret. Comput. Geom. 8: 295-313 (1992) - [e1]David Avis:
Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992. ACM 1992, ISBN 0-89791-517-8 [contents] - 1991
- [j29]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) - [j28]David Avis:
Preface. Discret. Appl. Math. 31(2): 79 (1991) - [j27]David Avis, Michel Deza:
The cut cone, L1 embeddability, complexity, and multicommodity flows. Networks 21(6): 595-617 (1991) - [c8]David Avis, Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. SCG 1991: 98-104 - 1990
- [j26]David Avis, Mike Doskas:
Algorithms for high dimensional stabbing problems. Discret. Appl. Math. 27(1-2): 39-48 (1990) - [j25]David Avis, Hiroshi Imai:
Locating a Robot with Angle Mathematics. J. Symb. Comput. 10(3/4): 311-326 (1990) - [c7]David Avis:
On the Complexity of Isometric Embedding in the Hypercube. SIGAL International Symposium on Algorithms 1990: 348-357
1980 – 1989
- 1989
- [j24]David Avis, Mutt:
All the Facets of the Six-point Hamming Cone. Eur. J. Comb. 10(4): 309-312 (1989) - [j23]David Avis, J. M. Robert, Rephael Wenger:
Lower Bounds for Line Stabbing. Inf. Process. Lett. 33(2): 59-62 (1989) - [j22]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) - 1988
- [j21]David Avis, Rephael Wenger:
Polyhedral Line transversals in Space. Discret. Comput. Geom. 3: 257-265 (1988) - [j20]David Avis, Paul Erdös, János Pach:
Repeated distances in space. Graphs Comb. 4(1): 207-217 (1988) - [j19]David Avis, C. W. Lai:
The Probabilistic Analysis of a Heuristic for the Assignment Problem. SIAM J. Comput. 17(4): 732-741 (1988) - [j18]David Avis, Binay K. Bhattacharya, Hiroshi Imai:
Computing the volume of the union of spheres. Vis. Comput. 3(6): 323-328 (1988) - 1987
- [j17]David Avis, Hossam A. ElGindy:
Triangulating Point Sets in Space. Discret. Comput. Geom. 2: 99-111 (1987) - [j16]Arun K. Somani, Vinod K. Agarwal, David Avis:
A Generalized Theory for System Level Diagnosis. IEEE Trans. Computers 36(5): 538-546 (1987) - [c6]David Avis, Rephael Wenger:
Algorithms for Line Transversals in Space. SCG 1987: 300-307 - 1986
- [j15]David Avis:
diameter Partitioning. Discret. Comput. Geom. 1: 265-276 (1986) - [j14]David Avis, Teren Gum, Godfried T. Toussaint:
Visibility between two edges of a simple polygon. Vis. Comput. 2(6): 342-357 (1986) - [c5]David Avis, Hossam A. ElGindy:
Triangulating Simplicial Point Sets in Space. SCG 1986: 133-141 - 1985
- [j13]Jin Akiyama, Kiyoshi Ando, David Avis:
Eccentric graphs. Discret. Math. 56(1): 1-6 (1985) - [c4]David Avis:
On the partitionability of point sets in space (preliminary report). SCG 1985: 116-120 - [c3]David Avis, David Rappaport:
Computing the largest empty convex subset of a set of points. SCG 1985: 161-167 - [c2]David Avis:
Space Partitioning and its Application to Generalized Retrieval Problems. FODO 1985: 237-248 - 1984
- [j12]David Avis:
Non-Partitionable Point Sets. Inf. Process. Lett. 19(3): 125-129 (1984) - 1983
- [j11]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) - [j10]David Avis:
A survey of heuristics for the weighted matching problem. Networks 13(4): 475-493 (1983) - [j9]David Avis, Hossam A. ElGindy:
A combinational approach to polygon similarity. IEEE Trans. Inf. Theory 29(1): 148-150 (1983) - 1982
- [j8]Godfried T. Toussaint, David Avis:
On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognit. 15(1): 23-29 (1982) - 1981
- [j7]Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era:
Balancing signed graphs. Discret. Appl. Math. 3(4): 227-233 (1981) - [j6]Hossam A. ElGindy, David Avis:
A Linear Algorithm for Computing the Visibility Polygon from a Point. J. Algorithms 2(2): 186-197 (1981) - [j5]David Avis, Godfried T. Toussaint:
An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognit. 13(6): 395-398 (1981) - [j4]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) - 1980
- [j3]David Avis:
Comments on a Lower Bound for Convex Hull Determination. Inf. Process. Lett. 11(3): 126 (1980)
1970 – 1979
- 1979
- [j2]Duncan McCallum, David Avis:
A Linear Algorithm for Finding the Convex Hull of a Simple Polygon. Inf. Process. Lett. 9(5): 201-206 (1979) - [j1]David Avis:
On minimal 5-chromatic triangle-free graphs. J. Graph Theory 3(4): 397-400 (1979) - 1977
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
