Ouvrages publiés en collaboration (1)
  1. 1. Giaro, K., & Kaminski, M. (2003). Introduction to Quantum Computing.
    2.   Parties d'ouvrages collectifs (1)
  2. 1. Kaminski, M., Della Croce, F., Escoffier, B., & Paschos, V. (2008). Worst-case Complexity of Exact Algorithms for NP-hard Problems. In V. Paschos (Ed.), Combinatorial Optimization and Theoretical Computer Science (pp. 203-240). ISTE Ltd and John Wiley & Sons Inc. doi:10.1002/9780470611098.ch8
    3.   Articles dans des revues avec comité de lecture (50)
  3. 1. Kaminski, M., Medvedev, P., & Milanic, M. (2010). Shortest paths between shortest paths and independent sets. Lecture notes in computer science. doi:10.1007/978-3-642-19222-7_7
  4. 2. Golovach, P. A., Paulusma, D., Kaminski, M., & Thilikos Touloupas, D. (2014). Lift-contractions. European journal of combinatorics, 35, 286-296. doi:10.1016/j.ejc.2013.06.026
  5. 3. Belmonte, R., Van't Hof, P., Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2013). Characterizing graphs of small carving-width. Discrete applied mathematics, 161(13-14), 1888-1893. doi:10.1016/j.dam.2013.02.036
  6. 4. Golovach, P. A., Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2013). Increasing the minimum degree of a graph by contractions. Theoretical computer science, 481, 74-84. doi:10.1016/j.tcs.2013.02.030
  7. 5. Hoàng, C. T., Kaminski, M., Sawada, J., & Sritharan, R. (2013). Finding and listing induced paths and cycles. Discrete applied mathematics, 161(4-5), 633-641. doi:10.1016/j.dam.2012.01.024
  8. 6. Błasiok, J., & Kaminski, M. (2013). Chain minors are FPT. Lecture notes in computer science, 8246 LNCS, 78-83. doi:10.1007/978-3-319-03898-8_8
  9. 7. Fiala, J., Kaminski, M., & Paulusma, D. (2012). Detecting induced star-like minors in polynomial time. Journal of discrete algorithms, 17, 74-85. doi:10.1016/j.jda.2012.11.002
  10. 8. Kaminski, M., Medvedev, P., & Milanic, M. (2012). Complexity of independent set reconfigurability problems. Theoretical computer science, 439, 9-15. doi:10.1016/j.tcs.2012.03.004
  11. 9. van 't Hof, P., Kaminski, M., Paulusma, D., Szeider, S., & Thilikos Touloupas, D. (2012). On graph contractions and induced minors. Discrete applied mathematics, 160(6), 799-809. doi:10.1016/j.dam.2010.05.005
  12. 10. Belmonte, R., van 't Hof, P., & Kaminski, M. (2012). Induced immersions. Lecture notes in computer science, 7676 LNCS, 299-308.
    13. << Précédent 1 2 3 4 5 6 Suivant >>