Marcin Kamiński

Cited by

	All	Since 2019
Citations	1738	729
h-index	23	14
i10-index	37	23

160

120

2007200820092010201120122013201420152016201720182019202020212022202320247 5 22 33 50 116 121 132 140 125 115 113 120 147 102 112 134 114

Public access

View all

8 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Daniel PaulusmaDepartment of Computer Science, Durham UniversityVerified email at durham.ac.uk
Dimitrios M. ThilikosVerified email at thilikos.info
Vadim LozinUniversity of WarwickVerified email at warwick.ac.uk
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Martin MilaničUniversity of Primorska, Koper, SloveniaVerified email at upr.si
Pim van 't HofUniversity of TwenteVerified email at utwente.nl
Paul MedvedevPenn StateVerified email at cse.psu.edu
Joe SawadaProfessor, Computer Science, University of GuelphVerified email at uoguelph.ca
Chinh T. HoangProfessor of Computer Science, Wilfrid Laurier UniversityVerified email at wlu.ca
Rémy BelmonteUniversité Gustave EiffelVerified email at univ-eiffel.fr
Xiao ShuMcMaster UniversityVerified email at mcmaster.ca
Jiri FialaCharles UniversityVerified email at kam.mff.cuni.cz
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Hirotaka OnoNagoya University, JapanVerified email at i.nagoya-u.ac.jp
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Paul Bonsmauniversity of TwenteVerified email at utwente.nl
Vangelis PaschosProfesseur d'Informatique, LAMSADE, Université Paris-DauphineVerified email at lamsade.dauphine.fr
Federico Della CroceDIGEP Politecnico di Torino, ItalyVerified email at polito.it
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyVerified email at jaist.ac.jp

Marcin Kamiński

4colors Research

Verified email at mimuw.edu.pl - Homepage

Graph Theory Combinatorial Optimization Metaheuristics Machine Learning


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Deciding k-Colorability of P ₅-Free Graphs in Polynomial Time CT Hoàng, M Kamiński, V Lozin, J Sawada, X Shu Algorithmica 57, 74-81, 2010	184	2010
Complexity of independent set reconfigurability problems M Kamiński, P Medvedev, M Milanič Theoretical computer science 439, 9-15, 2012	175	2012
Recent developments on graphs of bounded clique-width M Kamiński, VV Lozin, M Milanič Discrete Applied Mathematics 157 (12), 2747-2761, 2009	141	2009
Coloring edges and vertices of graphs without short or long cycles VV Lozin, M Kaminski Contributions to Discrete Mathematics 2 (1), 2007	113	2007
Reconfiguration of list edge-colorings in a graph T Ito, M Kamiński, ED Demaine Discrete Applied Mathematics 160 (15), 2199-2207, 2012	99	2012
Shortest paths between shortest paths M Kamiński, P Medvedev, M Milanič Theoretical Computer Science 412 (39), 5205-5210, 2011	99*	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	80	2014
Maximum k-regular induced subgraphs DM Cardoso, M Kamiński, V Lozin Journal of Combinatorial Optimization 14 (4), 455-463, 2007	56	2007
The cops and robber game on graphs with forbidden (induced) subgraphs G Joret, M Kamiński, DO Theis arXiv preprint arXiv:0804.4145, 2008	55	2008
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	51*	2011
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	43	2014
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	41	2012
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	40	2007
The k-in-a-Path Problem for Claw-free Graphs J Fiala, M Kamiński, B Lidický, D Paulusma Algorithmica 62, 499-519, 2012	33	2012
Contractions of planar graphs in polynomial time M Kamiński, D Paulusma, DM Thilikos Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010	31	2010
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	30	2009
Increasing the minimum degree of a graph by contractions PA Golovach, M Kamiński, D Paulusma, DM Thilikos Theoretical Computer Science, 2013	28	2013
Finding and listing induced paths and cycles CT Hoang, M Kamiński, J Sawada, R Sritharan Discrete applied mathematics 161 (4-5), 633-641, 2013	28	2013
Fixed-parameter tractability of token jumping on planar graphs T Ito, M Kamiński, H Ono International Symposium on Algorithms and Computation, 208-219, 2014	27	2014
Contraction checking in graphs on surfaces M Kaminski, DM Thilikos 29th International Symposium on Theoretical Aspects of Computer Science …, 2012	27	2012

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors