Polynomial-time algorithm for vertex k-colorability of P_5-free graphs - Marcin Kaminski 001; Vadim V. Lozin (CoRR, 2006)

Vertex 3-colorability of Claw-free Graphs. - Marcin Kaminski 001; Vadim V. Lozin (Algorithmic Oper. Res., 2007)

Coloring edges and vertices of graphs without short or long cycles. - Vadim V. Lozin; Marcin Kaminski 001 (Contributions Discret. Math., 2007)

Deciding k-colourability of P_5-free graphs in polynomial time - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (CoRR, 2007)

Maximum k -regular induced subgraphs. - Domingos Moreira Cardoso; Marcin Kaminski 001; Vadim V. Lozin (J. Comb. Optim., 2007)

An exact algorithm for MAX-CUT in sparse graphs. - Federico Della Croce; Marcin Jakub Kaminski; Vangelis Th. Paschos (Oper. Res. Lett., 2007)

MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. - Josep Díaz; Marcin Kaminski 001 (Theor. Comput. Sci., 2007)

A Note on k-Colorability of P5-Free Graphs. - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (MFCS, 2008)

Induced Packing of Odd Cycles in a Planar Graph. - Petr A. Golovach; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (ISAAC, 2009)

Recent developments on graphs of bounded clique-width. - Marcin Kaminski 001; Vadim V. Lozin; Martin Milanic (Discret. Appl. Math., 2009)

Contractions of Planar Graphs in Polynomial Time. - Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (ESA (1), 2010)

Shortest Paths between Shortest Paths and Independent Sets. - Marcin Kaminski 001; Paul Medvedev; Martin Milanic (IWOCA, 2010)

On Contracting Graphs to Fixed Pattern Graphs. - Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma; Stefan Szeider; Dimitrios M. Thilikos (SOFSEM, 2010)

Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. - Marcin Kaminski 001; Lukasz Kowalik (SWAT, 2010)

Deciding k-Colorability of P5-Free Graphs in Polynomial Time. - Chính T. Hoàng; Marcin Kaminski 001; Vadim V. Lozin; Joe Sawada; Xiao Shu (Algorithmica, 2010)

The Cops and Robber game on graphs with forbidden (induced) subgraphs. - Gwenaël Joret; Marcin Kaminski 001; Dirk Oliver Theis (Contributions Discret. Math., 2010)

A note on the subgraphs of the (2×∞)-grid. - Josep Díaz; Marcin Kaminski 001; Dimitrios M. Thilikos (Discret. Math., 2010)

Odd cyclic surface separators in planar graphs. - Petr A. Golovach; Marcin Kaminski 001; Dimitrios M. Thilikos (CTW, 2011)

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. - Rémy Belmonte; Petr A. Golovach; Pinar Heggernes; Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma (ISAAC, 2011)

Contracting a Chordal Graph to a Split Graph or a Tree. - Petr A. Golovach; Marcin Kaminski 001; Daniël Paulusma (MFCS, 2011)

On disconnected cuts and separators. - Takehiro Ito; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Discret. Appl. Math., 2011)

Lift Contractions. - Petr A. Golovach; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Electron. Notes Discret. Math., 2011)

Contracting planar graphs to contractions of triangulations. - Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (J. Discrete Algorithms, 2011)

The plane-width of graphs. - Marcin Kaminski 001; Paul Medvedev; Martin Milanic (J. Graph Theory, 2011)

Parameterizing cut sets in a graph by the number of their components. - Takehiro Ito; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Theor. Comput. Sci., 2011)

Shortest paths between shortest paths. - Marcin Kaminski 001; Paul Medvedev; Martin Milanic (Theor. Comput. Sci., 2011)

Induced Immersions. - Rémy Belmonte; Pim van 't Hof; Marcin Kaminski 001 (ISAAC, 2012)

Finding an induced path of given parity in planar graphs in polynomial time. - Marcin Kaminski 001; Naomi Nishimura (SODA, 2012)

Contraction checking in graphs on surfaces. - Marcin Kaminski 001; Dimitrios M. Thilikos (STACS, 2012)

The k-in-a-Path Problem for Claw-free Graphs. - Jirí Fiala 001; Marcin Kaminski 001; Bernard Lidický; Daniël Paulusma (Algorithmica, 2012)

Finding Induced Paths of Given Parity in Claw-Free Graphs. - Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma (Algorithmica, 2012)

Containment relations in split graphs. - Petr A. Golovach; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Discret. Appl. Math., 2012)

On graph contractions and induced minors. - Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma; Stefan Szeider; Dimitrios M. Thilikos (Discret. Appl. Math., 2012)

Reconfiguration of list edge-colorings in a graph. - Takehiro Ito; Marcin Kaminski 001; Erik D. Demaine (Discret. Appl. Math., 2012)

Detecting induced star-like minors in polynomial time. - Jirí Fiala 001; Marcin Kaminski 001; Daniël Paulusma (J. Discrete Algorithms, 2012)

