Marcin J. Kaminski, Ph.D.
Affiliations: | 2007 | Rutgers University, New Brunswick, New Brunswick, NJ, United States |
Area:
Computer ScienceGoogle:
"Marcin Kaminski"Parents
Sign in to add mentor| Vadim Lozin | grad student | 2007 | Rutgers, New Brunswick | |
| (New algorithmic and hardness results on graph partitioning problems.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Ito T, Kaminski MJ, Ono H, et al. (2020) Parameterized complexity of independent set reconfiguration problems Discrete Applied Mathematics. 283: 336-345 |
| Błasiok J, Kamiński M, Raymond J, et al. (2019) Induced minors and well-quasi-ordering Journal of Combinatorial Theory, Series B. 134: 110-142 |
| Kamiński M, Pstrucha A. (2019) Certifying coloring algorithms for graphs without long induced paths Discrete Applied Mathematics. 261: 258-267 |
| Kaminski MJ, Raymond J, Trunck T. (2018) Multigraphs without large bonds are wqo by contraction Journal of Graph Theory. 88: 558-565 |
| Golovach PA, Kaminski MJ, Maniatis S, et al. (2017) The Parameterized Complexity of Graph Cyclability Siam Journal On Discrete Mathematics. 31: 511-541 |
| Bresar B, Heggernes P, Kaminski MJ, et al. (2017) Preface: Algorithmic Graph Theory on the Adriatic Coast Discrete Applied Mathematics. 231: 1-3 |
| Kaminski MJ, Raymond J, Trunck T. (2017) Well-quasi-ordering H-contraction-free graphs Discrete Applied Mathematics. 248: 18-27 |
| Belmonte R, Hof Pv', Kamiński M, et al. (2017) The price of connectivity for feedback vertex set Discrete Applied Mathematics. 217: 132-143 |
| Atminas A, Kamiński M, Raymond J. (2016) Scattered packings of cycles Theoretical Computer Science. 647: 33-42 |
| Kamiński M, Paulusma D, Stewart A, et al. (2016) Minimal disconnected cuts in planar graphs Networks. 68: 250-259 |