| Reconciliation of a quantum-distributed Gaussian key G Van Assche, J Cardinal, NJ Cerf IEEE Transactions on Information Theory 50 (2), 394-400, 2004 | 260 | 2004 |
| Fast fractal compression of greyscale images J Cardinal IEEE transactions on image processing 10 (1), 159-164, 2001 | 73 | 2001 |
| Non-cooperative facility location and covering games J Cardinal, M Hoefer Theoretical Computer Science 411 (16-18), 1855-1876, 2010 | 64 | 2010 |
| 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 | 60 | 2017 |
| Recognition and complexity of point visibility graphs J Cardinal, U Hoffmann Discrete & Computational Geometry 57, 164-178, 2017 | 60 | 2017 |
| The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59 (2), 129-144, 2011 | 60 | 2011 |
| 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 | 51 | 2019 |
| The clique problem in ray intersection graphs S Cabello, J Cardinal, S Langerman Discrete & computational geometry 50, 771-783, 2013 | 51 | 2013 |
| Computational geometry column 62 J Cardinal ACM SIGACT News 46 (4), 69-78, 2015 | 44 | 2015 |
| Connected vertex covers in dense graphs J Cardinal, E Levy Theoretical Computer Science 411 (26-28), 2581-2590, 2010 | 42 | 2010 |
| 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 |
| Min-max-min geometric facility location problems J Cardinal, S Langerman Proc. European Workshop on Computational Geometry (EWCG’06), 149-152, 2006 | 40 | 2006 |
| 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 | 37 | 2010 |
| Tight results on minimum entropy set cover J Cardinal, S Fiorini, G Joret Algorithmica 51 (1), 49-60, 2008 | 37 | 2008 |
| Joint entropy-constrained multiterminal quantization J Cardinal, G Van Assche Proceedings IEEE International Symposium on Information Theory,, 63, 2002 | 36 | 2002 |
| Arc diagrams, flip distances, and Hamiltonian triangulations J Cardinal, M Hoffmann, V Kusters, CD Tóth, M Wettstein Computational Geometry 68, 206-225, 2018 | 35 | 2018 |
| 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 | 35 | 2010 |
| Minimum entropy coloring J Cardinal, S Fiorini, G Joret Journal of combinatorial optimization 16 (4), 361-377, 2008 | 32 | 2008 |
| Coloring geometric range spaces G Aloupis, J Cardinal, S Collette, S Langerman, S Smorodinsky Discrete & Computational Geometry 41 (2), 348-362, 2009 | 30 | 2009 |
Stefan LangermanDépartement d'Informatique, Université Libre de Bruxelles在 ulb.ac.be 的电子邮件经过验证
