H V -symmetric polyhedra and bipolarity.

David Avis McGill University, Montreal, Canada http://cgm.cs.mcgill.ca/~avis/ https://zbmath.org/authors/?q=ai:avis.david-m https://mathscinet.ams.org/mathscinet/MRAuthorID/28440 https://mathgenealogy.org/id.php?id=73405 https://en.wikipedia.org/wiki/David_Avis https://orcid.org/0000-0003-2977-2795 https://www.wikidata.org/entity/Q3709153 http://isni.org/isni/0000000117368336 https://id.loc.gov/authorities/names/n88610398

David Avis H V -symmetric polyhedra and bipolarity. 210-213 2026 382 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2025.10.062 db/journals/dam/dam382.html#Avis26 streams/journals/dam

David Avis Duc A. Hoang 0001 A Note on Acyclic Token Sliding Reconfiguration Graphs of Independent Sets. 133-154 2024 159 Ars Comb. 1 https://doi.org/10.61091/ars159-12 db/journals/arscom/arscom159.html#AvisH24 streams/journals/arscom

David Avis Charles Jordan Parallel Redundancy Removal in lrslib with Application to Projections. 2024 abs/2406.00065 CoRR https://doi.org/10.48550/arXiv.2406.00065 db/journals/corr/corr2406.html#abs-2406-00065 streams/journals/corr

David Avis Sergio Hernández-Cuenca On the foundations and extremal structure of the holographic entropy cone. 16-39 2023 March 328 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2022.11.016 db/journals/dam/dam328.html#AvisH23

David Avis Duc A. Hoang 0001 On Reconfiguration Graphs of Independent Sets Under Token Sliding. 59 2023 June 39 Graphs Comb. 3 https://doi.org/10.1007/s00373-023-02644-w db/journals/gc/gc39.html#AvisH23

David Avis Duc A. Hoang 0001 Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding. 88 2023 August 39 Graphs Comb. 4 https://doi.org/10.1007/s00373-023-02684-2 db/journals/gc/gc39.html#AvisH23a

David Avis Duc A. Hoang 0001 A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets. 2023 abs/2301.00317 CoRR https://doi.org/10.48550/arXiv.2301.00317 db/journals/corr/corr2301.html#abs-2301-00317

David Avis David Bremner Sparktope: linear programs from algorithms. 954-981 2022 37 Optim. Methods Softw. 3 https://doi.org/10.1080/10556788.2020.1864370 db/journals/oms/oms37.html#AvisB22

David Avis Duc A. Hoang 0001 On Reconfiguration Graph of Independent Sets under Token Sliding. 2022 abs/2203.16861 CoRR https://doi.org/10.48550/arXiv.2203.16861 db/journals/corr/corr2203.html#abs-2203-16861

Katsuhisa Yamanaka David Avis Takashi Horiyama Yoshio Okamoto Ryuhei Uehara Tanami Yamauchi Algorithmic enumeration of surrounding polygons. 305-313 2021 303 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2020.03.034 db/journals/dam/dam303.html#YamanakaAHOUY21

David Avis Charles Jordan mts: a light framework for parallelizing tree search codes. 279-300 2021 36 Optim. Methods Softw. 2-3 https://doi.org/10.1080/10556788.2019.1692344 https://www.wikidata.org/entity/Q126744496 db/journals/oms/oms36.html#AvisJ21

David Avis Charles Jordan lrsarith: a small fixed/hybrid arithmetic C library. 2021 abs/2101.12425 CoRR https://arxiv.org/abs/2101.12425 db/journals/corr/corr2101.html#abs-2101-12425

David Avis Luc Devroye An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees. 1329-1345 2020 82 Algorithmica 5 https://doi.org/10.1007/s00453-019-00645-x https://www.wikidata.org/entity/Q126793813 db/journals/algorithmica/algorithmica82.html#AvisD20

David Avis David Bremner Sparktope: linear programs from algorithms. 2020 abs/2005.02853 CoRR https://arxiv.org/abs/2005.02853 db/journals/corr/corr2005.html#abs-2005-02853

David Avis David Bremner Hans Raj Tiwary Osamu Watanabe 0001 Polynomial size linear programs for problems in P. 22-39 2019 265 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.03.016 https://www.wikidata.org/entity/Q128020829 db/journals/dam/dam265.html#AvisBTW19

