Jean Cardinal's Publications

Articles in journal, book chapters

  1. J. Cardinal and U. Hoffmann. Recognition and Complexity of Point Visibility Graphs.
    Discrete & Computational Geometry, 57(1):164-178, 2017. [abstract]
  2. J. Cardinal, C. D. Tóth, and D. R. Wood. General position subsets and independent hyperplanes in d-space.
    Journal of Geometry, 108(1):33-43, 2017. [abstract]
  3. K. Merckx, J. Cardinal, and J.-P. Doignon. On the shelling antimatroids of split graphs.
    Electronic Notes in Discrete Mathematics, 55:199-202, 2016. [abstract]
  4. J. Cardinal. Computational Geometry Column 62.
    SIGACT News, 46(4):69-78, 2015. [abstract]
  5. J. Cardinal and S. Felsner. Covering Partial Cubes with Zones.
    Electronic Journal of Combinatorics, 22(3):P3.31, 2015. [abstract]
  6. J. Cardinal, M. Hoffmann, and V. Kusters. On Universal Point Sets for Planar Graphs.
    Journal of Graph Algorithms and Applications, 19(1):529-547, 2015. [abstract]
  7. J. Cardinal and G. Joret. Hitting All Maximal Independent Sets of a Bipartite Graph.
    Algorithmica, 72(2):359-368, 2015. [abstract]
  8. J. Cardinal and V. Kusters. The Complexity of Simultaneous Geometric Graph Embedding.
    Journal of Graph Algorithms and Applications, 19(1):259-272, 2015. [abstract]
  9. O. Aichholzer, J. Cardinal, T. Hackl, F. Hurtado, M. Korman, A. Pilz, R. I. Silveira, R. Uehara, P. Valtr, B. Vogtenhuber, and E. Welzl. Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
    Discrete Mathematics & Theoretical Computer Science, 16(3):317-332, 2014. [abstract]
  10. G. Aloupis, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, and J. O'Rourke. Draining a polygon - or - rolling a ball out of a polygon.
    Computational Geometry: Theory and Applications, 47(2):316-328, 2014. [abstract]
  11. E. Camby, J. Cardinal, S. Fiorini, and O. Schaudt. The Price of Connectivity for Vertex Cover.
    Discrete Mathematics & Theoretical Computer Science, 16(1):207-224, 2014. [abstract]
  12. J. Cardinal, K. B. Knauer, P. Micek, and T. Ueckerdt. Making Octants Colorful and Related Covering Decomposition Problems.
    SIAM Journal on Discrete Mathematics, 28(4):1948-1959, 2014. [abstract]
  13. G. Aloupis, J. Cardinal, S. Collette, E. D. Demaine, M. L. Demaine, M. Dulieu, V. Hart, F. Hurtado, S. Langerman, M. Saumell, C. Seara, and P. Taslakian. Non-crossing Matchings of Points with Geometric Objects.
    Computational Geometry: Theory and Applications, 46(1):78-92, 2013. [abstract]
  14. P. Bose, J. Cardinal, S. Collette, F. Hurtado, M. Korman, S. Langerman, and P.Taslakian. Coloring and Guarding Arrangements.
    Discrete Mathematics & Theoretical Computer Science, 15(3):139-154, 2013. [abstract]
  15. S. Cabello, J. Cardinal, and S. Langerman. The Clique Problem in Ray Intersection Graphs.
    Discrete & Computational Geometry, 50(3):771-783, 2013. [abstract]
  16. J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, I. Newman, and O. Weimann. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs.
    Journal of Combinatorial Optimization, 25(1):19-46, 2013. [abstract]
  17. J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro. Sorting under Partial Information (without the Ellipsoid Algorithm).
    Combinatorica, 33(6):655-697, 2013. [abstract]
  18. J. Cardinal, H. Ito, M. Korman, and S. Langerman. Helly Numbers of Polyominoes.
    Graphs and Combinatorics, 29(5):1221-1234, 2013. [abstract]
  19. J. Cardinal, K. Knauer, P. Micek, and T. Ueckerdt. Making Triangles Colorful.
    Journal of Computational Geometry, 4(1):240-246, 2013. [abstract]
  20. J. Cardinal and M. Korman. Coloring planar homothets and three-dimensional hypergraphs.
    Computational Geometry: Theory and Applications, 46(9):1027-1035, 2013. [abstract]
  21. J. Cardinal, S. Fiorini, and G. Joret. Minimum Entropy Combinatorial Optimization Problems.
    Theory of Computing Systems, 51(1):4-21, 2012. [abstract]
  22. J. Cardinal, M. Karpinski, R. Schmied, and C. Viehmann. Approximating Vertex Cover in Dense Hypergraphs.
    Journal of Discrete Algorithms, 13:67-77, 2012. [abstract]
  23. G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman, O. Schwartz, S. Smorodinsky, and P. Taslakian. Colorful Strips.
    Graphs and Combinatorics, 27(3):327-339, 2011. [abstract]
  24. J. Cardinal, E. D. Demaine, M. L. Demaine, S. Imahori, T. Ito, M. Kiyomi, S. Langerman, R. Uehara, and T. Uno. Algorithmic Folding Complexity.
    Graphs and Combinatorics, 27(3):341-351, 2011. [abstract]
  25. J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, and O. Weimann. The Stackelberg Minimum Spanning Tree Game.
    Algorithmica, 59(2):129-144, 2011. [abstract]
  26. G. Aloupis, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, J. O'Rourke, and B. Palop. Highway Hull Revisited.
    Computational Geometry: Theory and Applications, 43(2):115-130, 2010.
  27. G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden, and P. Ramos. Decomposition of Multiple Coverings into More Parts.
    Discrete & Computational Geometry, 44(3):706-723, 2010.
  28. J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro. An efficient algorithm for partial order production.
    SIAM Journal on Computing, 39(7):2927-294, 2010.
  29. J. Cardinal and M. Hoefer. Non-cooperative facility location and covering games.
    Theoretical Computer Science, 411(16-18):1855-1876, 2010.
  30. J. Cardinal and E. Levy. Connected Vertex Covers in Dense Graphs.
    Theoretical Computer Science, 411(26-28):2581-2590, 2010.
  31. G. Aloupis, J. Cardinal, S. Collette, S. Langerman, and S. Smorodinsky. Coloring Geometric Range Spaces.
    Discrete & Computational Geometry, 41(2):348-362, 2009. [abstract]
  32. J. Cardinal, S. Collette, and S. Langerman. Empty Region Graphs.
    Computational Geometry: Theory and Applications, 42(3):183-195, 2009. [abstract]
  33. J. Cardinal, M. Labbé, S. Langerman, and B. Palop. Pricing Geometric Transportation Networks.
    International Journal of Computational Geometry and Applications, 19(6):507-520, 2009.
  34. J. Cardinal, S. Langerman, and E. Levy. Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.
    Theoretical Computer Science, 410(8-10):949-957, 2009. [abstract]
  35. J. Cardinal, V. Ravelomanana, and M. Valencia-Pabon. Minimum Sum Edge Colorings of Multicycles.
    Discrete Applied Mathematics, 158(12):1216-1223, 2009. [abstract]
  36. J. Cardinal, S. Collette, F. Hurtado, S. Langerman, and B. Palop. Optimal Location of Transportation Devices.
    Computational Geometry: Theory and Applications, 41(3):219-229, 2008.
  37. J. Cardinal, S. Collette, and S. Langerman. Local Properties of Geometric Graphs.
    Computational Geometry: Theory and Applications, 39(1):55-64, 2008.
  38. J. Cardinal, S. Fiorini, and G. Joret. Minimum Entropy Coloring.
    Journal of Combinatorial Optimization, 16(4):361-377, 2008.
  39. J. Cardinal, S. Fiorini, and G. Joret. Minimum Entropy Orientations.
    Operations Research Letters, 36:680-683, 2008. [abstract]
  40. J. Cardinal, S. Fiorini, and G. Joret. Tight Results on Minimum Entropy Set Cover.
    Algorithmica, 51(1):49-60, 2008.
  41. M. Röder, J. Cardinal, and R. Hamzaoui. Efficient Rate-Distortion Optimized Media Streaming for Tree-Structured Packet Dependencies.
    IEEE Transactions on Multimedia, 9(6):1259-1272, 2007.
  42. J. Cardinal, S. Kremer, and S. Langerman. Juggling with Pattern Matching.
    Theory of Computing Systems, 39(3):425-437, 2006.
  43. M. Röder, J. Cardinal, and R. Hamzaoui. Branch and Bound Algorithms for Rate-Distortion Optimized Media Streaming.
    IEEE Transactions on Multimedia, 8(1):170-178, 2006.
  44. J. Cardinal and S. Langerman. Designing Small Keyboards is Hard.
    Theoretical Computer Science, 332(1-3):405-415, 2005.
  45. J. Cardinal. Entropy-Constrained Index Assignments for Multiple Description Quantizers.
    IEEE Transactions on Signal Processing, 52(1):265-270, 2004.
  46. G. Van Assche, J. Cardinal, and N. J. Cerf. Reconciliation of a Quantum-Distributed Gaussian Key.
    IEEE Transactions on Information Theory, 50(2):394-400, 2004.
  47. J. Cardinal. Tree-Structured Multiple Description Coding.
    Journal of VLSI Signal Processing Systems, 33(3):287-294, 2003.
  48. J. Cardinal. Complexity-Constrained Tree-Structured Vector Quantizers.
    Signal Processing, 82(8):1176-1182, 2002.
  49. J. Cardinal. Fast Fractal Compression of Greyscale Images.
    IEEE Transactions on Image Processing, 10(1):159-164, 2001.
  50. J. Cardinal. A Lagrangian Optimization Approach to Complexity-Constrained TSVQ.
    IEEE Signal Processing Letters, 7(11):304-306, 2000.
  51. J. Cardinal. Faster Fractal Image Coding Using Similarity Search in a KL-Transformed Feature Space. In E. Lutton M. Dekking, J. Lévy-Véhel and C. Tricot, editors, Fractals : Theory and Applications in Engineering, pages 293-306. Springer, 1999.

