The following pages link to David Avis (Q173840):
Displayed 50 items.
- On the directed cut cone and polytope (Q281821) (← links)
- An exponential lower bound for Cunningham's rule (Q507321) (← links)
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- Locating a robot with angle measurements (Q751327) (← links)
- Distinct distances determined by subsets of a point set in space (Q808426) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Enumerating constrained non-crossing minimally rigid frameworks (Q946684) (← links)
- Computing monotone disjoint paths on polytopes (Q1016050) (← links)
- Non-partitionable point sets (Q1058137) (← links)
- An analysis of a decomposition heuristic for the assignment problem (Q1062912) (← links)
- Eccentric graphs (Q1066166) (← links)
- Diameter partitioning (Q1076974) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Computing the volume of the union of spheres (Q1104079) (← links)
- Repeated distances in space (Q1109785) (← links)
- A linear algorithm for finding the convex hull of a simple polygon (Q1134524) (← links)
- Worst case bounds for the Euclidean matching problem (Q1149255) (← links)
- Comments on a lower bound for convex hull determination (Q1150269) (← links)
- Balancing signed graphs (Q1156154) (← links)
- On the complexity of finding the convex hull of a set of points (Q1158971) (← links)
- On the multimodality of distances in convex polygons (Q1165585) (← links)
- A basis enumeration algorithm for linear systems with geometric applications (Q1180318) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- All the facets of the six-point Hamming cone (Q1262536) (← links)
- Metric extensions and the \(L^ 1\) hierarchy (Q1332439) (← links)
- How good are convex hull algorithms? (Q1356937) (← links)
- Stronger linear programming relaxations of max-cut (Q1403298) (← links)
- Estimating the number of vertices of a polyhedron (Q1607035) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- (Q1803267) (redirect page) (← links)
- A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems (Q1803268) (← links)
- Generating rooted triangulations without repetitions (Q1817003) (← links)
- Triangulating point sets in space (Q1820437) (← links)
- Polyhedral line transversals in space (Q1822999) (← links)
- Applications of a two-dimensional hidden-line algorithm to other geometric problems (Q1838318) (← links)
- On the chromatic polynomial of a graph (Q1849500) (← links)
- Reverse search for enumeration (Q1917258) (← links)
- Families of polytopal digraphs that do not satisfy the shelling property (Q1931285) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- An analysis of budgeted parallel search on conditional Galton-Watson trees (Q2309473) (← links)
- Compact linear programs for 2SAT (Q2311345) (← links)
- Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
- A generalization of extension complexity that captures P (Q2345857) (← links)
- Enumerating non-crossing minimally rigid frameworks (Q2373440) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities (Q2381532) (← links)
- One of the ``problèmes plaisants et délectables'' by Claude Berge (Un des ``problèmes plaisants et délectables'' de Claude Berge). (Q2433697) (← links)