Fast Search for Entropy-Constrained VQ. - Jean Cardinal (ICIAP, 1999)

Tree-Based Search for ECVQ. - Jean Cardinal (Data Compression Conference, 2000)

Multipath tree-structured vector quantizers. - Jean Cardinal (EUSIPCO, 2000)

A Lagrangian optimization approach to complexity-constrained TSVQ. - Jean Cardinal (IEEE Signal Process. Lett., 2000)

Design of Tree-Structured Multiple Description Vector Quantizers. - Jean Cardinal (Data Compression Conference, 2001)

Design of asymmetric tree-structured multiple description source codes. - Jean Cardinal (MMSP, 2001)

Fast fractal compression of greyscale images. - Jean Cardinal (IEEE Trans. Image Process., 2001)

Local optimization of index assignments for multiple description coding. - Jean Cardinal; Sourour Elloumi; Martine Labbé (EUSIPCO, 2002)

Complexity-constrained tree-structured vector quantizers. - Jean Cardinal (Signal Process., 2002)

Multistage index assignments for M-description coding. - Jean Cardinal (ICIP (3), 2003)

Compression of side information. - Jean Cardinal (ICME, 2003)

Construction of a shared secret key using continuous variables. - Jean Cardinal; Gilles Van Assche (ITW, 2003)

Tree-Structured Multiple Description Coding. - Jean Cardinal (J. VLSI Signal Process., 2003)

Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. - Jean Cardinal; David Eppstein (ALENEX/ANALC, 2004)

On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media. - Martin Röder; Jean Cardinal; Raouf Hamzaoui (Data Compression Conference, 2004)

On minimum entropy graph colorings. - Jean Cardinal; Samuel Fiorini; Gilles Van Assche (ISIT, 2004)

Reconciliation of a quantum-distributed Gaussian key. - Gilles Van Assche; Jean Cardinal; Nicolas J. Cerf (IEEE Trans. Inf. Theory, 2004)

Entropy-constrained index assignments for multiple description quantizers. - Jean Cardinal (IEEE Trans. Signal Process., 2004)

Region Counting Distances and Region Counting Circles. - Jean Cardinal; Sébastien Collette; Stefan Langerman (CCCG, 2005)

A Tight Analysis of the Maximal Matching Heuristic. - Jean Cardinal; Martine Labbé; Stefan Langerman; Eythan Levy; Hadrien Mélot (COCOON, 2005)

Region counting graphs. - Jean Cardinal; Sébastien Collette; Stefan Langerman (EuroCG, 2005)

Dynamic programming algorithm for rate-distortion optimized media streaming. - Martin Röder; Jean Cardinal; Raouf Hamzaoui (ICIP (2), 2005)

Designing small keyboards is hard. - Jean Cardinal; Stefan Langerman (Theor. Comput. Sci., 2005)

LUMINESStrategies. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Stefan Langerman (Computers and Games, 2006)

Constructing Dependency Trees for Rate-Distortion Optimized Media Streaming. - Martin Röder; Jean Cardinal; Raouf Hamzaoui (ICASSP (5), 2006)

Selfish Service Installation in Networks. - Jean Cardinal; Martin Hoefer 001 (WINE, 2006)

Juggling with Pattern Matching. - Jean Cardinal; Steve Kremer; Stefan Langerman (Theory Comput. Syst., 2006)

Branch and bound algorithms for rate-distortion optimized media streaming. - Martin Röder; Jean Cardinal; Raouf Hamzaoui (IEEE Trans. Multim., 2006)

Moving Walkways, Escalators, and Elevators - Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Belén Palop (CoRR, 2007)

Efficient Rate-Distortion Optimized Media Streaming for Tree-Structured Packet Dependencies. - Martin Röder; Jean Cardinal; Raouf Hamzaoui (IEEE Trans. Multim., 2007)

Tight Results on Minimum Entropy Set Cover. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret (Algorithmica, 2008)

Optimal location of transportation devices. - Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Belén Palop (Comput. Geom., 2008)

Local properties of geometric graphs. - Jean Cardinal; Sébastien Collette; Stefan Langerman (Comput. Geom., 2008)