Conference articles

  1. L. Barba, J. Cardinal, J. Iacono, S. Langerman, A. Ooms, and N. Solomon. Subquadratic Algorithms for Algebraic Generalizations of 3SUM. In Proc. Symposium on Computational Geometry (SoCG), 2017.
  2. J. Cardinal and U. Hoffmann. Convex allowable sequences. In Proc. European Workshop on Computational Geometry (EuroCG), 2017.
  3. J. Cardinal and S. Felsner. Topological drawings of complete bipartite graphs. In Proc. International Symposium on Graph Drawing & Network Visualization (GD), volume 9801 of Lecture Notes in Computer Science, 2016. Springer-Verlag. [abstract]
  4. J. Cardinal, J. Iacono, and A. Ooms. Solving k-sum using few linear queries. In Proc. European Symposium on Algorithms (ESA), 2016. [abstract]
  5. J. Cardinal, M. S. Payne, and N. Solomon. Ramsey-type theorems on lines in 3-space. In Proc. European Workshop on Computational Geometry (EuroCG), 2016.
  6. J. Cardinal and U. Hoffmann. Recognition and Complexity of Point Visibility Graphs. In Proc. Symposium on Computational Geometry (SoCG), pages 171-185, 2015. [abstract]
  7. J. Cardinal, M. Hoffmann, V. Kusters, C. D. Tóth, and M. Wettstein. Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. In Proc. International Symposium on Theoretical Aspects of Computer Science (STACS), pages 197-210, 2015. [abstract]
  8. O. Aichholzer, J. Cardinal, V. Kusters, S. Langerman, and P. Valtr. Reconstructing Point Set Order Types from Radial Orderings. In Proc. International Symposium on Algorithms and Computation (ISAAC), volume 8889 of Lecture Notes in Computer Science, pages 15-26, 2014. Springer-Verlag. [abstract]
  9. J. Cardinal and S. Felsner. Covering Partial Cubes with Zones. In Proc. 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG$^2$ 2013), volume 8845 of Lecture Notes in Computer Science, pages 1-13, 2014. Springer-Verlag. [abstract]
  10. J. Cardinal, K. Knauer, P. Micek, and T. Ueckerdt. Making Octants Colorful and Related Covering Decomposition Problems. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1424-1432, 2014. [abstract]
  11. O. Aichholzer, J. Cardinal, T. Hackl, F. Hurtado, M. Korman, A. Pilz, R. Silveira, R. Uehara, B. Vogtenhuber, and E. Welzl. Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. In Proc. Canadian Conference on Computational Geometry (CCCG), 2013.
  12. A. Asinowski, J. Cardinal, N. Cohen, S. Collette, T. Hackl, M. Hoffmann, K. Knauer, S. Langerman, M. Lason, P. Micek, G. Rote, and T. Ueckerdt. Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. In Proc. Workshop on Algorithms and Data Structures (WADS), volume 8037 of Lecture Notes in Computer Science, pages 73-84, 2013. Springer-Verlag. [abstract]
  13. J. Cardinal and S. Fiorini. On Generalized Comparison-Based Sorting Problems. In Space-Efficient Data Structures, Streams, and Algorithms, volume 8066 of Lecture Notes in Computer Science, pages 164-175, 2013. Springer-Verlag. [abstract]
  14. P. Bose, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, M. Korman, and P. Taslakian. Coloring and Guarding Arrangements. In Proc. European Workshop on Computational Geometry (EuroCG), 2012.
  15. S. Cabello, J. Cardinal, and S. Langerman. The Clique Problem in Ray Intersection Graphs. In Proc. European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 241-252, 2012. Springer-Verlag. [abstract]
  16. E. Camby, J. Cardinal, S. Fiorini, and O. Schaudt. The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. In Proc. Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), 2012.
  17. J. Cardinal, N. Cohen, S. Collette, M. Hoffmann, S. Langerman, and G. Rote. Coloring Dynamic Point Sets on a Line. In Proc. European Workshop on Computational Geometry (EuroCG), 2012.
  18. J. Cardinal, M. Hoffmann, and V. Kusters. On Universal Point Sets for Planar Graphs. In Computational Geometry and Graphs - Thailand-Japan Joint Conference (TJJCCGG), volume 8296 of Lecture Notes in Computer Science, pages 30-41, 2012. Springer-Verlag. [abstract]
  19. J. Cardinal and M. Korman. Coloring Planar Homothets and Three-Dimensional Hypergraphs. In Proc. Latin American Theoretical INformatics (LATIN), volume 7256 of Lecture Notes in Computer Science, pages 121-132, 2012. Springer-Verlag. Note: Also presented at the European Workshop on Computational Geometry (EuroCG) 2011. [abstract]
  20. J. Cardinal, H. Ito, and S. Langerman. Helly Numbers of Polyominoes. In Proc. Canadian Conference on Computational Geometry (CCCG), 2011.
  21. J. Cardinal, M. Karpinski, R. Schmied, and C. Viehmann. Approximating subdense instances of graph covering problems. In Proc. VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), volume 37 of Electronic Notes in Discrete Mathematics, pages 297-302, 2011. [abstract]
  22. G. Aloupis, J. Cardinal, S. Collette, E. D. Demaine, M. L. Demaine, M. Dulieu, R. Fabila-Monroy, V. Hart, F. Hurtado, S. Langerman, M. Saumell, C. Seara, and P. Taslakian. Matching Points with Things. In Proc. Latin American Theoretical INformatics (LATIN), volume 6034 of Lecture Notes in Computer Science, pages 456-467, 2010. Springer-Verlag. Note: 2-page abstract in Proceedings of the 7th Japan Conference on Computational Geometry and Graphs (JCCGG09). [abstract]
  23. G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman, O. Schwartz, S. Smorodinsky, and P. Taslakian. Colorful Strips. In Proc. Latin American Theoretical INformatics (LATIN), volume 6034 of Lecture Notes in Computer Science, pages 2-13, 2010. Springer-Verlag. Note: 2-page abstract in Proceedings of the 7th Japan Conference on Computational Geometry and Graphs (JCCGG09). [abstract]
  24. J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro. Sorting under Partial Information (without the Ellipsoid Algorithm). In Proc. ACM Symposium on Theory of Computing (STOC), pages 359-368, 2010. ACM. [abstract]
  25. G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden, and P. Ramos. Decomposition of Multiple Coverings into More Parts. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 302-310, 2009. [abstract]
  26. P. Bose, J. Cardinal, S. Collette, E. D. Demaine, B. Palop, P. Taslakian, and N. Zeh. Relaxed Gabriel Graphs. In Proc. Canadian Conference on Computational Geometry (CCCG), 2009.
  27. J. Cardinal, E. D. Demaine, M. L. Demaine, S. Imahori, S. Langerman, and R. Uehara. Algorithmic Folding Complexity. In Proc. International Symposium on Algorithms and Computation (ISAAC), volume 5878 of Lecture Notes in Computer Science, pages 452-461, 2009. Springer-Verlag. Note: Also presented at the 7th Japan Conference on Computational Geometry and Graphs (JCCGG09).
  28. J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, I. Newman, and O. Weimann. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. In Proc. Workshop on Internet and Network Economics (WINE), volume 5929 of Lecture Notes in Computer Science, pages 125-136, 2009. Springer-Verlag.
  29. J. Cardinal, S. Fiorini, and G. Joret. Minimum Entropy Combinatorial Optimization Problems. In Proc. Computability in Europe (CiE), volume 5635 of Lecture Notes in Computer Science, pages 79-88, 2009. Springer-Verlag. [abstract]
  30. J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro. An efficient algorithm for partial order production. In Proc. ACM Symposium on Theory of Computing (STOC), pages 93-100, 2009. ACM. [abstract]
  31. G. Aloupis, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, and J. O'Rourke. Draining a polygon - or - rolling a ball out of a polygon. In Proc. Canadian Conference on Computational Geometry (CCCG), 2008.
  32. G. Aloupis, J. Cardinal, S. Collette, S. Langerman, and S. Smorodinsky. Coloring geometric range spaces. In Proc. Latin American Theoretical INformatics (LATIN), volume 4957 of Lecture Notes in Computer Science, pages 146-157, 2008. Springer-Verlag.
  33. J. Cardinal and E. Levy. Connected vertex covers in dense graphs. In Proc. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 5171 of Lecture Notes in Computer Science, pages 35-48, 2008. Springer-Verlag.
  34. G. Aloupis, J. Cardinal, S. Collette, and S. Langerman. Lumines Strategies. In Proc. International Conference on Computer and Games (CG), volume 4630 of Lecture Notes in Computer Science, pages 190-199, 2007. Springer-Verlag.
  35. J. Cardinal, S. Collette, F. Hurtado, S. Langerman, and B. Palop. Moving walkways, Escalators, and Elevators. In Proc. Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007), 2007. Note: Also presented at the XII Encuentros de Geometrěa Computacional (EGC). [abstract]
  36. J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, and O. Weimann. The Stackelberg Minimum Spanning Tree Game. In Proc. Workshop on Algorithms and Data Structures (WADS), volume 4619 of Lecture Notes in Computer Science, pages 64-76, 2007. Springer-Verlag. [abstract]
  37. J. Cardinal, S. Langerman, and G. Louchard. Randomized Optimization : a Probabilistic analysis. In Proc. International Conference on Analysis of Algorithms (AofA), 2007.
  38. J. Cardinal, V. Ravelomanana, and M. Valencia-Pabon. Chromatic Edge Strength of Some Multigraphs. In Proc. IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Electronic Notes in Discrete Mathematics, volume 30, pages 39-44, 2007. [abstract]
  39. G. Aloupis, J. Cardinal, S. Collette, J. Iacono, and S. Langerman. Where to build a temple, and where to dig to find one. In Proc. European Workshop on Computational Geometry (EuroCG), pages 1-4, 2006.
  40. J. Cardinal, S. Fiorini, and G. Joret. Tight Results on Minimum Entropy Set Cover. In Proc. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 4110 of Lecture Notes in Computer Science, pages 61-69, 2006. Springer-Verlag.
  41. J. Cardinal and M. Hoefer. Selfish Service Installation in Networks. In Proc. Workshop on Internet and Network Economics (WINE), volume 4286 of Lecture Notes in Computer Science, pages 174-185, 2006. Springer-Verlag.
  42. J. Cardinal and S. Langerman. Min-max-min Geometric Facility Location Problems. In Proc. European Workshop on Computational Geometry (EuroCG), pages 149-152, 2006.
  43. J. Cardinal, S. Langerman, and E. Levy. Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. In Proc. Workshop on Approximation and Online Algorithms (WAOA), volume 4368 of Lecture Notes in Computer Science, pages 108-120, 2006. Springer-Verlag.
  44. M. Röder, J. Cardinal, and R. Hamzaoui. Efficient rate-distortion optimized media streaming for tree-reducible packet dependencies. In Proc. Multimedia Computing and Networking (MMCN), volume 6071, pages 40-51, 2006. SPIE/IS&T/ACM.
  45. J. Cardinal, S. Collette, and S. Langerman. Region Counting Circles. In Proc. Canadian Conference on Computational Geometry (CCCG), pages 278-281, 2005.
  46. J. Cardinal, S. Collette, and S. Langerman. Region Counting Graphs. In Proc. European Workshop on Computational Geometry (EuroCG), pages 21-24, 2005.
  47. J. Cardinal, S. Fiorini, and G. Joret. Minimum Entropy Coloring. In Proc. International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 819-828, 2005. Springer-Verlag.
  48. J. Cardinal, M. Labbé, S. Langerman, E. Levy, and H. Mélot. A tight analysis of the maximal matching heuristic. In Proc. Int. Computing and Combinatorics Conference (COCOON), volume 3595 of Lecture Notes in Computer Science, pages 701-709, 2005. Springer-Verlag.
  49. J. Cardinal, M. Labbé, S. Langerman, and B. Palop. Pricing of Geometric Transportation Networks. In Proc. Canadian Conference on Computational Geometry (CCCG), pages 92-96, 2005.
  50. M. Röder, J. Cardinal, and R. Hamzaoui. Dynamic Programming Algorithm for Rate-Distortion Optimized Media Streaming. In Proc. IEEE International Conf. Image Processing (ICIP), volume 2, pages 169-172, 2005.
  51. J. Cardinal, S. Collette, and S. Langerman. Local Properties of Geometric Graphs. In Proc. Canadian Conference on Computational Geometry (CCCG), pages 145-148, 2004.
  52. J. Cardinal and D. Eppstein. Lazy algorithms for dynamic closest pair with arbitrary distance measures. In Proc. SIAM Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, pages 112-119, January 2004. SIAM.
  53. J. Cardinal, S. Fiorini, and G. Van Assche. On Minimum Entropy Graph Colorings. In Proc. IEEE International Symposium on Information Theory (ISIT), pages 43, 2004. IEEE Information Theory Society.
  54. J. Cardinal, S. Kremer, and S. Langerman. Juggling with Pattern Matching. In Proc. Int. Conference on Fun with Algorithms (FUN), pages 147-158, 2004. Edizioni Plus, Universitŕ di Pisa.
  55. J. Cardinal and S. Langerman. Designing Small Keyboards is Hard. In Proc. Latin American Theoretical INformatics (LATIN), volume 2976 of Lecture Notes in Computer Science, pages 391-400, 2004. Springer-Verlag.
  56. M. Röder, J. Cardinal, and R. Hamzaoui. On the complexity of rate-distortion optimal streaming of packetized media. In Proc. IEEE Data Compression Conference (DCC), pages 192-201, 2004. IEEE Computer Society.
  57. J. Cardinal. Compression of side Information. In Proc. IEEE Int. Conf. Multimedia and Expo (ICME), volume 2, pages 569-572, 2003.
  58. J. Cardinal. Multistage Index Assignments for $M$-Description Coding. In Proc. IEEE International Conf. Image Processing (ICIP), volume 3, pages 249-252, 2003. Note: Also presented at the 24th Symposium on Information Theory in the Benelux.
  59. J. Cardinal and G. Van Assche. Construction of a Shared Secret Key Using Continuous Variables. In Proc. IEEE Information Theory Workshop (ITW), pages 135-138, 2003. IEEE Information Theory Society.
  60. J. Cardinal. Entropy-Constrained Index Assignments for Multiple Description Coding. In Proc. 23rd Symposium on Information Theory in the Benelux, Louvain-la-Neuve, Belgium, pages 17-24, May 2002. Werkgemeenschap Informatie en Communicatietheorie, Enschede (NL).
  61. J. Cardinal, S. Elloumi, and M. Labbé. Local Optimization of Index Assignments for Multiple Description Coding. In Proc. European Signal Processing Conference (EUSIPCO), volume I, pages 269-272, 2002.
  62. J. Cardinal and G. Van Assche. Joint Entropy-Constrained Multiterminal Quantization. In Proc. IEEE International Symposium on Information Theory (ISIT), pages 63, 2002. IEEE Information Theory Society.
  63. J. Cardinal. Design of Tree-Structured Multiple Description Vector Quantizers. In Proc. IEEE Data Compression Conference (DCC), pages 23-32, 2001. IEEE Computer Society.
  64. J. Cardinal. Tree-Structured Multiple Description Source Coding. In Proc. IEEE Workshop on Signal Processing Systems (SiPS), pages 416-427, September 2001.
  65. J. Cardinal. Vector Index Assignments for Packet Communication. In 8th Symposium on Communications and Vehicular Technology in the Benelux (SCVT), pages 42-47, October 2001. IEEE Benelux Joint Chapter on Communications and Vehicular Technology.
  66. J. Cardinal. Complexity-Constrained Tree-Structured Vector Quantizers. In 21st Symposium on Information Theory in the Benelux, pages 239-246, May 2000. Werkgemeenschap Informatie en Communicatietheorie, Enschede, Netherlands.
  67. J. Cardinal. Multipath tree-structured vector quantizers. In Proc. European Signal Processing Conference (EUSIPCO), Tampere (Finland), 2000.
  68. J. Cardinal. Tree-Based Search for ECVQ. In Proc. IEEE Data Compression Conference (DCC), pages 548, 2000. IEEE Computer Society. Note: (abstract).
  69. J. Cardinal. Fast Search Techniques for Product Code Vector Quantizers. In 2nd EURASIP Conference on DSP for Multimedia Communications and Services (ECMCS), June 1999.
  70. J. Cardinal. Fast Search for Entropy-Constrained VQ. In Proceedings of the 10th International Conference on Image Analysis and Processing, (ICIAP), pages 1038-1042, September 1999. IEEE Computer Society.



Last modified: Fri Apr 7 16:26:34 2017
Author: jean.


This document was translated from BibTEX by bibtex2html