Articles dans des revues avec comité de lecture (50)
  1. 35. Van't Hof, P., Kaminski, M., Paulusma, D., Szeider, S., & Thilikos Touloupas, D. (2010). On contracting graphs to fixed pattern graphs. Lecture notes in computer science, 5901 LNCS, 503-514. doi:10.1007/978-3-642-11266-9_42
  2. 36. Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2010). Contractions of planar graphs in polynomial time. Lecture notes in computer science, 6346 LNCS(PART 1), 122-133. doi:10.1007/978-3-642-15775-2_11
  3. 37. van 't Hof, P., Kaminski, M., & Paulusma, D. (2010). Finding induced paths of given parity in claw-free graphs. Lecture notes in computer science, 5911 LNCS, 341-352. doi:10.1007/978-3-642-11409-0_30
  4. 38. Joret, G., Kaminski, M., & Theis, D. (2010). The Cops and Robber game on graphs with forbidden (induced) subgraphs. Contributions to Discrete Mathematics, 5(2), 40-51. doi:10.11575/cdm.v5i2.62032
  5. 39. Kaminski, M., Medvedev, P., & Milanic, M. (2009). On the plane-width of graphs. Electronic Notes in Discrete Mathematics, 34, 633-637. doi:10.1016/j.endm.2009.07.107
  6. 40. Kaminski, M., Lozin, V., & Milanic, M. (2009). Recent developments on graphs of bounded clique-width. Discrete applied mathematics, 157(12), 2747-2761.
  7. 41. Ito, T., Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2009). Parameterizing cut sets in a graph by the number of their components. Lecture notes in computer science, 5878 LNCS, 605-615. doi:10.1007/978-3-642-10631-6_62
  8. 42. Ito, T., Kaminski, M., & Demaine, E. D. (2009). Reconfiguration of list edge-colorings in a graph. Lecture notes in computer science, 5664 LNCS, 375-386. doi:10.1007/978-3-642-03367-4_33
  9. 43. Golovach, P. A., Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2009). Induced packing of odd cycles in a planar graph. Lecture notes in computer science, 5878 LNCS, 514-523. doi:10.1007/978-3-642-10631-6_53
  10. 44. Hoàng, C. T., Kaminski, M., Lozin, V., Sawada, J., & Shu, X. (2008). A note on k-colorability of p5-free graphs. Lecture notes in computer science, 5162, 387-394.
  11. 45. Hoàng, C. T., Kaminski, M., Lozin, V., Sawada, J., & Shu, X. (2008). A note on k-colorability of P5-free graphs. Lecture notes in computer science, 5162 LNCS, 387-394. doi:10.1007/978-3-540-85238-4_31
  12. 46. Cardoso, D. M., Kaminski, M., & Lozin, V. (2007). Maximum k-regular induced subgraphs. Journal of combinatorial optimization, 14(4), 455-463. doi:10.1007/s10878-007-9045-9
    13. << Précédent 1 2 3 4 5 6 Suivant >>