Articles dans des revues avec comité de lecture (95)
  1. 49. Joret, G., Micek, P., Milans, K. G., Trotter, W. T., Walczak, B., & Wang, R. (2016). Tree-width and dimension. Combinatorica, 36(4), 431-450. doi:10.1007/s00493-014-3081-8
  2. 50. Cardinal, J., & Joret, G. (2015). Hitting all maximal independent sets of a bipartite graph. Algorithmica, 72(2), 359-368. doi:10.1007/s00453-013-9847-3
  3. 51. Barát, J., Dujmović, V. V., Joret, G., Payne, M., Scharf, L., Schymura, D., Valtr, P., & Wood, D. (2015). Empty pentagons in point sets with collinearities. SIAM journal on discrete mathematics, 29(1), 198-209. doi:10.1137/130950422
  4. 52. Joret, G., & Vetta, A. (2015). Reducing the rank of a matroid. Discrete mathematics and theoretical computer science, 17(2), 143-156. doi:10.46298/dmtcs.2135
  5. 53. Joret, G., Paul, C., Sau, I., Saurabh, S., & Thomassé, S. (2014). Hitting and harvesting pumpkins. SIAM journal on discrete mathematics, 28(3), 1363-1390. doi:10.1137/120883736
  6. 54. Clarke, N., Fiorini, S., Joret, G., & Theis, D. (2014). A note on the cops and robber game on graphs embedded in non-orientable surfaces. Graphs and combinatorics, 30(1), 119-124. doi:10.1007/s00373-012-1246-z
  7. 55. Esperet, L., & Joret, G. (2014). Coloring planar graphs with three colors and no large monochromatic components. Combinatorics, probability & computing, 23(4), 551--570. doi:10.1017/S0963548314000170
  8. 56. Esperet, L., & Joret, G. (2013). Boxicity of Graphs on Surfaces. Graphs and combinatorics, 29(3), 417-427. doi:10.1007/s00373-012-1130-x
  9. 57. Dujmović, V. V., Frati, F., Joret, G., & Wood, D. (2013). Nonrepetitive colourings of planar graphs with O(log n) colours. The electronic journal of combinatorics, 20(1), P51. doi:10.37236/3153
  10. 58. Joret, G., & Wood, D. (2013). Complete graph minors and the graph minor structure theorem. Journal of combinatorial theory. Series B, 103(1), 61-74. doi:10.1016/j.jctb.2012.09.001
  11. 59. Dujmović, V. V., Harvey, D., Joret, G., Reed, B., & Wood, D. (2013). A linear-time algorithm for finding a complete graph minor in a dense graph. SIAM journal on discrete mathematics, 27(4), 1770--1774. doi:10.1137/120866725
  12. 60. Fiorini, S., Joret, G., & Wood, D. (2013). Excluded forest minors and the Erdös-Pósa property. Combinatorics, probability & computing, 22(5), 700-721. doi:10.1017/S0963548313000266
    13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>