Set Covering Problems with General Objective Functions - Jean Cardinal; Christophe Dumeunier (CoRR, 2008)

Chromatic Edge Strength of Some Multigraphs. - Jean Cardinal; Vlady Ravelomanana; Mario Valencia-Pabon (Electron. Notes Discret. Math., 2008)

Minimum entropy coloring. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret (J. Comb. Optim., 2008)

Minimum entropy orientations. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret (Oper. Res. Lett., 2008)

Relaxed Gabriel Graphs. - Prosenjit Bose; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Belén Palop; Perouz Taslakian; Norbert Zeh (CCCG, 2009)

Algorithmic Folding Complexity. - Jean Cardinal; Erik D. Demaine; Martin L. Demaine; Shinji Imahori; Stefan Langerman; Ryuhei Uehara (ISAAC, 2009)

Empty region graphs. - Jean Cardinal; Sébastien Collette; Stefan Langerman (Comput. Geom., 2009)

Detecting all regular polygons in a point set - Greg Aloupis; Jean Cardinal; Sébastien Collette; John Iacono; Stefan Langerman (CoRR, 2009)

Coloring Geometric Range Spaces. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Stefan Langerman; Shakhar Smorodinsky (Discret. Comput. Geom., 2009)

Pricing Geometric Transportation Networks. - Jean Cardinal; Martine Labbé; Stefan Langerman; Belén Palop (Int. J. Comput. Geom. Appl., 2009)

Improved approximation bounds for edge dominating set in dense graphs. - Jean Cardinal; Stefan Langerman; Eythan Levy (Theor. Comput. Sci., 2009)

Matching Points with Things. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (LATIN, 2010)

Highway hull revisited. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke; Belén Palop (Comput. Geom., 2010)

Minimum sum edge colorings of multicycles. - Jean Cardinal; Vlady Ravelomanana; Mario Valencia-Pabon (Discret. Appl. Math., 2010)

Decomposition of Multiple Coverings into More Parts. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Stefan Langerman; David Orden; Pedro Ramos 001 (Discret. Comput. Geom., 2010)

An Efficient Algorithm for Partial Order Production. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret; Raphaël M. Jungers; J. Ian Munro (SIAM J. Comput., 2010)

Non-cooperative facility location and covering games. - Jean Cardinal; Martin Hoefer 001 (Theor. Comput. Sci., 2010)

Connected vertex covers in dense graphs. - Jean Cardinal; Eythan Levy (Theor. Comput. Sci., 2010)

The Stackelberg Minimum Spanning Tree Game. - Jean Cardinal; Erik D. Demaine; Samuel Fiorini; Gwenaël Joret; Stefan Langerman; Ilan Newman; Oren Weimann (Algorithmica, 2011)

Approximating Subdense Instances of Covering Problems. - Jean Cardinal; Marek Karpinski; Richard Schmied; Claus Viehmann (Electron. Notes Discret. Math., 2011)

Colorful Strips. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Shinji Imahori; Matias Korman; Stefan Langerman; Oded Schwartz; Shakhar Smorodinsky; Perouz Taslakian (Graphs Comb., 2011)

Algorithmic Folding Complexity. - Jean Cardinal; Erik D. Demaine; Martin L. Demaine; Shinji Imahori; Tsuyoshi Ito; Masashi Kiyomi; Stefan Langerman; Ryuhei Uehara; Takeaki Uno (Graphs Comb., 2011)

The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. - Eglantine Camby; Jean Cardinal; Samuel Fiorini; Oliver Schaudt (CTW, 2012)

Approximating vertex cover in dense hypergraphs. - Jean Cardinal; Marek Karpinski; Richard Schmied; Claus Viehmann (J. Discrete Algorithms, 2012)

Minimum Entropy Combinatorial Optimization Problems. - Jean Cardinal; Samuel Fiorini; Gwenaël Joret (Theory Comput. Syst., 2012)