David Avis Hans Raj Tiwary Compact linear programs for 2SAT. 17-22 2019 80 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2018.02.011 https://www.wikidata.org/entity/Q129979154 db/journals/ejc/ejc80.html#AvisT19

David Avis Charles Jordan mplrs: A scalable parallel vertex/facet enumeration code. 267-302 2018 10 Math. Program. Comput. 2 https://doi.org/10.1007/s12532-017-0129-y db/journals/mpc/mpc10.html#AvisJ18

David Avis Oliver Friedmann An exponential lower bound for Cunningham's rule. 271-305 2017 161 Math. Program. 1-2 https://doi.org/10.1007/s10107-016-1008-4 https://www.wikidata.org/entity/Q115606183 db/journals/mp/mp161.html#AvisF17

David Avis Hans Raj Tiwary On the ℋ-free extension complexity of the TSP. 445-455 2017 11 Optim. Lett. 3 https://doi.org/10.1007/s11590-016-1029-1 db/journals/ol/ol11.html#AvisT17

David Avis Hans Raj Tiwary Compact linear programs for 2SAT. 2017 abs/1702.06723 CoRR http://arxiv.org/abs/1702.06723 db/journals/corr/corr1702.html#AvisT17

David Avis Luc Devroye An analysis of budgeted parallel search on conditional Galton-Watson trees. 2017 abs/1703.10731 CoRR http://arxiv.org/abs/1703.10731 db/journals/corr/corr1703.html#AvisD17

David Avis Charles Jordan mts: a light framework for parallelizing tree search codes. 2017 abs/1709.07605 CoRR http://arxiv.org/abs/1709.07605 db/journals/corr/corr1709.html#abs-1709-07605

David Avis Conor Meagher On the directed cut cone and polytope. 1685-1708 2016 31 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-015-9863-0 db/journals/jco/jco31.html#AvisM16

David Avis Charles Jordan A parallel framework for reverse search using mts. 2016 abs/1610.07735 CoRR http://arxiv.org/abs/1610.07735 db/journals/corr/corr1610.html#AvisJ16

David Avis George Dantzig: father of the simplex method. 2015 116 Bull. EATCS http://eatcs.org/beatcs/index.php/beatcs/article/view/340 db/journals/eatcs/eatcs116.html#Avis15

David Avis Hans Raj Tiwary A generalization of extension complexity that captures P. 588-593 2015 115 Inf. Process. Lett. 6-8 https://doi.org/10.1016/j.ipl.2015.02.005 db/journals/ipl/ipl115.html#AvisT15

David Avis Hans Raj Tiwary On the extension complexity of combinatorial polytopes. 95-115 2015 153 Math. Program. 1 https://doi.org/10.1007/s10107-014-0764-2 db/journals/mp/mp153.html#AvisT15

David Avis Hans Raj Tiwary On the H-Free Extension Complexity of the TSP. 2015 abs/1506.08311 CoRR http://arxiv.org/abs/1506.08311 db/journals/corr/corr1506.html#AvisT15

David Avis Charles Jordan Comparative computational results for some vertex and facet enumeration codes. 2015 abs/1510.02545 CoRR http://arxiv.org/abs/1510.02545 db/journals/corr/corr1510.html#AvisJ15

David Avis Charles Jordan mplrs: A scalable parallel vertex/facet enumeration code. 2015 abs/1511.06487 CoRR http://arxiv.org/abs/1511.06487 db/journals/corr/corr1511.html#AvisJ15a

David Avis Kazuo Iwama Daichi Paku Reputation games for undirected graphs. 1-13 2014 166 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2013.09.022 db/journals/dam/dam166.html#AvisIP14

Marco Cuturi David Avis Ground metric learning. 533-564 2014 15 J. Mach. Learn. Res. 1 https://dl.acm.org/doi/10.5555/2627435.2627452 db/journals/jmlr/jmlr15.html#CuturiA14

David Avis Hans Raj Tiwary A generalization of extension complexity that captures $P$. 2014 abs/1402.5950 CoRR http://arxiv.org/abs/1402.5950 db/journals/corr/corr1402.html#AvisT14

David Avis David Bremner Hans Raj Tiwary Osamu Watanabe 0001 Polynomial size linear programs for non-bipartite matching problems and other problems in P. 2014 abs/1408.0807 CoRR http://arxiv.org/abs/1408.0807 db/journals/corr/corr1408.html#AvisBTW14

