Articles dans des revues avec comité de lecture (95)
  1. 73. 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-y
  2. 74. Barát, J., Joret, G., & Wood, D. (2011). Disproof of the list Hadwiger conjecture. The electronic journal of combinatorics, 18(1), R232. doi:10.37236/719
  3. 75. Joret, G., & Wood, D. (2010). Irreducible triangulations are small. Journal of combinatorial theory. Series B, 100, 446-455. doi:10.1016/j.jctb.2010.01.004
  4. 76. Fiorini, S., Joret, G., & Pietropaoli, U. (2010). Hitting diamonds and growing cacti. Lecture notes in computer science, 6080 LNCS, 191-204. doi:10.1007/978-3-642-13036-6_15
  5. 77. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2010). Sorting under partial information (without the ellipsoid algorithm). Proceedings of the annual ACM Symposium on Theory of Computing, 359-368. doi:10.1145/1806689.1806740
  6. 78. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2010). An efficient algorithm for partial order production. SIAM journal on computing, 39(7), 2927-2940. doi:10.1137/090759860
  7. 79. Joret, G., Kaminski, M., & Theis, D. (2010). The Cops and Robber game on graphs with forbidden (induced) subgraphs. Contributions to Discrete Mathematics, 5(2), 40-51. doi:10.11575/cdm.v5i2.62032
  8. 80. Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Newman, I., & Weimann, O. (2009). The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. Lecture notes in computer science, 5929, 125-136. doi:10.1007/978-3-642-10841-9-13
  9. 81. Cardinal, J., Fiorini, S., & Joret, G. (2009). Minimum entropy combinatorial optimization problems. Lecture notes in computer science, 5635, 79-88. doi:10.1007/978-3-642-03073-4-9
  10. 82. Fiorini, S., & Joret, G. (2009). On a theorem of Sewell and Trotter. European journal of combinatorics, 30, 425-428. doi:10.1016/j.ejc.2008.05.002
  11. 83. Doignon, J.-P., Fiorini, S., & Joret, G. (2009). Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. Discrete Optimization, 6, 1-9. doi:j.disopt.2008.07.001
  12. 84. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2009). An efficient algorithm for partial order production. Proceedings of the annual ACM Symposium on Theory of Computing. doi:10.1145/1536414.1536430
    13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>