Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Marcin Kamiński
2015
- Marcin Kamiński i Martin Milanic, On the complexity of the identifiable subgraph problem, Discrete Applied Mathematics 182 2015, s. 25–33.zobacz w PBN
- Archontia C. Giannopoulou, Marcin Kamiński i Dimitrios M. Thilikos, Forbidding Kuratowski Graphs as Immersions, Journal Of Graph Theory 78 (1) 2015, s. 43–60.zobacz w PBN
- Marcin Kamiński, Dani\"el Paulusma, Anthony Stewart i Dimitrios M. Thilikos, Minimal Disconnected Cuts in Planar Graphs, w: Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, s. 243–254.zobacz w PBN
- Jaroslaw Blasiok, Marcin Kamiński, Jean-Florent Raymond i Th\'eophile Trunck, Induced minors and well-quasi-ordering, Electronic Notes In Discrete Mathematics 49 2015, s. 197–201.zobacz w PBN
2014
- Peter Golovach, Marcin Kamiński, Daniel Paulusma i Dimitrios Thilikos, Lift Contractions, European Journal Of Combinatorics 35 2014.zobacz w PBN
- Marcin Kamiński i Łukasz Kowalik, Beyond the Vizing's Bound for at Most Seven Colors, Siam Journal On Discrete Mathematics 28 (3) 2014, s. 1334–1362.zobacz w PBN
- Remy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kamiński i Dani\"el Paulusma, Detecting Fixed Patterns in Chordal Graphs in Polynomial Time, Algorithmica 69 (3) 2014, s. 501–521.zobacz w PBN
- Petr A. Golovach, Marcin Kamiński, Spyridon Maniatis i Dimitrios M. Thilikos, The Parameterized Complexity of Graph Cyclability, w: Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings, Springer, 2014, s. 492–504.zobacz w PBN
- Paul S. Bonsma, Marcin Kamiński i Marcin Wrochna, Reconfiguring Independent Sets in Claw-Free Graphs, w: Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, 2014, s. 86–97.zobacz w PBN
2013
- Remy Belmonte, Pim van 't Hof, Marcin Kamiński, Daniel Paulusma i Dimitrios M. Thilikos, Characterizing graphs of small carving-width, Discrete Applied Mathematics 161 (13-14) 2013, s. 1888–1893.zobacz w PBN
- P.A. Golovach, Marcin Kamiński, D. Paulusma i D.M. Thilikos, Increasing the minimum degree of a graph by contractions, Theoretical Computer Science 481 (Complete) 2013, s. 74–84.zobacz w PBN
- Chính T. Hoàng, Marcin Kamiński, Joe Sawada i R. Sritharan, Finding and listing induced paths and cycles, Discrete Applied Mathematics 161 (4-5) 2013, s. 633–641.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