David Avis Hiroyuki Miyata Sonoko Moriyama Families of polytopal digraphs that do not satisfy the shelling property. 382-393 2013 46 Comput. Geom. 3 https://doi.org/10.1016/j.comgeo.2012.10.005 db/journals/comgeo/comgeo46.html#AvisMM13

David Avis Gary Roumanis A Portable Parallel Implementation of the lrs Vertex Enumeration Code. 414-429 2013 COCOA https://doi.org/10.1007/978-3-319-03780-6_36 conf/cocoa/2013 db/conf/cocoa/cocoa2013.html#AvisR13 David Avis Hans Raj Tiwary On the Extension Complexity of Combinatorial Polytopes. 57-68 2013 ICALP (1) https://doi.org/10.1007/978-3-642-39206-1_6 conf/icalp/2013-1 db/conf/icalp/icalp2013-1.html#AvisT13

David Avis Hans Raj Tiwary On the extension complexity of combinatorial polytopes http://arxiv.org/abs/1302.2340 2013 CoRR abs/1302.2340 db/journals/corr/corr1302.html#abs-1302-2340

David Avis Oliver Friedmann An exponential lower bound for Cunningham's rule http://arxiv.org/abs/1305.3944 2013 CoRR abs/1305.3944 db/journals/corr/corr1305.html#abs-1305-3944

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. 2104-2115 2012 160 Discret. Appl. Math. 15 https://doi.org/10.1016/j.dam.2012.05.023 db/journals/dam/dam160.html#AoshimaADMM12

David Avis Kazuo Iwama Daichi Paku Reputation Games for Undirected Graphs http://arxiv.org/abs/1205.6683 2012 CoRR abs/1205.6683 db/journals/corr/corr1205.html#abs-1205-6683

David Avis Kazuo Iwama Daichi Paku Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. 415-424 2011 ISAAC https://doi.org/10.1007/978-3-642-25591-5_43 conf/isaac/2011 db/conf/isaac/isaac2011.html#AvisIP11

Marco Cuturi David Avis Ground Metric Learning http://arxiv.org/abs/1110.2306 2011 CoRR abs/1110.2306 db/journals/corr/corr1110.html#abs-1110-2306

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 http://arxiv.org/abs/1110.3014 2011 CoRR abs/1110.3014 db/journals/corr/corr1110.html#abs-1110-3014

David Avis Hiroyuki Miyata Sonoko Moriyama Families of polytopal digraphs that do not satisfy the shelling property http://arxiv.org/abs/1110.3078 2011 CoRR abs/1110.3078 db/journals/corr/corr1110.html#abs-1110-3078

David Avis Those ubiquitous cut polyhedra. 25 2010 CCCG http://cccg.ca/proceedings/2010/paper09.pdf conf/cccg/2010 db/conf/cccg/cccg2010.html#Avis10

David Avis Sonoko Moriyama Masaki Owari From Bell Inequalities to Tsirelson's Theorem. 1254-1267 2009 92-A IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 5 https://doi.org/10.1587/transfun.E92.A.1254 http://search.ieice.org/bin/summary.php?id=e92-a_5_1254&category=A&year=2009&lang=E&abst= https://www.wikidata.org/entity/Q62586296 db/journals/ieicet/ieicet92a.html#AvisMO09

David Avis Naoki Katoh Makoto Ohsaki Ileana Streinu Shin-ichi Tanigawa Enumerating Constrained Non-crossing Minimally Rigid Frameworks. 31-46 2008 40 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-007-9026-x db/journals/dcg/dcg40.html#AvisKOST08

David Avis Bohdan Kaluzny David Titley-Péloquin Visualizing and Constructing Cycles in the Simplex Method. 512-518 2008 56 Oper. Res. 2 https://doi.org/10.1287/opre.1070.0474 db/journals/ior/ior56.html#AvisKT08

David Avis Bohdan Kaluzny Computing monotone disjoint paths on polytopes. 328-343 2008 16 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-008-9151-3 db/journals/jco/jco16.html#AvisK08

David Avis Hiroshi Imai Tsuyoshi Ito Generating facets for the cut polytope of a graph by triangular elimination. 303-325 2008 112 Math. Program. 2 https://doi.org/10.1007/s10107-006-0018-z db/journals/mp/mp112.html#AvisII08

