Articles dans des revues avec comité de lecture (114)
  1. 35. Aichholzer, O., Cardinal, J., Langerman, S., Kusters, V., & Valtr, P. (2014). Reconstructing point set order types from radial orderings. Lecture notes in computer science, 8889, 15-26. doi:10.1007/978-3-319-13075-0_2
  2. 36. Cardinal, J., & Felsner, S. (2014). Covering partial cubes with zones. Lecture notes in computer science, 8845, 1-13. doi:10.1007/978-3-319-13287-7_1
  3. 37. Aichholzer, O., Hackl, T., Pilz, A., Vogtenhuber, B., Cardinal, J., Hurtado, F., Silveira, R. R., Korman, M., Uehara, R., Valtr, P., & Welzl, E. (2014). Cell-paths in mono- And bichromatic line arrangements in the plane. Discrete mathematics and theoretical computer science, 16(3), 317-332.
  4. 38. Cardinal, J., Knauer, K., Micek, P., & Ueckerdt, T. (2014). Making octants colorful and related covering decomposition problems. SIAM journal on discrete mathematics, 28(4), 1948-1959. doi:10.1137/140955975
  5. 39. Camby, E., Cardinal, J., Fiorini, S., & Schaudt, O. (2014). The price of connectivity for vertex cover. Discrete mathematics and theoretical computer science, 16(1), 207-224.
  6. 40. Cardinal, J., Knauer, K., Micek, P., & Ueckerdt, T. (2014). Making Octants Colorful and Related Covering Decomposition Problems. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 1424-1432. doi:10.1137/1.9781611973402.105
  7. 41. Cabello, S., Cardinal, J., & Langerman, S. (2013). The Clique Problem in Ray Intersection Graphs. Discrete & computational geometry, 50(3), 771-783. doi:10.1007/s00454-013-9538-5
  8. 42. Cardinal, J., Ito, H., Korman, M., & Langerman, S. (2013). Helly Numbers of Polyominoes. Graphs and combinatorics, 29(5), 1221-1234. doi:10.1007/s00373-012-1203-x
  9. 43. Aloupis, G., Cardinal, J., Collette, S., Demaine, E. D., Demaine, M. L., Dulieu, M., Fabila-Monroy, R., Hart, V., Hurtado, F., Langerman, S., Saumell Mendiola, M., Seara, C., & Taslakian, P. (2013). Non-crossing matchings of points with geometric objects. Computational geometry, 46(1), 78-92. doi:10.1016/j.comgeo.2012.04.005
  10. 44. Asinowski, A., Cardinal, J., Cohen, N., Collette, S., Hackl, T., Hoffmann, M., Knauer, K., Langerman, S., Lasoń, M., Micek, P., Rote, G., & Ueckerdt, T. (2013). Coloring hypergraphs induced by dynamic point sets and bottomless rectangles. Lecture notes in computer science, 8037 LNCS, 73-84. doi:10.1007/978-3-642-40104-6_7
  11. 45. Bose, P., Cardinal, J., Collette, S., Hurtado, F., Korman, M., Langerman, S., & Taslakian, P. (2013). Coloring and guarding arrangements. Discrete mathematics and theoretical computer science, 15(3), 139-154.
  12. 46. Cardinal, J., & Fiorini, S. (2013). On generalized comparison-based sorting problems. Lecture notes in computer science, 8066 LNCS, 164-175. doi:10.1007/978-3-642-40273-9_12
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>