dblp.uni-trier.dewww.uni-trier.de

Gregory Gutin

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
105EEGregory Gutin: Traveling Salesman Problem. Encyclopedia of Optimization 2009: 3935-3944
104EEGregory Gutin: Domination Analysis in Combinatorial Optimization. Encyclopedia of Optimization 2009: 792-802
103EENathann 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)
102EEGregory Gutin, Daniel Karapetyan: A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Computing 1(1): 25-34 (2009)
2008
101EEGregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM 2008: 224-234
100EEGregory Gutin, Igor Razgon, Eun Jung Kim: Minimum Leaf Out-Branching Problems. AAIM 2008: 235-246
99EEGregory 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
98EEGregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008)
97EEGregory Gutin, Eun Jung Kim, Igor Razgon: Minimum Leaf Out-Branching Problems CoRR abs/0801.1979: (2008)
96EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves CoRR abs/0803.0701: (2008)
95EEGregory Gutin, Daniel Karapetyan: A Memetic Algorithm for the Generalized Traveling Salesman Problem CoRR abs/0804.0722: (2008)
94EEGregory Gutin, Daniel Karapetyan: Generalized Traveling Salesman Problem Reduction Algorithms CoRR abs/0804.0735: (2008)
93EEGregory Gutin, Eun Jung Kim: Properly Coloured Cycles and Paths: Results and Open Problems CoRR abs/0805.3901: (2008)
92EEGregory Gutin, Daniel Karapetyan: Local Search Heuristics For The Multidimensional Assignment Problem CoRR abs/0806.3258: (2008)
91EEPeter Dankelmann, Gregory Gutin, Eun Jung Kim: On Complexity of Minimum Leaf Out-branching Problem CoRR abs/0808.0980: (2008)
90EEJean Daligault, Gregory Gutin, Eun Jung Kim, Anders Yeo: FPT Algorithms and Kernels for the Directed $k$-Leaf Problem CoRR abs/0810.4946: (2008)
89EEGregory Gutin, Anders Yeo: Some Parameterized Problems On Digraphs. Comput. J. 51(3): 363-371 (2008)
88EEGregory Gutin, Arash Rafiey, Anders Yeo: Minimum cost homomorphisms to semicomplete multipartite digraphs. Discrete Applied Mathematics 156(12): 2429-2435 (2008)
87EEGregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008)
86EEGregory 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)
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
84EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327
83EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362
82EEErik 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
81EEErik 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
80EEGregory Gutin, Daniel Karapetyan, Natalio Krasnogor: Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. NICSO 2007: 199-210
79EEGregory Gutin, Anders Yeo: The Greedy Algorithm for the Symmetric TSP. Algorithmic Operations Research 2(1): (2007)
78EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR abs/0707.1095: (2007)
77EEGregory Gutin: Note on edge-colored graphs and digraphs without properly colored cycles CoRR abs/0707.4580: (2007)
76EEGregory Gutin, Eun Jung Kim: On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments CoRR abs/0708.2544: (2007)
75EEEun Jung Kim, Gregory Gutin: Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops CoRR abs/0708.2545: (2007)
74EEArvind 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)
73EEPaul 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)
72EEPaul N. Balister, Stefanie Gerke, Gregory Gutin: Convex sets in acyclic digraphs CoRR abs/0712.2678: (2007)
71EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems CoRR abs/cs/0702049: (2007)
70EEGregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007)
2006
69EEGregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367
68EEGregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71
67EEGregory 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
66EEGregory Gutin, Angela Koller, Anders Yeo: Note on Upper Bounds for TSP Domination Number. Algorithmic Operations Research 1(1): (2006)
65EEGregory Gutin, Tommy R. Jensen, Anders Yeo: On-line bin Packing with Two Item Sizes. Algorithmic Operations Research 1(2): (2006)
64EEGregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs CoRR abs/cs/0602038: (2006)
63EEGregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems CoRR abs/cs/0604095: (2006)
62EEGregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs CoRR abs/cs/0608101: (2006)
61EEGregory Gutin, Tommy R. Jensen, Anders Yeo: Domination analysis for minimum multiprocessor scheduling. Discrete Applied Mathematics 154(18): 2613-2619 (2006)
60EEGregory 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)
59EEGregory Gutin, Arash Rafiey, Anders Yeo: Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Applied Mathematics 154(6): 890-897 (2006)
58EEGregory Gutin, Arash Rafiey, Simone Severini, Anders Yeo: Hamilton cycles in digraphs of unitary matrices. Discrete Mathematics 306(24): 3315-3320 (2006)
57EEGregory Gutin, Abraham Punnen: The traveling salesman problem. Discrete Optimization 3(1): 1 (2006)
56EEJø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)
55EEGregory Gutin, Arash Rafiey, Anders Yeo: On n-partite Tournaments with Unique n-cycle. Graphs and Combinatorics 22(2): 241-249 (2006)
54EEJinfeng 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
53EEGregory 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
50EEGregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost and List Homomorphisms to Semicomplete Digraphs CoRR abs/cs/0507017: (2005)
49EEGregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs CoRR abs/cs/0509091: (2005)
48EEGregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value CoRR abs/cs/0511030: (2005)
47EEGregory Gutin, N. Jones, Arash Rafiey, Simone Severini, Anders Yeo: Mediated digraphs and quantum nonlocality. Discrete Applied Mathematics 150(1-3): 41-50 (2005)
46EEGregory Gutin, Tommy R. Jensen, Anders Yeo: Batched bin packing. Discrete Optimization 2(1): 71-82 (2005)
45EEGregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo: Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005)
44EEGregory Gutin, Fred Glover: Further Extension of the TSP Assign Neighborhood. J. Heuristics 11(5-6): 501-505 (2005)
43EEDavid Blokh, Gregory Gutin, Anders Yeo: A problem of finding an acceptable variant in generalized project networks. JAMDS 9(2): 75-81 (2005)
2004
42EENalan 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)
41EEGregory Gutin, Arash Rafiey: When n-cycles in n-partite tournaments are longest cycles. Discrete Mathematics 289(1-3): 163-168 (2004)
40EEJørgen Bang-Jensen, Gregory Gutin, Anders Yeo: When the greedy algorithm fails. Discrete Optimization 1(2): 121-127 (2004)
39EENoga Alon, Gregory Gutin, Michael Krivelevich: Algorithms with large domination ratio. J. Algorithms 50(1): 118-131 (2004)
38EEGregory 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
37EEGregory Gutin, Alek Vainshtein, Anders Yeo: Domination analysis of combinatorial optimization problems. Discrete Applied Mathematics 129(2-3): 513-520 (2003)
36EEGregory Gutin, Anders Yeo: Upper bounds on ATSP neighborhood size. Discrete Applied Mathematics 129(2-3): 533-538 (2003)
35EEDavid 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)
31EEGregory 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)
30EEGregory Gutin, Anders Yeo: Anti-matroids. Oper. Res. Lett. 30(2): 97-99 (2002)
2001
29EEGregory 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)
28EEGregory Gutin, Anders Yeo: TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Lett. 28(3): 107-111 (2001)
2000
27EEGregory Gutin, Alexandr V. Kostochka, Bjarne Toft: On the Hajo's number of graphs. Discrete Mathematics 213(1-3): 153-161 (2000)
26EEGregory 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)
25EEGregory 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
24EEFred 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)
22EEGregory Gutin: Exponential neighbourhood local search for the traveling salesman problem. Computers & OR 26(4): 313-320 (1999)
21EEGregory 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)
20EEJø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
19EEJø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)
18EEGregory Gutin: A note on the cardinality of certain classes of unlabeled multipartite tournaments. Discrete Mathematics 186(1-3): 277-280 (1998)
17EEJørgen Bang-Jensen, Gregory Gutin: Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discrete Mathematics 188(1-3): 61-72 (1998)
16EEGregory Gutin, Vadim E. Zverovich: Upper domination and upper irredundance perfect graphs. Discrete Mathematics 190(1-3): 95-105 (1998)
15EEGregory 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)
13EEJørgen Bang-Jensen, Gregory Gutin: Vertex heaviest paths and cycles in quasi-transitive digraphs. Discrete Mathematics 163(1-3): 217-223 (1997)
12EEJørgen Bang-Jensen, Gregory Gutin: Paths and cycles in extended and decomposable digraphs, . Discrete Mathematics 164(1-3): 5-19 (1997)
11EEJørgen Bang-Jensen, Gregory Gutin: Alternating cycles and paths in edge-coloured multigraphs: A survey. Discrete Mathematics 165-166: 39-60 (1997)
10EEJø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
8EEGregory Gutin, Anders Yeo: Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discrete Applied Mathematics 69(1-2): 75-82 (1996)
7EEJø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)
6EEJørgen Bang-Jensen, Gregory Gutin, Anders Yeo: On k-strong and k-cyclic digraphs. Discrete Mathematics 162(1-3): 1-11 (1996)
1995
5EEDavid Blokh, Gregory Gutin: Maximizing Traveling Salesman Problem for Special Matrices. Discrete Applied Mathematics 56(1): 83-86 (1995)
4EEJørgen Bang-Jensen, Gregory Gutin, Jing Huang: Weakly Hamiltonian-connected ordinary multipartite tournaments. Discrete Mathematics 138(1-3): 63-74 (1995)
3EEGregory Gutin: Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. Discrete Mathematics 141(1-3): 153-162 (1995)
1993
2EEGregory 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)

