Articles dans des revues avec comité de lecture (167)
  1. 60. Bremner, D., Chan, T. M., Demaine, E. D., Erickson, J. J., Hurtado, F., Iacono, J., Langerman, S., Pǎtraşcu, M., & Taslakian, P. (2014). Necklaces, convolutions, and X+Y. Algorithmica, 69(2), 294-314. doi:10.1007/s00453-012-9734-3
  2. 61. Aloupis, G., Iacono, J., Langerman, S., Özkan, Ö., & Wuhrer, S. S. (2014). The Complexity of Order Type Isomorphism. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 405-415. doi:10.1137/1.9781611973402.30
  3. 62. Cabello, S., Cardinal, J., & Langerman, S. (2013). The Clique Problem in Ray Intersection Graphs. Discrete & computational geometry, 50(3), 771-783. doi:10.1007/s00454-013-9538-5
  4. 63. Cardinal, J., Ito, H., Korman, M., & Langerman, S. (2013). Helly Numbers of Polyominoes. Graphs and combinatorics, 29(5), 1221-1234. doi:10.1007/s00373-012-1203-x
  5. 64. Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristán, V., & Saumell Mendiola, M. (2013). Some properties of k-Delaunay and k-Gabriel graphs. Computational geometry, 46(2), 131-139. doi:10.1016/j.comgeo.2012.04.006
  6. 65. Bose, P., Carmi, P., Chaitman-Yerushalmi, L., Collette, S., Katz, M. M., & Langerman, S. (2013). Stable roommates spanner. Computational geometry, 46(2), 120-130. doi:10.1016/j.comgeo.2012.07.001
  7. 66. Chen, D., Devillers, O., Iacono, J., Langerman, S., & Morin, P. P. (2013). Oja centers and centers of gravity. Computational geometry, 46(2), 140-147. doi:10.1016/j.comgeo.2012.04.004
  8. 67. Aloupis, G., Cardinal, J., Collette, S., Demaine, E. D., Demaine, M. L., Dulieu, M., Fabila-Monroy, R., Hart, V., Hurtado, F., Langerman, S., Saumell Mendiola, M., Seara, C., & Taslakian, P. (2013). Non-crossing matchings of points with geometric objects. Computational geometry, 46(1), 78-92. doi:10.1016/j.comgeo.2012.04.005
  9. 68. Dujmović, V. V., & Langerman, S. (2013). A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. Discrete & computational geometry, 49(1), 74-88. doi:10.1007/s00454-012-9464-y
  10. 69. Asinowski, A., Cardinal, J., Cohen, N., Collette, S., Hackl, T., Hoffmann, M., Knauer, K., Langerman, S., Lasoń, M., Micek, P., Rote, G., & Ueckerdt, T. (2013). Coloring hypergraphs induced by dynamic point sets and bottomless rectangles. Lecture notes in computer science, 8037 LNCS, 73-84. doi:10.1007/978-3-642-40104-6_7
  11. 70. Bose, P., Cardinal, J., Collette, S., Hurtado, F., Korman, M., Langerman, S., & Taslakian, P. (2013). Coloring and guarding arrangements. Discrete mathematics and theoretical computer science, 15(3), 139-154.
  12. 71. Barba Flores, L., Langerman, S., Korman, M., Silveira, R. R., & Sadakane, K. (2013). Space-time trade-offs for stack-based algorithms. Leibniz international proceedings in informatics, 20, 281-292. doi:10.4230/LIPIcs.STACS.2013.281
    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 >>