Publications (77)
Diameter estimates for graph associahedra
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
Colouring bottomless rectangles and arborescences
Jean Cardinal, Kolja Knauer, Piotr Micek +3
Finding a Maximum-Weight Convex Set in a Chordal Graph
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
Competitive Online Search Trees on Trees
Prosenjit Bose, Jean Cardinal, John Iacono +2
Combinatorics of rectangulations: Old and new bijections
Andrei Asinowski, Jean Cardinal, Stefan Felsner +1
On Universal Point Sets for Planar Graphs
Jean Cardinal, Michael Hoffmann, Vincent Kusters
Minimum Sum Edge Colorings of Multicycles
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
Shortest paths on polymatroids and hypergraphic polytopes
Jean Cardinal, Raphael Steiner
The rotation distance of brooms
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
Drawing Graphs as Spanners
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose +4
A Note on Flips in Diagonal Rectangulations
Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect
Jean Cardinal, Erik D. Demaine, David Eppstein +2
Coloring and Guarding Arrangements
Prosenjit Bose, Jean Cardinal, Sébastien Collette +4
The Stackelberg Minimum Spanning Tree Game
Jean Cardinal, Erik D. Demaine, Samuel Fiorini +4
The Price of Connectivity for Vertex Cover
Eglantine Camby, Jean Cardinal, Samuel Fiorini +1
Making Triangles Colorful
Jean Cardinal, Kolja Knauer, Piotr Micek +1
Recognition and Complexity of Point Visibility Graphs
Jean Cardinal, Udo Hoffmann
Set Covering Problems with General Objective Functions
Jean Cardinal, Christophe Dumeunier
Subquadratic Algorithms for Algebraic Generalizations of 3SUM
Luis Barba, Jean Cardinal, John Iacono +3
Covering Partial Cubes with Zones
Jean Cardinal, Stefan Felsner
Coloring Planar Homothets and Three-Dimensional Hypergraphs
Jean Cardinal, Matias Korman
On the shelling antimatroids of split graphs
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
Improved Algebraic Degeneracy Testing
Jean Cardinal, Micha Sharir
Geometric Pattern Matching Reduces to k-SUM
Boris Aronov, Jean Cardinal
The Complexity of Simultaneous Geometric Graph Embedding
Jean Cardinal, Vincent Kusters
Topological Drawings of Complete Bipartite Graphs
Jean Cardinal, Stefan Felsner
The Clique Problem in Ray Intersection Graphs
Sergio Cabello, Jean Cardinal, Stefan Langerman
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
Sparse Regression via Range Counting
Jean Cardinal, Aurélien Ooms
Worst-Case Efficient Dynamic Geometric Independent Set
Jean Cardinal, John Iacono, Grigorios Koumoutsos
General Position Subsets and Independent Hyperplanes in d-Space
Jean Cardinal, Csaba D. Tóth, David R. Wood
Cannibal Animal Games: a new variant of Tic-Tac-Toe
Jean Cardinal, Sébastien Collette, Hiro Ito +4
Implicit representations via the polynomial method
Jean Cardinal, Micha Sharir
Dynamic Schnyder Woods
Sujoy Bhore, Prosenjit Bose, Pilar Cano +2
Highway Hull Revisited
Greg Aloupis, Jean Cardinal, Sebastien Collette +4
The expansion of half-integral polytopes
Jean Cardinal, Lionel Pournin
Inapproximability of shortest paths on perfect matching polytopes
Jean Cardinal, Raphael Steiner
Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
Jean Cardinal, Kevin Mann, Akira Suzuki +3
Facet-Hamiltonicity
Hugo Akitaya, Jean Cardinal, Stefan Felsner +2
Minimum Entropy Combinatorial Optimization Problems
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
Helly Numbers of Polyominoes
Jean Cardinal, Hiro Ito, Matias Korman +1
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
Andrei Asinowski, Jean Cardinal, Nathann Cohen +9
A General Technique for Searching in Implicit Sets via Function Inversion
Boris Aronov, Jean Cardinal, Justin Dallant +1
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility
Jean Cardinal, Justin Dallant, John Iacono
Detecting all regular polygons in a point set
Greg Aloupis, Jean Cardinal, Sebastien Collette +2
The Existential Theory of the Reals as a Complexity Class: A Compendium
Marcus Schaefer, Jean Cardinal, Tillmann Miltzow
Combinatorial generation via permutation languages. IV. Elimination trees
Jean Cardinal, Arturo Merino, Torsten Mütze
Dynamic Graph Coloring
Luis Barba, Jean Cardinal, Matias Korman +4
Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization
Jean Cardinal, Xavier Goaoc, Sarah Wajsbrot
Approximability of (Simultaneous) Class Cover for Boxes
Jean Cardinal, Justin Dallant, John Iacono
Approximating Vertex Cover in Dense Hypergraphs
Jean Cardinal, Marek Karpinski, Richard Schmied +1
Compact Representation of Semilinear and Terrain-like Graphs
Jean Cardinal, Yelena Yuditsky
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets
Jean Cardinal, John Iacono
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Jean Cardinal, Erik D. Demaine, Samuel Fiorini +3
Rectangulotopes
Jean Cardinal, Vincent Pilaud
Solving -SUM using few linear queries
Jean Cardinal, John Iacono, Aurélien Ooms
Dynamic Geometric Independent Set
Sujoy Bhore, Jean Cardinal, John Iacono +1
An Efficient Algorithm for Partial Order Production
Jean Cardinal, Samuel Fiorini, Gwenaël Joret +2
Encoding 3SUM
Sergio Cabello, Jean Cardinal, John Iacono +3
Approximating Subdense Instances of Covering Problems
Jean Cardinal, Marek Karpinski, Richard Schmied +1
On the Diameter of Tree Associahedra
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
Making Octants Colorful and Related Covering Decomposition Problems
Jean Cardinal, Kolja Knauer, Piotr Micek +1
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
Sofia Brenner, Jean Cardinal, Thomas McConville +2
Information-theoretic lower bounds for quantum sorting
Jean Cardinal, Gwenaël Joret, Jérémie Roland
Combinatorial generation via permutation languages. V. Acyclic orientations
Jean Cardinal, Hung P. Hoang, Arturo Merino +2
Subquadratic Encodings for Point Configurations
Jean Cardinal, Timothy M. Chan, John Iacono +2
The Complexity of Intersection Graphs of Lines in Space and Circle Orders
Jean Cardinal
Arc diagrams, flip distances, and Hamiltonian triangulations
Jean Cardinal, Michael Hoffmann, Vincent Kusters +2
Ramsey-type theorems for lines in 3-space
Jean Cardinal, Michael S. Payne, Noam Solomon
Flip distances between graph orientations
Oswin Aichholzer, Jean Cardinal, Tony Huynh +4
Sorting under Partial Information (without the Ellipsoid Algorithm)
Jean Cardinal, Samuel Fiorini, Gwenaël Joret +2
Minimum Entropy Orientations
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
Subquadratic Algorithms for Some \textsc{3Sum}-Hard Geometric Problems in the Algebraic Decision Tree Model
Boris Aronov, Mark de Berg, Jean Cardinal +3
Intersection Graphs of Rays and Grounded Segments
Jean Cardinal, Stefan Felsner, Tillmann Miltzow +2
Hitting all Maximal Independent Sets of a Bipartite Graph
Jean Cardinal, Gwenaël Joret
Biclique decompositions from Welzl orders
Jean Cardinal, Rose McCarty, Yelena Yuditsky
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid
Jean Cardinal, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano