Artikel dengan mandat akses publik - Marcin KamińskiPelajari lebih lanjut
Tersedia di suatu tempat: 8
The price of connectivity for feedback vertex set
R Belmonte, P van't Hof, M Kamiński, D Paulusma
Discrete Applied Mathematics 217, 132-143, 2017
Mandat: UK Engineering and Physical Sciences Research Council, Research Council of …
Beyond the Vizing's bound for at most seven colors
M Kaminski, Ł Kowalik
SIAM Journal on Discrete Mathematics 28 (3), 1334-1362, 2014
Mandat: European Commission
A note on contracting claw-free graphs
J Fiala, M Kamiński, D Paulusma
Discrete Mathematics & Theoretical Computer Science 15 (Discrete Algorithms), 2013
Mandat: UK Engineering and Physical Sciences Research Council
The parameterized complexity of graph cyclability
PA Golovach, M Kaminski, S Maniatis, DM Thilikos
SIAM Journal on Discrete Mathematics 31 (1), 511-541, 2017
Mandat: European Commission
Induced minors and well-quasi-ordering
J Błasiok, M Kamiński, JF Raymond, T Trunck
Journal of Combinatorial Theory, Series B 134, 110-142, 2019
Mandat: US National Science Foundation, US Department of Defense, European Commission
Forbidden induced subgraphs and the price of connectivity for feedback vertex set
R Belmonte, P van’t Hof, M Kamiński, D Paulusma
International Symposium on Mathematical Foundations of Computer Science, 57-68, 2014
Mandat: UK Engineering and Physical Sciences Research Council, Research Council of …
Minimal disconnected cuts in planar graphs
M Kamiński, D Paulusma, A Stewart, DM Thilikos
Networks 68 (4), 250-259, 2016
Mandat: UK Engineering and Physical Sciences Research Council
A note on the subgraphs of the (2×∞)-grid
J Díaz, M Kamiński, DM Thilikos
Discrete mathematics 310 (3), 531-536, 2010
Mandat: German Research Foundation
Informasi terbitan dan pendanaan ditentukan secara otomatis oleh program komputer