Kamiński, Marcin
- Deciding k-colourability of P5-free graphs in polynomial time
2007/02/07 by Chı́nh T. Hoàng, Marcin Kamiński, Hoàng, Chính T. +7 · 5 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.2.2 #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
- Reconfiguring Independent Sets in Claw-Free Graphs
2014/03/03 by Paul Bonsma, Marcin Kamiński, Bonsma, Paul +3 · 5 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO
- Fixed-Parameter Tractability of Token Jumping on Planar Graphs
2014/06/25 by Takehiro Ito, Marcin Kamiński, Ito, Takehiro +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Limits and Structures in Graph Theory #cs.DM #cs.DS
- Induced minors and well-quasi-ordering
2015/10/24 by Błasiok, Jarosław, Kamiński, Marcin, Raymond, Jean-Florent +1 · 1 citation
#05C #06A07 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
- Certifying coloring algorithms for graphs without long induced paths
2017/03/07 by Kamiński, Marcin, Pstrucha, Anna · 1 citation
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics