David Avis

CoRR, 2024

2023

Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding.

[BibT_eX]

[DOI]

Graphs Comb., August, 2023

On Reconfiguration Graphs of Independent Sets Under Token Sliding.

[BibT_eX]

[DOI]

Graphs Comb., June, 2023

On the foundations and extremal structure of the holographic entropy cone.

[BibT_eX]

[DOI]

Sergio Hernández-Cuenca

Discret. Appl. Math., March, 2023

A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Sparktope: linear programs from algorithms.

[BibT_eX]

[DOI]

David Bremner

Optim. Methods Softw., 2022

On Reconfiguration Graph of Independent Sets under Token Sliding.

[BibT_eX]

[DOI]

CoRR, 2022

2021

mts: a light framework for parallelizing tree search codes.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2021

Algorithmic enumeration of surrounding polygons.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

lrsarith: a small fixed/hybrid arithmetic C library.

[BibT_eX]

[DOI]

CoRR, 2021

2020

An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees.

[BibT_eX]

[DOI]

Luc Devroye

Algorithmica, 2020

2019

Compact linear programs for 2SAT.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Polynomial size linear programs for problems in P.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

mplrs: A scalable parallel vertex/facet enumeration code.

[BibT_eX]

[DOI]

Math. Program. Comput., 2018

2017

On the ℋ-free extension complexity of the TSP.

[BibT_eX]

[DOI]

Optim. Lett., 2017

An exponential lower bound for Cunningham's rule.

[BibT_eX]

[DOI]

Oliver Friedmann

Math. Program., 2017

2016

On the directed cut cone and polytope.

[BibT_eX]

[DOI]

Conor Meagher

J. Comb. Optim., 2016

A parallel framework for reverse search using mts.

[BibT_eX]

[DOI]

CoRR, 2016

2015

On the extension complexity of combinatorial polytopes.

[BibT_eX]

[DOI]

Math. Program., 2015

A generalization of extension complexity that captures P.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

George Dantzig: father of the simplex method.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Comparative computational results for some vertex and facet enumeration codes.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Ground metric learning.

[BibT_eX]

[DOI]

Marco Cuturi

J. Mach. Learn. Res., 2014

Reputation games for undirected graphs.

[BibT_eX]

[DOI]

Kazuo Iwama

Daichi Paku

Discret. Appl. Math., 2014

Polynomial size linear programs for non-bipartite matching problems and other problems in P.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Families of polytopal digraphs that do not satisfy the shelling property.

[BibT_eX]

[DOI]

Hiroyuki Miyata

Sonoko Moriyama

Comput. Geom., 2013

A Portable Parallel Implementation of the lrs Vertex Enumeration Code.

[BibT_eX]

[DOI]

Gary Roumanis

Proceedings of the Combinatorial Optimization and Applications, 2013

2012

On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Worst-case Behaviour of History Based Pivot Rules on Acyclic Unique Sink Orientations of Hypercubes

[BibT_eX]

[DOI]

CoRR, 2011

Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs.

[BibT_eX]

[DOI]

Kazuo Iwama

Daichi Paku

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Those ubiquitous cut polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

From Bell Inequalities to Tsirelson's Theorem.

[BibT_eX]

[DOI]

Sonoko Moriyama

Masaki Owari

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

2008

Generating facets for the cut polytope of a graph by triangular elimination.

[BibT_eX]

[DOI]

Hiroshi Imai

Tsuyoshi Ito

Math. Program., 2008

Computing monotone disjoint paths on polytopes.

[BibT_eX]

[DOI]

Bohdan Kaluzny

J. Comb. Optim., 2008

Visualizing and Constructing Cycles in the Simplex Method.

[BibT_eX]

[DOI]

Bohdan Kaluzny

David Titley-Péloquin

Oper. Res., 2008

Enumerating Constrained Non-crossing Minimally Rigid Frameworks.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Multiparty Distributed Compression of Quantum Information.

[BibT_eX]

[DOI]

Patrick M. Hayden

Ivan Savov

Proceedings of the Second International Conference on Quantum, 2008

2007

A list heuristic for vertex cover.

[BibT_eX]

[DOI]