On Generalized Comparison-Based Sorting Problems. - Jean Cardinal; Samuel Fiorini (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. - Oswin Aichholzer; Jean Cardinal; Thomas Hackl; Ferran Hurtado; Matias Korman; Alexander Pilz; Rodrigo I. Silveira; Ryuhei Uehara; Birgit Vogtenhuber; Emo Welzl (CCCG, 2013)

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. - Andrei Asinowski; Jean Cardinal; Nathann Cohen; Sébastien Collette; Thomas Hackl; Michael Hoffmann 001; Kolja B. Knauer; Stefan Langerman; Michal Lason; Piotr Micek; Günter Rote; Torsten Ueckerdt (WADS, 2013)

Sorting under partial information (without the ellipsoid algorithm). - Jean Cardinal; Samuel Fiorini; Gwenaël Joret; Raphaël M. Jungers; J. Ian Munro (Comb., 2013)

Non-crossing matchings of points with geometric objects. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (Comput. Geom., 2013)

Coloring planar homothets and three-dimensional hypergraphs. - Jean Cardinal; Matias Korman (Comput. Geom., 2013)

The Clique Problem in Ray Intersection Graphs. - Sergio Cabello; Jean Cardinal; Stefan Langerman (Discret. Comput. Geom., 2013)

Coloring and Guarding Arrangements. - Prosenjit Bose; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Matias Korman; Stefan Langerman; Perouz Taslakian (Discret. Math. Theor. Comput. Sci., 2013)

Helly Numbers of Polyominoes. - Jean Cardinal; Hiro Ito; Matias Korman; Stefan Langerman (Graphs Comb., 2013)

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. - Jean Cardinal; Erik D. Demaine; Samuel Fiorini; Gwenaël Joret; Ilan Newman; Oren Weimann (J. Comb. Optim., 2013)

Making Triangles Colorful. - Jean Cardinal; Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (J. Comput. Geom., 2013)

Reconstructing Point Set Order Typesfrom Radial Orderings. - Oswin Aichholzer; Jean Cardinal; Vincent Kusters; Stefan Langerman; Pavel Valtr 001 (ISAAC, 2014)

Draining a polygon - or - rolling a ball out of a polygon. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke (Comput. Geom., 2014)

General Position Subsets and Independent Hyperplanes in d-Space. - Jean Cardinal; Csaba D. Tóth; David R. Wood (CoRR, 2014)

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. - Oswin Aichholzer; Jean Cardinal; Thomas Hackl; Ferran Hurtado; Matias Korman; Alexander Pilz; Rodrigo I. Silveira; Ryuhei Uehara; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (Discret. Math. Theor. Comput. Sci., 2014)

The Price of Connectivity for Vertex Cover. - Eglantine Camby; Jean Cardinal; Samuel Fiorini; Oliver Schaudt (Discret. Math. Theor. Comput. Sci., 2014)

Making Octants Colorful and Related Covering Decomposition Problems. - Jean Cardinal; Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (SIAM J. Discret. Math., 2014)

Hitting All Maximal Independent Sets of a Bipartite Graph. - Jean Cardinal; Gwenaël Joret (Algorithmica, 2015)

Covering Partial Cubes with Zones. - Jean Cardinal; Stefan Felsner (Electron. J. Comb., 2015)

On the Decision Tree Complexity of $k$-SUM. - Jean Cardinal; Aurélien Ooms (CoRR, 2015)

On Universal Point Sets for Planar Graphs. - Jean Cardinal; Michael Hoffmann 001; Vincent Kusters (J. Graph Algorithms Appl., 2015)

The Complexity of Simultaneous Geometric Graph Embedding. - Jean Cardinal; Vincent Kusters (J. Graph Algorithms Appl., 2015)

Cannibal Animal Games: a new variant of Tic-Tac-Toe. - Jean Cardinal; Sébastien Collette; Hiro Ito; Matias Korman; Stefan Langerman; Hikaru Sakaidani; Perouz Taslakian (J. Inf. Process., 2015)

Computational Geometry Column 62. - Jean Cardinal (SIGACT News, 2015)

Solving k-SUM Using Few Linear Queries. - Jean Cardinal; John Iacono; Aurélien Ooms (ESA, 2016)

Ramsey-type theorems for lines in 3-space. - Jean Cardinal; Michael S. Payne; Noam Solomon (Discret. Math. Theor. Comput. Sci., 2016)

On the shelling antimatroids of split graphs. - Keno Merckx; Jean Cardinal; Jean-Paul Doignon (Electron. Notes Discret. Math., 2016)

Reconstructing Point Set Order Types from Radial Orderings. - Oswin Aichholzer; Jean Cardinal; Vincent Kusters; Stefan Langerman; Pavel Valtr 001 (Int. J. Comput. Geom. Appl., 2016)

Subquadratic Algorithms for Algebraic Generalizations of 3SUM. - Luis Barba; Jean Cardinal; John Iacono; Stefan Langerman; Aurélien Ooms; Noam Solomon (SoCG, 2017)

Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. - Jean Cardinal; Jerri Nummenpalo; Emo Welzl (IPEC, 2017)

Recognition and Complexity of Point Visibility Graphs. - Jean Cardinal; Udo Hoffmann (Discret. Comput. Geom., 2017)

On the Diameter of Tree Associahedra. - Jean Cardinal; Stefan Langerman; Pablo Pérez-Lantero (Electron. J. Comb., 2018)

Arc diagrams, flip distances, and Hamiltonian triangulations. - Jean Cardinal; Michael Hoffmann 001; Vincent Kusters; Csaba D. Tóth; Manuel Wettstein (Comput. Geom., 2018)

A Note on Flips in Diagonal Rectangulations. - Jean Cardinal; Vera Sacristán; Rodrigo I. Silveira (Discret. Math. Theor. Comput. Sci., 2018)

Intersection Graphs of Rays and Grounded Segments. - Jean Cardinal; Stefan Felsner; Tillmann Miltzow; Casey Tompkins; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2018)

