Jean Cardinal
Jean Cardinal
Dirección de correo verificada de ulb.ac.be - Página principal
TítuloCitado porAño
Reconciliation of a quantum-distributed Gaussian key
G Van Assche, J Cardinal, NJ Cerf
IEEE Transactions on Information Theory 50 (2), 394-400, 2004
1792004
Fast fractal compression of greyscale images
J Cardinal
IEEE transactions on image processing 10 (1), 159-164, 2001
662001
Non-cooperative facility location and covering games
J Cardinal, M Hoefer
Theoretical Computer Science 411 (16-18), 1855-1876, 2010
512010
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59 (2), 129-144, 2011
442011
Empty region graphs
J Cardinal, S Collette, S Langerman
Computational Geometry 42 (3), 183-195, 2009
40*2009
Connected vertex covers in dense graphs
J Cardinal, E Levy
Theoretical computer science 411 (26-28), 2581-2590, 2010
342010
Decomposition of multiple coverings into more parts
G Aloupis, J Cardinal, S Collette, S Langerman, D Orden, P Ramos
Discrete & Computational Geometry 44 (3), 706-723, 2010
332010
Joint entropy-constrained multiterminal quantization
J Cardinal, G Van Assche
Proceedings IEEE International Symposium on Information Theory,, 63, 2002
322002
The clique problem in ray intersection graphs
S Cabello, J Cardinal, S Langerman
Discrete & computational geometry 50 (3), 771-783, 2013
312013
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
30*2013
Coloring geometric range spaces
G Aloupis, J Cardinal, S Collette, S Langerman, S Smorodinsky
Discrete & Computational Geometry 41 (2), 348-362, 2009
292009
Tight results on minimum entropy set cover
J Cardinal, S Fiorini, G Joret
Algorithmica 51 (1), 49-60, 2008
292008
Min-max-min geometric facility location problems
J Cardinal, S Langerman
Proc. European Workshop on Computational Geometry (EWCG’06), 149-152, 2006
282006
On the complexity of rate-distortion optimal streaming of packetized media
M Roder, J Cardinal, R Hamzaoui
Data Compression Conference, 2004. Proceedings. DCC 2004, 192-201, 2004
282004
Minimum entropy coloring
J Cardinal, S Fiorini, G Joret
Journal of combinatorial optimization 16 (4), 361-377, 2008
272008
Recognition and complexity of point visibility graphs
J Cardinal, U Hoffmann
Discrete & Computational Geometry 57 (1), 164-178, 2017
262017
Improved approximation bounds for edge dominating set in dense graphs
J Cardinal, S Langerman, E Levy
Theoretical Computer Science 410 (8-10), 949-957, 2009
262009
A tight analysis of the maximal matching heuristic
J Cardinal, M Labbé, S Langerman, E Levy, H Mélot
International Computing and Combinatorics Conference, 701-709, 2005
242005
The Price of Connectivity for Vertex Cover
O Schaudt, S Fiorini, J Cardinal, E Camby
Discrete Mathematics & Theoretical Computer Science 16, 2014
23*2014
Pricing geometric transportation networks
J Cardinal, M Labbet, S Langerman, B Palop
International Journal of Computational Geometry & Applications 19 (6), 507-520, 2009
23*2009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20