default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Cardinal
Person information
- affiliation: Université libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j75]Jean Cardinal, Lionel Pournin
, Mario Valencia-Pabon:
The rotation distance of brooms. Eur. J. Comb. 118: 103877 (2024)- [c77]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA 2024: 215-223 - [i74]Andrei Asinowski, Jean Cardinal, Stefan Felsner, Éric Fusy:
Combinatorics of rectangulations: Old and new bijections. CoRR abs/2402.01483 (2024) - [i73]Jean Cardinal, Lionel Pournin:
The expansion of half-integral polytopes. CoRR abs/2402.14343 (2024) - [i72]Jean Cardinal, Vincent Pilaud:
Rectangulotopes. CoRR abs/2404.17349 (2024) - [i71]Jean Cardinal:
The Complexity of Intersection Graphs of Lines in Space and Circle Orders. CoRR abs/2406.17504 (2024) - [i70]Marcus Schaefer, Jean Cardinal, Tillmann Miltzow:
The Existential Theory of the Reals as a Complexity Class: A Compendium. CoRR abs/2407.18006 (2024) - [i69]Maike Buchin, Jean Cardinal, Arnaud de Mesmay, Jonathan Spreer, Alex He:
Triangulations in Geometry and Topology (Dagstuhl Seminar 24072). Dagstuhl Reports 14(2): 120-163 (2024) - 2023
- [j74]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: 101945 (2023) - [j73]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: 102020 (2023) - [j72]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze:
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. SIAM J. Discret. Math. 37(3): 1509-1547 (2023) - [j71]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19(3): 25:1-25:19 (2023) - [c76]Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono:
Dynamic Schnyder woods. CCCG 2023: 97-104 - [c75]Jean Cardinal, Micha Sharir:
Improved Algebraic Degeneracy Testing. SoCG 2023: 22:1-22:16 - [c74]Jean Cardinal, Raphael Steiner:
Inapproximability of Shortest Paths on Perfect Matching Polytopes. IPCO 2023: 72-86 - [c73]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze:
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. SODA 2023: 3029-3042 - [i68]Jean Cardinal, Raphael Steiner:
Shortest paths on polymatroids and hypergraphic polytopes. CoRR abs/2311.00779 (2023) - [i67]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR abs/2311.12471 (2023) - 2022
- [j70]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. Discret. Comput. Geom. 68(3): 774-795 (2022) - [j69]Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. Discret. Comput. Geom. 68(3): 850-859 (2022) - [j68]Jean Cardinal, Aurélien Ooms:
Algorithms for approximate sparse regression and nearest induced hulls. J. Comput. Geom. 13(1): 377-398 (2022) - [c72]Jean Cardinal, Arturo Merino, Torsten Mütze:
Efficient generation of elimination trees and graph associahedra. SODA 2022: 2128-2140 - [i66]Jean Cardinal, Raphael Steiner:
Inapproximability of shortest paths on perfect matching polytopes. CoRR abs/2210.14608 (2022) - [i65]Jean Cardinal, Micha Sharir:
Improved Algebraic Degeneracy Testing. CoRR abs/2212.03030 (2022) - [i64]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze:
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR abs/2212.03915 (2022) - 2021
- [j67]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. Algorithmica 83(1): 116-143 (2021) - [c71]Jean Cardinal, Justin Dallant, John Iacono:
Approximability of (Simultaneous) Class Cover for Boxes. CCCG 2021: 149-156 - [c70]Jean Cardinal, Justin Dallant, John Iacono:
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA 2021: 24:1-24:14 - [c69]Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Worst-Case Efficient Dynamic Geometric Independent Set. ESA 2021: 25:1-25:15 - [c68]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: 3:1-3:15 - [c67]Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
Bounds on the Diameter of Graph Associahedra. LAGOS 2021: 239-247 - [c66]Jean Cardinal, John Iacono:
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. SOSA 2021: 45-56 - [i63]Jean Cardinal, Justin Dallant, John Iacono:
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. CoRR abs/2106.05638 (2021) - [i62]Jean Cardinal, Justin Dallant, John Iacono:
Approximability of (Simultaneous) Class Cover for Boxes. CoRR abs/2106.12969 (2021) - [i61]Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono:
Dynamic Schnyder Woods. CoRR abs/2106.14451 (2021) - [i60]Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
Bounds on the Diameter of Graph Associahedra. CoRR abs/2106.16130 (2021) - [i59]Jean Cardinal, Arturo Merino, Torsten Mütze:
Combinatorial generation via permutation languages. IV. Elimination trees. CoRR abs/2106.16204 (2021) - [i58]Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Worst-Case Efficient Dynamic Geometric Independent Set. CoRR abs/2108.08050 (2021) - [i57]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 abs/2109.07587 (2021) - 2020
- [j66]Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions. Algorithmica 82(5): 1474-1489 (2020) - [j65]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: 332-343 (2020) - [c65]Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. ISAAC 2020: 32:1-32:9 - [c64]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. SODA 2020: 1878-1891 - [c63]Jean Cardinal, Aurélien Ooms:
Sparse Regression via Range Counting. SWAT 2020: 20:1-20:17 - [c62]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. WG 2020: 310-324 - [i56]Jean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. CoRR abs/2001.08062 (2020) - [i55]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. CoRR abs/2002.05580 (2020) - [i54]Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. CoRR abs/2003.11890 (2020) - [i53]Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Dynamic Geometric Independent Set. CoRR abs/2007.08643 (2020) - [i52]Jean Cardinal, John Iacono:
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. CoRR abs/2008.08417 (2020)
2010 – 2019
- 2019
- [j64]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. Algorithmica 81(4): 1319-1341 (2019) - [j63]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. 61(4): 698-734 (2019) - [j62]Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
Finding a Maximum-Weight Convex Set in a Chordal Graph. J. Graph Algorithms Appl. 23(2): 167-190 (2019) - [j61]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic encodings for point configurations. J. Comput. Geom. 10(2): 99-126 (2019) - [c61]Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne:
Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG 2019: 23-28 - [c60]Jean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. CCCG 2019: 44-48 - [c59]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. WG 2019: 120-134 - [i51]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip distances between graph orientations. CoRR abs/1902.06103 (2019) - [i50]Jean Cardinal, Gwenaël Joret, Jérémie Roland:
Information-theoretic lower bounds for quantum sorting. CoRR abs/1902.06473 (2019) - [i49]Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms:
Encoding 3SUM. CoRR abs/1903.02645 (2019) - [i48]Jean Cardinal, Aurélien Ooms:
Sparse Regression via Range Counting. CoRR abs/1908.00351 (2019) - [i47]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. CoRR abs/1908.00848 (2019) - 2018
- [j60]Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero:
On the Diameter of Tree Associahedra. Electron. J. Comb. 25(4): 4 (2018) - [j59]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68: 206-225 (2018) - [j58]Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira:
A Note on Flips in Diagonal Rectangulations. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j57]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. J. Graph Algorithms Appl. 22(2): 273-295 (2018) - [j56]Jean Cardinal, Stefan Felsner:
Topological drawings of complete bipartite graphs. J. Comput. Geom. 9(1): 213-246 (2018) - [c58]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: 365-377 - [c57]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. SoCG 2018: 20:1-20:14 - [i46]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. CoRR abs/1801.01767 (2018) - [i45]Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero:
On the Diameter of Tree Associahedra. CoRR abs/1803.11427 (2018) - [i44]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 abs/1805.04055 (2018) - [i43]Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
Finding a Maximum-Weight Convex Set in a Chordal Graph. CoRR abs/1806.09992 (2018) - 2017
- [j55]Jean Cardinal, Udo Hoffmann:
Recognition and Complexity of Point Visibility Graphs. Discret. Comput. Geom. 57(1): 164-178 (2017) - [j54]Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
On the shelling antimatroids of split graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [c56]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG 2017: 13:1-13:15 - [c55]Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. IPEC 2017: 11:1-11:12 - [c54]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. WADS 2017: 97-108 - [c53]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. WG 2017: 153-166 - [i42]Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. CoRR abs/1708.01122 (2017) - [i41]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. CoRR abs/1708.06063 (2017) - [i40]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. CoRR abs/1708.09080 (2017) - [i39]Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira:
A Note on Flips in Diagonal Rectangulations. CoRR abs/1712.07919 (2017) - 2016
- [j53]Jean Cardinal, Michael S. Payne, Noam Solomon:
Ramsey-type theorems for lines in 3-space. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j52]Keno Merckx, Jean Cardinal, Jean-Paul Doignon:
On the shelling antimatroids of split graphs. Electron. Notes Discret. Math. 55: 199-202 (2016) - [j51]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): 167-184 (2016) - [c52]Jean Cardinal, John Iacono, Aurélien Ooms:
Solving k-SUM Using Few Linear Queries. ESA 2016: 25:1-25:17 - [c51]Jean Cardinal, Stefan Felsner:
Topological Drawings of Complete Bipartite Graphs. GD 2016: 441-453 - [i38]Jean Cardinal, Stefan Felsner:
Topological Drawings of Complete Bipartite Graphs. CoRR abs/1608.08324 (2016) - [i37]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. CoRR abs/1611.02541 (2016) - [i36]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR abs/1612.02384 (2016) - [i35]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. CoRR abs/1612.03638 (2016) - 2015
- [j50]Jean Cardinal, Gwenaël Joret:
Hitting All Maximal Independent Sets of a Bipartite Graph. Algorithmica 72(2): 359-368 (2015) - [j49]Jean Cardinal, Stefan Felsner:
Covering Partial Cubes with Zones. Electron. J. Comb. 22(3): 3 (2015) - [j48]Jean Cardinal, Vincent Kusters:
The Complexity of Simultaneous Geometric Graph Embedding. J. Graph Algorithms Appl. 19(1): 259-272 (2015) - [j47]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 19(1): 529-547 (2015) - [j46]Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian:
Cannibal Animal Games: a new variant of Tic-Tac-Toe. J. Inf. Process. 23(3): 265-271 (2015) - [j45]Jean Cardinal:
Computational Geometry Column 62. SIGACT News 46(4): 69-78 (2015) - [c50]Jean Cardinal, Udo Hoffmann:
Recognition and Complexity of Point Visibility Graphs. SoCG 2015: 171-185 - [c49]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. STACS 2015: 197-210 - [i34]Jean Cardinal, Udo Hoffmann:
Recognition and Complexity of Point Visibility Graphs. CoRR abs/1503.07082 (2015) - [i33]Jean Cardinal, Michael S. Payne, Noam Solomon:
Ramsey-type theorems for lines in 3-space. CoRR abs/1512.03236 (2015) - [i32]Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
On the shelling antimatroids of split graphs. CoRR abs/1512.06073 (2015) - [i31]Jean Cardinal, Aurélien Ooms:
On the Decision Tree Complexity of $k$-SUM. CoRR abs/1512.06678 (2015) - 2014
- [j44]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke:
Draining a polygon - or - rolling a ball out of a polygon. Comput. Geom. 47(2): 316-328 (2014) - [j43]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover. Discret. Math. Theor. Comput. Sci. 16(1): 207-224 (2014) - [j42]Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. 16(3): 317-332 (2014) - [j41]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. SIAM J. Discret. Math. 28(4): 1948-1959 (2014) - [c48]Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr:
Reconstructing Point Set Order Typesfrom Radial Orderings. ISAAC 2014: 15-26 - [c47]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. SODA 2014: 1424-1432 - [i30]Jean Cardinal, Csaba D. Tóth, David R. Wood:
General Position Subsets and Independent Hyperplanes in d-Space. CoRR abs/1410.3637 (2014) - 2013
- [j40]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). Comb. 33(6): 655-697 (2013) - [j39]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:
Non-crossing matchings of points with geometric objects. Comput. Geom. 46(1): 78-92 (2013) - [j38]Jean Cardinal, Matias Korman:
Coloring planar homothets and three-dimensional hypergraphs. Comput. Geom. 46(9): 1027-1035 (2013) - [j37]Sergio Cabello, Jean Cardinal, Stefan Langerman:
The Clique Problem in Ray Intersection Graphs. Discret. Comput. Geom. 50(3): 771-783 (2013) - [j36]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian:
Coloring and Guarding Arrangements. Discret. Math. Theor. Comput. Sci. 15(3): 139-154 (2013) - [j35]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. Graphs Comb. 29(5): 1221-1234 (2013) - [j34]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann:
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. 25(1): 19-46 (2013) - [j33]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Triangles Colorful. J. Comput. Geom. 4(1): 240-246 (2013) - [c46]Jean Cardinal, Samuel Fiorini:
On Generalized Comparison-Based Sorting Problems. Space-Efficient Data Structures, Streams, and Algorithms 2013: 164-175 - [c45]Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl:
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. CCCG 2013 - [c44]Jean Cardinal, Stefan Felsner:
Covering Partial Cubes with Zones. JCDCGG 2013: 1-13 - [c43]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:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [i29]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:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - [i28]Jean Cardinal, Vincent Kusters:
The Complexity of Simultaneous Geometric Graph Embedding. CoRR abs/1302.7127 (2013) - [i27]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover. CoRR abs/1303.2478 (2013) - [i26]Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian:
Cannibal Animal Games: a new variant of Tic-Tac-Toe. CoRR abs/1306.4884 (2013) - [i25]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. CoRR abs/1307.2705 (2013) - [i24]Jean Cardinal, Stefan Felsner:
Covering Partial Cubes with Zones. CoRR abs/1312.2819 (2013) - 2012
- [j32]Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating vertex cover in dense hypergraphs. J. Discrete Algorithms 13: 67-77 (2012) - [j31]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Combinatorial Optimization Problems. Theory Comput. Syst. 51(1): 4-21 (2012) - [c42]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. CTW 2012: 56-59 - [c41]Sergio Cabello, Jean Cardinal, Stefan Langerman:
The Clique Problem in Ray Intersection Graphs. ESA 2012: 241-252 - [c40]Jean Cardinal, Matias Korman:
Coloring Planar Homothets and Three-Dimensional Hypergraphs. LATIN 2012: 121-132 - [c39]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. TJJCCGG 2012: 30-41 - [i23]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian:
Coloring and Guarding Arrangements. CoRR abs/1205.5162 (2012) - [i22]Jean Cardinal, Gwenaël Joret:
Hitting all Maximal Independent Sets of a Bipartite Graph. CoRR abs/1208.5589 (2012) - [i21]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. CoRR abs/1209.3594 (2012) - [i20]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Triangles Colorful. CoRR abs/1212.2346 (2012) - 2011
- [j30]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. Algorithmica 59(2): 129-144 (2011) - [j29]Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating Subdense Instances of Covering Problems. Electron. Notes Discret. Math. 37: 297-302 (2011) - [j28]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. Graphs Comb. 27(3): 327-339 (2011) - [j27]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno:
Algorithmic Folding Complexity. Graphs Comb. 27(3): 341-351 (2011) - [c38]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. CCCG 2011 - [i19]Jean Cardinal, Matias Korman:
Coloring Planar Homothets and Three-Dimensional Hypergraphs. CoRR abs/1101.0565 (2011) - [i18]Sergio Cabello, Jean Cardinal, Stefan Langerman:
The Clique Problem in Ray Intersection Graphs. CoRR abs/1111.5986 (2011) - 2010
- [j26]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
Highway hull revisited. Comput. Geom. 43(2): 115-130 (2010) - [j25]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Minimum sum edge colorings of multicycles. Discret. Appl. Math. 158(12): 1216-1223 (2010) - [j24]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of Multiple Coverings into More Parts. Discret. Comput. Geom. 44(3): 706-723 (2010) - [j23]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An Efficient Algorithm for Partial Order Production. SIAM J. Comput. 39(7): 2927-2940 (2010) - [j22]Jean Cardinal, Martin Hoefer:
Non-cooperative facility location and covering games. Theor. Comput. Sci. 411(16-18): 1855-1876 (2010) - [j21]Jean Cardinal, Eythan Levy:
Connected vertex covers in dense graphs. Theor. Comput. Sci. 411(26-28): 2581-2590 (2010) - [c37]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. LATIN 2010: 2-13 - [c36]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:
Matching Points with Things. LATIN 2010: 456-467 - [c35]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). STOC 2010: 359-368 - [i17]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Combinatorial Optimization Problems. CoRR abs/1008.2928 (2010) - [i16]Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating Subdense Instances of Covering Problems. CoRR abs/1011.0078 (2010) - [i15]Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating Vertex Cover in Dense Hypergraphs. CoRR abs/1012.2573 (2010)
2000 – 2009
- 2009
- [j20]Jean Cardinal, Sébastien Collette, Stefan Langerman:
Empty region graphs. Comput. Geom. 42(3): 183-195 (2009) - [j19]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky:
Coloring Geometric Range Spaces. Discret. Comput. Geom. 41(2): 348-362 (2009) - [j18]Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop:
Pricing Geometric Transportation Networks. Int. J. Comput. Geom. Appl. 19(6): 507-520 (2009) - [j17]Jean Cardinal, Stefan Langerman, Eythan Levy:
Improved approximation bounds for edge dominating set in dense graphs. Theor. Comput. Sci. 410(8-10): 949-957 (2009) - [c34]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh:
Relaxed Gabriel Graphs. CCCG 2009: 169-172 - [c33]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Combinatorial Optimization Problems. CiE 2009: 79-88 - [c32]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara:
Algorithmic Folding Complexity. ISAAC 2009: 452-461 - [c31]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of multiple coverings into more parts. SODA 2009: 302-310 - [c30]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An efficient algorithm for partial order production. STOC 2009: 93-100 - [c29]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. WINE 2009: 125-136 - [i14]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. CoRR abs/0904.2115 (2009) - [i13]Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman:
Detecting all regular polygons in a point set. CoRR abs/0908.2442 (2009) - [i12]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. CoRR abs/0909.3221 (2009) - [i11]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under Partial Information (without the Ellipsoid Algorithm). CoRR abs/0911.0086 (2009) - 2008
- [j16]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Tight Results on Minimum Entropy Set Cover. Algorithmica 51(1): 49-60 (2008) - [j15]Jean Cardinal, Sébastien Collette, Stefan Langerman:
Local properties of geometric graphs. Comput. Geom. 39(1): 55-64 (2008) - [j14]Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop:
Optimal location of transportation devices. Comput. Geom. 41(3): 219-229 (2008) - [j13]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs. Electron. Notes Discret. Math. 30: 39-44 (2008) - [j12]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum entropy coloring. J. Comb. Optim. 16(4): 361-377 (2008) - [j11]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum entropy orientations. Oper. Res. Lett. 36(6): 680-683 (2008) - [c28]Jean Cardinal, Eythan Levy:
Connected Vertex Covers in Dense Graphs. APPROX-RANDOM 2008: 35-48 - [c27]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke:
Draining a Polygon - or - Rolling a Ball out of a Polygon. CCCG 2008 - [c26]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky:
Coloring Geometric Range Spaces. LATIN 2008: 146-157 - [i10]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Orientations. CoRR abs/0802.1237 (2008) - [i9]Jean Cardinal, Christophe Dumeunier:
Set Covering Problems with General Objective Functions. CoRR abs/0802.2184 (2008) - [i8]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop:
Highway Hull Revisited. CoRR abs/0806.1416 (2008) - [i7]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of Multiple Coverings into More Parts. CoRR abs/0807.0552 (2008) - [i6]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An Efficient Algorithm for Partial Order Production. CoRR abs/0811.2572 (2008) - 2007
- [j10]Martin Röder, Jean Cardinal, Raouf Hamzaoui:
Efficient Rate-Distortion Optimized Media Streaming for Tree-Structured Packet Dependencies. IEEE Trans. Multim. 9(6): 1259-1272 (2007) - [c25]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. WADS 2007: 64-76 - [i5]Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop:
Moving Walkways, Escalators, and Elevators. CoRR abs/0705.0635 (2007) - [i4]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs. CoRR abs/0706.3848 (2007) - [i3]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. CoRR abs/cs/0703019 (2007) - 2006
- [j9]Jean Cardinal, Steve Kremer, Stefan Langerman:
Juggling with Pattern Matching. Theory Comput. Syst. 39(3): 425-437 (2006) - [j8]Martin Röder, Jean Cardinal, Raouf Hamzaoui:
Branch and bound algorithms for rate-distortion optimized media streaming. IEEE Trans. Multim. 8(1): 170-178 (2006) - [c24]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Tight Results on Minimum Entropy Set Cover. APPROX-RANDOM 2006: 61-69 - [c23]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman:
LUMINESStrategies. Computers and Games 2006: 190-199 - [c22]Martin Röder, Jean Cardinal, Raouf Hamzaoui:
Constructing Dependency Trees for Rate-Distortion Optimized Media Streaming. ICASSP (5) 2006: 373-376 - [c21]Jean Cardinal, Stefan Langerman, Eythan Levy:
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. WAOA 2006: 108-120 - [c20]Jean Cardinal, Martin Hoefer:
Selfish Service Installation in Networks. WINE 2006: 174-185 - 2005
- [j7]Jean Cardinal, Stefan Langerman:
Designing small keyboards is hard. Theor. Comput. Sci. 332(1-3): 405-415 (2005) - [c19]Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop:
Pricing of Geometric Transportation Networks. CCCG 2005: 92-96 - [c18]Jean Cardinal, Sébastien Collette, Stefan Langerman:
Region Counting Distances and Region Counting Circles. CCCG 2005: 278-281 - [c17]Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot:
A Tight Analysis of the Maximal Matching Heuristic. COCOON 2005: 701-709 - [c16]Martin Röder, Jean Cardinal, Raouf Hamzaoui:
Dynamic programming algorithm for rate-distortion optimized media streaming. ICIP (2) 2005: 169-172 - [c15]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Coloring. ISAAC 2005: 819-828 - [i2]Jean Cardinal, Sébastien Collette, Stefan Langerman:
Region counting graphs. EuroCG 2005: 21-24 - 2004
- [j6]Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf:
Reconciliation of a quantum-distributed Gaussian key. IEEE Trans. Inf. Theory 50(2): 394-400 (2004) - [j5]Jean Cardinal:
Entropy-constrained index assignments for multiple description quantizers. IEEE Trans. Signal Process. 52(1): 265-270 (2004) - [c14]Jean Cardinal, David Eppstein:
Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. ALENEX/ANALC 2004: 112-119 - [c13]Jean Cardinal, Sébastien Collette, Stefan Langerman:
Local properties of geometric graphs. CCCG 2004: 145-148 - [c12]Martin Röder, Jean Cardinal, Raouf Hamzaoui:
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media. Data Compression Conference 2004: 192-201 - [c11]Jean Cardinal, Samuel Fiorini, Gilles Van Assche:
On minimum entropy graph colorings. ISIT 2004: 43 - [c10]Jean Cardinal, Stefan Langerman:
Designing Small Keyboards Is Hard. LATIN 2004: 391-400 - 2003
- [j4]Jean Cardinal:
Tree-Structured Multiple Description Coding. J. VLSI Signal Process. 33(3): 287-294 (2003) - [c9]Jean Cardinal:
Multistage index assignments for M-description coding. ICIP (3) 2003: 249-252 - [c8]Jean Cardinal:
Compression of side information. ICME 2003: 569-572 - [c7]Jean Cardinal, Gilles Van Assche:
Construction of a shared secret key using continuous variables. ITW 2003: 135-138 - 2002
- [j3]Jean Cardinal:
Complexity-constrained tree-structured vector quantizers. Signal Process. 82(8): 1176-1182 (2002) - [c6]Jean Cardinal, Sourour Elloumi, Martine Labbé:
Local optimization of index assignments for multiple description coding. EUSIPCO 2002: 1-4 - 2001
- [j2]Jean Cardinal:
Fast fractal compression of greyscale images. IEEE Trans. Image Process. 10(1): 159-164 (2001) - [c5]Jean Cardinal:
Design of Tree-Structured Multiple Description Vector Quantizers. Data Compression Conference 2001: 23-32 - [c4]Jean Cardinal:
Design of asymmetric tree-structured multiple description source codes. MMSP 2001: 117-122 - [i1]Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf:
Reconciliation of a Quantum-Distributed Gaussian Key. CoRR cs.CR/0107030 (2001) - 2000
- [j1]Jean Cardinal:
A Lagrangian optimization approach to complexity-constrained TSVQ. IEEE Signal Process. Lett. 7(11): 304-306 (2000) - [c3]Jean Cardinal:
Tree-Based Search for ECVQ. Data Compression Conference 2000: 548 - [c2]Jean Cardinal:
Multipath tree-structured vector quantizers. EUSIPCO 2000: 1-4
1990 – 1999
- 1999
- [c1]Jean Cardinal:
Fast Search for Entropy-Constrained VQ. ICIAP 1999: 1038-1042
Coauthor Index
[j71] [c64] [j64] [j63] [j61] [i49] [i47] [j60] [c57] [i46] [i45] [c56] [c54] [i41] [i40] [j51] [i36] [j46] [j44] [c48] [j39] [j37] [j36] [j35] [c43] [i29] [i26] [c41] [i23] [j30] [j28] [j27] [c38] [i18] [j26] [j24] [c37] [c36] [j20] [j19] [j18] [j17] [c32] [c31] [i14] [i13] [j15] [j14] [c27] [c26] [i8] [i7] [c25] [i5] [i3] [j9] [c23] [c21] [j7] [c19] [c18] [c17] [i2] [c13] [c10]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
