4 papers
A simple algorithm for computing Hamilton paths on independent set polytopes
Jean Cardinal, Pia Herkenrath, Torsten Mütze +1
The independent set polytope, or stable set polytope, of a graph is the 0/1-polytope defined by the convex hull of the characteristic vectors of all independent sets of . We…
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
Sofia Brenner, Jean Cardinal, Thomas McConville +2
For an arrangement of hyperplanes in through the origin, a region is a connected subset of . The graph of regions $G(…
The Complexity of Intersection Graphs of Lines in Space and Circle Orders
Jean Cardinal
We consider the complexity of the recognition problem for two families of combinatorial structures. A graph is said to be an intersection graph of lines in space if every…
A General Technique for Searching in Implicit Sets via Function Inversion
Boris Aronov, Jean Cardinal, Justin Dallant +1
In recent years, the Fiat-Naor function inversion scheme has been used to disprove conjectures in fine-grained complexity theory and design state of the art data structures for a n…