| 2009 | ||
|---|---|---|
| 54 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum Entropy Combinatorial Optimization Problems. CiE 2009: 79-88 | |
| 53 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos: Decomposition of multiple coverings into more parts. SODA 2009: 302-310 | |
| 52 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro: An efficient algorithm for partial order production. STOC 2009: 93-100 | |
| 51 | Greg Aloupis, Jean Cardinal, Sébastien Collette, S. Imahori, M. Korman, Stefan Langerman, O. Schwartz, Shakhar Smorodinsky, Perouz Taslakian: Colorful Strips CoRR abs/0904.2115: (2009) | |
| 50 | Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman: Detecting all regular polygons in a point set CoRR abs/0908.2442: (2009) | |
| 49 | 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) | |
| 48 | Jean Cardinal, Sébastien Collette, Stefan Langerman: Empty region graphs. Comput. Geom. 42(3): 183-195 (2009) | |
| 47 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky: Coloring Geometric Range Spaces. Discrete & Computational Geometry 41(2): 348-362 (2009) | |
| 46 | 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) | |
| 2008 | ||
| 45 | Jean Cardinal, Eythan Levy: Connected Vertex Covers in Dense Graphs. APPROX-RANDOM 2008: 35-48 | |
| 44 | 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 | |
| 43 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky: Coloring Geometric Range Spaces. LATIN 2008: 146-157 | |
| 42 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Tight Results on Minimum Entropy Set Cover. Algorithmica 51(1): 49-60 (2008) | |
| 41 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum Entropy Orientations CoRR abs/0802.1237: (2008) | |
| 40 | Jean Cardinal, Christophe Dumeunier: Set Covering Problems with General Objective Functions CoRR abs/0802.2184: (2008) | |
| 39 | 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) | |
| 38 | 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) | |
| 37 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro: An Efficient Algorithm for Partial Order Production CoRR abs/0811.2572: (2008) | |
| 36 | Jean Cardinal, Sébastien Collette, Stefan Langerman: Local properties of geometric graphs. Comput. Geom. 39(1): 55-64 (2008) | |
| 35 | Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop: Optimal location of transportation devices. Comput. Geom. 41(3): 219-229 (2008) | |
| 34 | Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon: Chromatic Edge Strength of Some Multigraphs. Electronic Notes in Discrete Mathematics 30: 39-44 (2008) | |
| 33 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum entropy coloring. J. Comb. Optim. 16(4): 361-377 (2008) | |
| 32 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum entropy orientations. Oper. Res. Lett. 36(6): 680-683 (2008) | |
| 2007 | ||
| 31 | 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 | |
| 30 | Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop: Moving Walkways, Escalators, and Elevators CoRR abs/0705.0635: (2007) | |
| 29 | Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon: Chromatic Edge Strength of Some Multigraphs CoRR abs/0706.3848: (2007) | |
| 28 | 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) | |
| 27 | Martin Schröder, Jean Cardinal, Raouf Hamzaoui: Efficient Rate-Distortion Optimized Media Streaming for Tree-Structured Packet Dependencies. IEEE Transactions on Multimedia 9(6): 1259-1272 (2007) | |
| 2006 | ||
| 26 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Tight Results on Minimum Entropy Set Cover. APPROX-RANDOM 2006: 61-69 | |
| 25 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman: LUMINESStrategies. Computers and Games 2006: 190-199 | |
| 24 | Jean Cardinal, Stefan Langerman, Eythan Levy: Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. WAOA 2006: 108-120 | |
| 23 | Jean Cardinal, Martin Hoefer: Selfish Service Installation in Networks. WINE 2006: 174-185 | |
| 22 | Martin Röder, Jean Cardinal, Raouf Hamzaoui: Branch and bound algorithms for rate-distortion optimized media streaming. IEEE Transactions on Multimedia 8(1): 170-178 (2006) | |
| 21 | Jean Cardinal, Steve Kremer, Stefan Langerman: Juggling with Pattern Matching. Theory Comput. Syst. 39(3): 425-437 (2006) | |
| 2005 | ||
| 20 | Jean Cardinal, Sébastien Collette, Stefan Langerman: Region Counting Distances and Region Counting Circles. CCCG 2005: 278-281 | |
| 19 | Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop: Pricing of Geometric Transportation Networks. CCCG 2005: 92-96 | |
| 18 | Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot: A Tight Analysis of the Maximal Matching Heuristic. COCOON 2005: 701-709 | |
| 17 | Jean Cardinal, Sébastien Collette, Stefan Langerman: Region counting graphs. EWCG 2005: 21-24 | |
| 16 | Martin Röder, Jean Cardinal, Raouf Hamzaoui: Dynamic programming algorithm for rate-distortion optimized media streaming. ICIP (2) 2005: 169-172 | |
| 15 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret: Minimum Entropy Coloring. ISAAC 2005: 819-828 | |
| 14 | Jean Cardinal, Stefan Langerman: Designing small keyboards is hard. Theor. Comput. Sci. 332(1-3): 405-415 (2005) | |
| 2004 | ||
| 13 | Jean Cardinal, David Eppstein: Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. ALENEX/ANALC 2004: 112-119 | |
| 12 | Jean Cardinal, Sébastien Collette, Stefan Langerman: Local properties of geometric graphs. CCCG 2004: 145-148 | |
| 11 | Martin Röder, Jean Cardinal, Raouf Hamzaoui: On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media. Data Compression Conference 2004: 192-201 | |
| 10 | Jean Cardinal, Stefan Langerman: Designing Small Keyboards Is Hard. LATIN 2004: 391-400 | |
| 9 | Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf: Reconciliation of a quantum-distributed Gaussian key. IEEE Transactions on Information Theory 50(2): 394-400 (2004) | |
| 2003 | ||
| 8 | Jean Cardinal: Multistage index assignments for M-description coding. ICIP (3) 2003: 249-252 | |
| 7 | Jean Cardinal: Tree-Structured Multiple Description Coding. VLSI Signal Processing 33(3): 287-294 (2003) | |
| 2002 | ||
| 6 | Jean Cardinal: Complexity-constrained tree-structured vector quantizers. Signal Processing 82(8): 1176-1182 (2002) | |
| 2001 | ||
| 5 | Jean Cardinal: Design of Tree-Structured Multiple Description Vector Quantizers. Data Compression Conference 2001: 23-32 | |
| 4 | Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf: Reconciliation of a Quantum-Distributed Gaussian Key CoRR cs.CR/0107030: (2001) | |
| 3 | Jean Cardinal: Fast fractal compression of greyscale images. IEEE Transactions on Image Processing 10(1): 159-164 (2001) | |
| 2000 | ||
| 2 | Jean Cardinal: Tree-Based Search for ECVQ. Data Compression Conference 2000: 548 | |
| 1999 | ||
| 1 | Jean Cardinal: Fast Search for Entropy-Constrained VQ. ICIAP 1999: 1038-1042 | |