Topological drawings of complete bipartite graphs. - Jean Cardinal; Stefan Felsner (J. Comput. Geom., 2018)

Three-Coloring Three-Dimensional Uniform Hypergraphs. - Ahmad Biniaz; Prosenjit Bose; Jean Cardinal; Michael S. Payne (CCCG, 2019)

Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. - Jean Cardinal; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (CCCG, 2019)

Dynamic Graph Coloring. - Luis Barba; Jean Cardinal; Matias Korman; Stefan Langerman; André van Renssen; Marcel Roeloffzen; Sander Verdonschot (Algorithmica, 2019)

Information-theoretic lower bounds for quantum sorting. - Jean Cardinal; Gwenaël Joret; Jérémie Roland (CoRR, 2019)

Encoding 3SUM. - Sergio Cabello; Jean Cardinal; John Iacono; Stefan Langerman; Pat Morin; Aurélien Ooms (CoRR, 2019)

Subquadratic Algorithms for Algebraic 3SUM. - Luis Barba; Jean Cardinal; John Iacono; Stefan Langerman; Aurélien Ooms; Noam Solomon (Discret. Comput. Geom., 2019)

Finding a Maximum-Weight Convex Set in a Chordal Graph. - Jean Cardinal; Jean-Paul Doignon; Keno Merckx (J. Graph Algorithms Appl., 2019)

Subquadratic encodings for point configurations. - Jean Cardinal; Timothy M. Chan; John Iacono; Stefan Langerman; Aurélien Ooms (J. Comput. Geom., 2019)

Sparse Regression via Range Counting. - Jean Cardinal; Aurélien Ooms (SWAT, 2020)

Solving and Sampling with Many Solutions. - Jean Cardinal; Jerri Nummenpalo; Emo Welzl (Algorithmica, 2020)

Dynamic Geometric Independent Set. - Sujoy Bhore; Jean Cardinal; John Iacono; Grigorios Koumoutsos (CoRR, 2020)

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 (Theor. Comput. Sci., 2020)

Approximability of (Simultaneous) Class Cover for Boxes. - Jean Cardinal; Justin Dallant; John Iacono (CCCG, 2021)

An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. - Jean Cardinal; Justin Dallant; John Iacono (ESA, 2021)

Worst-Case Efficient Dynamic Geometric Independent Set. - Jean Cardinal; John Iacono; Grigorios Koumoutsos (ESA, 2021)

Bounds on the Diameter of Graph Associahedra. - Jean Cardinal; Lionel Pournin; Mario Valencia-Pabon (LAGOS, 2021)

Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. - Jean Cardinal; John Iacono (SOSA, 2021)