Induced packing of odd cycles in planar graphs. - Petr A. Golovach; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Theor. Comput. Sci., 2012)

max-cut and containment relations in graphs. - Marcin Kaminski 001 (Theor. Comput. Sci., 2012)

Complexity of independent set reconfigurability problems. - Marcin Kaminski 001; Paul Medvedev; Martin Milanic (Theor. Comput. Sci., 2012)

Excluding Graphs as Immersions in Surface Embedded Graphs. - Archontia C. Giannopoulou; Marcin Kaminski 001; Dimitrios M. Thilikos (WG, 2013)

Characterizing graphs of small carving-width. - Rémy Belmonte; Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Discret. Appl. Math., 2013)

Finding and listing induced paths and cycles. - Chính T. Hoàng; Marcin Kaminski 001; Joe Sawada; R. Sritharan (Discret. Appl. Math., 2013)

A note on contracting claw-free graphs. - Jirí Fiala 001; Marcin Kaminski 001; Daniël Paulusma (Discret. Math. Theor. Comput. Sci., 2013)

Review of Boolean Models and Methods in Mathematics, Computer Science, and Engineering by Yves Crama and Peter L. Hammer. - Marcin Kaminski 001 (SIGACT News, 2013)

Increasing the minimum degree of a graph by contractions. - Petr A. Golovach; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Theor. Comput. Sci., 2013)

Fixed-Parameter Tractability of Token Jumping on Planar Graphs. - Takehiro Ito; Marcin Jakub Kaminski; Hirotaka Ono 001 (ISAAC, 2014)

Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. - Rémy Belmonte; Pim van 't Hof; Marcin Jakub Kaminski; Daniël Paulusma (MFCS (2), 2014)

Reconfiguring Independent Sets in Claw-Free Graphs. - Paul S. Bonsma; Marcin Kaminski 001; Marcin Wrochna (SWAT, 2014)

On the Parameterized Complexity for Token Jumping on Graphs. - Takehiro Ito; Marcin Kaminski 001; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (TAMC, 2014)

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. - Rémy Belmonte; Petr A. Golovach; Pinar Heggernes; Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma (Algorithmica, 2014)

Induced packings of cycles. - Aistis Atminas; Marcin Kaminski 001; Jean-Florent Raymond (CoRR, 2014)

Beyond the Vizing's Bound for at Most Seven Colors. - Marcin Jakub Kaminski; Lukasz Kowalik (SIAM J. Discret. Math., 2014)

On the complexity of the identifiable subgraph problem. - Marcin Jakub Kaminski; Martin Milanic (Discret. Appl. Math., 2015)

Forbidding Kuratowski Graphs as Immersions. - Archontia C. Giannopoulou; Marcin Jakub Kaminski; Dimitrios M. Thilikos (J. Graph Theory, 2015)

Minimal disconnected cuts in planar graphs. - Marcin Kaminski 001; Daniël Paulusma; Anthony Stewart; Dimitrios M. Thilikos (Networks, 2016)

Scattered packings of cycles. - Aistis Atminas; Marcin Kaminski 001; Jean-Florent Raymond (Theor. Comput. Sci., 2016)

Chain Minors are FPT. - Jaroslaw Blasiok; Marcin Jakub Kaminski (Algorithmica, 2017)

The price of connectivity for feedback vertex set. - Rémy Belmonte; Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma (Discret. Appl. Math., 2017)

Preface: Algorithmic Graph Theory on the Adriatic Coast. - Bostjan Bresar; Pinar Heggernes; Marcin Jakub Kaminski; Martin Milanic; Daniël Paulusma; Primoz Potocnik; Nicolas Trotignon (Discret. Appl. Math., 2017)

The Parameterized Complexity of Graph Cyclability. - Petr A. Golovach; Marcin Kaminski 001; Spyridon Maniatis; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2017)

Well-quasi-ordering H-contraction-free graphs. - Marcin Jakub Kaminski; Jean-Florent Raymond; Théophile Trunck (Discret. Appl. Math., 2018)

Multigraphs without large bonds are wqo by contraction. - Marcin Jakub Kaminski; Jean-Florent Raymond; Théophile Trunck (J. Graph Theory, 2018)

Certifying coloring algorithms for graphs without long induced paths. - Marcin Kaminski 001; Anna Pstrucha (Discret. Appl. Math., 2019)

Induced minors and well-quasi-ordering. - Jaroslaw Blasiok; Marcin Kaminski 001; Jean-Florent Raymond; Théophile Trunck (J. Comb. Theory B, 2019)

Parameterized complexity of independent set reconfiguration problems. - Takehiro Ito; Marcin Jakub Kaminski; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (Discret. Appl. Math., 2020)

Edge clique covers in graphs with independence number two. - Pierre Charbit; Gena Hahn; Marcin Kaminski 001; Manuel Lafond; Nicolas Lichiardopol; Reza Naserasr; Ben Seamone; Rezvan Sherkati (J. Graph Theory, 2021)