Articles dans des revues avec comité de lecture (95)
  1. 37. Dujmović, V. V., Joret, G., Morin, P. P., Norin, S., & Wood, D. (2018). Corrigendum: Orthogonal tree decompositions of graphs. SIAM journal on discrete mathematics, 32(4), 3003-3004. doi:10.1137/18M1214196
  2. 38. Joret, G., Micek, P., & Wiechert, V. (2018). Sparsity and dimension. Combinatorica, 38(5), 1129-1148.
  3. 39. Felsner, S., Joret, G., Micek, P., Trotter, W. T., & Wiechert, V. (2017). Burling graphs, chromatic number, and orthogonal tree-decompositions. Electronic Notes in Discrete Mathematics, 61, 415-420. doi:10.1016/j.endm.2017.06.068
  4. 40. Joret, G., Micek, P., Trotter, W. T., Wang, R., & Wiechert, V. (2017). On the Dimension of Posets with Cover Graphs of Treewidth 2. Order, 34(2), 185-234. doi:10.1007/s11083-016-9395-y
  5. 41. Fiorini, S., Huynh, T., Joret, G., & Pashkovich, K. (2017). Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. Discrete & computational geometry, 57(3), 757-761. doi:10.1007/s00454-016-9852-9
  6. 42. Fiorini, S., Huynh, T., Joret, G., & Varvitsiotis, A. (2017). The excluded minors for isometric realizability in the plane. SIAM journal on discrete mathematics, 31(1), 438-453. doi:10.1137/16M1064775
  7. 43. Joret, G., Micek, P., & Wiechert, V. (2017). Planar posets have dimension at most linear in their height. SIAM journal on discrete mathematics, 31(4), 2754-2790. doi:10.1137/17M111300X
  8. 44. Berbeglia, G., & Joret, G. (2017). Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments. Proceedings - ACM conference on Economics and Computation, ACM EC '17, 345-346. doi:10.1145/3033274.3084084
  9. 45. Gagol, A., Joret, G., Kozik, J., & Micek, P. (2016). Pathwidth and nonrepetitive list coloring. The electronic journal of combinatorics, 23(4), #P4.40. doi:10.37236/5855
  10. 46. Dujmović, V. V., Joret, G., Kozik, J., & Wood, D. (2016). Nonrepetitive colouring via entropy compression. Combinatorica, 1-26. doi:10.1007/s00493-015-3070-6
  11. 47. Fiorini, S., Joret, G., & Schaudt, O. (2016). Improved approximation algorithms for hitting 3-vertex paths. Lecture notes in computer science, 9682, Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, 238-249. doi:10.1007/978-3-319-33461-5_20
  12. 48. Joret, G., Micek, P., & Wiechert, V. (2016). Sparsity and dimension. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, 1804-1813. doi:10.1137/1.9781611974331.ch125
    13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>