default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Kaminski 0001
Marcin Jakub Kaminski – Marcin Jakub Kamiński
Person information
- unicode name: Marcin Jakub Kamiński
- affiliation: University of Warsaw, Institute of Computer Science, Poland
- affiliation (former): Université Libre de Bruxelles, Department of Computer Science, Belgium
- affiliation (PhD 2007): Rutgers University, RUTCOR, New Brunswick, NJ, USA
Other persons with the same name
- Marcin Marek Kaminski
![[0000-0002-8180-6991]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-8180-6991")
(aka: Marcin Kaminski 0002) — Technical University of Lodz, Poland - Marcin Kaminski 0003 — Opole University of Technology, Faculty of Electrical Engineering, Poland (and 1 more)
- Marcin Kaminski 0004 — Industrial Research Institute for Automation and Measurements PIAP, Warsaw, Poland
2020 – today
- 2021
[j48]Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati:
Edge clique covers in graphs with independence number two. J. Graph Theory 97(2): 324-339 (2021)- 2020
- [j47]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283: 336-345 (2020)
2010 – 2019
- 2019
- [j46]Marcin Kaminski, Anna Pstrucha:
Certifying coloring algorithms for graphs without long induced paths. Discret. Appl. Math. 261: 258-267 (2019) - [j45]Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Induced minors and well-quasi-ordering. J. Comb. Theory B 134: 110-142 (2019) - 2018
- [j44]Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck:
Well-quasi-ordering H-contraction-free graphs. Discret. Appl. Math. 248: 18-27 (2018) - [j43]Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck:
Multigraphs without large bonds are wqo by contraction. J. Graph Theory 88(4): 558-565 (2018) - 2017
- [j42]Jaroslaw Blasiok, Marcin Jakub Kaminski:
Chain Minors are FPT. Algorithmica 79(3): 698-707 (2017) - [j41]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
The price of connectivity for feedback vertex set. Discret. Appl. Math. 217: 132-143 (2017) - [j40]Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon:
Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. 231: 1-3 (2017) - [j39]Petr A. Golovach, Marcin Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. SIAM J. Discret. Math. 31(1): 511-541 (2017) - [i18]Marcin Kaminski, Anna Pstrucha:
Certifying coloring algorithms for graphs without long induced paths. CoRR abs/1703.02485 (2017) - 2016
- [j38]Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos:
Minimal disconnected cuts in planar graphs. Networks 68(4): 250-259 (2016) - [j37]Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond:
Scattered packings of cycles. Theor. Comput. Sci. 647: 33-42 (2016) - [i17]Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Well-quasi-ordering H-contraction-free graphs. CoRR abs/1602.00733 (2016) - 2015
- [j36]Marcin Jakub Kaminski, Martin Milanic:
On the complexity of the identifiable subgraph problem. Discret. Appl. Math. 182: 25-33 (2015) - [j35]Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Induced minors and well-quasi-ordering. Electron. Notes Discret. Math. 49: 197-201 (2015) - [j34]Archontia C. Giannopoulou, Marcin Jakub Kaminski, Dimitrios M. Thilikos:
Forbidding Kuratowski Graphs as Immersions. J. Graph Theory 78(1): 43-60 (2015) - [c27]Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos:
Minimal Disconnected Cuts in Planar Graphs. FCT 2015: 243-254 - [i16]Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma:
The Price of Connectivity for Feedback Vertex Set. CoRR abs/1510.02639 (2015) - [i15]Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Induced minors and well-quasi-ordering. CoRR abs/1510.07135 (2015) - 2014
- [j33]Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69(3): 501-521 (2014) - [j32]Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos:
Lift-contractions. Eur. J. Comb. 35: 286-296 (2014) - [j31]Marcin Jakub Kaminski, Lukasz Kowalik:
Beyond the Vizing's Bound for at Most Seven Colors. SIAM J. Discret. Math. 28(3): 1334-1362 (2014) - [c26]Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. ESA 2014: 492-504 - [c25]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. ISAAC 2014: 208-219 - [c24]Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma:
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. MFCS (2) 2014: 57-68 - [c23]Paul S. Bonsma, Marcin Kaminski, Marcin Wrochna:
Reconfiguring Independent Sets in Claw-Free Graphs. SWAT 2014: 86-97 - [c22]Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. TAMC 2014: 341-351 - [i14]Paul S. Bonsma, Marcin Kaminski, Marcin Wrochna:
Reconfiguring Independent Sets in Claw-Free Graphs. CoRR abs/1403.0359 (2014) - [i13]Takehiro Ito, Marcin Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. CoRR abs/1406.6567 (2014) - [i12]Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond:
Induced packings of cycles. CoRR abs/1409.2733 (2014) - [i11]Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. CoRR abs/1412.3955 (2014) - 2013
- [j30]Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan:
Finding and listing induced paths and cycles. Discret. Appl. Math. 161(4-5): 633-641 (2013) - [j29]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Characterizing graphs of small carving-width. Discret. Appl. Math. 161(13-14): 1888-1893 (2013) - [j28]Jirí Fiala, Marcin Kaminski, Daniël Paulusma:
A note on contracting claw-free graphs. Discret. Math. Theor. Comput. Sci. 15(2): 223-232 (2013) - [j27]Marcin Kaminski:
Review of Boolean Models and Methods in Mathematics, Computer Science, and Engineering by Yves Crama and Peter L. Hammer. SIGACT News 44(1): 21-24 (2013) - [j26]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. 481: 74-84 (2013) - [c21]Jaroslaw Blasiok, Marcin Kaminski:
Chain Minors Are FPT. IPEC 2013: 78-83 - [c20]Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos:
Excluding Graphs as Immersions in Surface Embedded Graphs. WG 2013: 274-285 - [i10]Jaroslaw Blasiok, Marcin Kaminski:
Chain minors are FPT. CoRR abs/1304.5849 (2013) - 2012
- [j25]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-Path Problem for Claw-free Graphs. Algorithmica 62(1-2): 499-519 (2012) - [j24]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica 62(1-2): 537-563 (2012) - [j23]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Containment relations in split graphs. Discret. Appl. Math. 160(1-2): 155-163 (2012) - [j22]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
On graph contractions and induced minors. Discret. Appl. Math. 160(6): 799-809 (2012) - [j21]Takehiro Ito, Marcin Kaminski, Erik D. Demaine:
Reconfiguration of list edge-colorings in a graph. Discret. Appl. Math. 160(15): 2199-2207 (2012) - [j20]Jirí Fiala, Marcin Kaminski, Daniël Paulusma:
Detecting induced star-like minors in polynomial time. J. Discrete Algorithms 17: 74-85 (2012) - [j19]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. 420: 28-35 (2012) - [j18]Marcin Kaminski:
max-cut and containment relations in graphs. Theor. Comput. Sci. 438: 89-95 (2012) - [j17]Marcin Kaminski, Paul Medvedev, Martin Milanic:
Complexity of independent set reconfigurability problems. Theor. Comput. Sci. 439: 9-15 (2012) - [c19]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Characterizing Graphs of Small Carving-Width. COCOA 2012: 360-370 - [c18]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski:
Induced Immersions. ISAAC 2012: 299-308 - [c17]Marcin Kaminski, Naomi Nishimura:
Finding an induced path of given parity in planar graphs in polynomial time. SODA 2012: 656-670 - [c16]Marcin Kaminski, Dimitrios M. Thilikos:
Contraction checking in graphs on surfaces. STACS 2012: 182-193 - [i9]Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos:
Forbidding Kuratowski Graphs as Immersions. CoRR abs/1207.5329 (2012) - [i8]Marcin Kaminski, Lukasz Kowalik:
Beyond the Vizing's bound for at most seven colors. CoRR abs/1211.5031 (2012) - 2011
- [j16]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
On disconnected cuts and separators. Discret. Appl. Math. 159(13): 1345-1351 (2011) - [j15]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Lift Contractions. Electron. Notes Discret. Math. 38: 407-412 (2011) - [j14]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms 9(3): 299-306 (2011) - [j13]Marcin Kaminski, Paul Medvedev, Martin Milanic:
The plane-width of graphs. J. Graph Theory 68(3): 229-245 (2011) - [j12]Marcin Kaminski, Paul Medvedev, Martin Milanic:
Shortest paths between shortest paths. Theor. Comput. Sci. 412(39): 5205-5210 (2011) - [j11]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Parameterizing cut sets in a graph by the number of their components. Theor. Comput. Sci. 412(45): 6340-6350 (2011) - [c15]Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos:
Odd cyclic surface separators in planar graphs. CTW 2011: 165-167 - [c14]Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC 2011: 110-119 - [c13]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79 - [c12]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma:
Contracting a Chordal Graph to a Split Graph or a Tree. MFCS 2011: 339-350 - 2010
- [j10]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
Deciding k-Colorability of P5-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010) - [j9]Gwenaël Joret, Marcin Kaminski, Dirk Oliver Theis:
The Cops and Robber game on graphs with forbidden (induced) subgraphs. Contributions Discret. Math. 5(2) (2010) - [j8]Josep Díaz, Marcin Kaminski, Dimitrios M. Thilikos:
A note on the subgraphs of the (2×∞)-grid. Discret. Math. 310(3): 531-536 (2010) - [c11]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Contractions of Planar Graphs in Polynomial Time. ESA (1) 2010: 122-133 - [c10]Marcin Kaminski, Paul Medvedev, Martin Milanic:
Shortest Paths between Shortest Paths and Independent Sets. IWOCA 2010: 56-67 - [c9]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514 - [c8]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-path Problem for Claw-free Graphs. STACS 2010: 371-382 - [c7]Marcin Kaminski, Lukasz Kowalik:
Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. SWAT 2010: 395-407 - [c6]Marcin Kaminski:
max-cut and Containment Relations in Graphs. WG 2010: 15-26 - [i7]Marcin Kaminski, Paul Medvedev, Martin Milanic:
Shortest paths between shortest paths and independent sets. CoRR abs/1008.4563 (2010) - [i6]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Contracting planar graphs to contractions of triangulations. CoRR abs/1012.2460 (2010)
2000 – 2009
- 2009
- [j7]Marcin Kaminski, Vadim V. Lozin, Martin Milanic:
Recent developments on graphs of bounded clique-width. Discret. Appl. Math. 157(12): 2747-2761 (2009) - [j6]Marcin Kaminski, Paul Medvedev, Martin Milanic:
On the Plane-Width of Graphs. Electron. Notes Discret. Math. 34: 633-637 (2009) - [c5]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523 - [c4]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Parameterizing Cut Sets in a Graph by the Number of Their Components. ISAAC 2009: 605-615 - [c3]Takehiro Ito, Marcin Kaminski, Erik D. Demaine:
Reconfiguration of List Edge-Colorings in a Graph. WADS 2009: 375-386 - [c2]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352 - [i5]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-path problem for claw-free graphs. CoRR abs/0912.5468 (2009) - 2008
- [c1]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
A Note on k-Colorability of P5-Free Graphs. MFCS 2008: 387-394 - [i4]Marcin Kaminski, Paul Medvedev, Martin Milanic:
The Plane-Width of Graphs. CoRR abs/0812.4346 (2008) - 2007
- [j5]Marcin Kaminski, Vadim V. Lozin:
Vertex 3-colorability of Claw-free Graphs. Algorithmic Oper. Res. 2(1) (2007) - [j4]Vadim V. Lozin, Marcin Kaminski:
Coloring edges and vertices of graphs without short or long cycles. Contributions Discret. Math. 2(1) (2007) - [j3]Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin:
Maximum k -regular induced subgraphs. J. Comb. Optim. 14(4): 455-463 (2007) - [j2]Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos:
An exact algorithm for MAX-CUT in sparse graphs. Oper. Res. Lett. 35(3): 403-408 (2007) - [j1]Josep Díaz, Marcin Kaminski:
MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theor. Comput. Sci. 377(1-3): 271-276 (2007) - [i3]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
Deciding k-colourability of P_5-free graphs in polynomial time. CoRR abs/cs/0702043 (2007) - 2006
- [i2]Marcin Kaminski, Vadim V. Lozin:
Polynomial-time algorithm for vertex k-colorability of P_5-free graphs. CoRR abs/cs/0607115 (2006) - [i1]Josep Díaz, Marcin Kaminski:
Max-Cut and Max-Bisection are NP-hard on unit disk graphs. CoRR abs/cs/0609128 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-24 00:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
