Articles dans des revues avec comité de lecture (95)
  1. 13. Joret, G., Micek, P., Reed, B., & Smid, M. M. (2021). Tight bounds on the clique chromatic number. The electronic journal of combinatorics, 28(3), P3.51. doi:10.37236/9659
  2. 14. Groenland, C., Joret, G., Nadara, W., & Walczak, B. (2021). Approximating pathwidth for graphs of small treewidth. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, 1965-1976. doi:10.1137/1.9781611976465.117
  3. 15. Dvorak, Z., Huynh, T., Joret, G., Liu, C.-H., & Wood, D. (2021). Notes on graph product structure theory. MATRIX book series, 4, 513-533. doi:10.1007/978-3-030-62497-2_32
  4. 16. Dujmović, V. V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., & Wood, D. (2020). Planar graphs have bounded queue number. Journal of the Association for Computing Machinery, 67(4), 22. doi:10.1145/3385731
  5. 17. Dujmović, V. V., Eppstein, D., Joret, G., Morin, P., & Wood, D. (2020). Minor-closed graph classes with bounded layered pathwidth. SIAM journal on discrete mathematics, 34(3), 1693-1709. doi:10.1137/18M122162X
  6. 18. Cames Van Batenburg, W., Goedgebeur, J., & Joret, G. (2020). Large independent sets in triangle-free cubic graphs: beyond planarity. Advances in combinatorics., P7. doi:10.19086/aic.13667
  7. 19. Cames Van Batenburg, W., Joret, G., & Ulmer, A. (2020). Erdős-Pósa from ball packing. SIAM journal on discrete mathematics, 34(3), 1609-1619. doi:10.1137/19M1309225
  8. 20. Dubois, L., Joret, G., Perarnau, G., Pilipczuk, M., & Pitois, F. (2020). Two lower bounds for p-centered colorings. Discrete mathematics and theoretical computer science, 22(4). doi:10.23638/DMTCS-22-4-9
  9. 21. Dujmović, V. V., Esperet, L., Gavoille, C., Joret, G., Micek, P., & Morin, P. (2020). Adjacency labelling for planar graphs (and beyond). Annual Symposium on Foundations of Computer Science, 2020, 9317884, 577-588. doi:10.1109/FOCS46700.2020.00060
  10. 22. Huynh, T., Joret, G., Micek, P., & Wood, D. (2020). Seymour’s conjecture on 2-connected graphs of large pathwidth. Combinatorica, 40, 839-868. doi:10.1007/s00493-020-3941-3
  11. 23. Berbeglia, G., & Joret, G. (2020). Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. Algorithmica, 82(4), 681-720. doi:10.1007/s00453-019-00610-8
  12. 24. Fiorini, S., Joret, G., & Schaudt, O. (2020). Improved approximation algorithms for hitting 3-vertex paths. Mathematical programming, 182(1-2), 355–367. doi:10.1007/s10107-019-01395-y
    13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>