Articles dans des revues avec comité de lecture (50)
  1. 23. Golovach, P. A., Kaminski, M., & Paulusma, D. (2011). Contracting a chordal graph to a split graph or a tree. Lecture notes in computer science, 6907 LNCS, 339-350. doi:10.1007/978-3-642-22993-0_32
  2. 24. Belmonte, R., Golovach, P. A., Heggernes, P., van 't Hof, P., Kaminski, M., & Paulusma, D. (2011). Finding contractions and induced minors in chordal graphs via disjoint paths. Lecture notes in computer science, 7074 LNCS, 110-119. doi:10.1007/978-3-642-25591-5_13
  3. 25. Kaminski, M., Medvedev, P., & Milanic, M. (2011). Shortest paths between shortest paths. Theoretical computer science, 412(39), 5205-5210. doi:10.1016/j.tcs.2011.05.021
  4. 26. Paulusma, D., Thilikos Touloupas, D., & Kaminski, M. (2011). Contracting planar graphs to contraction of triangulations. Journal of discrete algorithms, 9(3), 299-306.
  5. 27. Ito, T., Paulusma, D., Thilikos Touloupas, D., & Kaminski, M. (2011). On disconnected cuts and separators. Discrete applied mathematics, 159(13), 1345-1351. doi:10.1016/j.dam.2011.04.027
  6. 28. Díaz, J., Kaminski, M., & Thilikos Touloupas, D. (2010). A note on the subgraphs of the (2 × ∞)-grid. Discrete mathematics, 310(3), 531-536. doi:10.1016/j.disc.2009.03.046
  7. 29. Kaminski, M., & Kowalik, L. (2010). Approximating maximum k-edge-colorable subgraphs. Lecture notes in computer science, 6139, 395-407.
  8. 30. Diaz, J. M. C., Kaminski, M., & Thilikos Touloupas, D. (2010). A note on the subgraphs of the (2 x infinity)-grid. Discrete mathematics, 310(3), 531-536.
  9. 31. Hoàng, C. T., Kaminski, M., Lozin, V., Sawada, J., & Shu, X. (2010). Deciding k-colorability of p5-free graphs in polynomial time. Algorithmica, 57(1), 74-81.
  10. 32. Fiala, J., Kaminski, M., Lidicky, B., & Paulusma, D. (2010). The k-in-a-path problem for claw-free graphs. Leibniz international proceedings in informatics, 5, 371-382.
  11. 33. Kaminski, M. (2010). Max-cut and containment relations in graphs. Lecture notes in computer science, 6410 LNCS, 15-26. doi:10.1007/978-3-642-16926-7_4
  12. 34. Kaminski, M., & Kowalik, Ł. (2010). Approximating the maximum 3- and 4-edge-colorable subgraph (extended abstract). Lecture notes in computer science, 6139 LNCS, 395-407. doi:10.1007/978-3-642-13731-0_37
    13. << Précédent 1 2 3 4 5 6 Suivant >>