David Avis Patrick M. Hayden Ivan Savov Multiparty Distributed Compression of Quantum Information. 90-97 2008 ICQNM https://doi.org/10.1109/ICQNM.2008.19 https://doi.ieeecomputersociety.org/10.1109/ICQNM.2008.19 conf/icqnm/2008 db/conf/icqnm/icqnm2008.html#AvisHS08

David Avis Tsuyoshi Ito New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities. 1689-1699 2007 155 Discret. Appl. Math. 13 https://doi.org/10.1016/j.dam.2007.03.005 db/journals/dam/dam155.html#AvisI07

David Avis Preface. 2007 23 Graphs Comb. Supplement-1 https://doi.org/10.1007/s00373-007-0744-x db/journals/gc/gc23.html#Avis07

David Avis J. Adrian Bondy William J. Cook Bruce A. Reed Vašek Chvátal: A Very Short Introduction. 41-65 2007 23 Graphs Comb. Supplement-1 https://doi.org/10.1007/s00373-007-0721-4 https://www.wikidata.org/entity/Q59699134 db/journals/gc/gc23.html#AvisBCR07

David Avis Naoki Katoh Makoto Ohsaki Ileana Streinu Shin-ichi Tanigawa Enumerating Non-crossing Minimally Rigid Frameworks. 117-134 2007 23 Graphs Comb. Supplement-1 https://doi.org/10.1007/s00373-007-0709-0 db/journals/gc/gc23.html#AvisKOST07

David Avis Tomokazu Imamura A list heuristic for vertex cover. 201-204 2007 35 Oper. Res. Lett. 2 https://doi.org/10.1016/j.orl.2006.03.014 db/journals/orl/orl35.html#AvisI07

David Avis Tsuyoshi Ito Comparison of two bounds of the quantum correlation set. 2 2007 conf/icqnm/2007 ICQNM https://doi.org/10.1109/ICQNM.2007.5 https://doi.ieeecomputersociety.org/10.1109/ICQNM.2007.5 db/conf/icqnm/icqnm2007.html#AvisI07

David Avis Patrick M. Hayden Ivan Savov Distributed Compression and Multiparty Squashed Entanglement. 2007 abs/0707.2792 CoRR http://arxiv.org/abs/0707.2792 db/journals/corr/corr0707.html#AvisHS07

David Avis Antoine Deza Un des "problèmes plaisans et délectables" de Claude Berge. 2299-2302 2006 306 Discret. Math. 19-20 https://doi.org/10.1016/j.disc.2005.12.027 db/journals/dm/dm306.html#AvisD06

David Avis Jun Hasegawa Yosuke Kikuchi Yuuya Sasaki A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs. 1378-1381 2006 89-A IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 5 https://doi.org/10.1093/ietfec/e89-a.5.1378 db/journals/ieicet/ieicet89a.html#AvisHKS06

David Avis Naoki Katoh Makoto Ohsaki Ileana Streinu Shin-ichi Tanigawa Enumerating Non-crossing Minimally Rigid Frameworks. 205-215 2006 conf/cocoon/2006 COCOON https://doi.org/10.1007/11809678_23 db/conf/cocoon/cocoon2006.html#AvisKOST06

David Avis Caterina De Simone Bruce A. Reed On the fractional chromatic index of a graph and its complement. 385-388 2005 33 Oper. Res. Lett. 4 https://doi.org/10.1016/j.orl.2004.08.009 db/journals/orl/orl33.html#AvisSR05

David Avis Bohdan Kaluzny Solving Inequalities and Proving Farkas's Lemma Made Easy. 152-157 2004 111 Am. Math. Mon. 2 http://www.jstor.org/stable/4145216 db/journals/tamm/tamm111.html#AvisK04

David Avis Jun Umemoto Stronger linear programming relaxations of max-cut. 451-469 2003 97 Math. Program. 3 https://doi.org/10.1007/s10107-003-0423-5 db/journals/mp/mp97.html#AvisU03

David Avis Caterina De Simone Paolo Nobili On the chromatic polynomial of a graph. 439-452 2002 92 Math. Program. 3 https://doi.org/10.1007/s101070100285 db/journals/mp/mp92.html#AvisSN02

David Avis On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. 51-59 https://doi.org/10.1007/978-3-540-44400-8_6 2002 conf/jcdcg/2002 JCDCG db/conf/jcdcg/jcdcg2002.html#Avis02

