![]() | ![]() |
| 2012 | ||
|---|---|---|
| 181 | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh: Parameterized Complexity of MaxSat above Average. LATIN 2012: 184-194 | |
| 180 | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo: Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica 64(1): 112-125 (2012) | |
| 179 | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica 64(1): 56-68 (2012) | |
| 178 | Gregory Gutin, Mark Jones: Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances CoRR abs/1202.6260: (2012) | |
| 177 | Gregory Gutin, G. Muciaccia, A. Yeo: (Non-)existence of Polynomial Kernels for the Test Cover Problem CoRR abs/1204.4368: (2012) | |
| 176 | Jason Crampton, Gregory Gutin, Anders Yeo: On the Parameterized Complexity of the Workflow Satisfiability Problem CoRR abs/1205.0852: (2012) | |
| 175 | Daniel Karapetyan, Gregory Gutin: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. European Journal of Operational Research 219(2): 234-251 (2012) | |
| 174 | Robert Crowston, Gregory Gutin, M. Jones, A. Yeo: Parameterized Eulerian strong component arc deletion problem on tournaments. Inf. Process. Lett. 112(6): 249-251 (2012) | |
| 173 | Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo: Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci. 78(1): 151-163 (2012) | |
| 172 | Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo: An algorithm for finding input-output constrained convex sets in an acyclic digraph. J. Discrete Algorithms 13: 47-58 (2012) | |
| 2011 | ||
| 171 | Gregory Gutin, Mark Jones, Anders Yeo: A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT 2011: 138-147 | |
| 170 | Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo: Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011: 229-240 | |
| 169 | Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011) | |
| 168 | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory CoRR abs/1104.1135: (2011) | |
| 167 | Gregory Gutin, Mark Jones, Anders Yeo: A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application CoRR abs/1104.2818: (2011) | |
| 166 | Gregory Gutin, Anders Yeo: Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width CoRR abs/1106.1049: (2011) | |
| 165 | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo: Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming CoRR abs/1106.3527: (2011) | |
| 164 | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments CoRR abs/1106.4454: (2011) | |
| 163 | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh: Parameterized Complexity of MaxSat Above Average CoRR abs/1108.4501: (2011) | |
| 162 | Gregory Gutin, Anders Yeo: Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey CoRR abs/1108.4803: (2011) | |
| 161 | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$ CoRR abs/1110.5915: (2011) | |
| 160 | Michael R. Fellows, Fedor V. Fomin, Gregory Gutin: Special Issue on Parameterized Complexity of Discrete Optimization. Discrete Optimization 8(1): 1 (2011) | |
| 159 | Daniel Karapetyan, Gregory Gutin: Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem. European Journal of Operational Research 208(3): 221-232 (2011) | |
| 158 | Daniel Karapetyan, Gregory Gutin: A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. Evolutionary Computation 19(3): 345-371 (2011) | |
| 157 | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2): 422-429 (2011) | |
| 156 | Daniel Karapetyan, Gregory Gutin: Local search heuristics for the multidimensional assignment problem. J. Heuristics 17(3): 201-249 (2011) | |
| 155 | Gregory Gutin, Mark Jones, Anders Yeo: Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. Theor. Comput. Sci. 412(41): 5744-5751 (2011) | |
| 154 | Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou: Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. 48(2): 402-410 (2011) | |
| 2010 | ||
| 153 | Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo: All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. ESA (1) 2010: 326-337 | |
| 152 | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo: Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC 2010: 158-169 | |
| 151 | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application. IPEC 2010: 84-94 | |
| 150 | Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517 | |
| 149 | Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa: Systems of Linear Equations over F2 and Problems Parameterized above Average. SWAT 2010: 164-175 | |
| 148 | Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa: Systems of Linear Equations over F2 and Problems Parameterized Above Average CoRR abs/1002.0286: (2010) | |
| 147 | Daniel Karapetyan, Gregory Gutin: A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem CoRR abs/1003.4314: (2010) | |
| 146 | Daniel Karapetyan, Gregory Gutin: Lin-Kernighan Heuristic Adaptation for the Generalized Traveling Salesman Problem CoRR abs/1003.5330: (2010) | |
| 145 | Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation CoRR abs/1004.0526: (2010) | |
| 144 | Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo: All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels CoRR abs/1004.1956: (2010) | |
| 143 | Gregory Gutin, Anders Yeo: Note on Maximal Bisection above Tight Lower Bound CoRR abs/1005.2848: (2010) | |
| 142 | Daniel Karapetyan, Gregory Gutin: Local Search Algorithms for the Generalized Traveling Salesman Problem CoRR abs/1005.5525: (2010) | |
| 141 | Gregory Gutin, Mark Jones, Anders Yeo: Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems CoRR abs/1010.5881: (2010) | |
| 140 | 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) | |
| 139 | Robert Crowston, Gregory Gutin, Mark Jones: Note on Max Lin-2 above Average. Inf. Process. Lett. 110(11): 451-454 (2010) | |
| 138 | Gregory Gutin, Anders Yeo: Note on maximal bisection above tight lower bound. Inf. Process. Lett. 110(21): 966-969 (2010) | |
| 137 | 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) | |
| 136 | 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. J. Comput. Syst. Sci. 76(7): 650-662 (2010) | |
| 135 | Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo: Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. 76(8): 872-878 (2010) | |
| 134 | Gregory Gutin, Daniel Karapetyan: A memetic algorithm for the generalized traveling salesman problem. Natural Computing 9(1): 47-60 (2010) | |
| 2009 | ||
| 133 | 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 | |
| 132 | Joseph Reddington, Gregory Gutin, Adrian Johnstone, Elizabeth Scott, Anders Yeo: Better Than Optimal: Fast Identification of Custom Instruction Candidates. CSE (2) 2009: 17-24 | |
| 131 | Gregory Gutin, Daniel Karapetyan: Local Search Heuristics for the Multidimensional Assignment Problem. Graph Theory, Computational Intelligence and Thought 2009: 100-115 | |
| 130 | Gregory Gutin, Eun Jung Kim: Properly Coloured Cycles and Paths: Results and Open Problems. Graph Theory, Computational Intelligence and Thought 2009: 200-208 | |
| 129 | Gregory Gutin, Daniel Karapetyan, Igor Razgon: Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. IWPEC 2009: 222-233 | |
| 128 | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245 | |
| 127 | Gregory Gutin, Daniel Karapetyan: A Memetic Algorithm for the Multidimensional Assignment Problem. SLS 2009: 125-129 | |
| 126 | Gregory Gutin: Traveling Salesman Problem. Encyclopedia of Optimization 2009: 3935-3944 | |
| 125 | Gregory Gutin: Domination Analysis in Combinatorial Optimization. Encyclopedia of Optimization 2009: 792-802 | |
| 124 | Gregory Gutin, Daniel Karapetyan: Generalized Traveling Salesman Problem Reduction Algorithms. Algorithmic Operations Research 4(2): 144-154 (2009) | |
| 123 | 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) | |
| 122 | Gregory Gutin, Daniel Karapetyan: A Memetic Algorithm for the Multidimensional Assignment Problem CoRR abs/0906.0862: (2009) | |
| 121 | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound CoRR abs/0906.1356: (2009) | |
| 120 | Gregory Gutin, Daniel Karapetyan, Igor Razgon: FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs CoRR abs/0906.1359: (2009) | |
| 119 | Daniel Karapetyan, Gregory Gutin, Boris Goldengorin: Empirical evaluation of construction heuristics for the multidimensional assignment problem CoRR abs/0906.2960: (2009) | |
| 118 | Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou: Vertex Cover Problem Parameterized Above and Below Tight Bounds CoRR abs/0907.4488: (2009) | |
| 117 | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-2-SAT Above a Tight Lower Bound CoRR abs/0907.4573: (2009) | |
| 116 | Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo: Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound CoRR abs/0907.5427: (2009) | |
| 115 | Robert Crowston, Gregory Gutin, Mark Jones: Note on Max Lin-2 above Average CoRR abs/0911.5384: (2009) | |
| 114 | Peter Dankelmann, Gregory Gutin, Eun Jung Kim: On complexity of Minimum Leaf Out-Branching problem. Discrete Applied Mathematics 157(13): 3000-3004 (2009) | |
| 113 | Gregory Gutin, Anders Yeo: On the number of connected convex subgraphs of a connected acyclic digraph. Discrete Applied Mathematics 157(7): 1660-1662 (2009) | |
| 112 | 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) | |
| 111 | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Graphs and Combinatorics 25(4): 521-531 (2009) | |
| 110 | Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo: Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms 7(4): 509-518 (2009) | |
| 109 | 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) | |
| 108 | Paul Balister, Stefanie Gerke, Gregory Gutin: Convex Sets in Acyclic Digraphs. Order 26(1): 95-100 (2009) | |
| 107 | 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) | |
| 106 | Gregory Gutin, Igor Razgon, Eun Jung Kim: Minimum leaf out-branching and related problems. Theor. Comput. Sci. 410(45): 4571-4579 (2009) | |
| 2008 | ||
| 105 | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM 2008: 224-234 | |
| 104 | Gregory Gutin, Igor Razgon, Eun Jung Kim: Minimum Leaf Out-Branching Problems. AAIM 2008: 235-246 | |
| 103 | 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 | |
| 102 | Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008) | |
| 101 | Gregory Gutin, Eun Jung Kim, Igor Razgon: Minimum Leaf Out-Branching Problems CoRR abs/0801.1979: (2008) | |
| 100 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves CoRR abs/0803.0701: (2008) | |
| 99 | Gregory Gutin, Daniel Karapetyan: A Memetic Algorithm for the Generalized Traveling Salesman Problem CoRR abs/0804.0722: (2008) | |
| 98 | Gregory Gutin, Daniel Karapetyan: Generalized Traveling Salesman Problem Reduction Algorithms CoRR abs/0804.0735: (2008) | |
| 97 | Gregory Gutin, Eun Jung Kim: Properly Coloured Cycles and Paths: Results and Open Problems CoRR abs/0805.3901: (2008) | |
| 96 | Gregory Gutin, Daniel Karapetyan: Local Search Heuristics For The Multidimensional Assignment Problem CoRR abs/0806.3258: (2008) | |
| 95 | Peter Dankelmann, Gregory Gutin, Eun Jung Kim: On Complexity of Minimum Leaf Out-branching Problem CoRR abs/0808.0980: (2008) | |
| 94 | Jean Daligault, Gregory Gutin, Eun Jung Kim, Anders Yeo: FPT Algorithms and Kernels for the Directed $k$-Leaf Problem CoRR abs/0810.4946: (2008) | |
| 93 | Gregory Gutin, Anders Yeo: Some Parameterized Problems On Digraphs. Comput. J. 51(3): 363-371 (2008) | |
| 92 | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum cost homomorphisms to semicomplete multipartite digraphs. Discrete Applied Mathematics 156(12): 2429-2435 (2008) | |
| 91 | Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008) | |
| 90 | 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) | |
| 89 | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discrete Math. 22(4): 1624-1639 (2008) | |
| 2007 | ||
| 88 | 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 | |
| 87 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327 | |
| 86 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362 | |
| 85 | 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 | |
| 84 | 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 | |
| 83 | Gregory Gutin, Daniel Karapetyan, Natalio Krasnogor: Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. NICSO 2007: 199-210 | |
| 82 | Gregory Gutin, Anders Yeo: The Greedy Algorithm for the Symmetric TSP. Algorithmic Operations Research 2(1): (2007) | |
| 81 | 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) | |
| 80 | Gregory Gutin: Note on edge-colored graphs and digraphs without properly colored cycles CoRR abs/0707.4580: (2007) | |
| 79 | Gregory Gutin, Eun Jung Kim: On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments CoRR abs/0708.2544: (2007) | |
| 78 | Eun Jung Kim, Gregory Gutin: Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops CoRR abs/0708.2545: (2007) | |
| 77 | 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) | |
| 76 | Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo: Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR abs/0712.2661: (2007) | |
| 75 | Paul N. Balister, Stefanie Gerke, Gregory Gutin: Convex sets in acyclic digraphs CoRR abs/0712.2678: (2007) | |
| 74 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems CoRR abs/cs/0702049: (2007) | |
| 73 | 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 | ||
| 72 | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367 | |
| 71 | Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71 | |
| 70 | 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 | |
| 69 | Gregory Gutin, Angela Koller, Anders Yeo: Note on Upper Bounds for TSP Domination Number. Algorithmic Operations Research 1(1): (2006) | |
| 68 | Gregory Gutin, Tommy R. Jensen, Anders Yeo: On-line bin Packing with Two Item Sizes. Algorithmic Operations Research 1(2): (2006) | |
| 67 | Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs CoRR abs/cs/0602038: (2006) | |
| 66 | Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems CoRR abs/cs/0604095: (2006) | |
| 65 | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs CoRR abs/cs/0608101: (2006) | |
| 64 | Gregory Gutin, Tommy R. Jensen, Anders Yeo: Domination analysis for minimum multiprocessor scheduling. Discrete Applied Mathematics 154(18): 2613-2619 (2006) | |
| 63 | 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) | |
| 62 | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Applied Mathematics 154(6): 890-897 (2006) | |
| 61 | Gregory Gutin, Arash Rafiey, Simone Severini, Anders Yeo: Hamilton cycles in digraphs of unitary matrices. Discrete Mathematics 306(24): 3315-3320 (2006) | |
| 60 | Gregory Gutin, Abraham Punnen: The traveling salesman problem. Discrete Optimization 3(1): 1 (2006) | |
| 59 | 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) | |
| 58 | Gregory Gutin, Arash Rafiey, Anders Yeo: On n-partite Tournaments with Unique n-cycle. Graphs and Combinatorics 22(2): 241-249 (2006) | |
| 57 | 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 | ||
| 56 | Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso: Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. AAIM 2005: 427-439 | |
| 55 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94 | |
| 54 | Gregory Gutin, Tommy R. Jensen, Anders Yeo: Optimal On-Line Bin Packing with Two Item Sizes. ACiD 2005: 95-103 | |
| 53 | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost and List Homomorphisms to Semicomplete Digraphs CoRR abs/cs/0507017: (2005) | |
| 52 | Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs CoRR abs/cs/0509091: (2005) | |
| 51 | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value CoRR abs/cs/0511030: (2005) | |
| 50 | Gregory Gutin, N. Jones, Arash Rafiey, Simone Severini, Anders Yeo: Mediated digraphs and quantum nonlocality. Discrete Applied Mathematics 150(1-3): 41-50 (2005) | |
| 49 | Gregory Gutin, Tommy R. Jensen, Anders Yeo: Batched bin packing. Discrete Optimization 2(1): 71-82 (2005) | |
| 48 | Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo: Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005) | |
| 47 | Gregory Gutin, Fred Glover: Further Extension of the TSP Assign Neighborhood. J. Heuristics 11(5-6): 501-505 (2005) | |
| 46 | David Blokh, Gregory Gutin, Anders Yeo: A problem of finding an acceptable variant in generalized project networks. JAMDS 9(2): 75-81 (2005) | |
| 2004 | ||
| 45 | 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) | |
| 44 | Gregory Gutin, Arash Rafiey: When n-cycles in n-partite tournaments are longest cycles. Discrete Mathematics 289(1-3): 163-168 (2004) | |
| 43 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: When the greedy algorithm fails. Discrete Optimization 1(2): 121-127 (2004) | |
| 42 | Noga Alon, Gregory Gutin, Michael Krivelevich: Algorithms with large domination ratio. J. Algorithms 50(1): 118-131 (2004) | |
| 41 | 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 | ||
| 40 | Gregory Gutin, Alek Vainshtein, Anders Yeo: Domination analysis of combinatorial optimization problems. Discrete Applied Mathematics 129(2-3): 513-520 (2003) | |
| 39 | Gregory Gutin, Anders Yeo: Upper bounds on ATSP neighborhood size. Discrete Applied Mathematics 129(2-3): 533-538 (2003) | |
| 38 | 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 | ||
| 37 | Jørgen Bang-Jensen, Gregory Gutin: Digraphs - theory, algorithms and applications. Springer 2002: I-XXII, 1-754 | |
| 36 | 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) | |
| 35 | 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) | |
| 34 | Gregory Gutin, Anders Yeo: Orientations of digraphs almost preserving diameter. Discrete Applied Mathematics 121(1-3): 129-138 (2002) | |
| 33 | 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) | |
| 32 | Gregory Gutin, Anders Yeo: Anti-matroids. Oper. Res. Lett. 30(2): 97-99 (2002) | |
| 2001 | ||
| 31 | Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich: Construction heuristics for the asymmetric TSP. European Journal of Operational Research 129(3): 555-568 (2001) | |
| 30 | 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) | |
| 29 | Gregory Gutin, Anders Yeo: TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Lett. 28(3): 107-111 (2001) | |
| 2000 | ||
| 28 | Gregory Gutin, Alexandr V. Kostochka, Bjarne Toft: On the Hajo's number of graphs. Discrete Mathematics 213(1-3): 153-161 (2000) | |
| 27 | 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) | |
| 26 | 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 | ||
| 25 | Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich: Construction Heuristics and Domination Analysis for the Asymmetric TSP. Algorithm Engineering 1999: 85-94 | |
| 24 | Gregory Gutin: Connected (g, f)-factors and supereulerian digraphs. Ars Comb. 54: (1999) | |
| 23 | Gregory Gutin: Exponential neighbourhood local search for the traveling salesman problem. Computers & OR 26(4): 313-320 (1999) | |
| 22 | 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) | |
| 21 | 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 | ||
| 20 | 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) | |
| 19 | Gregory Gutin: A note on the cardinality of certain classes of unlabeled multipartite tournaments. Discrete Mathematics 186(1-3): 277-280 (1998) | |
| 18 | Jørgen Bang-Jensen, Gregory Gutin: Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discrete Mathematics 188(1-3): 61-72 (1998) | |
| 17 | Gregory Gutin, Vadim E. Zverovich: Upper domination and upper irredundance perfect graphs. Discrete Mathematics 190(1-3): 95-105 (1998) | |
| 16 | Gregory Gutin, Benny Sudakov, Anders Yeo: Note on alternating directed cycles. Discrete Mathematics 191(1-3): 101-107 (1998) | |
| 1997 | ||
| 15 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Combinatorics, Probability & Computing 6(3): 255-261 (1997) | |
| 14 | Jørgen Bang-Jensen, Gregory Gutin: Vertex heaviest paths and cycles in quasi-transitive digraphs. Discrete Mathematics 163(1-3): 217-223 (1997) | |
| 13 | Jørgen Bang-Jensen, Gregory Gutin: Paths and cycles in extended and decomposable digraphs, . Discrete Mathematics 164(1-3): 5-19 (1997) | |
| 12 | Jørgen Bang-Jensen, Gregory Gutin: Alternating cycles and paths in edge-coloured multigraphs: A survey. Discrete Mathematics 165-166: 39-60 (1997) | |
| 11 | Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann: A classification of locally semicomplete digraphs. Discrete Mathematics 167-168: 101-114 (1997) | |
| 10 | Noga Alon, Gregory Gutin: Properly colored Hamilton cycles in edge-colored complete graphs. Random Struct. Algorithms 11(2): 179-186 (1997) | |
| 1996 | ||
| 9 | Gregory Gutin, Anders Yeo: Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discrete Applied Mathematics 69(1-2): 75-82 (1996) | |
| 8 | 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) | |
| 7 | Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: On k-strong and k-cyclic digraphs. Discrete Mathematics 162(1-3): 1-11 (1996) | |
| 1995 | ||
| 6 | David Blokh, Gregory Gutin: Maximizing Traveling Salesman Problem for Special Matrices. Discrete Applied Mathematics 56(1): 83-86 (1995) | |
| 5 | Jørgen Bang-Jensen, Gregory Gutin, Jing Huang: Weakly Hamiltonian-connected ordinary multipartite tournaments. Discrete Mathematics 138(1-3): 63-74 (1995) | |
| 4 | Gregory Gutin: Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. Discrete Mathematics 141(1-3): 153-162 (1995) | |
| 1994 | ||
| 3 | Gregory Gutin: Minimizing and maximizing the diameter in orientations of graphs. Graphs and Combinatorics 10(2-4): 225-230 (1994) | |
| 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) | |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page