Flip Distances Between Graph Orientations. - Oswin Aichholzer; Jean Cardinal; Tony Huynh; Kolja Knauer; Torsten Mütze; Raphael Steiner; Birgit Vogtenhuber (Algorithmica, 2021)

Efficient generation of elimination trees and graph associahedra. - Jean Cardinal; Arturo Merino; Torsten Mütze (SODA, 2022)

Drawing Graphs as Spanners. - Oswin Aichholzer; Manuel Borrazzo; Prosenjit Bose; Jean Cardinal; Fabrizio Frati; Pat Morin; Birgit Vogtenhuber (Discret. Comput. Geom., 2022)

Geometric Pattern Matching Reduces to k-SUM. - Boris Aronov; Jean Cardinal (Discret. Comput. Geom., 2022)

Algorithms for approximate sparse regression and nearest induced hulls. - Jean Cardinal; Aurélien Ooms (J. Comput. Geom., 2022)

Dynamic Schnyder woods. - Pilar Cano; Sujoy Bhore; Prosenjit Bose; Jean Cardinal; John Iacono (CCCG, 2023)

Zigzagging through acyclic orientations of chordal graphs and hypergraphs. - Jean Cardinal; Hung Phuc Hoang; Arturo Merino; Torsten Mütze (SODA, 2023)

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 (Comput. Geom., 2023)

Shortest paths on polymatroids and hypergraphic polytopes. - Jean Cardinal; Raphael Steiner (CoRR, 2023)

Competitive Online Search Trees on Trees. - Prosenjit Bose; Jean Cardinal; John Iacono; Grigorios Koumoutsos; Stefan Langerman (ACM Trans. Algorithms, 2023)

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. - Jean Cardinal; Hung Phuc Hoang; Arturo Merino; Ondrej Micka; Torsten Mütze (SIAM J. Discret. Math., 2023)

Colouring bottomless rectangles and arborescences. - Jean Cardinal; Kolja Knauer; Piotr Micek; Dömötör Pálvölgyi; Torsten Ueckerdt; Narmada Varadarajan (Comput. Geom., 2023)

A General Technique for Searching in Implicit Sets via Function Inversion. - Boris Aronov; Jean Cardinal; Justin Dallant; John Iacono (SOSA, 2024)

The expansion of half-integral polytopes. - Jean Cardinal; Lionel Pournin (CoRR, 2024)

The Complexity of Intersection Graphs of Lines in Space and Circle Orders. - Jean Cardinal (CoRR, 2024)

The Existential Theory of the Reals as a Complexity Class: A Compendium. - Marcus Schaefer 001; Jean Cardinal; Tillmann Miltzow (CoRR, 2024)

Triangulations in Geometry and Topology (Dagstuhl Seminar 24072). - Maike Buchin; Jean Cardinal; Arnaud de Mesmay; Jonathan Spreer; Alex He (Dagstuhl Reports, 2024)

The rotation distance of brooms. - Jean Cardinal; Lionel Pournin; Mario Valencia-Pabon (Eur. J. Comb., 2024)

Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization. - Jean Cardinal; Xavier Goaoc; Sarah Wajsbrot (MFCS, 2025)

Facet-Hamiltonicity. - Hugo A. Akitaya; Jean Cardinal; Stefan Felsner; Linda Kleist; Robert Lauff (SODA, 2025)

Combinatorics of rectangulations: old and new bijections. - Andrei Asinowski; Jean Cardinal; Stefan Felsner; Éric Fusy (Comb. Theory, 2025)

Rectangulotopes. - Jean Cardinal; Vincent Pilaud (Eur. J. Comb., 2025)

Combinatorial Generation via Permutation Languages. IV. Elimination Trees. - Jean Cardinal; Arturo Merino; Torsten Mütze (ACM Trans. Algorithms, 2025)

Inapproximability of shortest paths on perfect matching polytopes. - Jean Cardinal; Raphael Steiner (Math. Program., 2025)

Compact Representation of Semilinear and Terrain-like Graphs. - Jean Cardinal; Yelena Yuditsky (CoRR, 2025)

Improved Algebraic Degeneracy Testing. - Jean Cardinal; Micha Sharir (Discret. Comput. Geom., 2025)