Articles dans des revues avec comité de lecture (95)
  1. 61. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2013). Sorting under partial information (without the ellipsoid algorithm). Combinatorica, 33(6), 655-697. doi:10.1007/s00493-013-2821-5
  2. 62. 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-2
  3. 63. Bruyère, V., Joret, G., & Melot, H. (2012). Trees with Given Stability Number and Minimum Number of Stable Sets. Graphs and combinatorics, 28(2), 167-187. doi:10.1007/s00373-011-1041-2
  4. 64. Joret, G., & Wood, D. (2012). Nordhaus-Gaddum for treewidth. European journal of combinatorics, 33(4), 488--490. doi:10.1016/j.ejc.2011.10.005
  5. 65. Dujmović, V. V., Joret, G., & Wood, D. (2012). An improved bound for First-Fit on posets without two long incomparable chains. SIAM journal on discrete mathematics, 26(3), 1068-1075. doi:10.1137/110855806
  6. 66. Fiorini, S., Joret, G., Theis, D., & Wood, D. (2012). Small minors in dense graphs. European journal of combinatorics, 33(6), 1226-1245. doi:10.1016/j.ejc.2012.02.003
  7. 67. Cardinal, J., Fiorini, S., & Joret, G. (2012). Minimum entropy combinatorial optimization problems. Theory of Computing Systems, 51(1), 4-21. doi:10.1007/s00224-011-9371-2
  8. 68. Fiorini, S., & Joret, G. (2012). Approximating the balanced minimum evolution problem. Operations research letters, 40(1), 31-35. doi:10.1016/j.orl.2011.10.003
  9. 69. Joret, G., & Milans, K. G. (2011). First-Fit is linear on posets excluding two long incomparable chains. Order, 28(3), 455--464. doi:10.1007/s11083-010-9184-y
  10. 70. Dujmović, V. V., Fijavz, G., Joret, G., Sulanke, T., & Wood, D. (2011). On the maximum number of cliques in a graph embedded in a surface. European journal of combinatorics, 32(8), 1244–1252. doi:10.1016/j.ejc.2011.04.001
  11. 71. Joret, G. (2011). Stackelberg network pricing is hard to approximate. Networks, 57(2), 117-120. doi:10.1002/net.20391
  12. 72. Joret, G., Paul, C., Sau, I., Saurabh, S., & Thomassé, S. (2011). Hitting and harvesting pumpkins. Lecture notes in computer science, 6942 LNCS, 394-407. doi:10.1007/978-3-642-23719-5_34
    13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>