 | 2010 |
|---|
| 130 |       | Robert Crowston,
Gregory Gutin,
M. Jones,
E. J. Kim,
I. Z. Ruzsa:
Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized Above Average
CoRR abs/1002.0286: (2010) |
| 129 | | Gregory Gutin,
Eun Jung Kim:
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops.
Discrete Applied Mathematics 158(4): 319-330 (2010) |
| 128 | | Jean Daligault,
Gregory Gutin,
Eun Jung Kim,
Anders Yeo:
FPT algorithms and kernels for the Directed k-Leaf problem.
J. Comput. Syst. Sci. 76(2): 144-152 (2010) |
| 2009 |
|---|
| 127 | | Nathann Cohen,
Fedor V. Fomin,
Gregory Gutin,
Eun Jung Kim,
Saket Saurabh,
Anders Yeo:
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem.
COCOON 2009: 37-46 |
| 126 | | Joseph Reddington,
Gregory Gutin,
Adrian Johnstone,
Elizabeth Scott,
Anders Yeo:
Better Than Optimal: Fast Identification of Custom Instruction Candidates.
CSE (2) 2009: 17-24 |
| 125 | | Gregory Gutin,
Daniel Karapetyan:
Local Search Heuristics for the Multidimensional Assignment Problem.
Graph Theory, Computational Intelligence and Thought 2009: 100-115 |
| 124 | | Gregory Gutin,
Eun Jung Kim:
Properly Coloured Cycles and Paths: Results and Open Problems.
Graph Theory, Computational Intelligence and Thought 2009: 200-208 |
| 123 | | Gregory Gutin,
Daniel Karapetyan,
Igor Razgon:
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs.
IWPEC 2009: 222-233 |
| 122 | | Gregory Gutin,
Eun Jung Kim,
Stefan Szeider,
Anders Yeo:
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds.
IWPEC 2009: 234-245 |
| 121 | | Gregory Gutin,
Daniel Karapetyan:
A Memetic Algorithm for the Multidimensional Assignment Problem.
SLS 2009: 125-129 |
| 120 | | Gregory Gutin:
Traveling Salesman Problem.
Encyclopedia of Optimization 2009: 3935-3944 |
| 119 | | Gregory Gutin:
Domination Analysis in Combinatorial Optimization.
Encyclopedia of Optimization 2009: 792-802 |
| 118 | | Nathann Cohen,
Fedor V. Fomin,
Gregory Gutin,
Eun Jung Kim,
Saket Saurabh,
Anders Yeo:
Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem
CoRR abs/0903.0938: (2009) |
| 117 | | Gregory Gutin,
Daniel Karapetyan:
A Memetic Algorithm for the Multidimensional Assignment Problem
CoRR abs/0906.0862: (2009) |
| 116 | | Gregory Gutin,
Eun Jung Kim,
Stefan Szeider,
Anders Yeo:
A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound
CoRR abs/0906.1356: (2009) |
| 115 | | Gregory Gutin,
Daniel Karapetyan,
Igor Razgon:
FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
CoRR abs/0906.1359: (2009) |
| 114 | | Daniel Karapetyan,
Gregory Gutin,
Boris Goldengorin:
Empirical evaluation of construction heuristics for the multidimensional assignment problem
CoRR abs/0906.2960: (2009) |
| 113 | | Gregory Gutin,
Eun Jung Kim,
Michael Lampis,
Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds
CoRR abs/0907.4488: (2009) |
| 112 | | Gregory Gutin,
Eun Jung Kim,
Stefan Szeider,
Anders Yeo:
Solving MAX-2-SAT Above a Tight Lower Bound
CoRR abs/0907.4573: (2009) |
| 111 | | Gregory Gutin,
Eun Jung Kim,
Matthias Mnich,
Anders Yeo:
Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound
CoRR abs/0907.5427: (2009) |
| 110 | | Robert Crowston,
Gregory Gutin,
Mark Jones:
Note on Max Lin-2 above Average
CoRR abs/0911.5384: (2009) |
| 109 | | Peter Dankelmann,
Gregory Gutin,
Eun Jung Kim:
On complexity of Minimum Leaf Out-Branching problem.
Discrete Applied Mathematics 157(13): 3000-3004 (2009) |
| 108 | | Gregory Gutin,
Anders Yeo:
On the number of connected convex subgraphs of a connected acyclic digraph.
Discrete Applied Mathematics 157(7): 1660-1662 (2009) |
| 107 | | Gregory Gutin:
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems.
Electronic Notes in Discrete Mathematics 32: 75-82 (2009) |
| 106 | | Gregory Gutin,
Daniel Karapetyan:
A selection of useful theoretical tools for the design and analysis of optimization heuristics.
Memetic Computing 1(1): 25-34 (2009) |
| 105 | | Paul Balister,
Stefanie Gerke,
Gregory Gutin:
Convex Sets in Acyclic Digraphs.
Order 26(1): 95-100 (2009) |
| 104 | | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Spanning Directed Trees with Many Leaves.
SIAM J. Discrete Math. 23(1): 466-476 (2009) |
| 103 | | Gregory Gutin,
Igor Razgon,
Eun Jung Kim:
Minimum leaf out-branching and related problems.
Theor. Comput. Sci. 410(45): 4571-4579 (2009) |
| 2008 |
|---|
| 102 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles.
AAIM 2008: 224-234 |
| 101 | | Gregory Gutin,
Igor Razgon,
Eun Jung Kim:
Minimum Leaf Out-Branching Problems.
AAIM 2008: 235-246 |
| 100 | | Gregory Gutin,
Adrian Johnstone,
Joseph Reddington,
Elizabeth Scott,
Anders Yeo:
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph.
WG 2008: 206-217 |
| 99 | | Gregory Gutin,
Stefan Szeider,
Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems.
Algorithmica 52(2): 133-152 (2008) |
| 98 | | Gregory Gutin,
Eun Jung Kim,
Igor Razgon:
Minimum Leaf Out-Branching Problems
CoRR abs/0801.1979: (2008) |
| 97 | | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Spanning directed trees with many leaves
CoRR abs/0803.0701: (2008) |
| 96 | | Gregory Gutin,
Daniel Karapetyan:
A Memetic Algorithm for the Generalized Traveling Salesman Problem
CoRR abs/0804.0722: (2008) |
| 95 | | Gregory Gutin,
Daniel Karapetyan:
Generalized Traveling Salesman Problem Reduction Algorithms
CoRR abs/0804.0735: (2008) |
| 94 | | Gregory Gutin,
Eun Jung Kim:
Properly Coloured Cycles and Paths: Results and Open Problems
CoRR abs/0805.3901: (2008) |
| 93 | | Gregory Gutin,
Daniel Karapetyan:
Local Search Heuristics For The Multidimensional Assignment Problem
CoRR abs/0806.3258: (2008) |
| 92 | | Peter Dankelmann,
Gregory Gutin,
Eun Jung Kim:
On Complexity of Minimum Leaf Out-branching Problem
CoRR abs/0808.0980: (2008) |
| 91 | | Jean Daligault,
Gregory Gutin,
Eun Jung Kim,
Anders Yeo:
FPT Algorithms and Kernels for the Directed $k$-Leaf Problem
CoRR abs/0810.4946: (2008) |
| 90 | | Gregory Gutin,
Anders Yeo:
Some Parameterized Problems On Digraphs.
Comput. J. 51(3): 363-371 (2008) |
| 89 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum cost homomorphisms to semicomplete multipartite digraphs.
Discrete Applied Mathematics 156(12): 2429-2435 (2008) |
| 88 | | Gregory Gutin,
Pavol Hell,
Arash Rafiey,
Anders Yeo:
A dichotomy for minimum cost graph homomorphisms.
Eur. J. Comb. 29(4): 900-911 (2008) |
| 87 | | Gregory Gutin,
Boris Goldengorin,
Jing Huang:
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems.
J. Heuristics 14(2): 169-181 (2008) |
| 86 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs.
SIAM J. Discrete Math. 22(4): 1624-1639 (2008) |
| 2007 |
|---|
| 85 |  | Erik D. Demaine,
Gregory Gutin,
Dániel Marx,
Ulrike Stege:
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 84 | | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems.
FSTTCS 2007: 316-327 |
| 83 | | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems.
ICALP 2007: 352-362 |
| 82 | | Erik D. Demaine,
Gregory Gutin,
Dániel Marx,
Ulrike Stege:
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| 81 | | Erik D. Demaine,
Gregory Gutin,
Dániel Marx,
Ulrike Stege:
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| 80 | | Gregory Gutin,
Daniel Karapetyan,
Natalio Krasnogor:
Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem.
NICSO 2007: 199-210 |
| 79 | | Gregory Gutin,
Anders Yeo:
The Greedy Algorithm for the Symmetric TSP.
Algorithmic Operations Research 2(1): (2007) |
| 78 | | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems
CoRR abs/0707.1095: (2007) |
| 77 | | Gregory Gutin:
Note on edge-colored graphs and digraphs without properly colored cycles
CoRR abs/0707.4580: (2007) |
| 76 | | Gregory Gutin,
Eun Jung Kim:
On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments
CoRR abs/0708.2544: (2007) |
| 75 | | Eun Jung Kim,
Gregory Gutin:
Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops
CoRR abs/0708.2545: (2007) |
| 74 | | Arvind Gupta,
Gregory Gutin,
Mehdi Karimi,
Eun Jung Kim,
Arash Rafiey:
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
CoRR abs/0712.0804: (2007) |
| 73 | | Paul N. Balister,
Stefanie Gerke,
Gregory Gutin,
Adrian Johnstone,
Joseph Reddington,
Elizabeth Scott,
A. Soleimanfallah,
Anders Yeo:
Algorithms for Generating Convex Sets in Acyclic Digraphs
CoRR abs/0712.2661: (2007) |
| 72 | | Paul N. Balister,
Stefanie Gerke,
Gregory Gutin:
Convex sets in acyclic digraphs
CoRR abs/0712.2678: (2007) |
| 71 | | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems
CoRR abs/cs/0702049: (2007) |
| 70 | | Gregory Gutin,
Arash Rafiey,
Stefan Szeider,
Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Theory Comput. Syst. 41(3): 521-538 (2007) |
| 2006 |
|---|
| 69 | | Gregory Gutin,
Arash Rafiey,
Stefan Szeider,
Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value.
CIAC 2006: 356-367 |
| 68 | | Gregory Gutin,
Stefan Szeider,
Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems.
IWPEC 2006: 60-71 |
| 67 | | Gregory Gutin,
Boris Goldengorin,
Jing Huang:
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.
WAOA 2006: 214-225 |
| 66 | | Gregory Gutin,
Angela Koller,
Anders Yeo:
Note on Upper Bounds for TSP Domination Number.
Algorithmic Operations Research 1(1): (2006) |
| 65 | | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
On-line bin Packing with Two Item Sizes.
Algorithmic Operations Research 1(2): (2006) |
| 64 | | Gregory Gutin,
Pavol Hell,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs
CoRR abs/cs/0602038: (2006) |
| 63 | | Gregory Gutin,
Stefan Szeider,
Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems
CoRR abs/cs/0604095: (2006) |
| 62 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
CoRR abs/cs/0608101: (2006) |
| 61 | | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Domination analysis for minimum multiprocessor scheduling.
Discrete Applied Mathematics 154(18): 2613-2619 (2006) |
| 60 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo,
Michael Tso:
Level of repair analysis and minimum cost homomorphisms of graphs.
Discrete Applied Mathematics 154(6): 881-889 (2006) |
| 59 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum cost and list homomorphisms to semicomplete digraphs.
Discrete Applied Mathematics 154(6): 890-897 (2006) |
| 58 | | Gregory Gutin,
Arash Rafiey,
Simone Severini,
Anders Yeo:
Hamilton cycles in digraphs of unitary matrices.
Discrete Mathematics 306(24): 3315-3320 (2006) |
| 57 | | Gregory Gutin,
Abraham Punnen:
The traveling salesman problem.
Discrete Optimization 3(1): 1 (2006) |
| 56 | | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs.
Discrete Optimization 3(1): 86-94 (2006) |
| 55 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
On n-partite Tournaments with Unique n-cycle.
Graphs and Combinatorics 22(2): 241-249 (2006) |
| 54 | | Jinfeng Feng,
Hans-Erik Giesen,
Yubao Guo,
Gregory Gutin,
Tommy R. Jensen,
Arash Rafiey:
Characterization of edge-colored complete graphs with properly colored Hamilton paths.
Journal of Graph Theory 53(4): 333-346 (2006) |
| 2005 |
|---|
| 53 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo,
Michael Tso:
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs.
AAIM 2005: 427-439 |
| 52 | | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs.
ACiD 2005: 81-94 |
| 51 | | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Optimal On-Line Bin Packing with Two Item Sizes.
ACiD 2005: 95-103 |
| 50 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost and List Homomorphisms to Semicomplete Digraphs
CoRR abs/cs/0507017: (2005) |
| 49 | | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs
CoRR abs/cs/0509091: (2005) |
| 48 | | Gregory Gutin,
Arash Rafiey,
Stefan Szeider,
Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value
CoRR abs/cs/0511030: (2005) |
| 47 | | Gregory Gutin,
N. Jones,
Arash Rafiey,
Simone Severini,
Anders Yeo:
Mediated digraphs and quantum nonlocality.
Discrete Applied Mathematics 150(1-3): 41-50 (2005) |
| 46 | | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Batched bin packing.
Discrete Optimization 2(1): 71-82 (2005) |
| 45 | | Gregory Gutin,
Ton Kloks,
Chuan-Min Lee,
Anders Yeo:
Kernels in planar digraphs.
J. Comput. Syst. Sci. 71(2): 174-184 (2005) |
| 44 | | Gregory Gutin,
Fred Glover:
Further Extension of the TSP Assign Neighborhood.
J. Heuristics 11(5-6): 501-505 (2005) |
| 43 | | David Blokh,
Gregory Gutin,
Anders Yeo:
A problem of finding an acceptable variant in generalized project networks.
JAMDS 9(2): 75-81 (2005) |
| 2004 |
|---|
| 42 | | Nalan Gülpinar,
Gregory Gutin,
G. Mitra,
A. Zverovitch:
Extracting pure network submatrices in linear programs using signed graphs.
Discrete Applied Mathematics 137(3): 359-372 (2004) |
| 41 | | Gregory Gutin,
Arash Rafiey:
When n-cycles in n-partite tournaments are longest cycles.
Discrete Mathematics 289(1-3): 163-168 (2004) |
| 40 | | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
When the greedy algorithm fails.
Discrete Optimization 1(2): 121-127 (2004) |
| 39 | | Noga Alon,
Gregory Gutin,
Michael Krivelevich:
Algorithms with large domination ratio.
J. Algorithms 50(1): 118-131 (2004) |
| 38 | | Gregory Gutin,
Khee Meng Koh,
Eng Guan Tay,
Anders Yeo:
On the number of quasi-kernels in digraphs.
Journal of Graph Theory 46(1): 48-56 (2004) |
| 2003 |
|---|
| 37 | | Gregory Gutin,
Alek Vainshtein,
Anders Yeo:
Domination analysis of combinatorial optimization problems.
Discrete Applied Mathematics 129(2-3): 513-520 (2003) |
| 36 | | Gregory Gutin,
Anders Yeo:
Upper bounds on ATSP neighborhood size.
Discrete Applied Mathematics 129(2-3): 533-538 (2003) |
| 35 | | David Ben-Arieh,
Gregory Gutin,
M. Penn,
Anders Yeo,
Alexey Zverovich:
Transformations of generalized ATSP into ATSP.
Oper. Res. Lett. 31(3): 357-365 (2003) |
| 2002 |
|---|
| 34 | | Gregory Gutin,
Anders Yeo,
Alexey Zverovich:
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP.
Discrete Applied Mathematics 117(1-3): 81-86 (2002) |
| 33 | | Gregory Gutin,
Anders Yeo:
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number.
Discrete Applied Mathematics 119(1-2): 107-116 (2002) |
| 32 | | Gregory Gutin,
Anders Yeo:
Orientations of digraphs almost preserving diameter.
Discrete Applied Mathematics 121(1-3): 129-138 (2002) |
| 31 | | Gregory Gutin,
Khee Meng Koh,
Eng Guan Tay,
Anders Yeo:
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.
Graphs and Combinatorics 18(3): 499-506 (2002) |
| 30 | | Gregory Gutin,
Anders Yeo:
Anti-matroids.
Oper. Res. Lett. 30(2): 97-99 (2002) |
| 2001 |
|---|
| 29 | | Gregory Gutin,
Anders Yeo:
Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs.
Graphs and Combinatorics 17(3): 473-477 (2001) |
| 28 | | Gregory Gutin,
Anders Yeo:
TSP tour domination and Hamilton cycle decompositions of regular digraphs.
Oper. Res. Lett. 28(3): 107-111 (2001) |
| 2000 |
|---|
| 27 | | Gregory Gutin,
Alexandr V. Kostochka,
Bjarne Toft:
On the Hajo's number of graphs.
Discrete Mathematics 213(1-3): 153-161 (2000) |
| 26 | | Gregory Gutin,
Meike Tewes,
Anders Yeo:
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.
Discrete Mathematics 222(1-3): 269-274 (2000) |
| 25 | | Gregory Gutin,
Anders Yeo:
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian.
J. Comb. Theory, Ser. B 78(2): 232-242 (2000) |
| 1999 |
|---|
| 24 | | Fred Glover,
Gregory Gutin,
Anders Yeo,
Alexey Zverovich:
Construction Heuristics and Domination Analysis for the Asymmetric TSP.
Algorithm Engineering 1999: 85-94 |
| 23 | | Gregory Gutin:
Connected (g, f)-factors and supereulerian digraphs.
Ars Comb. 54: (1999) |
| 22 | | Gregory Gutin:
Exponential neighbourhood local search for the traveling salesman problem.
Computers & OR 26(4): 313-320 (1999) |
| 21 | | Gregory Gutin,
Anders Yeo:
Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour.
Computers & OR 26(4): 321-327 (1999) |
| 20 | | Jørgen Bang-Jensen,
Gregory Gutin:
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.
Discrete Applied Mathematics 95(1-3): 41-60 (1999) |
| 1998 |
|---|
| 19 | | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs.
Discrete Applied Mathematics 82(1-3): 247-250 (1998) |
| 18 | | Gregory Gutin:
A note on the cardinality of certain classes of unlabeled multipartite tournaments.
Discrete Mathematics 186(1-3): 277-280 (1998) |
| 17 | | Jørgen Bang-Jensen,
Gregory Gutin:
Alternating cycles and trails in 2-edge-coloured complete multigraphs.
Discrete Mathematics 188(1-3): 61-72 (1998) |
| 16 | | Gregory Gutin,
Vadim E. Zverovich:
Upper domination and upper irredundance perfect graphs.
Discrete Mathematics 190(1-3): 95-105 (1998) |
| 15 | | Gregory Gutin,
Benny Sudakov,
Anders Yeo:
Note on alternating directed cycles.
Discrete Mathematics 191(1-3): 101-107 (1998) |
| 1997 |
|---|
| 14 | | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments.
Combinatorics, Probability & Computing 6(3): 255-261 (1997) |
| 13 | | Jørgen Bang-Jensen,
Gregory Gutin:
Vertex heaviest paths and cycles in quasi-transitive digraphs.
Discrete Mathematics 163(1-3): 217-223 (1997) |
| 12 | | Jørgen Bang-Jensen,
Gregory Gutin:
Paths and cycles in extended and decomposable digraphs, .
Discrete Mathematics 164(1-3): 5-19 (1997) |
| 11 | | Jørgen Bang-Jensen,
Gregory Gutin:
Alternating cycles and paths in edge-coloured multigraphs: A survey.
Discrete Mathematics 165-166: 39-60 (1997) |
| 10 | | Jørgen Bang-Jensen,
Yubao Guo,
Gregory Gutin,
Lutz Volkmann:
A classification of locally semicomplete digraphs.
Discrete Mathematics 167-168: 101-114 (1997) |
| 9 | | Noga Alon,
Gregory Gutin:
Properly colored Hamilton cycles in edge-colored complete graphs.
Random Struct. Algorithms 11(2): 179-186 (1997) |
| 1996 |
|---|
| 8 | | Gregory Gutin,
Anders Yeo:
Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph.
Discrete Applied Mathematics 69(1-2): 75-82 (1996) |
| 7 | | Jørgen Bang-Jensen,
Gregory Gutin,
Jing Huang:
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian.
Discrete Mathematics 161(1-3): 1-12 (1996) |
| 6 | | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
On k-strong and k-cyclic digraphs.
Discrete Mathematics 162(1-3): 1-11 (1996) |
| 1995 |
|---|
| 5 | | David Blokh,
Gregory Gutin:
Maximizing Traveling Salesman Problem for Special Matrices.
Discrete Applied Mathematics 56(1): 83-86 (1995) |
| 4 | | Jørgen Bang-Jensen,
Gregory Gutin,
Jing Huang:
Weakly Hamiltonian-connected ordinary multipartite tournaments.
Discrete Mathematics 138(1-3): 63-74 (1995) |
| 3 | | Gregory Gutin:
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs.
Discrete Mathematics 141(1-3): 153-162 (1995) |
| 1993 |
|---|
| 2 | | Gregory Gutin:
On Cycles in Multipartite Tournaments.
J. Comb. Theory, Ser. B 58(2): 319-321 (1993) |
| 1 | | Gregory Gutin:
Finding a Longest Path in a Complete Multipartite Digraph.
SIAM J. Discrete Math. 6(2): 270-273 (1993) |
