Articles dans des revues avec comité de lecture (95)

  1. 1. Esperet, L., Joret, G., & Morin, P. (2023). Sparse universal graphs for planarity. Journal of the London Mathematical Society. doi:10.1112/jlms.12781
  2. 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-5
  3. 3. Groenland, C., Joret, G., Nadara, W., & Walczak, B. (2023). Approximating pathwidth for graphs of small treewidth. ACM transactions on algorithms, 19(2), 1-19. doi:10.1145/3576044
  4. 4. Joret, G., Lochet, I., & Seweryn, M. M. (2023). Edge Separators for Graphs Excluding a Minor. The electronic journal of combinatorics, 30(4), 4.12. doi:10.37236/11744
  5. 5. Joret, G., & Micek, P. (2022). Improved bounds for weak coloring numbers. The electronic journal of combinatorics, 29(1), P1.60. doi:10.37236/10274
  6. 6. Fiorini, S., Joret, G., Weltge, S., & Yuditsky, Y. (2022). Integer programs with bounded subdeterminants and two nonzeros per row. Annual Symposium on Foundations of Computer Science,, FOCS 2021 13-24. doi:10.1109/FOCS52979.2021.00011
  7. 7. Huynh, T., Joret, G., Micek, P., Seweryn, M., & Wollan, P. (2022). Excluding a ladder. Combinatorica, 42, 405-432. doi:10.1007/s00493-021-4592-8
  8. 8. Huynh, T., Joret, G., & Wood, D. R. (2022). Subgraph densities in a surface. Combinatorics, probability & computing, 31(5), 812-839. doi:10.1017/S0963548321000560
  9. 9. 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/10522
  10. 10. Fiorini, S., Huynh, T., Joret, G., & Muller, C. (2021). Unavoidable Minors for Graphs with Large ℓp -Dimension. Discrete & computational geometry, 66(1), 301-343. doi:10.1007/s00454-021-00285-5
  11. 11. 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-3
  12. 12. 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

  13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>