dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Marcin Jakub Kaminski Home Page Coauthor index pubzone.org

Marcin Kaminski

Department of Computer Science, Université Libre de Bruxelles, Belgium

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Naomi Nishimura: Finding an induced path of given parity in planar graphs in polynomial time. SODA 2012: 656-670
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Dimitrios M. Thilikos: Contraction checking in graphs on surfaces. STACS 2012: 182-193
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí 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)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim 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)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Containment relations in split graphs. Discrete Applied Mathematics 160(1-2): 155-163 (2012)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On graph contractions and induced minors. Discrete Applied Mathematics 160(6): 799-809 (2012)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr 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)
2011
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos: Odd cyclic surface separators in planar graphs. CTW 2011: 165-167
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRé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
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Marcin Kaminski, Daniël Paulusma: Contracting a Chordal Graph to a Split Graph or a Tree. MFCS 2011: 339-350
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: On disconnected cuts and separators. Discrete Applied Mathematics 159(13): 1345-1351 (2011)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Lift Contractions. Electronic Notes in Discrete Mathematics 38: 407-412 (2011)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms 9(3): 299-306 (2011)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Paul Medvedev, Martin Milanic: The plane-width of graphs. Journal of Graph Theory 68(3): 229-245 (2011)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Paul Medvedev, Martin Milanic: Shortest paths between shortest paths. Theor. Comput. Sci. 412(39): 5205-5210 (2011)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakehiro 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)
2010
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contractions of Planar Graphs in Polynomial Time. ESA (1) 2010: 122-133
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Paul Medvedev, Martin Milanic: Shortest Paths between Shortest Paths and Independent Sets. IWOCA 2010: 56-67
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path Problem for Claw-free Graphs. STACS 2010: 371-382
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Lukasz Kowalik: Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. SWAT 2010: 395-407
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski: max-cut and Containment Relations in Graphs. WG 2010: 15-26
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChí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)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Paul Medvedev, Martin Milanic: Shortest paths between shortest paths and independent sets CoRR abs/1008.4563: (2010)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contracting planar graphs to contractions of triangulations CoRR abs/1012.2460: (2010)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosep Díaz, Marcin Kaminski, Dimitrios M. Thilikos: A note on the subgraphs of the (2× INFINITY )-grid. Discrete Mathematics 310(3): 531-536 (2010)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski: Generalized stochastic perturbation technique in engineering computations. Mathematical and Computer Modelling 51(3-4): 272-285 (2010)
2009
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakehiro 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakehiro Ito, Marcin Kaminski, Erik D. Demaine: Reconfiguration of List Edge-Colorings in a Graph. WADS 2009: 375-386
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Marcin Kaminski, Daniël Paulusma: Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path problem for claw-free graphs CoRR abs/0912.5468: (2009)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Vadim V. Lozin, Martin Milanic: Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics 157(12): 2747-2761 (2009)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Paul Medvedev, Martin Milanic: On the Plane-Width of Graphs. Electronic Notes in Discrete Mathematics 34: 633-637 (2009)
2008
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChí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
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Paul Medvedev, Martin Milanic: The Plane-Width of Graphs CoRR abs/0812.4346: (2008)
2007
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Vadim V. Lozin: Vertex 3-colorability of Claw-free Graphs. Algorithmic Operations Research 2(1): (2007)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChí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)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDomingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin: Maximum k -regular induced subgraphs. J. Comb. Optim. 14(4): 455-463 (2007)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFederico 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)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosep 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)
2006
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Kaminski, Vadim V. Lozin: Polynomial-time algorithm for vertex k-colorability of P_5-free graphs CoRR abs/cs/0607115: (2006)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosep Díaz, Marcin Kaminski: Max-Cut and Max-Bisection are NP-hard on unit disk graphs CoRR abs/cs/0609128: (2006)

Coauthor Index

1Rémy Belmonte [35]
2Domingos Moreira Cardoso [5]
3Federico Della Croce [4]
4Erik D. Demaine [14]
5Josep Díaz [1] [3] [18]
6Jirí Fiala [12] [24] [42]
7Petr A. Golovach [16] [32] [34] [35] [36] [37] [38] [40]
8Pinar Heggernes [35]
9Chính T. Hoàng [6] [9] [21]
10Pim van 't Hof [13] [25] [35] [39] [41]
11Takehiro Ito [14] [15] [28] [33]
12Lukasz Kowalik [23]
13Bernard Lidický [12] [24] [42]
14Vadim V. Lozin [2] [5] [6] [7] [9] [11] [21]
15Paul Medvedev [8] [10] [20] [26] [29] [30]
16Martin Milanic [8] [10] [11] [20] [26] [29] [30]
17Naomi Nishimura [44]
18Vangelis Th. Paschos [4]
19Daniël Paulusma [12] [13] [15] [16] [19] [24] [25] [27] [28] [31] [32] [33] [34] [35] [36] [38] [39] [40] [41] [42]
20Joe Sawada [6] [9] [21]
21Xiao Shu [6] [9] [21]
22Stefan Szeider [25] [39]
23Dimitrios M. Thilikos [15] [16] [18] [19] [25] [27] [28] [31] [32] [33] [36] [37] [38] [39] [40] [43]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page