Author of the publication

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.

 

Other publications of authors with the same name

On the complexity of coloring areflexive h-ary relations with given permutation group., , and . Ars Comb., (1998)Independent packings in structured graphs., and . Math. Program., 105 (2-3): 201-213 (2006)Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs, , , and . CoRR, (2006)Matrix Partitions of Split Graphs., , and . CoRR, (2013)Two algorithms for general list matrix partitions., , , and . SODA, page 870-876. SIAM, (2005)Correspondence Homomorphisms to Reflexive Graphs., and . Electron. Notes Discret. Math., (2017)Homomorphisms to powers of digraphs., and . Discret. Math., 244 (1-3): 31-41 (2002)Counting Partitions of Graphs., , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 227-236. Springer, (2012)Small H-Coloring Problems for Bounded Degree Digraphs., and . COCOON, volume 7936 of Lecture Notes in Computer Science, page 579-590. Springer, (2013)Retractions to Pseudoforests., , , , and . SIAM J. Discret. Math., 24 (1): 101-112 (2010)