David Avis Antoine Deza On the binary solitaire cone. 3-14 2001 115 Discret. Appl. Math. 1-3 db/journals/dam/dam115.html#AvisD01 https://doi.org/10.1016/S0166-218X(01)00211-6 https://www.wikidata.org/entity/Q126352981

David Avis Kiyoshi Hosono Masatsugu Urabe On the existence of a point subset with a specified number of interior points. 33-40 2001 241 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(01)00108-X db/journals/dm/dm241.html#AvisHU01

David Avis Antoine Deza On the solitaire cone and its relationship to multi-commodity flows. 27-57 2001 90 Math. Program. 1 https://doi.org/10.1007/PL00011419 https://www.wikidata.org/entity/Q56069004 db/journals/mp/mp90.html#AvisD01

David Avis Luc Devroye Estimating the number of vertices of a polyhedron. 137-143 2000 73 Inf. Process. Lett. 3-4 db/journals/ipl/ipl73.html#AvisD00 https://doi.org/10.1016/S0020-0190(00)00011-9

David Avis Caterina De Simone Paolo Nobili Two Conjectures on the Chromatic Polynomial. 154-162 2000 conf/latin/2000 LATIN db/conf/latin/latin2000.html#AvisSN00 https://doi.org/10.1007/10719839_17

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. 278-296 1998 28 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp28.html#AvisBDEGHZ98 https://doi.org/10.1137/S0097539794277871

David Avis Living with lrs. 47-56 1998 conf/jcdcg/1998 JCDCG db/conf/jcdcg/jcdcg1998.html#Avis98 https://doi.org/10.1007/978-3-540-46515-7_4 David Avis Kiyoshi Hosono Masatsugu Urabe On the Existence of a Point Subset with 4 or 5 Interior Points. 57-64 1998 conf/jcdcg/1998 JCDCG db/conf/jcdcg/jcdcg1998.html#AvisHU98 https://doi.org/10.1007/978-3-540-46515-7_5 David MacDonald David Avis Alan C. Evans Proximity Constraints in Deformable Models for Cortical Surface Identification. 650-659 https://doi.org/10.1007/BFb0056251 1998 conf/miccai/1998 MICCAI db/conf/miccai/miccai1998.html#MacDonaldAE98

David Avis David Bremner Raimund Seidel How Good Are Convex Hull Algorithms?. 265-301 1997 7 Comput. Geom. db/journals/comgeo/comgeo7.html#WelzlABS97 https://doi.org/10.1016/S0925-7721(96)00023-5 https://www.wikidata.org/entity/Q29542125

David Avis Generating Rooted Triangulations Without Repetitions. 618-632 1996 16 Algorithmica 6 db/journals/algorithmica/algorithmica16.html#Avis96 https://doi.org/10.1007/BF01944353

David Avis Komei Fukuda Reverse Search for Enumeration. 21-46 1996 65 Discret. Appl. Math. 1-3 https://doi.org/10.1016/0166-218X(95)00026-N https://www.wikidata.org/entity/Q56506110 db/journals/dam/dam65.html#AvisF96

David Avis Chiu Ming Kong Generating Rooted Triangulations with Minimum Degree Four. 56-61 1996 conf/cccg/1996 CCCG db/conf/cccg/cccg1996.html#AvisK96 http://www.cccg.ca/proceedings/1996/cccg1996_0010.pdf David Avis Prosenjit Bose Godfried T. Toussaint Thomas C. Shermer Binhai Zhu Jack Snoeyink On the Sectional Area of Convex Polytopes. C-11-C-12 1996 conf/compgeom/1996 SCG https://doi.org/10.1145/237218.237411 db/conf/compgeom/compgeom96.html#AvisBTSZS96 Tsuyoshi Ono Yoshiaki Kyoda Tomonari Masada Kazuyoshi Hayase Tetsuo Shibuya Motoki Nakade Mary Inaba Hiroshi Imai Keiko Imai David Avis A Package for Triangulations. V-17-V-18 1996 conf/compgeom/1996 SCG https://doi.org/10.1145/237218.237430 db/conf/compgeom/compgeom96.html#OnoKMHSNIIIA96

