( en | de | ru )

 

Disambiguation of "Kaminski, Marcin"

Author of the publication

copydeleteadd this publication to your clipboard
A Note on k-Colorability of P5-Free Graphs.

, , , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 387-394. Springer, (2008)

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 Grzegorzek

Marcin Å0yszkiewicz

Marcin Teodorczyk

Marcin Siatkowski

 

Other publications of authors with the same name

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)Stochastic perturbation approach to the wavelet-based analysis.. Numerical Lin. Alg. with Applic., 11 (4): 355-370 (2004)Forbidding Kuratowski Graphs as Immersions, , and . CoRR, (2012)Max-Cut and Max-Bisection are NP-hard on unit disk graphs, and . CoRR, (2006)Polynomial-time algorithm for vertex k-colorability of P_5-free graphs, and . CoRR, (2006)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)A Modified Fuzzy Luenberger Observer for a Two-Mass Drive System., , and . IEEE Trans. Ind. Informatics, 11 (2): 531-539 (2015)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)Deciding k-Colorability of P5-Free Graphs in Polynomial Time., , , , and . Algorithmica, 57 (1): 74-81 (2010)