Articles dans des revues avec comité de lecture (50)
11.
Kaminski, M., & Thilikos Touloupas, D. (2012). Contraction checking in graphs on surfaces. Leibniz international proceedings in informatics, 14, 182-193. doi:10.4230/LIPIcs.STACS.2012.182
12.
Golovach, P. A., Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2012). Increasing the minimum degree of a graph by contractions. Lecture notes in computer science, 7112 LNCS, 67-79. doi:10.1007/978-3-642-28050-4_6
13.
Ito, T., Demaine, E. D., & Kaminski, M. (2012). Reconfiguration of list edge-colorings in a graph. Discrete applied mathematics, 160(15), 2199-2207.
14.
Golovach, P. A., Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2012). Containment relations in split graphs. Discrete applied mathematics, 160(1-2), 155-163. doi:10.1016/j.dam.2011.10.004
15.
Kaminski, M., Golovach, P. A., Paulusma, D., & Thilikos Touloupas, D. (2012). Induced packing of odd cycles in a planar graph. Theoretical computer science, 420, 28-35.
16.
Kaminski, M. (2012). Max-cut and containment relations in graphs. Theoretical computer science, 438, 89-95.
17.
van 't Hof, P., Paulusma, D., & Kaminski, M. (2012). Finding induced paths of given parity in claw-free graphs. Algorithmica, 62(1-2), 537-563.
18.
Fiala, J., Lidicky, B., Paulusma, D., & Kaminski, M. (2012). The k-in-a-path problem for claw-free graphs. Algorithmica, 62(1-2), 499-519.
19.
Golovach, P. A., Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2011). Lift Contractions. Electronic Notes in Discrete Mathematics, 38, 407-412. doi:10.1016/j.endm.2011.09.066
20.
Ito, T., Paulusma, D., Thilikos Touloupas, D., & Kaminski, M. (2011). Parameterizing cut sets in a graph by the number of their components. Theoretical computer science, 412(45), 6340-6350.
21.
Kaminski, M., Paulusma, D., & Thilikos Touloupas, D. (2011). Contracting planar graphs to contractions of triangulations. Journal of discrete algorithms, 9(3), 299-306. doi:10.1016/j.jda.2011.03.010
22.
Kaminski, M., Medvedev, P., & Milanic, M. (2011). The plane-width of graphs. Journal of graph theory, 68(3), 229-245. doi:10.1002/jgt.20554