( en | de | ru )

 

Disambiguation of "Kaminski, Marcin"

Author of the publication

copydeleteadd this publication to your clipboard
A note on the subgraphs of the (2×∞)-grid.

, , and . Discret. Math., 310 (3): 531-536 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Marcin Wlodarski

Marcin Å0yszkiewicz

Marcin Grzegorzek

Marcin Teodorczyk

Marcin Wlodarczak

 

Other publications of authors with the same name

Parameterizing Cut Sets in a Graph by the Number of Their Components., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 605-615. Springer, (2009)Approximating the Maximum 3- and 4-Edge-Colorable Subgraph., and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 395-407. Springer, (2010)Contraction checking in graphs on surfaces., and . STACS, volume 14 of LIPIcs, page 182-193. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)A note on the subgraphs of the (2×∞)-grid., , and . Discret. Math., 310 (3): 531-536 (2010)On graph contractions and induced minors., , , , and . Discret. Appl. Math., 160 (6): 799-809 (2012)Increasing the Minimum Degree of a Graph by Contractions., , , and . IPEC, volume 7112 of Lecture Notes in Computer Science, page 67-79. Springer, (2011)Stochastic perturbation approach to the wavelet-based analysis.. Numerical Lin. Alg. with Applic., 11 (4): 355-370 (2004)Multiresolutional Techniques in Finite Element Method Solution of Eigenvalue Problem.. International Conference on Computational Science, volume 3037 of Lecture Notes in Computer Science, page 171-178. Springer, (2004)Polynomial-time algorithm for vertex k-colorability of P_5-free graphs, and . CoRR, (2006)Max-Cut and Max-Bisection are NP-hard on unit disk graphs, and . CoRR, (2006)