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) (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]