David Avis Michael E. Houle Computational aspects of Helly's theorem and its relatives. 357-367 1995 5 Int. J. Comput. Geom. Appl. 4 db/journals/ijcga/ijcga5.html#AvisH95 https://doi.org/10.1142/S0218195995000222

David Avis David Bremner How Good are Convex Hull Algorithms? 20-28 1995 conf/compgeom/1995 SCG https://doi.org/10.1145/220279.220282 db/conf/compgeom/compgeom95.html#AvisB95

David Avis Hiroshi Maehara Metric extensions and the L1 hierarchy. 17-28 1994 131 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(94)90369-7 db/journals/dm/dm131.html#AvisM94

David MacDonald David Avis Alan C. Evans Multiple surface identification and matching in magnetic resonance images. 1994 VBC https://doi.org/10.1117/12.185176 conf/vbc/1994 db/conf/vbc/vbc1994.html#MacDonaldAE94

David Avis The m-core properly contains the m-divisible points in space. 703-705 1993 14 Pattern Recognit. Lett. 9 https://doi.org/10.1016/0167-8655(93)90138-4 db/journals/prl/prl14.html#Avis93

David Avis Viatcheslav P. Grishukhin A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. 241-254 1992 2 Comput. Geom. db/journals/comgeo/comgeo2.html#AvisG92 https://doi.org/10.1016/0925-7721(93)90021-W

David Avis Komei Fukuda A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. 295-313 1992 8 Discret. Comput. Geom. db/journals/dcg/dcg8.html#AvisF92 https://doi.org/10.1007/BF02293050 https://www.wikidata.org/entity/Q30051803

David Avis Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992 SCG ACM 1992 0-89791-517-8 https://doi.org/10.1145/142675 db/conf/compgeom/compgeom92.html

David Avis Paul Erdös János Pach Distinct Distances Determined By Subsets of a Point Set in Space. 1-11 1991 1 Comput. Geom. db/journals/comgeo/comgeo1.html#AvisEP91 https://doi.org/10.1016/0925-7721(91)90009-4 https://www.wikidata.org/entity/Q101208128

David Avis Preface. 79 1991 31 Discret. Appl. Math. 2 https://doi.org/10.1016/0166-218X(91)90061-Z db/journals/dam/dam31.html#Avis91

David Avis Michel Deza The cut cone, L1 embeddability, complexity, and multicommodity flows. 595-617 1991 21 Networks 6 https://doi.org/10.1002/net.3230210602 db/journals/networks/networks21.html#AvisD91

David Avis Komei Fukuda A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. 98-104 1991 conf/compgeom/1991 SCG https://doi.org/10.1145/109648.109659 db/conf/compgeom/compgeom91.html#AvisF91

David Avis Mike Doskas Algorithms for high dimensional stabbing problems. 39-48 1990 27 Discret. Appl. Math. 1-2 https://doi.org/10.1016/0166-218X(90)90127-X db/journals/dam/dam27.html#AvisD90

David Avis Hiroshi Imai Locating a Robot with Angle Mathematics. 311-326 1990 10 J. Symb. Comput. 3/4 db/journals/jsc/jsc10.html#AvisI90 https://doi.org/10.1016/S0747-7171(08)80066-1

David Avis On the Complexity of Isometric Embedding in the Hypercube. 348-357 1990 conf/sigal/1990 SIGAL International Symposium on Algorithms db/conf/sigal/sigal1990.html#Avis90 https://doi.org/10.1007/3-540-52921-7_84

David Avis Mutt All the Facets of the Six-point Hamming Cone. 309-312 1989 10 Eur. J. Comb. 4 https://doi.org/10.1016/S0195-6698(89)80002-2 db/journals/ejc/ejc10.html#AvisM89

David Avis J. M. Robert Rephael Wenger Lower Bounds for Line Stabbing. 59-62 1989 33 Inf. Process. Lett. 2 db/journals/ipl/ipl33.html#AvisRW89 https://doi.org/10.1016/0020-0190(89)90155-5

Arun K. Somani Vinod K. Agarwal David Avis On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems. 195-201 1989 38 IEEE Trans. Computers 2 db/journals/tc/tc38.html#SomaniAA89 https://doi.org/10.1109/12.16496 http://doi.ieeecomputersociety.org/10.1109/12.16496

David Avis Rephael Wenger Polyhedral Line transversals in Space. 257-265 1988 3 Discret. Comput. Geom. db/journals/dcg/dcg3.html#AvisW88 https://doi.org/10.1007/BF02187911

