Articles dans des revues avec comité de lecture (95)
2.
Briański, M., Joret, G., Majewski, K., Micek, P., Seweryn, M., & Sharma, R. (2023). Treedepth vs Circumference. Combinatorica. doi:10.1007/s00493-023-00028-57.
Huynh, T., Joret, G., Micek, P., Seweryn, M., & Wollan, P. (2022). Excluding a ladder. Combinatorica, 42, 405-432. doi:10.1007/s00493-021-4592-89.
Aprile, M. F., Fiorini, S., Huynh, T., Joret, G., & Wood, D. R. (2021). Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. The electronic journal of combinatorics, 28(4), P4.47. doi:10.37236/1052211.
Bousquet, N., Cames Van Batenburg, W., Esperet, L., Joret, G., Lochet, W., Muller, C., & Pirot, F. (2021). Packing and covering balls in graphs excluding a minor. Combinatorica, 41, 299-318. doi:10.1007/s00493-020-4423-312.
Dujmović, V. V., Esperet, L., Gavoille, C., Joret, G., Micek, P., & Morin, P. (2021). Adjacency labelling for planar graphs (and beyond). Journal of the Association for Computing Machinery, 68(6), 42. doi:10.1145/3477542