Marcin Kamiński
Marcin Kamiński
Unknown affiliation
Verified email at - Homepage
Cited by
Cited by
Deciding k-colorability of P 5-free graphs in polynomial time
CT Hoŕng, M Kamiński, V Lozin, J Sawada, X Shu
Algorithmica 57 (1), 74-81, 2010
Recent developments on graphs of bounded clique-width
M Kamiński, VV Lozin, M Milanič
Discrete Applied Mathematics 157 (12), 2747-2761, 2009
Complexity of independent set reconfigurability problems
M Kamiński, P Medvedev, M Milanič
Theoretical computer science 439, 9-15, 2012
Coloring edges and vertices of graphs without short or long cycles
VV Lozin, M Kaminski
Contributions to Discrete Mathematics 2 (1), 2007
Reconfiguration of list edge-colorings in a graph
T Ito, M Kamiński, ED Demaine
Discrete Applied Mathematics 160 (15), 2199-2207, 2012
Shortest paths between shortest paths
M Kamiński, P Medvedev, M Milanič
Theoretical Computer Science 412 (39), 5205-5210, 2011
Reconfiguring independent sets in claw-free graphs
P Bonsma, M Kamiński, M Wrochna
Scandinavian Workshop on Algorithm Theory, 86-97, 2014
Maximum k-regular induced subgraphs
DM Cardoso, M Kamiński, V Lozin
Journal of Combinatorial Optimization 14 (4), 455-463, 2007
Finding contractions and induced minors in chordal graphs via disjoint paths
R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ...
International Symposium on Algorithms and Computation, 110-119, 2011
On graph contractions and induced minors
P van’t Hof, M Kamiński, D Paulusma, S Szeider, DM Thilikos
Discrete Applied Mathematics 160 (6), 799-809, 2012
The cops and robber game on graphs with forbidden (induced) subgraphs
G Joret, M Kamiński, DO Theis
arXiv preprint arXiv:0804.4145, 2008
The k-in-a-path problem for claw-free graphs
J Fiala, M Kamiński, B Lidický, D Paulusma
Algorithmica 62 (1), 499-519, 2012
Contractions of planar graphs in polynomial time
M Kamiński, D Paulusma, DM Thilikos
European Symposium on Algorithms, 122-133, 2010
On the parameterized complexity for token jumping on graphs
T Ito, M Kamiński, H Ono, A Suzuki, R Uehara, K Yamanaka
International Conference on Theory and Applications of Models of Computation …, 2014
MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
J Díaz, M Kamiński
Theoretical computer science 377 (1-3), 271-276, 2007
Forbidding Kuratowski graphs as immersions
AC Giannopoulou, M Kamiński, DM Thilikos
Journal of Graph Theory 78 (1), 43-60, 2015
Increasing the minimum degree of a graph by contractions
PA Golovach, M Kamiński, D Paulusma, DM Thilikos
Theoretical Computer Science, 2013
Induced packing of odd cycles in a planar graph
PA Golovach, M Kamiński, D Paulusma, DM Thilikos
International Symposium on Algorithms and Computation, 514-523, 2009
Contraction checking in graphs on surfaces
M Kaminski, DM Thilikos
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
An exact algorithm for MAX-CUT in sparse graphs
F Della Croce, MJ Kaminski, VT Paschos
Operations research letters 35 (3), 403-408, 2007
The system can't perform the operation now. Try again later.
Articles 1–20