David Avis Paul Erdös János Pach Repeated distances in space. 207-217 1988 4 Graphs Comb. 1 https://doi.org/10.1007/BF01864161 https://www.wikidata.org/entity/Q105659535 db/journals/gc/gc4.html#AvisEP88

David Avis C. W. Lai The Probabilistic Analysis of a Heuristic for the Assignment Problem. 732-741 1988 17 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp17.html#AvisL88 https://doi.org/10.1137/0217047

David Avis Binay K. Bhattacharya Hiroshi Imai Computing the volume of the union of spheres. 323-328 1988 3 Vis. Comput. 6 db/journals/vc/vc3.html#AvisBI88 https://doi.org/10.1007/BF01901190

David Avis Hossam A. ElGindy Triangulating Point Sets in Space. 99-111 1987 2 Discret. Comput. Geom. db/journals/dcg/dcg2.html#AvisE87 https://doi.org/10.1007/BF02187874

Arun K. Somani Vinod K. Agarwal David Avis A Generalized Theory for System Level Diagnosis. 538-546 1987 36 IEEE Trans. Computers 5 db/journals/tc/tc36.html#SomaniAA87 https://doi.org/10.1109/TC.1987.1676938 http://doi.ieeecomputersociety.org/10.1109/TC.1987.1676938

David Avis Rephael Wenger Algorithms for Line Transversals in Space. 300-307 1987 conf/compgeom/1987 SCG https://doi.org/10.1145/41958.41990 db/conf/compgeom/compgeom87.html#AvisW87

David Avis diameter Partitioning. 265-276 1986 1 Discret. Comput. Geom. db/journals/dcg/dcg1.html#Avis86 https://doi.org/10.1007/BF02187699

David Avis Teren Gum Godfried T. Toussaint Visibility between two edges of a simple polygon. 342-357 1986 2 Vis. Comput. 6 db/journals/vc/vc2.html#AvisGT86 https://doi.org/10.1007/BF01952419

David Avis Hossam A. ElGindy Triangulating Simplicial Point Sets in Space. 133-141 1986 conf/compgeom/1986 SCG https://doi.org/10.1145/10515.10530 db/conf/compgeom/compgeom86.html#AvisE86

Jin Akiyama Kiyoshi Ando David Avis Eccentric graphs. 1-6 1985 56 Discret. Math. 1 https://doi.org/10.1016/0012-365X(85)90188-8 db/journals/dm/dm56.html#AkiyamaAA85

David Avis On the partitionability of point sets in space (preliminary report). 116-120 1985 SCG https://doi.org/10.1145/323233.323249 conf/compgeom/1985 db/conf/compgeom/compgeom1985.html#Avis85 David Avis David Rappaport Computing the largest empty convex subset of a set of points. 161-167 1985 SCG https://doi.org/10.1145/323233.323255 conf/compgeom/1985 db/conf/compgeom/compgeom1985.html#AvisR85 David Avis Space Partitioning and its Application to Generalized Retrieval Problems. 237-248 1985 conf/fodo/1985 FODO db/conf/fodo/fodo85.html#Avis85

David Avis Non-Partitionable Point Sets. 125-129 1984 19 Inf. Process. Lett. 3 db/journals/ipl/ipl19.html#Avis84 https://doi.org/10.1016/0020-0190(84)90090-5

Hossam A. ElGindy David Avis Godfried T. Toussaint Applications of a two-dimensional hidden-line algorithm to other geometric problems. 191-202 1983 31 Computing 3 https://doi.org/10.1007/BF02263430 db/journals/computing/computing31.html#ElGindyAT83

David Avis A survey of heuristics for the weighted matching problem. 475-493 1983 13 Networks 4 https://doi.org/10.1002/net.3230130404 db/journals/networks/networks13.html#Avis83

David Avis Hossam A. ElGindy A combinational approach to polygon similarity. 148-150 1983 29 IEEE Trans. Inf. Theory 1 db/journals/tit/tit29.html#AvisE83 https://doi.org/10.1109/TIT.1983.1056600

Godfried T. Toussaint David Avis On a convex hull algorithm for polygons and its application to triangulation problems. 23-29 1982 15 Pattern Recognit. 1 https://doi.org/10.1016/0031-3203(82)90057-7 db/journals/pr/pr15.html#ToussaintA82

