Articles dans des revues avec comité de lecture (113)
47.
Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Newman, I., & Weimann, O. (2013). The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. Journal of combinatorial optimization, 25(1), 19-46. doi:10.1007/s10878-011-9414-248.
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_756.
Cardinal, J., Demaine, E. D., Demaine, M. L., Imahori, S. S., Ito, T., Kiyomi, M., Langerman, S., Uehara, R., & Uno, T. (2011). Algorithmic Folding Complexity. Graphs and combinatorics, 27(3), 341-351. doi:10.1007/s00373-011-1019-057.
Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Langerman, S., Newman, I., & Weimann, O. (2011). The Stackelberg minimum spanning tree game. Algorithmica, 59(2), 129-144. doi:10.1007/s00453-009-9299-y58.
Taslakian, P., 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. (2010). Matching points with things. Lecture notes in computer science, 6034, 456-467. doi:10.1007/978-3-642-12200-2_40