The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean Cardinal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Jean Cardinal, Sébastien Collette, Stefan Langerman
    Local properties of geometric graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:145-148 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Jean Cardinal
    Tree-Based Search for ECVQ. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2000, pp:548- [Conf]
  8. Jean Cardinal
    Design of Tree-Structured Multiple Description Vector Quantizers. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:23-32 [Conf]
  9. 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]
  10. Jean Cardinal
    Fast Search for Entropy-Constrained VQ. [Citation Graph (0, 0)][DBLP]
    ICIAP, 1999, pp:1038-1042 [Conf]
  11. Jean Cardinal
    Multistage index assignments for M-description coding. [Citation Graph (0, 0)][DBLP]
    ICIP (3), 2003, pp:249-252 [Conf]
  12. 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]
  13. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
    Minimum Entropy Coloring. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:819-828 [Conf]
  14. Jean Cardinal, Stefan Langerman
    Designing Small Keyboards Is Hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:391-400 [Conf]
  15. 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]
  16. Jean Cardinal, Martin Hoefer
    Selfish Service Installation in Networks. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:174-185 [Conf]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. Jean Cardinal
    Complexity-constrained tree-structured vector quantizers. [Citation Graph (0, 0)][DBLP]
    Signal Processing, 2002, v:82, n:8, pp:1176-1182 [Journal]
  24. Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman
    LUMINESStrategies. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2006, pp:190-199 [Conf]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]

  30. Connected Vertex Covers in Dense Graphs. [Citation Graph (, )][DBLP]


  31. Draining a Polygon - or - Rolling a Ball out of a Polygon. [Citation Graph (, )][DBLP]


  32. Relaxed Gabriel Graphs. [Citation Graph (, )][DBLP]


  33. Minimum Entropy Combinatorial Optimization Problems. [Citation Graph (, )][DBLP]


  34. Region counting graphs. [Citation Graph (, )][DBLP]


  35. Colorful Strips. [Citation Graph (, )][DBLP]


  36. Matching Points with Things. [Citation Graph (, )][DBLP]


  37. Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]


  38. Decomposition of multiple coverings into more parts. [Citation Graph (, )][DBLP]


  39. An efficient algorithm for partial order production. [Citation Graph (, )][DBLP]


  40. Sorting under partial information (without the ellipsoid algorithm). [Citation Graph (, )][DBLP]


  41. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. [Citation Graph (, )][DBLP]


  42. Tight Results on Minimum Entropy Set Cover. [Citation Graph (, )][DBLP]


  43. Optimal location of transportation devices. [Citation Graph (, )][DBLP]


  44. Empty region graphs. [Citation Graph (, )][DBLP]


  45. Highway hull revisited. [Citation Graph (, )][DBLP]


  46. Minimum Entropy Orientations [Citation Graph (, )][DBLP]


  47. Set Covering Problems with General Objective Functions [Citation Graph (, )][DBLP]


  48. Highway Hull Revisited [Citation Graph (, )][DBLP]


  49. Decomposition of Multiple Coverings into More Parts [Citation Graph (, )][DBLP]


  50. An Efficient Algorithm for Partial Order Production [Citation Graph (, )][DBLP]


  51. Colorful Strips [Citation Graph (, )][DBLP]


  52. Detecting all regular polygons in a point set [Citation Graph (, )][DBLP]


  53. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs [Citation Graph (, )][DBLP]


  54. Sorting under Partial Information (without the Ellipsoid Algorithm) [Citation Graph (, )][DBLP]


  55. Minimum Entropy Combinatorial Optimization Problems [Citation Graph (, )][DBLP]


  56. Minimum sum edge colorings of multicycles. [Citation Graph (, )][DBLP]


  57. Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]


  58. Decomposition of Multiple Coverings into More Parts. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002