Articles dans des revues avec comité de lecture (95)
  1. 25. Bonamy, M., Charbit, P., Defrain, O., Joret, G., Lagoutte, A., Limouzy, V., Pastor, L., & Sereni, J. S. (2020). Revisiting a theorem by Folkman on graph colouring. The electronic journal of combinatorics, 27(1), P1.56. doi:10.37236/8899
  2. 26. Dujmović, V. V., Esperet, L., Joret, G., Walczak, B., & Wood, D. (2020). Planar graphs have bounded nonrepetitive chromatic number. Advances in combinatorics., P5. doi:10.19086/aic.12100
  3. 27. Conforti, M., Fiorini, S., Huynh, T., Joret, G., & Weltge, S. (2020). The stable set problem in graphs with bounded genus and bounded odd cycle packing number. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, 2896-2915. doi:https://epubs.siam.org/doi/10.1137/1.9781611975994.176
  4. 28. Joret, G., & Lochet, W. (2020). Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. SIAM journal on discrete mathematics, 34(4), 2221-2238. doi:10.1137/18M1200427
  5. 29. Joret, G., Micek, P., Ossona de Mendez, P., & Wiechert, V. (2019). Nowhere Dense Graph Classes and Dimension. Combinatorica, 39(5), 1055-1079. doi:10.1007/s00493-019-3892-8
  6. 30. Cames Van Batenburg, W., Huynh, T., Joret, G., & Raymond, J.-F. (2019). A tight Erdõs-Pósa function for planar minors. Advances in combinatorics., P2. doi:10.19086/aic.10807
  7. 31. Cames Van Batenburg, W., Huynh, T., Joret, G., & Raymond, J.-F. (2019). A tight Erdõs-Pósa function for planar minors. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, SODA '19, 1485-1500. doi:10.1137/1.9781611975482.90
  8. 32. Dujmović, V. V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., & Wood, D. (2019). Planar graphs have bounded queue number. Annual Symposium on Foundations of Computer Science, FOCS 2019, 862-875. doi:10.1109/FOCS.2019.00056
  9. 33. Aboulker, P., Fiorini, S., Huynh, T., Joret, G., Raymond, J.-F., & Sau, I. (2018). A tight Erdõs-Pósa theorem for wheel minors. SIAM journal on discrete mathematics, 32(3), 2302-2312. doi:10.1137/17M1153169
  10. 34. Felsner, S., Joret, G., Micek, P., Trotter, W. T., & Wiechert, V. (2018). Burling graphs, chromatic number, and orthogonal tree-decompositions. The electronic journal of combinatorics, 25(1), P1.35. doi:10.37236/7052
  11. 35. Joret, G., & Wood, D. (2018). K4-minor-free induced subgraphs of sparse connected graphs. SIAM journal on discrete mathematics, 32(1), 123-147. doi:10.1137/16M107712X
  12. 36. Dujmović, V. V., Joret, G., Morin, P. P., Norin, S., & Wood, D. (2018). Orthogonal tree decompositions of graphs∗. SIAM journal on discrete mathematics, 32(2), 839-863. doi:10.1137/17M1112637
    13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>