Articles dans des revues avec comité de lecture (90)
49.
Biedl, T., Durocher, S., Engelbeen, C., Fiorini, S., & Young, M. (2011). Faster optimal algorithms for segment minimization with small maximal value. Lecture notes in computer science, 6844 LNCS, 86-97. doi:10.1007/978-3-642-22300-6_850.
Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Langerman, S., Newman, I., & Weimann, O. (2011). The Stackelberg minimum spanning tree game. Algorithmica, 59(2), 129-144. doi:10.1007/s00453-009-9299-y51.
Biedl, T., Durocher, S., Engelbeen, C., Fiorini, S., & Young, M. (2011). A closest vector problem arising in radiation therapy planning. Lecture notes in computer science, 22(4), 609-629. doi:10.1007/s10878-010-9308-853.
Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2010). Sorting under partial information (without the ellipsoid algorithm). Proceedings of the annual ACM Symposium on Theory of Computing, 359-368. doi:10.1145/1806689.180674054.
Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2010). An efficient algorithm for partial order production. SIAM journal on computing, 39(7), 2927-2940. doi:10.1137/09075986057.
Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Newman, I., & Weimann, O. (2009). The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. Lecture notes in computer science, 5929, 125-136. doi:10.1007/978-3-642-10841-9-13