Marcin Kamiński

Dikutip oleh

	Semua	Sejak 2020
Kutipan	1832	685
indeks-h	23	15
indeks-i10	39	20

160

120

20072008200920102011201220132014201520162017201820192020202120222023202420257 5 22 34 52 120 123 138 138 129 115 113 120 147 102 113 133 140 50

Akses publik

Lihat semua

8 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Daniel PaulusmaDepartment of Computer Science, Durham UniversityEmail yang diverifikasi di durham.ac.uk
Dimitrios M. ThilikosNational and Kapodistrian University of AthensEmail yang diverifikasi di thilikos.info
Vadim LozinUniversity of WarwickEmail yang diverifikasi di warwick.ac.uk
Martin MilaničUniversity of Primorska, Koper, SloveniaEmail yang diverifikasi di upr.si
Petr GolovachUniversity of BergenEmail yang diverifikasi di ii.uib.no
Paul MedvedevPenn StateEmail yang diverifikasi di cse.psu.edu
Pim van 't HofUniversity of TwenteEmail yang diverifikasi di utwente.nl
Joe SawadaProfessor, Computer Science, University of GuelphEmail yang diverifikasi di uoguelph.ca
Chinh T. HoangProfessor of Computer Science, Wilfrid Laurier UniversityEmail yang diverifikasi di wlu.ca
Rémy BelmonteUniversité Gustave EiffelEmail yang diverifikasi di univ-eiffel.fr
Xiao ShuMcMaster UniversityEmail yang diverifikasi di mcmaster.ca
Jiri FialaCharles UniversityEmail yang diverifikasi di kam.mff.cuni.cz
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail yang diverifikasi di mit.edu
Hirotaka OnoNagoya University, JapanEmail yang diverifikasi di i.nagoya-u.ac.jp
Pinar HeggernesProfessor of computer science, University of BergenEmail yang diverifikasi di ii.uib.no
Paul Bonsmauniversity of TwenteEmail yang diverifikasi di utwente.nl
Vangelis PaschosProfesseur d'Informatique, LAMSADE, Université Paris-DauphineEmail yang diverifikasi di lamsade.dauphine.fr
Federico Della CroceDIGEP Politecnico di Torino, ItalyEmail yang diverifikasi di polito.it
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaEmail yang diverifikasi di szeider.net
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyEmail yang diverifikasi di jaist.ac.jp

Ikuti

Marcin Kamiński

4colors Research

Email yang diverifikasi di mimuw.edu.pl - Beranda

Graph Theory Combinatorial Optimization Metaheuristics Machine Learning


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Complexity of independent set reconfigurability problems M Kamiński, P Medvedev, M Milanič Theoretical computer science 439, 9-15, 2012	191	2012
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	190	2010
Recent developments on graphs of bounded clique-width M Kamiński, VV Lozin, M Milanič Discrete Applied Mathematics 157 (12), 2747-2761, 2009	150	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
Shortest paths between shortest paths M Kamiński, P Medvedev, M Milanič Theoretical Computer Science 412 (39), 5205-5210, 2011	105*	2011
Reconfiguration of list edge-colorings in a graph T Ito, M Kamiński, ED Demaine Discrete Applied Mathematics 160 (15), 2199-2207, 2012	101	2012
Reconfiguring independent sets in claw-free graphs P Bonsma, M Kamiński, M Wrochna Scandinavian Workshop on Algorithm Theory, 86-97, 2014	89	2014
The cops and robber game on graphs with forbidden (induced) subgraphs G Joret, M Kamiński, DO Theis arXiv preprint arXiv:0804.4145, 2008	61	2008
Maximum k-regular induced subgraphs DM Cardoso, M Kamiński, V Lozin Journal of Combinatorial Optimization 14 (4), 455-463, 2007	56	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, ... Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011	55*	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	48	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	44	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	37	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	33	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	32	2009
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	30	2014
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	30	2013
Increasing the minimum degree of a graph by contractions PA Golovach, M Kamiński, D Paulusma, DM Thilikos Theoretical Computer Science, 2013	29	2013
MAX-CUT and containment relations in graphs M Kamiński Theoretical Computer Science 438, 89-95, 2012	28	2012

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama