Jean Cardinal

242 papers A* 13A 8B 25C 5Misc 3Journal 160Unranked 28
YearRankTypeTitle / Venue / Authors
2026 J jnl
A General Technique for Searching in Implicit Sets via Function Inversion.
Algorithmica
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2026 J jnl
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements.
Eur. J. Comb.
Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze
2026 J jnl
Implicit representations via the polynomial method.
CoRR
Jean Cardinal, Micha Sharir
2026 A* conf
Traversing regions of supersolvable hyperplane arrangements and their lattice quotients.
SODA
Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze
2025 J jnl
Combinatorial Generation via Permutation Languages. IV. Elimination Trees.
ACM Trans. Algorithms
Jean Cardinal, Arturo Merino, Torsten Mütze
2025 J jnl
Combinatorics of rectangulations: old and new bijections.
Comb. Theory
Andrei Asinowski, Jean Cardinal, Stefan Felsner, Éric Fusy
2025 A conf
Compact Representation of Semilinear and Terrain-Like Graphs.
ESA
Jean Cardinal, Yelena Yuditsky
2025 J jnl
Compact Representation of Semilinear and Terrain-like Graphs.
CoRR
Jean Cardinal, Yelena Yuditsky
2025 A* conf
Facet-Hamiltonicity.
SODA
Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff
2025 B conf
Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization.
MFCS
Jean Cardinal, Xavier Goaoc, Sarah Wajsbrot
2025 J jnl
Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization.
CoRR
Jean Cardinal, Xavier Goaoc, Sarah Wajsbrot
2025 J jnl
Improved Algebraic Degeneracy Testing.
Discret. Comput. Geom.
Jean Cardinal, Micha Sharir
2025 J jnl
Inapproximability of shortest paths on perfect matching polytopes.
Math. Program.
Jean Cardinal, Raphael Steiner
2025 J jnl
Rectangulotopes.
Eur. J. Comb.
Jean Cardinal, Vincent Pilaud
2025 J jnl
Shortest paths on polymatroids and hypergraphic polytopes.
Comb. Theory
Jean Cardinal, Raphael Steiner
2024 — conf
A General Technique for Searching in Implicit Sets via Function Inversion.
SOSA
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2024 J jnl
Combinatorics of rectangulations: Old and new bijections.
CoRR
Andrei Asinowski, Jean Cardinal, Stefan Felsner, Éric Fusy
2024 J jnl
Facet-Hamiltonicity.
CoRR
Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff
2024 J jnl
Rectangulotopes.
CoRR
Jean Cardinal, Vincent Pilaud
2024 J jnl
The Complexity of Intersection Graphs of Lines in Space and Circle Orders.
CoRR
Jean Cardinal
2024 J jnl
The Existential Theory of the Reals as a Complexity Class: A Compendium.
CoRR
Marcus Schaefer, Jean Cardinal, Tillmann Miltzow
2024 J jnl
The expansion of half-integral polytopes.
CoRR
Jean Cardinal, Lionel Pournin
2024 J jnl
The rotation distance of brooms.
Eur. J. Comb.
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
2024 J jnl
Triangulations in Geometry and Topology (Dagstuhl Seminar 24072).
Dagstuhl Reports
Maike Buchin, Jean Cardinal, Arnaud de Mesmay, Jonathan Spreer, Alex He
2023 J jnl
A General Technique for Searching in Implicit Sets via Function Inversion.
CoRR
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2023 J jnl
Colouring bottomless rectangles and arborescences.
Comput. Geom.
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
2023 J jnl
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations.
SIAM J. Discret. Math.
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze
2023 J jnl
Competitive Online Search Trees on Trees.
ACM Trans. Algorithms
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2023 — conf
Dynamic Schnyder woods.
CCCG
Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono
2023 A* conf
Improved Algebraic Degeneracy Testing.
SoCG
Jean Cardinal, Micha Sharir
2023 B conf
Inapproximability of Shortest Paths on Perfect Matching Polytopes.
IPCO
Jean Cardinal, Raphael Steiner
2023 J jnl
Shortest paths on polymatroids and hypergraphic polytopes.
CoRR
Jean Cardinal, Raphael Steiner
2023 J jnl
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model.
Comput. Geom.
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2023 A* conf
Zigzagging through acyclic orientations of chordal graphs and hypergraphs.
SODA
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze
2022 J jnl
Algorithms for approximate sparse regression and nearest induced hulls.
J. Comput. Geom.
Jean Cardinal, Aurélien Ooms
2022 J jnl
Combinatorial generation via permutation languages. V. Acyclic orientations.
CoRR
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze
2022 J jnl
Drawing Graphs as Spanners.
Discret. Comput. Geom.
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
2022 A* conf
Efficient generation of elimination trees and graph associahedra.
SODA
Jean Cardinal, Arturo Merino, Torsten Mütze
2022 J jnl
Geometric Pattern Matching Reduces to k-SUM.
Discret. Comput. Geom.
Boris Aronov, Jean Cardinal
2022 J jnl
Improved Algebraic Degeneracy Testing.
CoRR
Jean Cardinal, Micha Sharir
2022 J jnl
Inapproximability of shortest paths on perfect matching polytopes.
CoRR
Jean Cardinal, Raphael Steiner
2021 A conf
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
ESA
Jean Cardinal, Justin Dallant, John Iacono
2021 J jnl
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility.
CoRR
Jean Cardinal, Justin Dallant, John Iacono
2021 — conf
Approximability of (Simultaneous) Class Cover for Boxes.
CCCG
Jean Cardinal, Justin Dallant, John Iacono
2021 J jnl
Approximability of (Simultaneous) Class Cover for Boxes.
CoRR
Jean Cardinal, Justin Dallant, John Iacono
2021 C conf
Bounds on the Diameter of Graph Associahedra.
LAGOS
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
2021 J jnl
Bounds on the Diameter of Graph Associahedra.
CoRR
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
2021 J jnl
Combinatorial generation via permutation languages. IV. Elimination trees.
CoRR
Jean Cardinal, Arturo Merino, Torsten Mütze
2021 J jnl
Dynamic Schnyder Woods.
CoRR
Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono
2021 J jnl
Flip Distances Between Graph Orientations.
Algorithmica
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
2021 — conf
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets.
SOSA
Jean Cardinal, John Iacono
2021 B conf
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model.
ISAAC
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2021 J jnl
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model.
CoRR
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2021 A conf
Worst-Case Efficient Dynamic Geometric Independent Set.
ESA
Jean Cardinal, John Iacono, Grigorios Koumoutsos
2021 J jnl
Worst-Case Efficient Dynamic Geometric Independent Set.
CoRR
Jean Cardinal, John Iacono, Grigorios Koumoutsos
2020 J jnl
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid.
CoRR
Jean Cardinal, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano
2020 A* conf
Competitive Online Search Trees on Trees.
SODA
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2020 B conf
Drawing Graphs as Spanners.
WG
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
2020 J jnl
Drawing Graphs as Spanners.
CoRR
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
2020 J jnl
Dynamic Geometric Independent Set.
CoRR
Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos
2020 B conf
Geometric Pattern Matching Reduces to k-SUM.
ISAAC
Boris Aronov, Jean Cardinal
2020 J jnl
Geometric Pattern Matching Reduces to k-SUM.
CoRR
Boris Aronov, Jean Cardinal
2020 J jnl
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets.
CoRR
Jean Cardinal, John Iacono
2020 J jnl
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect.
Theor. Comput. Sci.
Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2020 J jnl
Solving and Sampling with Many Solutions.
Algorithmica
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
2020 — conf
Sparse Regression via Range Counting.
SWAT
Jean Cardinal, Aurélien Ooms
2019 — conf
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid.
CCCG
Jean Cardinal, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano
2019 J jnl
Competitive Online Search Trees on Trees.
CoRR
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019 J jnl
Dynamic Graph Coloring.
Algorithmica
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
2019 J jnl
Encoding 3SUM.
CoRR
Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms
2019 J jnl
Finding a Maximum-Weight Convex Set in a Chordal Graph.
J. Graph Algorithms Appl.
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
2019 B conf
Flip Distances Between Graph Orientations.
WG
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
2019 J jnl
Flip distances between graph orientations.
CoRR
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
2019 J jnl
Information-theoretic lower bounds for quantum sorting.
CoRR
Jean Cardinal, Gwenaël Joret, Jérémie Roland
2019 J jnl
Sparse Regression via Range Counting.
CoRR
Jean Cardinal, Aurélien Ooms
2019 J jnl
Subquadratic Algorithms for Algebraic 3SUM.
Discret. Comput. Geom.
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
2019 J jnl
Subquadratic encodings for point configurations.
J. Comput. Geom.
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2019 — conf
Three-Coloring Three-Dimensional Uniform Hypergraphs.
CCCG
Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne
2018 J jnl
A Note on Flips in Diagonal Rectangulations.
Discret. Math. Theor. Comput. Sci.
Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira
2018 J jnl
Arc diagrams, flip distances, and Hamiltonian triangulations.
Comput. Geom.
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
2018 J jnl
Finding a Maximum-Weight Convex Set in a Chordal Graph.
CoRR
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
2018 J jnl
Intersection Graphs of Rays and Grounded Segments.
J. Graph Algorithms Appl.
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
2018 J jnl
On the Diameter of Tree Associahedra.
Electron. J. Comb.
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
2018 J jnl
On the Diameter of Tree Associahedra.
CoRR
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
2018 Misc conf
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect.
COCOON
Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2018 J jnl
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect.
CoRR
Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow
2018 A* conf
Subquadratic Encodings for Point Configurations.
SoCG
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2018 J jnl
Subquadratic Encodings for Point Configurations.
CoRR
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2018 J jnl
Topological drawings of complete bipartite graphs.
J. Comput. Geom.
Jean Cardinal, Stefan Felsner
2017 J jnl
A Note on Flips in Diagonal Rectangulations.
CoRR
Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira
2017 B conf
Dynamic Graph Coloring.
WADS
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
2017 J jnl
Dynamic Graph Coloring.
CoRR
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
2017 J jnl
Helly Numbers of Polyominoes.
CoRR
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
2017 B conf
Intersection Graphs of Rays and Grounded Segments.
WG
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
2017 J jnl
On the shelling antimatroids of split graphs.
Discret. Math. Theor. Comput. Sci.
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
2017 J jnl
Recognition and Complexity of Point Visibility Graphs.
Discret. Comput. Geom.
Jean Cardinal, Udo Hoffmann
2017 B conf
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems.
IPEC
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
2017 J jnl
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems.
CoRR
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
2017 A* conf
Subquadratic Algorithms for Algebraic Generalizations of 3SUM.
SoCG
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
2016 J jnl
Arc diagrams, flip distances, and Hamiltonian triangulations.
CoRR
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
2016 J jnl
Intersection Graphs of Rays and Grounded Segments.
CoRR
Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
2016 J jnl
On the shelling antimatroids of split graphs.
Electron. Notes Discret. Math.
Keno Merckx, Jean Cardinal, Jean-Paul Doignon
2016 J jnl
Ramsey-type theorems for lines in 3-space.
Discret. Math. Theor. Comput. Sci.
Jean Cardinal, Michael S. Payne, Noam Solomon
2016 J jnl
Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geom. Appl.
Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
2016 A conf
Solving k-SUM Using Few Linear Queries.
ESA
Jean Cardinal, John Iacono, Aurélien Ooms
2016 J jnl
Subquadratic Algorithms for Algebraic Generalizations of 3SUM.
CoRR
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
2016 A conf
Topological Drawings of Complete Bipartite Graphs.
GD
Jean Cardinal, Stefan Felsner
2016 J jnl
Topological Drawings of Complete Bipartite Graphs.
CoRR
Jean Cardinal, Stefan Felsner
2015 A conf
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations.
STACS
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
2015 J jnl
Cannibal Animal Games: a new variant of Tic-Tac-Toe.
J. Inf. Process.
Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian
2015 J jnl
Computational Geometry Column 62.
SIGACT News
Jean Cardinal
2015 J jnl
Covering Partial Cubes with Zones.
Electron. J. Comb.
Jean Cardinal, Stefan Felsner
2015 J jnl
Hitting All Maximal Independent Sets of a Bipartite Graph.
Algorithmica
Jean Cardinal, Gwenaël Joret
2015 J jnl
On Universal Point Sets for Planar Graphs.
J. Graph Algorithms Appl.
Jean Cardinal, Michael Hoffmann, Vincent Kusters
2015 J jnl
On the Decision Tree Complexity of $k$-SUM.
CoRR
Jean Cardinal, Aurélien Ooms
2015 J jnl
On the shelling antimatroids of split graphs.
CoRR
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
2015 J jnl
Ramsey-type theorems for lines in 3-space.
CoRR
Jean Cardinal, Michael S. Payne, Noam Solomon
2015 A* conf
Recognition and Complexity of Point Visibility Graphs.
SoCG
Jean Cardinal, Udo Hoffmann
2015 J jnl
Recognition and Complexity of Point Visibility Graphs.
CoRR
Jean Cardinal, Udo Hoffmann
2015 J jnl
The Complexity of Simultaneous Geometric Graph Embedding.
J. Graph Algorithms Appl.
Jean Cardinal, Vincent Kusters
2014 J jnl
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discret. Math. Theor. Comput. Sci.
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2014 J jnl
Draining a polygon - or - rolling a ball out of a polygon.
Comput. Geom.
Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke
2014 J jnl
General Position Subsets and Independent Hyperplanes in d-Space.
CoRR
Jean Cardinal, Csaba D. Tóth, David R. Wood
2014 A* conf
Making Octants Colorful and Related Covering Decomposition Problems.
SODA
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2014 J jnl
Making Octants Colorful and Related Covering Decomposition Problems.
SIAM J. Discret. Math.
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2014 B conf
Reconstructing Point Set Order Typesfrom Radial Orderings.
ISAAC
Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
2014 J jnl
The Price of Connectivity for Vertex Cover.
Discret. Math. Theor. Comput. Sci.
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
2013 J jnl
Cannibal Animal Games: a new variant of Tic-Tac-Toe.
CoRR
Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian
2013 — conf
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
CCCG
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl
2013 J jnl
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
CoRR
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt
2013 B conf
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
WADS
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt
2013 J jnl
Coloring and Guarding Arrangements.
Discret. Math. Theor. Comput. Sci.
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian
2013 J jnl
Coloring planar homothets and three-dimensional hypergraphs.
Comput. Geom.
Jean Cardinal, Matias Korman
2013 — conf
Covering Partial Cubes with Zones.
JCDCGG
Jean Cardinal, Stefan Felsner
2013 J jnl
Covering Partial Cubes with Zones.
CoRR
Jean Cardinal, Stefan Felsner
2013 J jnl
Helly Numbers of Polyominoes.
Graphs Comb.
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
2013 J jnl
Making Octants Colorful and Related Covering Decomposition Problems.
CoRR
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2013 J jnl
Making Triangles Colorful.
J. Comput. Geom.
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2013 J jnl
Non-crossing matchings of points with geometric objects.
Comput. Geom.
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, Perouz Taslakian
2013 — conf
On Generalized Comparison-Based Sorting Problems.
Space-Efficient Data Structures, Streams, and Algorithms
Jean Cardinal, Samuel Fiorini
2013 J jnl
Sorting under partial information (without the ellipsoid algorithm).
Comb.
Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2013 J jnl
The Clique Problem in Ray Intersection Graphs.
Discret. Comput. Geom.
Sergio Cabello, Jean Cardinal, Stefan Langerman
2013 J jnl
The Complexity of Simultaneous Geometric Graph Embedding
CoRR
Jean Cardinal, Vincent Kusters
2013 J jnl
The Price of Connectivity for Vertex Cover
CoRR
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
2013 J jnl
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs.
J. Comb. Optim.
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2012 J jnl
Approximating vertex cover in dense hypergraphs.
J. Discrete Algorithms
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2012 B conf
Coloring Planar Homothets and Three-Dimensional Hypergraphs.
LATIN
Jean Cardinal, Matias Korman
2012 J jnl
Coloring and Guarding Arrangements
CoRR
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian
2012 J jnl
Hitting all Maximal Independent Sets of a Bipartite Graph
CoRR
Jean Cardinal, Gwenaël Joret
2012 J jnl
Making Triangles Colorful
CoRR
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2012 J jnl
Minimum Entropy Combinatorial Optimization Problems.
Theory Comput. Syst.
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2012 J jnl
On Universal Point Sets for Planar Graphs
CoRR
Jean Cardinal, Michael Hoffmann, Vincent Kusters
2012 — conf
On Universal Point Sets for Planar Graphs.
TJJCCGG
Jean Cardinal, Michael Hoffmann, Vincent Kusters
2012 A conf
The Clique Problem in Ray Intersection Graphs.
ESA
Sergio Cabello, Jean Cardinal, Stefan Langerman
2012 C conf
The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs.
CTW
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
2011 J jnl
Algorithmic Folding Complexity.
Graphs Comb.
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno
2011 J jnl
Approximating Subdense Instances of Covering Problems.
Electron. Notes Discret. Math.
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2011 J jnl
Colorful Strips.
Graphs Comb.
Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
2011 J jnl
Coloring Planar Homothets and Three-Dimensional Hypergraphs
CoRR
Jean Cardinal, Matias Korman
2011 — conf
Helly Numbers of Polyominoes.
CCCG
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
2011 J jnl
The Clique Problem in Ray Intersection Graphs
CoRR
Sergio Cabello, Jean Cardinal, Stefan Langerman
2011 J jnl
The Stackelberg Minimum Spanning Tree Game.
Algorithmica
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2010 J jnl
An Efficient Algorithm for Partial Order Production.
SIAM J. Comput.
Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2010 J jnl
Approximating Subdense Instances of Covering Problems
CoRR
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2010 J jnl
Approximating Vertex Cover in Dense Hypergraphs
CoRR
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2010 B conf
Colorful Strips.
LATIN
Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
2010 J jnl
Connected vertex covers in dense graphs.
Theor. Comput. Sci.
Jean Cardinal, Eythan Levy
2010 J jnl
Decomposition of Multiple Coverings into More Parts.
Discret. Comput. Geom.
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos
2010 J jnl
Highway hull revisited.
Comput. Geom.
Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop
2010 B conf
Matching Points with Things.
LATIN
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, Perouz Taslakian
2010 J jnl
Minimum Entropy Combinatorial Optimization Problems
CoRR
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2010 J jnl
Minimum sum edge colorings of multicycles.
Discret. Appl. Math.
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
2010 J jnl
Non-cooperative facility location and covering games.
Theor. Comput. Sci.
Jean Cardinal, Martin Hoefer
2010 A* conf
Sorting under partial information (without the ellipsoid algorithm).
STOC
Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2009 B conf
Algorithmic Folding Complexity.
ISAAC
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara
2009 A* conf
An efficient algorithm for partial order production.
STOC
Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2009 J jnl
Colorful Strips
CoRR
Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
2009 J jnl
Coloring Geometric Range Spaces.
Discret. Comput. Geom.
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky
2009 A* conf
Decomposition of multiple coverings into more parts.
SODA
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos
2009 J jnl
Detecting all regular polygons in a point set
CoRR
Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman
2009 J jnl
Empty region graphs.
Comput. Geom.
Jean Cardinal, Sébastien Collette, Stefan Langerman
2009 J jnl
Improved approximation bounds for edge dominating set in dense graphs.
Theor. Comput. Sci.
Jean Cardinal, Stefan Langerman, Eythan Levy
2009 C conf
Minimum Entropy Combinatorial Optimization Problems.
CiE
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2009 J jnl
Pricing Geometric Transportation Networks.
Int. J. Comput. Geom. Appl.
Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop
2009 — conf
Relaxed Gabriel Graphs.
CCCG
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh
2009 J jnl
Sorting under Partial Information (without the Ellipsoid Algorithm)
CoRR
Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2009 J jnl
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
CoRR
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2009 — conf
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs.
WINE
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
2008 J jnl
An Efficient Algorithm for Partial Order Production
CoRR
Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro
2008 J jnl
Chromatic Edge Strength of Some Multigraphs.
Electron. Notes Discret. Math.
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
2008 B conf
Coloring Geometric Range Spaces.
LATIN
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky
2008 — conf
Connected Vertex Covers in Dense Graphs.
APPROX-RANDOM
Jean Cardinal, Eythan Levy
2008 J jnl
Decomposition of Multiple Coverings into More Parts
CoRR
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos
2008 — conf
Draining a Polygon - or - Rolling a Ball out of a Polygon.
CCCG
Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke
2008 J jnl
Highway Hull Revisited
CoRR
Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop
2008 J jnl
Local properties of geometric graphs.
Comput. Geom.
Jean Cardinal, Sébastien Collette, Stefan Langerman
2008 J jnl
Minimum Entropy Orientations
CoRR
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2008 J jnl
Minimum entropy coloring.
J. Comb. Optim.
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2008 J jnl
Minimum entropy orientations.
Oper. Res. Lett.
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2008 J jnl
Optimal location of transportation devices.
Comput. Geom.
Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop
2008 J jnl
Set Covering Problems with General Objective Functions
CoRR
Jean Cardinal, Christophe Dumeunier
2008 J jnl
Tight Results on Minimum Entropy Set Cover.
Algorithmica
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2007 J jnl
Chromatic Edge Strength of Some Multigraphs
CoRR
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
2007 J jnl
Efficient Rate-Distortion Optimized Media Streaming for Tree-Structured Packet Dependencies.
IEEE Trans. Multim.
Martin Röder, Jean Cardinal, Raouf Hamzaoui
2007 J jnl
Moving Walkways, Escalators, and Elevators
CoRR
Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop
2007 J jnl
The Stackelberg Minimum Spanning Tree Game
CoRR
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2007 B conf
The Stackelberg Minimum Spanning Tree Game.
WADS
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2006 J jnl
Branch and bound algorithms for rate-distortion optimized media streaming.
IEEE Trans. Multim.
Martin Röder, Jean Cardinal, Raouf Hamzaoui
2006 — conf
Constructing Dependency Trees for Rate-Distortion Optimized Media Streaming.
ICASSP (5)
Martin Röder, Jean Cardinal, Raouf Hamzaoui
2006 B conf
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.
WAOA
Jean Cardinal, Stefan Langerman, Eythan Levy
2006 J jnl
Juggling with Pattern Matching.
Theory Comput. Syst.
Jean Cardinal, Steve Kremer, Stefan Langerman
2006 — conf
LUMINESStrategies.
Computers and Games
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman
2006 — conf
Selfish Service Installation in Networks.
WINE
Jean Cardinal, Martin Hoefer
2006 — conf
Tight Results on Minimum Entropy Set Cover.
APPROX-RANDOM
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2005 Misc conf
A Tight Analysis of the Maximal Matching Heuristic.
COCOON
Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
2005 J jnl
Designing small keyboards is hard.
Theor. Comput. Sci.
Jean Cardinal, Stefan Langerman
2005 — conf
Dynamic programming algorithm for rate-distortion optimized media streaming.
ICIP (2)
Martin Röder, Jean Cardinal, Raouf Hamzaoui
2005 B conf
Minimum Entropy Coloring.
ISAAC
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
2005 — conf
Pricing of Geometric Transportation Networks.
CCCG
Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop
2005 — conf
Region Counting Distances and Region Counting Circles.
CCCG
Jean Cardinal, Sébastien Collette, Stefan Langerman
2005 C conf
Region counting graphs.
EuroCG
Jean Cardinal, Sébastien Collette, Stefan Langerman
2004 B conf
Designing Small Keyboards Is Hard.
LATIN
Jean Cardinal, Stefan Langerman
2004 J jnl
Entropy-constrained index assignments for multiple description quantizers.
IEEE Trans. Signal Process.
Jean Cardinal
2004 — conf
Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures.
ALENEX/ANALC
Jean Cardinal, David Eppstein
2004 — conf
Local properties of geometric graphs.
CCCG
Jean Cardinal, Sébastien Collette, Stefan Langerman
2004 B conf
On minimum entropy graph colorings.
ISIT
Jean Cardinal, Samuel Fiorini, Gilles Van Assche
2004 B conf
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media.
Data Compression Conference
Martin Röder, Jean Cardinal, Raouf Hamzaoui
2004 J jnl
Reconciliation of a quantum-distributed Gaussian key.
IEEE Trans. Inf. Theory
Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf
2003 A conf
Compression of side information.
ICME
Jean Cardinal
2003 B conf
Construction of a shared secret key using continuous variables.
ITW
Jean Cardinal, Gilles Van Assche
2003 — conf
Multistage index assignments for M-description coding.
ICIP (3)
Jean Cardinal
2003 J jnl
Tree-Structured Multiple Description Coding.
J. VLSI Signal Process.
Jean Cardinal
2002 J jnl
Complexity-constrained tree-structured vector quantizers.
Signal Process.
Jean Cardinal
2002 — conf
Local optimization of index assignments for multiple description coding.
EUSIPCO
Jean Cardinal, Sourour Elloumi, Martine Labbé
2001 B conf
Design of Tree-Structured Multiple Description Vector Quantizers.
Data Compression Conference
Jean Cardinal
2001 C conf
Design of asymmetric tree-structured multiple description source codes.
MMSP
Jean Cardinal
2001 J jnl
Fast fractal compression of greyscale images.
IEEE Trans. Image Process.
Jean Cardinal
2001 J jnl
Reconciliation of a Quantum-Distributed Gaussian Key
CoRR
Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf
2000 J jnl
A Lagrangian optimization approach to complexity-constrained TSVQ.
IEEE Signal Process. Lett.
Jean Cardinal
2000 — conf
Multipath tree-structured vector quantizers.
EUSIPCO
Jean Cardinal
2000 B conf
Tree-Based Search for ECVQ.
Data Compression Conference
Jean Cardinal
1999 Misc conf
Fast Search for Entropy-Constrained VQ.
ICIAP
Jean Cardinal