Marcin Kaminski

79 papers A* 1A 2B 14C 4Journal 55Unranked 3

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Edge clique covers in graphs with independence number two. J. Graph Theory Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati
2019	J	`jnl`	Certifying coloring algorithms for graphs without long induced paths. Discret. Appl. Math. Marcin Kaminski, Anna Pstrucha
2019	J	`jnl`	Induced minors and well-quasi-ordering. J. Comb. Theory B Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
2017	J	`jnl`	Certifying coloring algorithms for graphs without long induced paths. CoRR Marcin Kaminski, Anna Pstrucha
2017	J	`jnl`	The Parameterized Complexity of Graph Cyclability. SIAM J. Discret. Math. Petr A. Golovach, Marcin Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos
2017	J	`jnl`	The price of connectivity for feedback vertex set. Discret. Appl. Math. Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2016	J	`jnl`	Minimal disconnected cuts in planar graphs. Networks Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos
2016	J	`jnl`	Scattered packings of cycles. Theor. Comput. Sci. Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
2016	J	`jnl`	Well-quasi-ordering H-contraction-free graphs. CoRR Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
2015	J	`jnl`	Induced minors and well-quasi-ordering. CoRR Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
2015	J	`jnl`	Induced minors and well-quasi-ordering. Electron. Notes Discret. Math. Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
2015	B	`conf`	Minimal Disconnected Cuts in Planar Graphs. FCT Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos
2014	J	`jnl`	Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2014	J	`jnl`	Fixed-Parameter Tractability of Token Jumping on Planar Graphs. CoRR Takehiro Ito, Marcin Kaminski, Hirotaka Ono
2014	J	`jnl`	Induced packings of cycles. CoRR Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
2014	J	`jnl`	Lift-contractions. Eur. J. Comb. Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos
2014	C	`conf`	On the Parameterized Complexity for Token Jumping on Graphs. TAMC Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2014	—	`conf`	Reconfiguring Independent Sets in Claw-Free Graphs. SWAT Paul S. Bonsma, Marcin Kaminski, Marcin Wrochna
2014	J	`jnl`	Reconfiguring Independent Sets in Claw-Free Graphs. CoRR Paul S. Bonsma, Marcin Kaminski, Marcin Wrochna
2013	J	`jnl`	A note on contracting claw-free graphs. Discret. Math. Theor. Comput. Sci. Jirí Fiala, Marcin Kaminski, Daniël Paulusma
2013	B	`conf`	Chain Minors Are FPT. IPEC Jaroslaw Blasiok, Marcin Kaminski
2013	J	`jnl`	Chain minors are FPT CoRR Jaroslaw Blasiok, Marcin Kaminski
2013	J	`jnl`	Characterizing graphs of small carving-width. Discret. Appl. Math. Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2013	B	`conf`	Excluding Graphs as Immersions in Surface Embedded Graphs. WG Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
2013	J	`jnl`	Finding and listing induced paths and cycles. Discret. Appl. Math. Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan
2013	J	`jnl`	Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2013	J	`jnl`	Review of Boolean Models and Methods in Mathematics, Computer Science, and Engineering by Yves Crama and Peter L. Hammer. SIGACT News Marcin Kaminski
2012	J	`jnl`	Beyond the Vizing's bound for at most seven colors CoRR Marcin Kaminski, Lukasz Kowalik
2012	C	`conf`	Characterizing Graphs of Small Carving-Width. COCOA Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	J	`jnl`	Complexity of independent set reconfigurability problems. Theor. Comput. Sci. Marcin Kaminski, Paul Medvedev, Martin Milanic
2012	J	`jnl`	Containment relations in split graphs. Discret. Appl. Math. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	A	`conf`	Contraction checking in graphs on surfaces. STACS Marcin Kaminski, Dimitrios M. Thilikos
2012	J	`jnl`	Detecting induced star-like minors in polynomial time. J. Discrete Algorithms Jirí Fiala, Marcin Kaminski, Daniël Paulusma
2012	J	`jnl`	Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2012	A*	`conf`	Finding an induced path of given parity in planar graphs in polynomial time. SODA Marcin Kaminski, Naomi Nishimura
2012	J	`jnl`	Forbidding Kuratowski Graphs as Immersions CoRR Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
2012	B	`conf`	Induced Immersions. ISAAC Rémy Belmonte, Pim van 't Hof, Marcin Kaminski
2012	J	`jnl`	Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	J	`jnl`	On graph contractions and induced minors. Discret. Appl. Math. Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2012	J	`jnl`	Reconfiguration of list edge-colorings in a graph. Discret. Appl. Math. Takehiro Ito, Marcin Kaminski, Erik D. Demaine
2012	J	`jnl`	The k-in-a-Path Problem for Claw-free Graphs. Algorithmica Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
2012	J	`jnl`	max-cut and containment relations in graphs. Theor. Comput. Sci. Marcin Kaminski
2011	B	`conf`	Contracting a Chordal Graph to a Split Graph or a Tree. MFCS Petr A. Golovach, Marcin Kaminski, Daniël Paulusma
2011	J	`jnl`	Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	B	`conf`	Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2011	B	`conf`	Increasing the Minimum Degree of a Graph by Contractions. IPEC Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Lift Contractions. Electron. Notes Discret. Math. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	C	`conf`	Odd cyclic surface separators in planar graphs. CTW Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos
2011	J	`jnl`	On disconnected cuts and separators. Discret. Appl. Math. Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Parameterizing cut sets in a graph by the number of their components. Theor. Comput. Sci. Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Shortest paths between shortest paths. Theor. Comput. Sci. Marcin Kaminski, Paul Medvedev, Martin Milanic
2011	J	`jnl`	The plane-width of graphs. J. Graph Theory Marcin Kaminski, Paul Medvedev, Martin Milanic
2010	J	`jnl`	A note on the subgraphs of the (2×∞)-grid. Discret. Math. Josep Díaz, Marcin Kaminski, Dimitrios M. Thilikos
2010	—	`conf`	Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. SWAT Marcin Kaminski, Lukasz Kowalik
2010	J	`jnl`	Contracting planar graphs to contractions of triangulations CoRR Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2010	—	`conf`	Contractions of Planar Graphs in Polynomial Time. ESA (1) Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2010	J	`jnl`	Deciding Algorithmica Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2010	B	`conf`	On Contracting Graphs to Fixed Pattern Graphs. SOFSEM Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2010	C	`conf`	Shortest Paths between Shortest Paths and Independent Sets. IWOCA Marcin Kaminski, Paul Medvedev, Martin Milanic
2010	J	`jnl`	Shortest paths between shortest paths and independent sets CoRR Marcin Kaminski, Paul Medvedev, Martin Milanic
2010	J	`jnl`	The Cops and Robber game on graphs with forbidden (induced) subgraphs. Contributions Discret. Math. Gwenaël Joret, Marcin Kaminski, Dirk Oliver Theis
2010	A	`conf`	The k-in-a-path Problem for Claw-free Graphs. STACS Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
2010	B	`conf`	max-cut and Containment Relations in Graphs. WG Marcin Kaminski
2009	B	`conf`	Finding Induced Paths of Given Parity in Claw-Free Graphs. WG Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2009	B	`conf`	Induced Packing of Odd Cycles in a Planar Graph. ISAAC Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2009	J	`jnl`	On the Plane-Width of Graphs. Electron. Notes Discret. Math. Marcin Kaminski, Paul Medvedev, Martin Milanic
2009	B	`conf`	Parameterizing Cut Sets in a Graph by the Number of Their Components. ISAAC Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2009	J	`jnl`	Recent developments on graphs of bounded clique-width. Discret. Appl. Math. Marcin Kaminski, Vadim V. Lozin, Martin Milanic
2009	B	`conf`	Reconfiguration of List Edge-Colorings in a Graph. WADS Takehiro Ito, Marcin Kaminski, Erik D. Demaine
2009	J	`jnl`	The k-in-a-path problem for claw-free graphs CoRR Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
2008	B	`conf`	A Note on k-Colorability of P5-Free Graphs. MFCS Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2008	J	`jnl`	The Plane-Width of Graphs CoRR Marcin Kaminski, Paul Medvedev, Martin Milanic
2007	J	`jnl`	Coloring edges and vertices of graphs without short or long cycles. Contributions Discret. Math. Vadim V. Lozin, Marcin Kaminski
2007	J	`jnl`	Deciding k-colourability of P_5-free graphs in polynomial time CoRR Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2007	J	`jnl`	MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theor. Comput. Sci. Josep Díaz, Marcin Kaminski
2007	J	`jnl`	Maximum J. Comb. Optim. Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin
2007	J	`jnl`	Vertex 3-colorability of Claw-free Graphs. Algorithmic Oper. Res. Marcin Kaminski, Vadim V. Lozin
2006	J	`jnl`	Max-Cut and Max-Bisection are NP-hard on unit disk graphs CoRR Josep Díaz, Marcin Kaminski
2006	J	`jnl`	Polynomial-time algorithm for vertex k-colorability of P_5-free graphs CoRR Marcin Kaminski, Vadim V. Lozin