From post

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.

 

Другие публикации лиц с тем же именем

A new DSATUR-based algorithm for the Equitable Coloring Problem., , и . CoRR, (2013)The Packing Coloring Problem for (q, q-4) Graphs., , и . ISCO, том 7422 из Lecture Notes in Computer Science, стр. 309-319. Springer, (2012)The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs., , и . Electron. Notes Discret. Math., (2010)Near-perfect graphs with polyhedral N+(G)., , , и . Electron. Notes Discret. Math., (2011)The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs., , и . Electron. Notes Discret. Math., (2010)An exact DSatur-based algorithm for the Equitable Coloring Problem., , и . Electron. Notes Discret. Math., (2013)The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems., , и . Electron. Notes Discret. Math., (2010)Total dominating sequences in trees, split graphs, and under modular decomposition., , , и . Discret. Optim., (2018)On the computational complexity of combinatorial flexibility problems., и . Int. J. Comput. Math., 87 (15): 3330-3343 (2010)Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs., , , и . Math. Program., 162 (1-2): 201-223 (2017)