Articles dans des revues avec comité de lecture (167)
  1. 48. Aloupis, G., Barba Flores, L., Langerman, S., & Souvaine, D. D. (2015). Bichromatic compatible matchings. Computational geometry, 48(8), 622-633. doi:10.1016/j.comgeo.2014.08.009
  2. 49. Demaine, E. D., Iacono, J., & Langerman, S. (2015). Worst-Case Optimal Tree Layout in External Memory. Algorithmica, 72(2), 369-378. doi:10.1007/s00453-013-9856-2
  3. 50. Aloupis, G., Barba Flores, L., De Carufel, J. L., Langerman, S., & Souvaine, D. D. (2015). Isoperimetric Enclosures. Graphs and combinatorics, 31(2), 361-392. doi:10.1007/s00373-015-1553-2
  4. 51. Cardinal, J., Collette, S., Ito, H., Korman, M., Langerman, S., Sakaidani, H., & Taslakian, P. (2015). Cannibal Animal Games: A new variant of Tic-Tac-Toe. Journal of Information Processing, 23(3), 265-271. doi:10.2197/ipsjjip.23.265
  5. 52. Barba Flores, L., Korman, M., Langerman, S., & Silveira, R. R. (2014). Computing a visibility polygon using few variables. Computational geometry, 47(9), 918-926. doi:10.1016/j.comgeo.2014.04.001
  6. 53. Bose, P., Iacono, J., Douieb, K., & Langerman, S. (2014). The power and limitations of static binary search trees with lazy finger. Lecture notes in computer science, 8889, 181-192. doi:10.1007/978-3-319-13075-0_15
  7. 54. Aichholzer, O., Cardinal, J., Langerman, S., Kusters, V., & Valtr, P. (2014). Reconstructing point set order types from radial orderings. Lecture notes in computer science, 8889, 15-26. doi:10.1007/978-3-319-13075-0_2
  8. 55. Ito, H., Langerman, S., & Yoshida, Y. (2014). Generalized River Crossing Problems. Theory of Computing Systems, 56(2), 418-435. doi:10.1007/s00224-014-9562-8
  9. 56. Aloupis, G., Bose, P., Dujmović, V. V., Gray, C., Langerman, S., & Speckmann, B. (2014). Triangulating and guarding realistic polygons. Computational geometry, 47(2 PART C), 296-306. doi:10.1016/j.comgeo.2013.03.005
  10. 57. Barba Flores, L., Bose, P., & Langerman, S. (2014). Optimal Algorithms for Constrained 1-Center Problems. Lecture notes in computer science, 8392 LNCS, 84-95. doi:10.1007/978-3-642-54423-1_8
  11. 58. Cheilaris, P., Khramtcova, E., Papadopoulou, E., & Langerman, S. (2014). A randomized incremental approach for the hausdorff voronoi diagram of non-crossing clusters. Lecture notes in computer science, 8392 LNCS, 96-107. doi:10.1007/978-3-642-54423-1_9
  12. 59. Higashikawa, Y., Katoh, N., Langerman, S., & Tanigawa, S. I. (2014). Online graph exploration algorithms for cycles and trees by multiple searchers. Journal of combinatorial optimization, 28(2), 480-495. doi:10.1007/s10878-012-9571-y
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Suivant >>