( en | de | ru )

 

Disambiguation of "Fiala, Jirí"

Author of the publication

copydeleteadd this publication to your clipboard
Graph Subcolorings: Complexity and Algorithms.

, , , and . SIAM J. Discret. Math., 16 (4): 635-650 (2003)

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.

Jirí Mencák

Jirí Panyr

Jirí Friml

Jirí Simácek

Günther Jirikowski

 

Other publications of authors with the same name

A complete complexity classification of the role assignment problem., and . Theor. Comput. Sci., 349 (1): 67-81 (2005)Outerplanar and Forest Storyplans., , , , and . CoRR, (2023)Systems of distant representatives., , and . Discret. Appl. Math., 145 (2): 306-316 (2005)Generalized H-coloring and H-covering of Trees., , , and . Nord. J. Comput., 10 (3): 206-223 (2003)Algorithmic Aspects of Regular Graph Covers., , , and . CoRR, (2016)Distance Constrained Labeling of Precolored Trees., , and . ICTCS, volume 2202 of Lecture Notes in Computer Science, page 285-292. Springer, (2001)The Computational Complexity of the Role Assignment Problem., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 817-828. Springer, (2003)Elegant Distance Constrained Labelings of Trees., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 58-67. Springer, (2004)Complexity of Partial Covers of Graphs., and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 537-549. Springer, (2001)Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms., , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 340-351. Springer, (2005)