( en | de | ru )

 

Disambiguation of "Gutin, Gregory Z."

Author of the publication

copydeleteadd this publication to your clipboard
Minimum Cost Homomorphism Dichotomy for Oriented Cycles.

, , and . AAIM, volume 5034 of Lecture Notes in Computer Science, page 224-234. 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.

Ralf Hartmut Güting

Damaris Güting

Hermann Güting

Peter-Matthias Güting

Eberhard Güting

 

Other publications of authors with the same name

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming., , , , and . IPEC, volume 6478 of Lecture Notes in Computer Science, page 158-169. Springer, (2010)Properly Coloured Cycles and Paths: Results and Open Problems., and . Graph Theory, Computational Intelligence and Thought, volume 5420 of Lecture Notes in Computer Science, page 200-208. Springer, (2009)Minimum Cost Homomorphism Dichotomy for Oriented Cycles., , and . AAIM, volume 5034 of Lecture Notes in Computer Science, page 224-234. Springer, (2008)Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems.. Electron. Notes Discret. Math., (2009)Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems., , and . WAOA, volume 4368 of Lecture Notes in Computer Science, page 214-225. Springer, (2006)Kings in semicomplete multipartite digraphs., and . J. Graph Theory, 33 (3): 177-183 (2000)On the number of quasi-kernels in digraphs., , , and . J. Graph Theory, 46 (1): 48-56 (2004)Parameterized Complexity of Satisfying Almost All Linear Equations over $F_2$., , , and . Theory Comput. Syst., 52 (4): 719-728 (2013)Alternative parameterizations of Metric Dimension., , , and . Theor. Comput. Sci., (2020)Parameterized Eulerian strong component arc deletion problem on tournaments., , , and . Inf. Process. Lett., 112 (6): 249-251 (2012)