Jin Akiyama David Avis Vasek Chvátal Hiroshi Era Balancing signed graphs. 227-233 1981 3 Discret. Appl. Math. 4 https://doi.org/10.1016/0166-218X(81)90001-9 db/journals/dam/dam3.html#AkiyamaACE81

Hossam A. ElGindy David Avis A Linear Algorithm for Computing the Visibility Polygon from a Point. 186-197 1981 2 J. Algorithms 2 db/journals/jal/jal2.html#ElGindyA81 https://doi.org/10.1016/0196-6774(81)90019-5 https://www.wikidata.org/entity/Q29391117

David Avis Godfried T. Toussaint An efficient algorithm for decomposing a polygon into star-shaped polygons. 395-398 1981 13 Pattern Recognit. 6 https://doi.org/10.1016/0031-3203(81)90002-9 https://www.wikidata.org/entity/Q56504462 db/journals/pr/pr13.html#AvisT81

David Avis Godfried T. Toussaint An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge. 910-914 1981 30 IEEE Trans. Computers 12 db/journals/tc/tc30.html#AvisT81 https://doi.org/10.1109/TC.1981.1675729 http://doi.ieeecomputersociety.org/10.1109/TC.1981.1675729

David Avis Comments on a Lower Bound for Convex Hull Determination. 126 1980 11 Inf. Process. Lett. 3 db/journals/ipl/ipl11.html#Avis80 https://doi.org/10.1016/0020-0190(80)90125-8

Duncan McCallum David Avis A Linear Algorithm for Finding the Convex Hull of a Simple Polygon. 201-206 1979 9 Inf. Process. Lett. 5 db/journals/ipl/ipl9.html#McCallumA79 https://doi.org/10.1016/0020-0190(79)90069-3

David Avis On minimal 5-chromatic triangle-free graphs. 397-400 1979 3 J. Graph Theory 4 https://doi.org/10.1002/jgt.3190030411 db/journals/jgt/jgt3.html#Avis79

An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem Andrew Chi-Chih Yao David Avis Ronald L. Rivest 11-17 conf/stoc/STOC9 1977 STOC db/conf/stoc/stoc77.html#YaoAR77 https://doi.org/10.1145/800105.803391 Vinod K. Agarwal Jin Akiyama Kiyoshi Ando Yoshikazu Aoshima Bryan Beresford-Smith Binay K. Bhattacharya J. Adrian Bondy Prosenjit Bose David Bremner Vasek Chvátal William J. Cook Marco Cuturi Theresa Deering Luc Devroye Antoine Deza Michel Deza Mike Doskas Hossam A. ElGindy Hiroshi Era Paul Erdös Alan C. Evans Oliver Friedmann Komei Fukuda Viatcheslav P. Grishukhin Eric Guévremont Teren Gum Jun Hasegawa Kazuyoshi Hayase Patrick M. Hayden Sergio Hernández-Cuenca Duc A. Hoang 0001 Takashi Horiyama Kiyoshi Hosono Michael E. Houle Ferran Hurtado Hiroshi Imai Keiko Imai Tomokazu Imamura Mary Inaba Tsuyoshi Ito Kazuo Iwama Charles Jordan Bohdan Kaluzny Naoki Katoh Yosuke Kikuchi Chiu Ming Kong Yoshiaki Kyoda C. W. Lai David MacDonald Hiroshi Maehara Tomonari Masada Yoshitake Matsumoto Duncan McCallum Conor Meagher Hiroyuki Miyata Sonoko Moriyama Mutt Motoki Nakade Paolo Nobili Makoto Ohsaki Yoshio Okamoto Tsuyoshi Ono Masaki Owari János Pach Daichi Paku David Rappaport Bruce A. Reed Ronald L. Rivest J. M. Robert Gary Roumanis Yuuya Sasaki Ivan Savov Raimund Seidel Thomas C. Shermer Tetsuo Shibuya Caterina De Simone Jack Snoeyink Arun K. Somani Ileana Streinu Shin-ichi Tanigawa David Titley-Péloquin Hans Raj Tiwary Godfried T. Toussaint Ryuhei Uehara Jun Umemoto Masatsugu Urabe Osamu Watanabe 0001 Rephael Wenger Katsuhisa Yamanaka Tanami Yamauchi Andrew Chi-Chih Yao Binhai Zhu