The following pages link to David Avis (Q173840):
Displaying 50 items.
- Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)
- On the fractional chromatic index of a graph and its complement (Q2488234) (← links)
- Reputation games for undirected graphs (Q2636798) (← links)
- A list heuristic for vertex cover (Q2643795) (← links)
- On the foundations and extremal structure of the holographic entropy cone (Q2685693) (← links)
- (Q2728843) (← links)
- A Portable Parallel Implementation of the lrs Vertex Enumeration Code (Q2867140) (← links)
- (Q2934001) (← links)
- (Q3078231) (← links)
- Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs (Q3104636) (← links)
- A survey of heuristics for the weighted matching problem (Q3315292) (← links)
- (Q3337484) (← links)
- Visualizing and Constructing Cycles in the Simplex Method (Q3392187) (← links)
- Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching (Q3415878) (← links)
- Enumerating Non-crossing Minimally Rigid Frameworks (Q3591318) (← links)
- (Q3622252) (← links)
- (Q3622261) (← links)
- (Q3680876) (← links)
- The Number of Furthest Neighbour Pairs of a Finite Planar Set (Q3689008) (← links)
- (Q3692390) (← links)
- (Q3716335) (← links)
- A Generalized Theory for System Level Diagnosis (Q3753937) (← links)
- (Q3796752) (← links)
- On the complexity of single fault set diagnosability and diagnosis problems (Q3817610) (← links)
- On minimal 5-chromatic triangle-free graphs (Q3856793) (← links)
- (Q3862427) (← links)
- A note on some computationally difficult set covering problems (Q3867546) (← links)
- Hypermetric Spaces and the Hamming Cone (Q3889701) (← links)
- A linear algorithm for computing the visibility polygon from a point (Q3910036) (← links)
- (Q3910557) (← links)
- (Q3911404) (← links)
- On the Extreme Rays of the Metric Cone (Q3921264) (← links)
- Extremal Metrics Induced by Graphs (Q3922711) (← links)
- A combinational approach to polygon similarity (Q3964035) (← links)
- The cut cone,L1 embeddability, complexity, and multicommodity flows (Q3984283) (← links)
- (Q4178292) (← links)
- (Q4188659) (← links)
- Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms (Q4210148) (← links)
- The m-core properly contains the m-divisible points in space (Q4274650) (← links)
- (Q4389428) (← links)
- Solving Inequalities and Proving Farkas's Lemma Made Easy (Q4469100) (← links)
- (Q4504018) (← links)
- (Q4508372) (← links)
- (Q4518988) (← links)
- (Q4741714) (← links)
- (Q4790468) (← links)
- COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES (Q4858650) (← links)
- Leggett-Garg inequalities and the geometry of the cut polytope (Q4903062) (← links)
- (Q4935168) (← links)
- Computational experience with the reverse search vertex enumeration algorithm (Q4946698) (← links)