Coauthor Index

1Noga Alon [9] [39] [71] [78] [83] [84] [96]
2Paul N. Balister (Paul Balister) [72] [73]
3Jørgen Bang-Jensen [4] [6] [7] [10] [11] [12] [13] [14] [17] [19] [20] [40] [52] [56]
4David Ben-Arieh [35]
5David Blokh [5] [43]
6Nathann Cohen [103]
7Jean Daligault [90]
8Peter Dankelmann [91]
9Erik D. Demaine [81] [82] [85]
10Jinfeng Feng [54]
11Fedor V. Fomin [71] [78] [83] [84] [96] [103]
12Stefanie Gerke [72] [73]
13Hans-Erik Giesen [54]
14Fred Glover [24] [44]
15Boris Goldengorin [67] [86]
16Nalan Gülpinar [42]
17Yubao Guo [10] [54]
18Arvind Gupta [74]
19Pavol Hell [64] [87]
20Jing Huang [4] [7] [67] [86]
21Tommy R. Jensen [46] [51] [54] [61] [65]
22Adrian Johnstone [73] [99]
23N. Jones [47]
24Daniel Karapetyan [80] [92] [94] [95] [102]
25Mehdi Karimi [74]
26Eun Jung Kim [74] [75] [76] [90] [91] [93] [97] [100] [103]
27Ton Kloks (Antonius J. J. Kloks) [45]
28Khee Meng Koh [31] [38]
29Angela Koller [66]
30Alexandr V. Kostochka [27]
31Natalio Krasnogor [80]
32Michael Krivelevich [39] [71] [78] [83] [84] [96]
33Chuan-Min Lee [45]
34Dániel Marx [81] [82] [85]
35G. Mitra [42]
36M. Penn [35]
37Abraham Punnen [57]
38Arash Rafiey [41] [47] [48] [49] [50] [53] [54] [55] [58] [59] [60] [62] [64] [69] [70] [74] [87] [88] [101]
39Igor Razgon [97] [100]
40Joseph Reddington [73] [99]
41Saket Saurabh [71] [78] [83] [84] [96] [103]
42Elizabeth Scott [73] [99]
43Simone Severini [47] [58]
44A. Soleimanfallah [73]
45Ulrike Stege [81] [82] [85]
46Benny Sudakov [15]
47Stefan Szeider [48] [63] [68] [69] [70] [98]
48Eng Guan Tay [31] [38]
49Meike Tewes [26]
50Bjarne Toft [27]
51Michael Tso [53] [60]
52Alek Vainshtein (Alexander Vainshtein) [37]
53Lutz Volkmann [10]
54Anders Yeo [6] [8] [14] [15] [19] [21] [24] [25] [26] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [40] [43] [45] [46] [47] [48] [49] [50] [51] [52] [53] [55] [56] [58] [59] [60] [61] [62] [63] [64] [65] [66] [68] [69] [70] [73] [79] [87] [88] [89] [90] [98] [99] [101] [103]
55Alexey Zverovich [24] [34] [35]
56Vadim E. Zverovich [16]
57A. Zverovitch [42]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)