Marcin Kamiński 个人学术档案

引用次数

	总计	2019 年至今
引用	1706	702
h 指数	22	14
i10 指数	36	22

160

120

2007200820092010201120122013201420152016201720182019202020212022202320247 5 22 33 50 116 121 132 140 125 115 113 120 147 108 121 127 79

开放获取的出版物数量

查看全部

8 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Daniel PaulusmaDepartment of Computer Science, Durham University在 durham.ac.uk 的电子邮件经过验证
Dimitrios M. Thilikos在 thilikos.info 的电子邮件经过验证
Vadim LozinUniversity of Warwick在 warwick.ac.uk 的电子邮件经过验证
Petr GolovachUniversity of Bergen在 ii.uib.no 的电子邮件经过验证
Martin MilaničUniversity of Primorska, Koper, Slovenia在 upr.si 的电子邮件经过验证
Pim van 't HofUniversity of Twente在 utwente.nl 的电子邮件经过验证
Paul MedvedevPenn State在 cse.psu.edu 的电子邮件经过验证
Joe SawadaProfessor, Computer Science, University of Guelph在 uoguelph.ca 的电子邮件经过验证
Chinh T. HoangProfessor of Computer Science, Wilfrid Laurier University在 wlu.ca 的电子邮件经过验证
Rémy BelmonteUniversité Gustave Eiffel在 univ-eiffel.fr 的电子邮件经过验证
Xiao ShuMcMaster University在 mcmaster.ca 的电子邮件经过验证
Jiri FialaCharles University在 kam.mff.cuni.cz 的电子邮件经过验证
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Hirotaka OnoNagoya University, Japan在 i.nagoya-u.ac.jp 的电子邮件经过验证
Pinar HeggernesProfessor of computer science, University of Bergen在 ii.uib.no 的电子邮件经过验证
Paul Bonsmauniversity of Twente在 utwente.nl 的电子邮件经过验证
Vangelis PaschosProfesseur d'Informatique, LAMSADE, Université Paris-Dauphine在 lamsade.dauphine.fr 的电子邮件经过验证
Federico Della CroceDIGEP Politecnico di Torino, Italy在 polito.it 的电子邮件经过验证
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, Austria在 szeider.net 的电子邮件经过验证
Ryuhei UeharaJapan Advanced Institute of Science and Technology在 jaist.ac.jp 的电子邮件经过验证

关注

Marcin Kamiński

4colors Research

在 mimuw.edu.pl 的电子邮件经过验证 - 首页

Graph Theory Combinatorial Optimization Metaheuristics Machine Learning


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	181	2010
Complexity of independent set reconfigurability problems M Kamiński, P Medvedev, M Milanič Theoretical computer science 439, 9-15, 2012	169	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	111	2007
Reconfiguration of list edge-colorings in a graph T Ito, M Kamiński, ED Demaine Discrete Applied Mathematics 160 (15), 2199-2207, 2012	97	2012
Shortest paths between shortest paths M Kamiński, P Medvedev, M Milanič Theoretical Computer Science 412 (39), 5205-5210, 2011	97*	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	79	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	54	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	42	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	39	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	29	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	27	2013
Contraction checking in graphs on surfaces M Kaminski, DM Thilikos 29th International Symposium on Theoretical Aspects of Computer Science …, 2012	26	2012
Forbidding Kuratowski graphs as immersions AC Giannopoulou, M Kamiński, DM Thilikos Journal of Graph Theory 78 (1), 43-60, 2015	25	2015

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用