Marcin Kaminski
Marcin Jakub Kamiński
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j31 |      | Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan: Finding and listing induced paths and cycles. Discrete Applied Mathematics 161(4-5): 633-641 (2013) |
| j30 | | 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) |
| j29 | | 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) |
| i10 | | |
| 2012 | ||
| j28 | | 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) |
| j27 | | 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) |
| j26 | | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Containment relations in split graphs. Discrete Applied Mathematics 160(1-2): 155-163 (2012) |
| j25 | | Pim 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) |
| j24 | | Takehiro Ito, Marcin Kaminski, Erik D. Demaine: Reconfiguration of list edge-colorings in a graph. Discrete Applied Mathematics 160(15): 2199-2207 (2012) |
| j23 | | Jirí Fiala, Marcin Kaminski, Daniël Paulusma: Detecting induced star-like minors in polynomial time. J. Discrete Algorithms 17: 74-85 (2012) |
| j22 | | 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) |
| j21 | | |
| j20 | | 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 | | |
| 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 | ||
| j19 | | Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: On disconnected cuts and separators. Discrete Applied Mathematics 159(13): 1345-1351 (2011) |
| j18 | | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Lift Contractions. Electronic Notes in Discrete Mathematics 38: 407-412 (2011) |
| j17 | | Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms 9(3): 299-306 (2011) |
| j16 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: The plane-width of graphs. Journal of Graph Theory 68(3): 229-245 (2011) |
| j15 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: Shortest paths between shortest paths. Theor. Comput. Sci. 412(39): 5205-5210 (2011) |
| j14 | | 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 | ||
| j13 | | 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) |
| j12 | | Gwenaël Joret, Marcin Kaminski, Dirk Oliver Theis: The Cops and Robber game on graphs with forbidden (induced) subgraphs. Contributions to Discrete Mathematics 5(2) (2010) |
| j11 | | Josep Díaz, Marcin Kaminski, Dimitrios M. Thilikos: A note on the subgraphs of the (2× INFINITY )-grid. Discrete Mathematics 310(3): 531-536 (2010) |
| j10 | | Marcin Kaminski: Generalized stochastic perturbation technique in engineering computations. Mathematical and Computer Modelling 51(3-4): 272-285 (2010) |
| j9 | | Teresa Orlowska-Kowalska, Marcin Kaminski, Krzysztof Szabat: Implementation of a Sliding-Mode Controller With an Integral Function and Fuzzy Gain Value for the Electrical Drive With an Elastic Joint. IEEE Transactions on Industrial Electronics 57(4): 1309-1317 (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 | | |
| 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) |
| 2009 | ||
| j8 | | Marcin Kaminski, Vadim V. Lozin, Martin Milanic: Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics 157(12): 2747-2761 (2009) |
| j7 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: On the Plane-Width of Graphs. Electronic Notes in Discrete Mathematics 34: 633-637 (2009) |
| j6 | | Teresa Orlowska-Kowalska, Marcin Kaminski: Effectiveness of Saliency-Based Methods in Optimization of Neural State Estimators of the Drive System With Elastic Couplings. IEEE Transactions on Industrial Electronics 56(10): 4043-4051 (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 Operations Research 2(1) (2007) |
| j4 | | Vadim V. Lozin, Marcin Kaminski: Coloring edges and vertices of graphs without short or long cycles. Contributions to Discrete Mathematics 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) |
Colors in the list of coauthors
Last update Tue May 21 20:20:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page