Obserwuj
Jean Cardinal
Jean Cardinal
Université libre de Bruxelles (ULB)
Zweryfikowany adres z ulb.be - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Reconciliation of a quantum-distributed Gaussian key
G Van Assche, J Cardinal, NJ Cerf
IEEE Transactions on Information Theory 50 (2), 394-400, 2004
2722004
Fast fractal compression of greyscale images
J Cardinal
IEEE transactions on image processing 10 (1), 159-164, 2001
752001
Intersection graphs of rays and grounded segments
J Cardinal, S Felsner, T Miltzow, C Tompkins, B Vogtenhuber
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
642017
Non-cooperative facility location and covering games
J Cardinal, M Hoefer
Theoretical Computer Science 411 (16-18), 1855-1876, 2010
642010
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59 (2), 129-144, 2011
632011
Recognition and complexity of point visibility graphs
J Cardinal, U Hoffmann
Discrete & Computational Geometry 57, 164-178, 2017
612017
Empty region graphs
J Cardinal, S Collette, S Langerman
Computational Geometry 42 (3), 183-195, 2009
55*2009
Dynamic graph coloring
L Barba, J Cardinal, M Korman, S Langerman, A Van Renssen, ...
Algorithmica 81, 1319-1341, 2019
512019
The clique problem in ray intersection graphs
S Cabello, J Cardinal, S Langerman
Discrete & computational geometry 50, 771-783, 2013
512013
Computational geometry column 62
J Cardinal
ACM SIGACT News 46 (4), 69-78, 2015
442015
Connected vertex covers in dense graphs
J Cardinal, E Levy
Theoretical Computer Science 411 (26-28), 2581-2590, 2010
432010
Non-crossing matchings of points with geometric objects
G Aloupis, J Cardinal, S Collette, ED Demaine, ML Demaine, M Dulieu, ...
Computational geometry 46 (1), 78-92, 2013
41*2013
Decomposition of multiple coverings into more parts
G Aloupis, J Cardinal, S Collette, S Langerman, D Orden, P Ramos
Discrete & Computational Geometry 44, 706-723, 2010
412010
Min-max-min geometric facility location problems
J Cardinal, S Langerman
Proc. European Workshop on Computational Geometry (EWCG’06), 149-152, 2006
402006
Tight results on minimum entropy set cover
J Cardinal, S Fiorini, G Joret
Algorithmica 51 (1), 49-60, 2008
382008
Sorting under partial information (without the ellipsoid algorithm)
J Cardinal, S Fiorini, G Joret, RM Jungers, JI Munro
Proceedings of the forty-second ACM symposium on Theory of computing, 359-368, 2010
372010
Arc diagrams, flip distances, and Hamiltonian triangulations
J Cardinal, M Hoffmann, V Kusters, CD Tóth, M Wettstein
Computational Geometry 68, 206-225, 2018
362018
Joint entropy-constrained multiterminal quantization
J Cardinal, G Van Assche
Proceedings IEEE International Symposium on Information Theory,, 63, 2002
352002
Coloring geometric range spaces
G Aloupis, J Cardinal, S Collette, S Langerman, S Smorodinsky
Discrete & Computational Geometry 41 (2), 348-362, 2009
332009
Minimum entropy coloring
J Cardinal, S Fiorini, G Joret
Journal of combinatorial optimization 16 (4), 361-377, 2008
322008
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20