#### Filter Results:

- Full text PDF available (86)

#### Publication Year

1984

2019

- This year (22)
- Last 5 years (74)
- Last 10 years (167)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New… (More)

- Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
- Algorithmica
- 2010

We present an exact algorithm that decides, for every fixed <i>r</i> ≥ 2 in time <i>O(m) + 2<sup>O(k2</sup>)</i> whether a given set of <i>m</i> clauses of size <i>r</i> admits a truth assignment… (More)

- Gregory Gutin, Anders Yeo, Alexey Zverovich
- Discrete Applied Mathematics
- 2002

Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN), popular choices for tour construction heuristics, work at acceptable level for the Euclidean… (More)

- Gregory Gutin, Daniel Karapetyan
- Natural Computing
- 2009

The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a… (More)

- Noga Alon, Gregory Gutin, Michael Krivelevich
- J. Algorithms
- 2004

Let P be an optimization problem, and let A be an approximation algorithm for P . The domination ratio domr(A,n) is the maximum real q such that the solution x(I) obtained by A for any instance I of… (More)

- David A. Cohen, Jason Crampton, Andrei V. Gagarin, Gregory Gutin, Mark Lody Jones
- J. Artif. Intell. Res.
- 2014

The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We… (More)

- Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
- Eur. J. Comb.
- 2008

For graphs G and H, a mapping f : V (G)→V (H) is a homomorphism of G to H if uv ∈ E(G) implies f(u)f(v) ∈ E(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the… (More)

- Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann
- Discrete Mathematics
- 1997

In [19] Huang gave a characterization of local tournaments. His characterization involves arc-reversals and therefore may not be easily used to solve other structural problems on locally semicomplete… (More)

- Gregory Gutin
- Journal of Graph Theory
- 1995

A digraph obtained by replacing each edge of a complete m-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete m-partite digraph. We… (More)

- Fred W. Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich
- European Journal of Operational Research
- 2001

Non Euclidean TSP construction heuristics and especially asymmetric TSP construc tion heuristics have been neglected in the literature by comparison with the extensive e orts devoted to studying… (More)