Jean Cardinal

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 92

Top Venues

CoRR

Discret. Math. Theor. Comput. Sci.

SODA

CCCG

Publications

Marcus Schaefer, Jean Cardinal, Tillmann Miltzow
The Existential Theory of the Reals as a Complexity Class: A Compendium. CoRR (2024)
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
The rotation distance of brooms. Eur. J. Comb. 118 (2024)
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA (2024)
Jean Cardinal, Lionel Pournin
The expansion of half-integral polytopes. CoRR (2024)
Maike Buchin, Jean Cardinal, Arnaud de Mesmay, Jonathan Spreer, Alex He
Triangulations in Geometry and Topology (Dagstuhl Seminar 24072). Dagstuhl Reports 14 (2) (2024)
Jean Cardinal, Vincent Pilaud
Rectangulotopes. CoRR (2024)
Jean Cardinal
The Complexity of Intersection Graphs of Lines in Space and Circle Orders. CoRR (2024)
Andrei Asinowski, Jean Cardinal, Stefan Felsner, Éric Fusy
Combinatorics of rectangulations: Old and new bijections. CoRR (2024)
Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono
Dynamic Schnyder woods. CCCG (2023)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Torsten Mütze
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. SODA (2023)
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109 (2023)
Jean Cardinal, Micha Sharir
Improved Algebraic Degeneracy Testing. SoCG (2023)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19 (3) (2023)
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR (2023)
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
Colouring bottomless rectangles and arborescences. Comput. Geom. 115 (2023)
Jean Cardinal, Raphael Steiner
Shortest paths on polymatroids and hypergraphic polytopes. CoRR (2023)
Jean Cardinal, Raphael Steiner
Inapproximability of Shortest Paths on Perfect Matching Polytopes. IPCO (2023)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Ondrej Micka, Torsten Mütze
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. SIAM J. Discret. Math. 37 (3) (2023)
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
Drawing Graphs as Spanners. Discret. Comput. Geom. 68 (3) (2022)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Ondrej Micka, Torsten Mütze
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR (2022)
Boris Aronov, Jean Cardinal
Geometric Pattern Matching Reduces to k-SUM. Discret. Comput. Geom. 68 (3) (2022)
Jean Cardinal, Raphael Steiner
Inapproximability of shortest paths on perfect matching polytopes. CoRR (2022)
Jean Cardinal, Micha Sharir
Improved Algebraic Degeneracy Testing. CoRR (2022)
Jean Cardinal, Aurélien Ooms
Algorithms for approximate sparse regression and nearest induced hulls. J. Comput. Geom. 13 (1) (2022)
Jean Cardinal, Arturo I. Merino, Torsten Mütze
Efficient generation of elimination trees and graph associahedra. SODA (2022)
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
Bounds on the Diameter of Graph Associahedra. CoRR (2021)
Jean Cardinal, Arturo I. Merino, Torsten Mütze
Combinatorial generation via permutation languages. IV. Elimination trees. CoRR (2021)
Jean Cardinal, Justin Dallant, John Iacono
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. CoRR (2021)
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC (2021)
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR (2021)
Jean Cardinal, John Iacono, Grigorios Koumoutsos
Worst-Case Efficient Dynamic Geometric Independent Set. CoRR (2021)
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
Bounds on the Diameter of Graph Associahedra. LAGOS (2021)
Jean Cardinal, John Iacono
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. SOSA (2021)
Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono
Dynamic Schnyder Woods. CoRR (2021)
Jean Cardinal, Justin Dallant, John Iacono
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA (2021)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. Algorithmica 83 (1) (2021)
Jean Cardinal, Justin Dallant, John Iacono
Approximability of (Simultaneous) Class Cover for Boxes. CoRR (2021)
Jean Cardinal, John Iacono, Grigorios Koumoutsos
Worst-Case Efficient Dynamic Geometric Independent Set. ESA (2021)
Jean Cardinal, Justin Dallant, John Iacono
Approximability of (Simultaneous) Class Cover for Boxes. CCCG (2021)
Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. Theor. Comput. Sci. 806 (2020)
Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos
Dynamic Geometric Independent Set. CoRR (2020)
Jean Cardinal, Aurélien Ooms
Sparse Regression via Range Counting. SWAT (2020)
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
Solving and Sampling with Many Solutions. Algorithmica 82 (5) (2020)
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
Drawing Graphs as Spanners. WG (2020)
Boris Aronov, Jean Cardinal
Geometric Pattern Matching Reduces to k-SUM. CoRR (2020)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. SODA (2020)
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
Drawing Graphs as Spanners. CoRR (2020)
Boris Aronov, Jean Cardinal
Geometric Pattern Matching Reduces to k-SUM. ISAAC (2020)
Jean Cardinal, John Iacono
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. CoRR (2020)
Jean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. CoRR (2020)
Jean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. CCCG (2019)
Jean Cardinal, Aurélien Ooms
Sparse Regression via Range Counting. CoRR (2019)
Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms
Encoding 3SUM. CoRR (2019)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. CoRR (2019)
Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne
Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip distances between graph orientations. CoRR (2019)
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
Dynamic Graph Coloring. Algorithmica 81 (4) (2019)
Jean Cardinal, Gwenaël Joret, Jérémie Roland
Information-theoretic lower bounds for quantum sorting. CoRR (2019)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic encodings for point configurations. J. Comput. Geom. 10 (2) (2019)
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
Finding a Maximum-Weight Convex Set in a Chordal Graph. J. Graph Algorithms Appl. 23 (2) (2019)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. 61 (4) (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. WG (2019)
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
On the Diameter of Tree Associahedra. CoRR (2018)
Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira
A Note on Flips in Diagonal Rectangulations. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
Intersection Graphs of Rays and Grounded Segments. J. Graph Algorithms Appl. 22 (2) (2018)
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
On the Diameter of Tree Associahedra. Electron. J. Comb. 25 (4) (2018)
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68 (2018)
Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. COCOON (2018)
Jean Cardinal, Stefan Felsner
Topological drawings of complete bipartite graphs. J. Comput. Geom. 9 (1) (2018)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic Encodings for Point Configurations. CoRR (2018)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic Encodings for Point Configurations. SoCG (2018)
Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. CoRR (2018)
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
Finding a Maximum-Weight Convex Set in a Chordal Graph. CoRR (2018)
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
Dynamic Graph Coloring. WADS (2017)
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. CoRR (2017)
Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira
A Note on Flips in Diagonal Rectangulations. CoRR (2017)
Jean Cardinal, Udo Hoffmann
Recognition and Complexity of Point Visibility Graphs. Discret. Comput. Geom. 57 (1) (2017)
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
Intersection Graphs of Rays and Grounded Segments. WG (2017)
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. IPEC (2017)
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
Helly Numbers of Polyominoes. CoRR (2017)
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
On the shelling antimatroids of split graphs. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
Dynamic Graph Coloring. CoRR (2017)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG (2017)
Jean Cardinal, John Iacono, Aurélien Ooms
Solving k-SUM Using Few Linear Queries. ESA (2016)
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
Arc diagrams, flip distances, and Hamiltonian triangulations. CoRR (2016)
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
Intersection Graphs of Rays and Grounded Segments. CoRR (2016)
Jean Cardinal, Michael S. Payne, Noam Solomon
Ramsey-type theorems for lines in 3-space. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Jean Cardinal, Stefan Felsner
Topological Drawings of Complete Bipartite Graphs. CoRR (2016)
Keno Merckx, Jean Cardinal, Jean-Paul Doignon
On the shelling antimatroids of split graphs. Electron. Notes Discret. Math. 55 (2016)
Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 26 (3-4) (2016)
Jean Cardinal, Stefan Felsner
Topological Drawings of Complete Bipartite Graphs. Graph Drawing (2016)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR (2016)
Jean Cardinal, Udo Hoffmann
Recognition and Complexity of Point Visibility Graphs. CoRR (2015)
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. STACS (2015)
Jean Cardinal, Michael S. Payne, Noam Solomon
Ramsey-type theorems for lines in 3-space. CoRR (2015)
Jean Cardinal, Stefan Felsner
Covering Partial Cubes with Zones. Electron. J. Comb. 22 (3) (2015)
Jean Cardinal, Aurélien Ooms
On the Decision Tree Complexity of $k$-SUM. CoRR (2015)
Jean Cardinal
Computational Geometry Column 62. SIGACT News 46 (4) (2015)
Jean Cardinal, Michael Hoffmann, Vincent Kusters
On Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 19 (1) (2015)
Jean Cardinal, Vincent Kusters
The Complexity of Simultaneous Geometric Graph Embedding. J. Graph Algorithms Appl. 19 (1) (2015)

Jean Cardinal.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean Cardinal