Follow
Marcin Kamiński
Marcin Kamiński
4colors Research
Verified email at mimuw.edu.pl - Homepage
Title
Cited by
Cited by
Year
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, 74-81, 2010
1622010
Complexity of independent set reconfigurability problems
M Kamiński, P Medvedev, M Milanič
Theoretical computer science 439, 9-15, 2012
1442012
Recent developments on graphs of bounded clique-width
M Kamiński, VV Lozin, M Milanič
Discrete Applied Mathematics 157 (12), 2747-2761, 2009
1332009
Coloring edges and vertices of graphs without short or long cycles
VV Lozin, M Kaminski
Contributions to Discrete Mathematics 2 (1), 2007
1032007
Reconfiguration of list edge-colorings in a graph
T Ito, M Kamiński, ED Demaine
Discrete Applied Mathematics 160 (15), 2199-2207, 2012
882012
Shortest paths between shortest paths
M Kamiński, P Medvedev, M Milanič
Theoretical Computer Science 412 (39), 5205-5210, 2011
84*2011
Reconfiguring independent sets in claw-free graphs
P Bonsma, M Kamiński, M Wrochna
Algorithm Theory–SWAT 2014: 14th Scandinavian Symposium and Workshops …, 2014
742014
Maximum k-regular induced subgraphs
DM Cardoso, M Kamiński, V Lozin
Journal of Combinatorial Optimization 14 (4), 455-463, 2007
552007
Finding contractions and induced minors in chordal graphs via disjoint paths
R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ...
Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011
50*2011
The cops and robber game on graphs with forbidden (induced) subgraphs
G Joret, M Kamiński, DO Theis
arXiv preprint arXiv:0804.4145, 2008
442008
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
402007
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
392012
On the parameterized complexity for token jumping on graphs
T Ito, M Kamiński, H Ono, A Suzuki, R Uehara, K Yamanaka
Theory and Applications of Models of Computation: 11th Annual Conference …, 2014
382014
Contractions of planar graphs in polynomial time.
M Kaminski, D Paulusma, DM Thilikos
ESA (1) 6346, 122-133, 2010
332010
The k-in-a-Path Problem for Claw-free Graphs
J Fiala, M Kamiński, B Lidický, D Paulusma
Algorithmica 62, 499-519, 2012
322012
Increasing the minimum degree of a graph by contractions
PA Golovach, M Kamiński, D Paulusma, DM Thilikos
Theoretical Computer Science, 2013
292013
Induced packing of odd cycles in a planar graph.
PA Golovach, M Kaminski, D Paulusma, DM Thilikos
ISAAC, 514-523, 2009
282009
Forbidding Kuratowski graphs as immersions
AC Giannopoulou, M Kamiński, DM Thilikos
Journal of Graph Theory 78 (1), 43-60, 2015
272015
Fixed-parameter tractability of token jumping on planar graphs
T Ito, M Kamiński, H Ono
Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju …, 2014
262014
Contraction checking in graphs on surfaces
M Kaminski, DM Thilikos
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
262012
The system can't perform the operation now. Try again later.
Articles 1–20