Jean Cardinal
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
52
Venues
23
Active years
1999–2026
Best venue rank
A*
Where they publish
- A*SODA7 papers
- AESA5 papers
- BISAAC5 papers
- BLATIN5 papers
- BWG4 papers
- BWADS3 papers
- BDCC3 papers
- BMFCS2 papers
- NationalCOCOON2 papers
- A*STOC2 papers
- BICIP2 papers
- BIPCO1 paper
- CLAGOS1 paper
- AGD1 paper
- ASTACS1 paper
- CCiE1 paper
- MulticonferenceICASSP1 paper
- BWAOA1 paper
- AALENEX1 paper
- BISIT1 paper
- BITW1 paper
- CMMSP1 paper
- NationalICIAP1 paper
Papers
52 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | MFCS | Finding Shortest Reconfiguration Sequences on Independent Set Polytopes. | Jean Cardinal, Kevin Mann, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | SODA | Traversing regions of supersolvable hyperplane arrangements and their lattice quotients. | Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mtze |
| 2026 | WG | Implicit Representations via the Polynomial Method. | Jean Cardinal, Micha Sharir |
| 2025 | ESA | Compact Representation of Semilinear and Terrain-Like Graphs. | Jean Cardinal, Yelena Yuditsky |
| 2025 | MFCS | Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization. | Jean Cardinal, Xavier Goaoc, Sarah Wajsbrot |
| 2025 | SODA | Facet-Hamiltonicity. | Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff |
| 2023 | IPCO | Inapproximability of Shortest Paths on Perfect Matching Polytopes. | Jean Cardinal, Raphael Steiner |
| 2023 | SODA | Zigzagging through acyclic orientations of chordal graphs and hypergraphs. | Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mtze |
| 2022 | SODA | Efficient generation of elimination trees and graph associahedra. | Jean Cardinal, Arturo Merino, Torsten Mtze |
| 2021 | ESA | An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. | Jean Cardinal, Justin Dallant, John Iacono |
| 2021 | ESA | Worst-Case Efficient Dynamic Geometric Independent Set. | Jean Cardinal, John Iacono, Grigorios Koumoutsos |
| 2021 | ISAAC | Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. | Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir |
| 2021 | LAGOS | Bounds on the Diameter of Graph Associahedra. | Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon |
| 2020 | ISAAC | Geometric Pattern Matching Reduces to k-SUM. | Boris Aronov, Jean Cardinal |
| 2020 | SODA | Competitive Online Search Trees on Trees. | Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman |
| 2020 | WG | Drawing Graphs as Spanners. | Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber |
| 2019 | WG | Flip Distances Between Graph Orientations. | Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mtze, Raphael Steiner, Birgit Vogtenhuber |
| 2018 | COCOON | Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. | Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow |
| 2017 | WADS | Dynamic Graph Coloring. | Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, Andr van Renssen, Marcel Roeloffzen, Sander Verdonschot |
| 2017 | WG | Intersection Graphs of Rays and Grounded Segments. | Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber |
| 2016 | ESA | Solving k-SUM Using Few Linear Queries. | Jean Cardinal, John Iacono, Aurlien Ooms |
| 2016 | GD | Topological Drawings of Complete Bipartite Graphs. | Jean Cardinal, Stefan Felsner |
| 2015 | STACS | Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. | Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tth, Manuel Wettstein |
| 2014 | ISAAC | Reconstructing Point Set Order Typesfrom Radial Orderings. | Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr |
| 2014 | SODA | Making Octants Colorful and Related Covering Decomposition Problems. | Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt |
| 2013 | WADS | Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. | Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sbastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Gnter Rote, Torsten Ueckerdt |
| 2012 | ESA | The Clique Problem in Ray Intersection Graphs. | Sergio Cabello, Jean Cardinal, Stefan Langerman |
| 2012 | LATIN | Coloring Planar Homothets and Three-Dimensional Hypergraphs. | Jean Cardinal, Matias Korman |
| 2010 | LATIN | Matching Points with Things. | Greg Aloupis, Jean Cardinal, Sbastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian |
| 2010 | LATIN | Colorful Strips. | Greg Aloupis, Jean Cardinal, Sbastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
| 2010 | STOC | Sorting under partial information (without the ellipsoid algorithm). | Jean Cardinal, Samuel Fiorini, Gwenal Joret, Raphal M. Jungers, J. Ian Munro |
| 2009 | CiE | Minimum Entropy Combinatorial Optimization Problems. | Jean Cardinal, Samuel Fiorini, Gwenal Joret |
| 2009 | ISAAC | Algorithmic Folding Complexity. | Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara |
| 2009 | SODA | Decomposition of multiple coverings into more parts. | Greg Aloupis, Jean Cardinal, Sbastien Collette, Stefan Langerman, David Orden, Pedro Ramos |
| 2009 | STOC | An efficient algorithm for partial order production. | Jean Cardinal, Samuel Fiorini, Gwenal Joret, Raphal M. Jungers, J. Ian Munro |
| 2008 | LATIN | Coloring Geometric Range Spaces. | Greg Aloupis, Jean Cardinal, Sbastien Collette, Stefan Langerman, Shakhar Smorodinsky |
| 2007 | WADS | The Stackelberg Minimum Spanning Tree Game. | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenal Joret, Stefan Langerman, Ilan Newman, Oren Weimann |
| 2006 | ICASSP | Constructing Dependency Trees for Rate-Distortion Optimized Media Streaming. | Martin Rder, Jean Cardinal, Raouf Hamzaoui |
| 2006 | WAOA | Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. | Jean Cardinal, Stefan Langerman, Eythan Levy |
| 2005 | COCOON | A Tight Analysis of the Maximal Matching Heuristic. | Jean Cardinal, Martine Labb, Stefan Langerman, Eythan Levy, Hadrien Mlot |
| 2005 | ICIP | Dynamic programming algorithm for rate-distortion optimized media streaming. | Martin Rder, Jean Cardinal, Raouf Hamzaoui |
| 2005 | ISAAC | Minimum Entropy Coloring. | Jean Cardinal, Samuel Fiorini, Gwenal Joret |
| 2004 | ALENEX | Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. | Jean Cardinal, David Eppstein |
| 2004 | DCC | On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media. | Martin Rder, Jean Cardinal, Raouf Hamzaoui |
| 2004 | ISIT | On minimum entropy graph colorings. | Jean Cardinal, Samuel Fiorini, Gilles Van Assche |
| 2004 | LATIN | Designing Small Keyboards Is Hard. | Jean Cardinal, Stefan Langerman |
| 2003 | ICIP | Multistage index assignments for M-description coding. | Jean Cardinal |
| 2003 | ITW | Construction of a shared secret key using continuous variables. | Jean Cardinal, Gilles Van Assche |
| 2001 | DCC | Design of Tree-Structured Multiple Description Vector Quantizers. | Jean Cardinal |
| 2001 | MMSP | Design of asymmetric tree-structured multiple description source codes. | Jean Cardinal |
| 2000 | DCC | Tree-Based Search for ECVQ. | Jean Cardinal |
| 1999 | ICIAP | Fast Search for Entropy-Constrained VQ. | Jean Cardinal |