Tomokazu Imamura

Oper. Res. Lett., 2007

Enumerating Non-crossing Minimally Rigid Frameworks.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Vašek Chvátal: A Very Short Introduction.

[BibT_eX]

[DOI]

Graphs Comb., 2007

New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities.

[BibT_eX]

[DOI]

Tsuyoshi Ito

Discret. Appl. Math., 2007

Distributed Compression and Multiparty Squashed Entanglement.

[BibT_eX]

[DOI]

Patrick M. Hayden

Ivan Savov

CoRR, 2007

Comparison of two bounds of the quantum correlation set.

[BibT_eX]

[DOI]

Tsuyoshi Ito

Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies, 2007

2006

A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Un des "problèmes plaisans et délectables" de Claude Berge.

[BibT_eX]

[DOI]

Antoine Deza

Discret. Math., 2006

2005

On the fractional chromatic index of a graph and its complement.

[BibT_eX]

[DOI]

Caterina De Simone

Bruce A. Reed

Oper. Res. Lett., 2005

2004

Solving Inequalities and Proving Farkas's Lemma Made Easy.

[BibT_eX]

[DOI]

Bohdan Kaluzny

Am. Math. Mon., 2004

2003

Stronger linear programming relaxations of max-cut.

[BibT_eX]

[DOI]

Jun Umemoto

Math. Program., 2003

2002

On the chromatic polynomial of a graph.

[BibT_eX]

[DOI]

Caterina De Simone

Paolo Nobili

Math. Program., 2002

On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001

On the solitaire cone and its relationship to multi-commodity flows.

[BibT_eX]

[DOI]

Antoine Deza

Math. Program., 2001

On the existence of a point subset with a specified number of interior points.

[BibT_eX]

[DOI]

Kiyoshi Hosono

Masatsugu Urabe

Discret. Math., 2001

On the binary solitaire cone.

[BibT_eX]

[DOI]

Antoine Deza

Discret. Appl. Math., 2001

2000

Estimating the number of vertices of a polyhedron.

[BibT_eX]

[DOI]

Luc Devroye

Inf. Process. Lett., 2000

Two Conjectures on the Chromatic Polynomial.

[BibT_eX]

[DOI]

Caterina De Simone

Paolo Nobili

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1998

Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.

[BibT_eX]

[DOI]

Bryan Beresford-Smith

SIAM J. Comput., 1998

Proximity Constraints in Deformable Models for Cortical Surface Identification.

[BibT_eX]

[DOI]

David MacDonald

Alan C. Evans

Proceedings of the Medical Image Computing and Computer-Assisted Intervention, 1998

On the Existence of a Point Subset with 4 or 5 Interior Points.

[BibT_eX]

[DOI]

Kiyoshi Hosono

Masatsugu Urabe

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Living with lrs.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

1997

How Good Are Convex Hull Algorithms?.

[BibT_eX]

[DOI]

David Bremner

Raimund Seidel

Comput. Geom., 1997

1996

Reverse Search for Enumeration.

[BibT_eX]

[DOI]

Komei Fukuda

Discret. Appl. Math., 1996

Generating Rooted Triangulations Without Repetitions.

[BibT_eX]

[DOI]

Algorithmica, 1996

A Package for Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

On the Sectional Area of Convex Polytopes.

[BibT_eX]

[DOI]

Prosenjit Bose

Thomas C. Shermer

Binhai Zhu

Jack Snoeyink

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Generating Rooted Triangulations with Minimum Degree Four.

[BibT_eX]

[DOI]

Chiu Ming Kong

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Computational aspects of Helly's theorem and its relatives.

[BibT_eX]

[DOI]

Michael E. Houle

Int. J. Comput. Geom. Appl., 1995

How Good are Convex Hull Algorithms?

[BibT_eX]

[DOI]

David Bremner

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Metric extensions and the L1 hierarchy.

[BibT_eX]

[DOI]

Hiroshi Maehara

Discret. Math., 1994

Multiple surface identification and matching in magnetic resonance images.

[BibT_eX]

[DOI]

David MacDonald

Alan C. Evans

Proceedings of the Visualization in Biomedical Computing 1994, 1994

1993

