David Avis - RankMe

127 papers A* 1A 1B 2C 1Misc 1Journal 101Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	H V -symmetric polyhedra and bipolarity. Discret. Appl. Math. David Avis
2024	J	`jnl`	A Note on Acyclic Token Sliding Reconfiguration Graphs of Independent Sets. Ars Comb. David Avis, Duc A. Hoang
2024	J	`jnl`	Parallel Redundancy Removal in lrslib with Application to Projections. CoRR David Avis, Charles Jordan
2023	J	`jnl`	A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets. CoRR David Avis, Duc A. Hoang
2023	J	`jnl`	Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding. Graphs Comb. David Avis, Duc A. Hoang
2023	J	`jnl`	On Reconfiguration Graphs of Independent Sets Under Token Sliding. Graphs Comb. David Avis, Duc A. Hoang
2023	J	`jnl`	On the foundations and extremal structure of the holographic entropy cone. Discret. Appl. Math. David Avis, Sergio Hernández-Cuenca
2022	J	`jnl`	On Reconfiguration Graph of Independent Sets under Token Sliding. CoRR David Avis, Duc A. Hoang
2022	J	`jnl`	Sparktope: linear programs from algorithms. Optim. Methods Softw. David Avis, David Bremner
2021	J	`jnl`	Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
2021	J	`jnl`	lrsarith: a small fixed/hybrid arithmetic C library. CoRR David Avis, Charles Jordan
2021	J	`jnl`	mts: a light framework for parallelizing tree search codes. Optim. Methods Softw. David Avis, Charles Jordan
2020	J	`jnl`	An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees. Algorithmica David Avis, Luc Devroye
2020	J	`jnl`	Sparktope: linear programs from algorithms. CoRR David Avis, David Bremner
2019	J	`jnl`	Compact linear programs for 2SAT. Eur. J. Comb. David Avis, Hans Raj Tiwary
2019	J	`jnl`	Polynomial size linear programs for problems in P. Discret. Appl. Math. David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe
2018	J	`jnl`	mplrs: A scalable parallel vertex/facet enumeration code. Math. Program. Comput. David Avis, Charles Jordan
2017	J	`jnl`	An analysis of budgeted parallel search on conditional Galton-Watson trees. CoRR David Avis, Luc Devroye
2017	J	`jnl`	An exponential lower bound for Cunningham's rule. Math. Program. David Avis, Oliver Friedmann
2017	J	`jnl`	Compact linear programs for 2SAT. CoRR David Avis, Hans Raj Tiwary
2017	J	`jnl`	On the ℋ-free extension complexity of the TSP. Optim. Lett. David Avis, Hans Raj Tiwary
2017	J	`jnl`	mts: a light framework for parallelizing tree search codes. CoRR David Avis, Charles Jordan
2016	J	`jnl`	A parallel framework for reverse search using mts. CoRR David Avis, Charles Jordan
2016	J	`jnl`	On the directed cut cone and polytope. J. Comb. Optim. David Avis, Conor Meagher
2015	J	`jnl`	A generalization of extension complexity that captures P. Inf. Process. Lett. David Avis, Hans Raj Tiwary
2015	J	`jnl`	Comparative computational results for some vertex and facet enumeration codes. CoRR David Avis, Charles Jordan
2015	J	`jnl`	George Dantzig: father of the simplex method. Bull. EATCS David Avis
2015	J	`jnl`	On the H-Free Extension Complexity of the TSP. CoRR David Avis, Hans Raj Tiwary
2015	J	`jnl`	On the extension complexity of combinatorial polytopes. Math. Program. David Avis, Hans Raj Tiwary
2015	J	`jnl`	mplrs: A scalable parallel vertex/facet enumeration code. CoRR David Avis, Charles Jordan
2014	J	`jnl`	A generalization of extension complexity that captures $P$. CoRR David Avis, Hans Raj Tiwary
2014	J	`jnl`	Ground metric learning. J. Mach. Learn. Res. Marco Cuturi, David Avis
2014	J	`jnl`	Polynomial size linear programs for non-bipartite matching problems and other problems in P. CoRR David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe
2014	J	`jnl`	Reputation games for undirected graphs. Discret. Appl. Math. David Avis, Kazuo Iwama, Daichi Paku
2013	C	`conf`	A Portable Parallel Implementation of the lrs Vertex Enumeration Code. COCOA David Avis, Gary Roumanis
2013	J	`jnl`	An exponential lower bound for Cunningham's rule CoRR David Avis, Oliver Friedmann
2013	J	`jnl`	Families of polytopal digraphs that do not satisfy the shelling property. Comput. Geom. David Avis, Hiroyuki Miyata, Sonoko Moriyama
2013	—	`conf`	On the Extension Complexity of Combinatorial Polytopes. ICALP (1) David Avis, Hans Raj Tiwary
2013	J	`jnl`	On the extension complexity of combinatorial polytopes CoRR David Avis, Hans Raj Tiwary
2012	J	`jnl`	On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes. Discret. Appl. Math. Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto, Sonoko Moriyama
2012	J	`jnl`	Reputation Games for Undirected Graphs CoRR David Avis, Kazuo Iwama, Daichi Paku
2011	J	`jnl`	Families of polytopal digraphs that do not satisfy the shelling property CoRR David Avis, Hiroyuki Miyata, Sonoko Moriyama
2011	J	`jnl`	Ground Metric Learning CoRR Marco Cuturi, David Avis
2011	B	`conf`	Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. ISAAC David Avis, Kazuo Iwama, Daichi Paku
2011	J	`jnl`	Worst-case Behaviour of History Based Pivot Rules on Acyclic Unique Sink Orientations of Hypercubes CoRR Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto, Sonoko Moriyama
2010	—	`conf`	Those ubiquitous cut polyhedra. CCCG David Avis
2009	J	`jnl`	From Bell Inequalities to Tsirelson's Theorem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. David Avis, Sonoko Moriyama, Masaki Owari
2008	J	`jnl`	Computing monotone disjoint paths on polytopes. J. Comb. Optim. David Avis, Bohdan Kaluzny
2008	J	`jnl`	Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
2008	J	`jnl`	Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. David Avis, Hiroshi Imai, Tsuyoshi Ito
2008	—	`conf`	Multiparty Distributed Compression of Quantum Information. ICQNM David Avis, Patrick M. Hayden, Ivan Savov
2008	J	`jnl`	Visualizing and Constructing Cycles in the Simplex Method. Oper. Res. David Avis, Bohdan Kaluzny, David Titley-Péloquin
2007	J	`jnl`	A list heuristic for vertex cover. Oper. Res. Lett. David Avis, Tomokazu Imamura
2007	—	`conf`	Comparison of two bounds of the quantum correlation set. ICQNM David Avis, Tsuyoshi Ito
2007	J	`jnl`	Distributed Compression and Multiparty Squashed Entanglement. CoRR David Avis, Patrick M. Hayden, Ivan Savov
2007	J	`jnl`	Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
2007	J	`jnl`	New classes of facets of the cut polytope and tightness of I Discret. Appl. Math. David Avis, Tsuyoshi Ito
2007	J	`jnl`	Preface. Graphs Comb. David Avis
2007	J	`jnl`	Vašek Chvátal: A Very Short Introduction. Graphs Comb. David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed
2006	J	`jnl`	A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. David Avis, Jun Hasegawa, Yosuke Kikuchi, Yuuya Sasaki
2006	Misc	`conf`	Enumerating Non-crossing Minimally Rigid Frameworks. COCOON David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
2006	J	`jnl`	Un des "problèmes plaisans et délectables" de Claude Berge. Discret. Math. David Avis, Antoine Deza
2005	J	`jnl`	On the fractional chromatic index of a graph and its complement. Oper. Res. Lett. David Avis, Caterina De Simone, Bruce A. Reed
2004	J	`jnl`	Solving Inequalities and Proving Farkas's Lemma Made Easy. Am. Math. Mon. David Avis, Bohdan Kaluzny
2003	J	`jnl`	Stronger linear programming relaxations of max-cut. Math. Program. David Avis, Jun Umemoto
2002	—	`conf`	On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. JCDCG David Avis
2002	J	`jnl`	On the chromatic polynomial of a graph. Math. Program. David Avis, Caterina De Simone, Paolo Nobili
2001	J	`jnl`	On the binary solitaire cone. Discret. Appl. Math. David Avis, Antoine Deza
2001	J	`jnl`	On the existence of a point subset with a specified number of interior points. Discret. Math. David Avis, Kiyoshi Hosono, Masatsugu Urabe
2001	J	`jnl`	On the solitaire cone and its relationship to multi-commodity flows. Math. Program. David Avis, Antoine Deza
2000	J	`jnl`	Estimating the number of vertices of a polyhedron. Inf. Process. Lett. David Avis, Luc Devroye
2000	B	`conf`	Two Conjectures on the Chromatic Polynomial. LATIN David Avis, Caterina De Simone, Paolo Nobili
1998	—	`conf`	Living with JCDCG David Avis
1998	—	`conf`	On the Existence of a Point Subset with 4 or 5 Interior Points. JCDCG David Avis, Kiyoshi Hosono, Masatsugu Urabe
1998	A	`conf`	Proximity Constraints in Deformable Models for Cortical Surface Identification. MICCAI David MacDonald, David Avis, Alan C. Evans
1998	J	`jnl`	Unoriented Theta-Maxima in the Plane: Complexity and Algorithms. SIAM J. Comput. David Avis, Bryan Beresford-Smith, Luc Devroye, Hossam A. ElGindy, Eric Guévremont, Ferran Hurtado, Binhai Zhu
1997	J	`jnl`	How Good Are Convex Hull Algorithms?. Comput. Geom. David Avis, David Bremner, Raimund Seidel
1996	—	`conf`	A Package for Triangulations. SCG Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis
1996	J	`jnl`	Generating Rooted Triangulations Without Repetitions. Algorithmica David Avis
1996	—	`conf`	Generating Rooted Triangulations with Minimum Degree Four. CCCG David Avis, Chiu Ming Kong
1996	—	`conf`	On the Sectional Area of Convex Polytopes. SCG David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
1996	J	`jnl`	Reverse Search for Enumeration. Discret. Appl. Math. David Avis, Komei Fukuda
1995	J	`jnl`	Computational aspects of Helly's theorem and its relatives. Int. J. Comput. Geom. Appl. David Avis, Michael E. Houle
1995	—	`conf`	How Good are Convex Hull Algorithms? SCG David Avis, David Bremner
1994	J	`jnl`	Metric extensions and the L Discret. Math. David Avis, Hiroshi Maehara
1994	—	`conf`	Multiple surface identification and matching in magnetic resonance images. VBC David MacDonald, David Avis, Alan C. Evans
1993	J	`jnl`	The m-core properly contains the m-divisible points in space. Pattern Recognit. Lett. David Avis
1992	J	`jnl`	A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems. Comput. Geom. David Avis, Viatcheslav P. Grishukhin
1992	J	`jnl`	A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. Discret. Comput. Geom. David Avis, Komei Fukuda
1992	—	`ed.`	Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992 SCG David Avis
1991	—	`conf`	A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. SCG David Avis, Komei Fukuda
1991	J	`jnl`	Distinct Distances Determined By Subsets of a Point Set in Space. Comput. Geom. David Avis, Paul Erdös, János Pach
1991	J	`jnl`	Preface. Discret. Appl. Math. David Avis
1991	J	`jnl`	The cut cone, Networks David Avis, Michel Deza
1990	J	`jnl`	Algorithms for high dimensional stabbing problems. Discret. Appl. Math. David Avis, Mike Doskas
1990	J	`jnl`	Locating a Robot with Angle Mathematics. J. Symb. Comput. David Avis, Hiroshi Imai
1990	—	`conf`	On the Complexity of Isometric Embedding in the Hypercube. SIGAL International Symposium on Algorithms David Avis
1989	J	`jnl`	All the Facets of the Six-point Hamming Cone. Eur. J. Comb. David Avis, Mutt
1989	J	`jnl`	Lower Bounds for Line Stabbing. Inf. Process. Lett. David Avis, J. M. Robert, Rephael Wenger
1989	J	`jnl`	On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems. IEEE Trans. Computers Arun K. Somani, Vinod K. Agarwal, David Avis
1988	J	`jnl`	Computing the volume of the union of spheres. Vis. Comput. David Avis, Binay K. Bhattacharya, Hiroshi Imai
1988	J	`jnl`	Polyhedral Line transversals in Space. Discret. Comput. Geom. David Avis, Rephael Wenger
1988	J	`jnl`	Repeated distances in space. Graphs Comb. David Avis, Paul Erdös, János Pach
1988	J	`jnl`	The Probabilistic Analysis of a Heuristic for the Assignment Problem. SIAM J. Comput. David Avis, C. W. Lai
1987	J	`jnl`	A Generalized Theory for System Level Diagnosis. IEEE Trans. Computers Arun K. Somani, Vinod K. Agarwal, David Avis
1987	—	`conf`	Algorithms for Line Transversals in Space. SCG David Avis, Rephael Wenger
1987	J	`jnl`	Triangulating Point Sets in Space. Discret. Comput. Geom. David Avis, Hossam A. ElGindy
1986	—	`conf`	Triangulating Simplicial Point Sets in Space. SCG David Avis, Hossam A. ElGindy
1986	J	`jnl`	Visibility between two edges of a simple polygon. Vis. Comput. David Avis, Teren Gum, Godfried T. Toussaint
1986	J	`jnl`	diameter Partitioning. Discret. Comput. Geom. David Avis
1985	—	`conf`	Computing the largest empty convex subset of a set of points. SCG David Avis, David Rappaport
1985	J	`jnl`	Eccentric graphs. Discret. Math. Jin Akiyama, Kiyoshi Ando, David Avis
1985	—	`conf`	On the partitionability of point sets in space (preliminary report). SCG David Avis
1985	—	`conf`	Space Partitioning and its Application to Generalized Retrieval Problems. FODO David Avis
1984	J	`jnl`	Non-Partitionable Point Sets. Inf. Process. Lett. David Avis
1983	J	`jnl`	A combinational approach to polygon similarity. IEEE Trans. Inf. Theory David Avis, Hossam A. ElGindy
1983	J	`jnl`	A survey of heuristics for the weighted matching problem. Networks David Avis
1983	J	`jnl`	Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing Hossam A. ElGindy, David Avis, Godfried T. Toussaint
1982	J	`jnl`	On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognit. Godfried T. Toussaint, David Avis
1981	J	`jnl`	A Linear Algorithm for Computing the Visibility Polygon from a Point. J. Algorithms Hossam A. ElGindy, David Avis
1981	J	`jnl`	An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge. IEEE Trans. Computers David Avis, Godfried T. Toussaint
1981	J	`jnl`	An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognit. David Avis, Godfried T. Toussaint
1981	J	`jnl`	Balancing signed graphs. Discret. Appl. Math. Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era
1980	J	`jnl`	Comments on a Lower Bound for Convex Hull Determination. Inf. Process. Lett. David Avis
1979	J	`jnl`	A Linear Algorithm for Finding the Convex Hull of a Simple Polygon. Inf. Process. Lett. Duncan McCallum, David Avis
1979	J	`jnl`	On minimal 5-chromatic triangle-free graphs. J. Graph Theory David Avis
1977	A*	`conf`	An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem STOC Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest