|
Search the dblp DataBase
Jean Cardinal:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jean Cardinal, David Eppstein
Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. [Citation Graph (0, 0)][DBLP] ALENEX/ANALC, 2004, pp:112-119 [Conf]
- Jean Cardinal, Samuel Fiorini, Gwenaël Joret
Tight Results on Minimum Entropy Set Cover. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:61-69 [Conf]
- Jean Cardinal, Sébastien Collette, Stefan Langerman
Local properties of geometric graphs. [Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:145-148 [Conf]
- Jean Cardinal, Sébastien Collette, Stefan Langerman
Region Counting Distances and Region Counting Circles. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:278-281 [Conf]
- Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop
Pricing of Geometric Transportation Networks. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:92-96 [Conf]
- Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
A Tight Analysis of the Maximal Matching Heuristic. [Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:701-709 [Conf]
- Jean Cardinal
Tree-Based Search for ECVQ. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 2000, pp:548- [Conf]
- Jean Cardinal
Design of Tree-Structured Multiple Description Vector Quantizers. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 2001, pp:23-32 [Conf]
- Martin Röder, Jean Cardinal, Raouf Hamzaoui
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 2004, pp:192-201 [Conf]
- Jean Cardinal
Fast Search for Entropy-Constrained VQ. [Citation Graph (0, 0)][DBLP] ICIAP, 1999, pp:1038-1042 [Conf]
- Jean Cardinal
Multistage index assignments for M-description coding. [Citation Graph (0, 0)][DBLP] ICIP (3), 2003, pp:249-252 [Conf]
- Martin Röder, Jean Cardinal, Raouf Hamzaoui
Dynamic programming algorithm for rate-distortion optimized media streaming. [Citation Graph (0, 0)][DBLP] ICIP (2), 2005, pp:169-172 [Conf]
- Jean Cardinal, Samuel Fiorini, Gwenaël Joret
Minimum Entropy Coloring. [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:819-828 [Conf]
- Jean Cardinal, Stefan Langerman
Designing Small Keyboards Is Hard. [Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:391-400 [Conf]
- Jean Cardinal, Stefan Langerman, Eythan Levy
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. [Citation Graph (0, 0)][DBLP] WAOA, 2006, pp:108-120 [Conf]
- Jean Cardinal, Martin Hoefer
Selfish Service Installation in Networks. [Citation Graph (0, 0)][DBLP] WINE, 2006, pp:174-185 [Conf]
- Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf
Reconciliation of a Quantum-Distributed Gaussian Key [Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal]
- Jean Cardinal, Steve Kremer, Stefan Langerman
Juggling with Pattern Matching. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:3, pp:425-437 [Journal]
- Jean Cardinal, Stefan Langerman
Designing small keyboards is hard. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:332, n:1-3, pp:405-415 [Journal]
- Jean Cardinal
Fast fractal compression of greyscale images. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Image Processing, 2001, v:10, n:1, pp:159-164 [Journal]
- Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf
Reconciliation of a quantum-distributed Gaussian key. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:394-400 [Journal]
- Martin Röder, Jean Cardinal, Raouf Hamzaoui
Branch and bound algorithms for rate-distortion optimized media streaming. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Multimedia, 2006, v:8, n:1, pp:170-178 [Journal]
- Jean Cardinal
Complexity-constrained tree-structured vector quantizers. [Citation Graph (0, 0)][DBLP] Signal Processing, 2002, v:82, n:8, pp:1176-1182 [Journal]
- Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman
LUMINESStrategies. [Citation Graph (0, 0)][DBLP] Computers and Games, 2006, pp:190-199 [Conf]
- Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
The Stackelberg Minimum Spanning Tree Game. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:64-76 [Conf]
- Jean Cardinal, Sébastien Collette, Stefan Langerman
Local properties of geometric graphs. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2008, v:39, n:1, pp:55-64 [Journal]
- Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
The Stackelberg Minimum Spanning Tree Game [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop
Moving Walkways, Escalators, and Elevators [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
Chromatic Edge Strength of Some Multigraphs [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
Connected Vertex Covers in Dense Graphs. [Citation Graph (, )][DBLP]
Draining a Polygon - or - Rolling a Ball out of a Polygon. [Citation Graph (, )][DBLP]
Relaxed Gabriel Graphs. [Citation Graph (, )][DBLP]
Minimum Entropy Combinatorial Optimization Problems. [Citation Graph (, )][DBLP]
Region counting graphs. [Citation Graph (, )][DBLP]
Colorful Strips. [Citation Graph (, )][DBLP]
Matching Points with Things. [Citation Graph (, )][DBLP]
Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]
Decomposition of multiple coverings into more parts. [Citation Graph (, )][DBLP]
An efficient algorithm for partial order production. [Citation Graph (, )][DBLP]
Sorting under partial information (without the ellipsoid algorithm). [Citation Graph (, )][DBLP]
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. [Citation Graph (, )][DBLP]
Tight Results on Minimum Entropy Set Cover. [Citation Graph (, )][DBLP]
Optimal location of transportation devices. [Citation Graph (, )][DBLP]
Empty region graphs. [Citation Graph (, )][DBLP]
Highway hull revisited. [Citation Graph (, )][DBLP]
Minimum Entropy Orientations [Citation Graph (, )][DBLP]
Set Covering Problems with General Objective Functions [Citation Graph (, )][DBLP]
Highway Hull Revisited [Citation Graph (, )][DBLP]
Decomposition of Multiple Coverings into More Parts [Citation Graph (, )][DBLP]
An Efficient Algorithm for Partial Order Production [Citation Graph (, )][DBLP]
Colorful Strips [Citation Graph (, )][DBLP]
Detecting all regular polygons in a point set [Citation Graph (, )][DBLP]
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs [Citation Graph (, )][DBLP]
Sorting under Partial Information (without the Ellipsoid Algorithm) [Citation Graph (, )][DBLP]
Minimum Entropy Combinatorial Optimization Problems [Citation Graph (, )][DBLP]
Minimum sum edge colorings of multicycles. [Citation Graph (, )][DBLP]
Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]
Decomposition of Multiple Coverings into More Parts. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.459secs
|