The m-core properly contains the m-divisible points in space.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1993

1992

A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.

[BibT_eX]

[DOI]

Komei Fukuda

Discret. Comput. Geom., 1992

A Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems.

[BibT_eX]

[DOI]

Viatcheslav P. Grishukhin

Comput. Geom., 1992

1991

The cut cone, L1 embeddability, complexity, and multicommodity flows.

[BibT_eX]

[DOI]

Michel Deza

Networks, 1991

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Distinct Distances Determined By Subsets of a Point Set in Space.

[BibT_eX]

[DOI]

Paul Erdös

János Pach

Comput. Geom., 1991

1990

Locating a Robot with Angle Mathematics.

[BibT_eX]

[DOI]

Hiroshi Imai

J. Symb. Comput., 1990

Algorithms for high dimensional stabbing problems.

[BibT_eX]

[DOI]

Mike Doskas

Discret. Appl. Math., 1990

On the Complexity of Isometric Embedding in the Hypercube.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1990

1989

On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems.

[BibT_eX]

[DOI]

Arun K. Somani

Vinod K. Agarwal

IEEE Trans. Computers, 1989

Lower Bounds for Line Stabbing.

[BibT_eX]

[DOI]

J. M. Robert

Rephael Wenger

Inf. Process. Lett., 1989

All the Facets of the Six-point Hamming Cone.

[BibT_eX]

[DOI]

Mutt

Eur. J. Comb., 1989

1988

Computing the volume of the union of spheres.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

Hiroshi Imai

Vis. Comput., 1988

The Probabilistic Analysis of a Heuristic for the Assignment Problem.

[BibT_eX]

[DOI]

C. W. Lai

SIAM J. Comput., 1988

Repeated distances in space.

[BibT_eX]

[DOI]

Paul Erdös

János Pach

Graphs Comb., 1988

Polyhedral Line transversals in Space.

[BibT_eX]

[DOI]

Rephael Wenger

Discret. Comput. Geom., 1988

1987

A Generalized Theory for System Level Diagnosis.

[BibT_eX]

[DOI]

Arun K. Somani

Vinod K. Agarwal

IEEE Trans. Computers, 1987

Triangulating Point Sets in Space.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1987

Algorithms for Line Transversals in Space.

[BibT_eX]

[DOI]

Rephael Wenger

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Visibility between two edges of a simple polygon.

[BibT_eX]

[DOI]

Teren Gum

Vis. Comput., 1986

diameter Partitioning.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1986

Triangulating Simplicial Point Sets in Space.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Eccentric graphs.

[BibT_eX]

[DOI]

Jin Akiyama

Kiyoshi Ando

Discret. Math., 1985

Space Partitioning and its Application to Generalized Retrieval Problems.

[BibT_eX]

Proceedings of the Foundations of Data Organization, 1985

Computing the largest empty convex subset of a set of points.

[BibT_eX]

[DOI]

David Rappaport

Proceedings of the First Annual Symposium on Computational Geometry, 1985

On the partitionability of point sets in space (preliminary report).

[BibT_eX]

[DOI]

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Non-Partitionable Point Sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1983

A combinational approach to polygon similarity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

A survey of heuristics for the weighted matching problem.

[BibT_eX]

[DOI]

Networks, 1983

Applications of a two-dimensional hidden-line algorithm to other geometric problems.

[BibT_eX]

[DOI]

Computing, 1983

1982

On a convex hull algorithm for polygons and its application to triangulation problems.

[BibT_eX]

[DOI]

Pattern Recognit., 1982

1981

An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1981

An efficient algorithm for decomposing a polygon into star-shaped polygons.

[BibT_eX]

[DOI]

Pattern Recognit., 1981

A Linear Algorithm for Computing the Visibility Polygon from a Point.

[BibT_eX]

[DOI]

J. Algorithms, 1981

Balancing signed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

1980

Comments on a Lower Bound for Convex Hull Determination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

1979

On minimal 5-chromatic triangle-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1979

A Linear Algorithm for Finding the Convex Hull of a Simple Polygon.

[BibT_eX]

[DOI]

Duncan McCallum

Inf. Process. Lett., 1979

1977

An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao