Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gregory Gutin
2010 – today
- 2013
[j110]Gregory Gutin, Gabriele Muciaccia, Anders Yeo: (Non-)existence of polynomial kernels for the Test Cover problem. Inf. Process. Lett. 113(4): 123-126 (2013)- [j109]Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$. Theory Comput. Syst. 52(4): 719-728 (2013)
- [j108]Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 53(4): 690-691 (2013)
- [j107]Jason Crampton, Gregory Gutin, Anders Yeo: On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem. ACM Trans. Inf. Syst. Secur. 16(1): 4 (2013)
- [c37]Jason Crampton, Robert Crowston, Gregory Gutin, Mark Jones, M. S. Ramanujan: Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. FAW-AAIM 2013: 198-209
- [c36]Robert Crowston, Gregory Gutin, Mark Jones, Gabriele Muciaccia: Maximum Balanced Subgraph Problem Parameterized above Lower Bound. COCOON 2013: 434-445
- [c35]Jason Crampton, Gregory Gutin: Constraint expressions and workflow satisfiability. SACMAT 2013: 73-84
- [i61]Jason Crampton, Gregory Gutin: Constraint Expressions and Workflow Satisfiability. CoRR abs/1301.3402 (2013)
- [i60]David Cohen, Jason Crampton, Gregory Gutin, Mark Jones: Pattern-Based Plan Construction for the Workflow Satisfiability Problem. CoRR abs/1306.3649 (2013)
- [i59]Gregory Gutin, Gabriele Muciaccia, Anders Yeo: Parameterized Complexity of k-Chinese Postman Problem. CoRR abs/1308.0482 (2013)
- [i58]Gregory Gutin, Mark Jones: Parameterized Algorithms for Load Coloring Problem. CoRR abs/1308.1820 (2013)
- [i57]Gregory Gutin, Magnus Wahlstrom, Anders Yeo: Parameterized Rural Postman and Conjoining Bipartite Matching Problems. CoRR abs/1308.2599 (2013)
- 2012
- [j106]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)
- [j105]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)
- [j104]Gregory Gutin, Anders Yeo: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. Discrete Applied Mathematics 160(15): 2323-2328 (2012)
- [j103]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)
- [j102]Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Eulerian strong component arc deletion problem on tournaments. Inf. Process. Lett. 112(6): 249-251 (2012)
- [j101]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)
- [j100]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)
- [j99]Gregory Gutin, Mark Jones: Note on Large Subsets of Binary Vectors with Similar Distances. SIAM J. Discrete Math. 26(3): 1108-1111 (2012)
- [c34]Gregory Gutin, Anders Yeo: Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey. The Multivariate Algorithmic Revolution and Beyond 2012: 257-286
- [c33]Jason Crampton, Gregory Gutin, Anders Yeo: On the parameterized complexity of the workflow satisfiability problem. ACM Conference on Computer and Communications Security 2012: 857-868
- [c32]Robert Crowston, Gregory Gutin, Mark Jones: Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. FSTTCS 2012: 400-411
- [c31]Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh: Parameterized Complexity of MaxSat above Average. LATIN 2012: 184-194
- [c30]Robert Crowston, Gregory Gutin, Mark Jones, Saket Saurabh, Anders Yeo: Parameterized Study of the Test Cover Problem. MFCS 2012: 283-295
- [c29]Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo: Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT 2012: 355-368
- [i56]Gregory Gutin, Mark Jones: Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances. CoRR abs/1202.6260 (2012)
- [i55]Gregory Gutin, Gabriele Muciaccia, Anders Yeo: (Non-)existence of Polynomial Kernels for the Test Cover Problem. CoRR abs/1204.4368 (2012)
- [i54]Jason Crampton, Gregory Gutin, Anders Yeo: On the Parameterized Complexity of the Workflow Satisfiability Problem. CoRR abs/1205.0852 (2012)
- [i53]Robert Crowston, Gregory Gutin, Mark Jones: Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound. CoRR abs/1207.3586 (2012)
- [i52]Robert Crowston, Gregory Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo: Parameterizations of Test Cover with Bounded Test Sizes. CoRR abs/1209.6528 (2012)
- [i51]Jason Crampton, Robert Crowston, Gregory Gutin, Mark Jones, M. S. Ramanujan: Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. CoRR abs/1210.3978 (2012)
- [i50]Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo: Fixed-parameter tractability of satisfying beyond the number of variables. CoRR abs/1212.0106 (2012)
- [i49]Robert Crowston, Gregory Gutin, Mark Jones, Saket Saurabh, Anders Yeo: Parameterized Study of the Test Cover Problem. CoRR abs/1212.0117 (2012)
- [i48]Robert Crowston, Gregory Gutin, Mark Jones, Gabriele Muciaccia: Maximum Balanced Subgraph Problem Parameterized Above Lower Bound. CoRR abs/1212.6848 (2012)
- 2011
- [j98]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)
- [j97]Michael R. Fellows, Fedor V. Fomin, Gregory Gutin: Special Issue on Parameterized Complexity of Discrete Optimization. Discrete Optimization 8(1): 1 (2011)
- [j96]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)
- [j95]Daniel Karapetyan, Gregory Gutin: Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem. European Journal of Operational Research 208(3): 221-232 (2011)
- [j94]Daniel Karapetyan, Gregory Gutin: Local search heuristics for the multidimensional assignment problem. J. Heuristics 17(3): 201-249 (2011)
- [j93]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)
- [j92]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)
- [j91]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)
- [c28]Gregory Gutin, Mark Jones, Anders Yeo: A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT 2011: 138-147
- [c27]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
- [i47]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)
- [i46]Gregory Gutin, Mark Jones, Anders Yeo: A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application. CoRR abs/1104.2818 (2011)
- [i45]Gregory Gutin, Anders Yeo: Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width. CoRR abs/1106.1049 (2011)
- [i44]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)
- [i43]Robert Crowston, Gregory Gutin, Mark Jones, Anders Yeo: Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments. CoRR abs/1106.4454 (2011)
- [i42]Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh: Parameterized Complexity of MaxSat Above Average. CoRR abs/1108.4501 (2011)
- [i41]Gregory Gutin, Anders Yeo: Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey. CoRR abs/1108.4803 (2011)
- [i40]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)
- 2010
- [j90]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)
- [j89]Robert Crowston, Gregory Gutin, Mark Jones: Note on Max Lin-2 above Average. Inf. Process. Lett. 110(11): 451-454 (2010)
- [j88]Gregory Gutin, Anders Yeo: Note on maximal bisection above tight lower bound. Inf. Process. Lett. 110(21): 966-969 (2010)
- [j87]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)
- [j86]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)
- [j85]Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo: Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. 76(8): 872-878 (2010)
- [j84]Gregory Gutin, Daniel Karapetyan: A memetic algorithm for the generalized traveling salesman problem. Natural Computing 9(1): 47-60 (2010)
- [c26]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
- [c25]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
- [c24]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
- [c23]Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517
- [c22]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
- [i39]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)
- [i38]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)
- [i37]Daniel Karapetyan, Gregory Gutin: Lin-Kernighan Heuristic Adaptation for the Generalized Traveling Salesman Problem. CoRR abs/1003.5330 (2010)
- [i36]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)
- [i35]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)
- [i34]Gregory Gutin, Anders Yeo: Note on Maximal Bisection above Tight Lower Bound. CoRR abs/1005.2848 (2010)
- [i33]Daniel Karapetyan, Gregory Gutin: Local Search Algorithms for the Generalized Traveling Salesman Problem. CoRR abs/1005.5525 (2010)
- [i32]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)
2000 – 2009
- 2009
- [j83]Gregory Gutin, Daniel Karapetyan: Generalized Traveling Salesman Problem Reduction Algorithms. Algorithmic Operations Research 4(2): 144-154 (2009)
- [j82]Gregory Gutin, Anders Yeo: On the number of connected convex subgraphs of a connected acyclic digraph. Discrete Applied Mathematics 157(7): 1660-1662 (2009)
- [j81]Peter Dankelmann, Gregory Gutin, Eun Jung Kim: On complexity of Minimum Leaf Out-Branching problem. Discrete Applied Mathematics 157(13): 3000-3004 (2009)
- [j80]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)
- [j79]Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Graphs and Combinatorics 25(4): 521-531 (2009)
- [j78]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)
- [j77]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)
- [j76]Paul Balister, Stefanie Gerke, Gregory Gutin: Convex Sets in Acyclic Digraphs. Order 26(1): 95-100 (2009)
- [j75]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)
- [j74]Gregory Gutin, Igor Razgon, Eun Jung Kim: Minimum leaf out-branching and related problems. Theor. Comput. Sci. 410(45): 4571-4579 (2009)
- [c21]Gregory Gutin, Daniel Karapetyan: Local Search Heuristics for the Multidimensional Assignment Problem. Graph Theory, Computational Intelligence and Thought 2009: 100-115
- [c20]Gregory Gutin, Eun Jung Kim: Properly Coloured Cycles and Paths: Results and Open Problems. Graph Theory, Computational Intelligence and Thought 2009: 200-208
- [c19]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
- [c18]Joseph Reddington, Gregory Gutin, Adrian Johnstone, Elizabeth Scott, Anders Yeo: Better Than Optimal: Fast Identification of Custom Instruction Candidates. CSE (2) 2009: 17-24
- [c17]Gregory Gutin, Daniel Karapetyan, Igor Razgon: Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. IWPEC 2009: 222-233
- [c16]Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245
- [c15]Gregory Gutin, Daniel Karapetyan: A Memetic Algorithm for the Multidimensional Assignment Problem. SLS 2009: 125-129
- [r2]Gregory Gutin: Domination Analysis in Combinatorial Optimization. Encyclopedia of Optimization 2009: 792-802
- [r1]
- [i31]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)
- [i30]Gregory Gutin, Daniel Karapetyan: A Memetic Algorithm for the Multidimensional Assignment Problem. CoRR abs/0906.0862 (2009)
- [i29]Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound. CoRR abs/0906.1356 (2009)
- [i28]Gregory Gutin, Daniel Karapetyan, Igor Razgon: FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. CoRR abs/0906.1359 (2009)
- [i27]Daniel Karapetyan, Gregory Gutin, Boris Goldengorin: Empirical evaluation of construction heuristics for the multidimensional assignment problem. CoRR abs/0906.2960 (2009)
- [i26]Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou: Vertex Cover Problem Parameterized Above and Below Tight Bounds. CoRR abs/0907.4488 (2009)
- [i25]Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-2-SAT Above a Tight Lower Bound. CoRR abs/0907.4573 (2009)
- [i24]Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo: Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. CoRR abs/0907.5427 (2009)
- [i23]Robert Crowston, Gregory Gutin, Mark Jones: Note on Max Lin-2 above Average. CoRR abs/0911.5384 (2009)
- 2008
- [j73]Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008)
- [j72]Gregory Gutin, Anders Yeo: Some Parameterized Problems On Digraphs. Comput. J. 51(3): 363-371 (2008)
- [j71]Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum cost homomorphisms to semicomplete multipartite digraphs. Discrete Applied Mathematics 156(12): 2429-2435 (2008)
- [j70]Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008)
- [j69]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)
- [j68]Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discrete Math. 22(4): 1624-1639 (2008)
- [c14]Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM 2008: 224-234
- [c13]
- [c12]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
- [i22]Gregory Gutin, Eun Jung Kim, Igor Razgon: Minimum Leaf Out-Branching Problems. CoRR abs/0801.1979 (2008)
- [i21]Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves. CoRR abs/0803.0701 (2008)
- [i20]Gregory Gutin, Daniel Karapetyan: A Memetic Algorithm for the Generalized Traveling Salesman Problem. CoRR abs/0804.0722 (2008)
- [i19]Gregory Gutin, Daniel Karapetyan: Generalized Traveling Salesman Problem Reduction Algorithms. CoRR abs/0804.0735 (2008)
- [i18]Gregory Gutin, Eun Jung Kim: Properly Coloured Cycles and Paths: Results and Open Problems. CoRR abs/0805.3901 (2008)
- [i17]Gregory Gutin, Daniel Karapetyan: Local Search Heuristics For The Multidimensional Assignment Problem. CoRR abs/0806.3258 (2008)
- [i16]Peter Dankelmann, Gregory Gutin, Eun Jung Kim: On Complexity of Minimum Leaf Out-branching Problem. CoRR abs/0808.0980 (2008)
- [i15]Jean Daligault, Gregory Gutin, Eun Jung Kim, Anders Yeo: FPT Algorithms and Kernels for the Directed $k$-Leaf Problem. CoRR abs/0810.4946 (2008)
- 2007
- [j67]Gregory Gutin, Anders Yeo: The Greedy Algorithm for the Symmetric TSP. Algorithmic Operations Research 2(1) (2007)
- [j66]Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007)
- [c11]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
- [c10]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
- [c9]Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327
- [c8]Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362
- [p1]Gregory Gutin, Daniel Karapetyan, Natalio Krasnogor: Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. NICSO 2007: 199-210
- [e1]Erik D. Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege (Eds.): Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007. Dagstuhl Seminar Proceedings 07281, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [i14]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)
- [i13]Gregory Gutin: Note on edge-colored graphs and digraphs without properly colored cycles. CoRR abs/0707.4580 (2007)
- [i12]Gregory Gutin, Eun Jung Kim: On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments. CoRR abs/0708.2544 (2007)
- [i11]Eun Jung Kim, Gregory Gutin: Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops. CoRR abs/0708.2545 (2007)
- [i10]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)
- [i9]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)
- [i8]Paul N. Balister, Stefanie Gerke, Gregory Gutin: Convex sets in acyclic digraphs. CoRR abs/0712.2678 (2007)
- [i7]Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. CoRR abs/cs/0702049 (2007)
- 2006
- [j65]Gregory Gutin, Angela Koller, Anders Yeo: Note on Upper Bounds for TSP Domination Number. Algorithmic Operations Research 1(1) (2006)
- [j64]Gregory Gutin, Tommy R. Jensen, Anders Yeo: On-line bin Packing with Two Item Sizes. Algorithmic Operations Research 1(2) (2006)
- [j63]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)
- [j62]Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Applied Mathematics 154(6): 890-897 (2006)
- [j61]Gregory Gutin, Tommy R. Jensen, Anders Yeo: Domination analysis for minimum multiprocessor scheduling. Discrete Applied Mathematics 154(18): 2613-2619 (2006)
- [j60]
- [j59]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)
- [j58]Gregory Gutin, Arash Rafiey, Simone Severini, Anders Yeo: Hamilton cycles in digraphs of unitary matrices. Discrete Mathematics 306(24): 3315-3320 (2006)
- [j57]Gregory Gutin, Arash Rafiey, Anders Yeo: On n-partite Tournaments with Unique n-cycle. Graphs and Combinatorics 22(2): 241-249 (2006)
- [j56]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)
- [c7]Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367
- [c6]Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71
- [c5]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
- [i6]Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. CoRR abs/cs/0602038 (2006)
- [i5]Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. CoRR abs/cs/0604095 (2006)
- [i4]Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. CoRR abs/cs/0608101 (2006)
- 2005
- [j55]Gregory Gutin, N. Jones, Arash Rafiey, Simone Severini, Anders Yeo: Mediated digraphs and quantum nonlocality. Discrete Applied Mathematics 150(1-3): 41-50 (2005)
- [j54]Gregory Gutin, Tommy R. Jensen, Anders Yeo: Batched bin packing. Discrete Optimization 2(1): 71-82 (2005)
- [j53]Gregory Gutin, Fred Glover: Further Extension of the TSP Assign Neighborhood. J. Heuristics 11(5-6): 501-505 (2005)
- [j52]David Blokh, Gregory Gutin, Anders Yeo: A problem of finding an acceptable variant in generalized project networks. JAMDS 9(2): 75-81 (2005)
- [j51]Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo: Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005)
- [c4]Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso: Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. AAIM 2005: 427-439
- [c3]Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94
- [c2]Gregory Gutin, Tommy R. Jensen, Anders Yeo: Optimal On-Line Bin Packing with Two Item Sizes. ACiD 2005: 95-103
- [i3]Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost and List Homomorphisms to Semicomplete Digraphs. CoRR abs/cs/0507017 (2005)
- [i2]Gregory Gutin, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. CoRR abs/cs/0509091 (2005)
- [i1]Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CoRR abs/cs/0511030 (2005)
- 2004
- [j50]Nalan Gülpinar, Gregory Gutin, Gautam Mitra, A. Zverovitch: Extracting pure network submatrices in linear programs using signed graphs. Discrete Applied Mathematics 137(3): 359-372 (2004)
- [j49]Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: When the greedy algorithm fails. Discrete Optimization 1(2): 121-127 (2004)
- [j48]Gregory Gutin, Arash Rafiey: When n-cycles in n-partite tournaments are longest cycles. Discrete Mathematics 289(1-3): 163-168 (2004)
- [j47]Noga Alon, Gregory Gutin, Michael Krivelevich: Algorithms with large domination ratio. J. Algorithms 50(1): 118-131 (2004)
- [j46]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
- [j45]Gregory Gutin, Alek Vainshtein, Anders Yeo: Domination analysis of combinatorial optimization problems. Discrete Applied Mathematics 129(2-3): 513-520 (2003)
- [j44]Gregory Gutin, Anders Yeo: Upper bounds on ATSP neighborhood size. Discrete Applied Mathematics 129(2-3): 533-538 (2003)
- [j43]Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. Journal of Graph Theory 44(3): 193-207 (2003)
- [j42]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
- [b1]Jørgen Bang-Jensen, Gregory Gutin: Digraphs - theory, algorithms and applications. Springer 2002, ISBN 978-1-85233-611-0, pp. I-XXII, 1-754
- [j41]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)
- [j40]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)
- [j39]Gregory Gutin, Anders Yeo: Orientations of digraphs almost preserving diameter. Discrete Applied Mathematics 121(1-3): 129-138 (2002)
- [j38]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)
- [j37]
- 2001
- [j36]Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich: Construction heuristics for the asymmetric TSP. European Journal of Operational Research 129(3): 555-568 (2001)
- [j35]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)
- [j34]Gregory Gutin, Anders Yeo: TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Lett. 28(3): 107-111 (2001)
- 2000
- [j33]Nalan Gülpinar, Gregory Gutin, Gautam Mitra, István Maros: Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms. Comp. Opt. and Appl. 15(3): 235-247 (2000)
- [j32]Gregory Gutin, Alexandr V. Kostochka, Bjarne Toft: On the Hajo's number of graphs. Discrete Mathematics 213(1-3): 153-161 (2000)
- [j31]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)
- [j30]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)
- [j29]Gregory Gutin, Anders Yeo: Kings in semicomplete multipartite digraphs. Journal of Graph Theory 33(3): 177-183 (2000)
1990 – 1999
- 1999
- [j28]
- [j27]Gregory Gutin: Exponential neighbourhood local search for the traveling salesman problem. Computers & OR 26(4): 313-320 (1999)
- [j26]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)
- [j25]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)
- [c1]Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich: Construction Heuristics and Domination Analysis for the Asymmetric TSP. Algorithm Engineering 1999: 85-94
- 1998
- [j24]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)
- [j23]Gregory Gutin: A note on the cardinality of certain classes of unlabeled multipartite tournaments. Discrete Mathematics 186(1-3): 277-280 (1998)
- [j22]Jørgen Bang-Jensen, Gregory Gutin: Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discrete Mathematics 188(1-3): 61-72 (1998)
- [j21]Gregory Gutin, Vadim E. Zverovich: Upper domination and upper irredundance perfect graphs. Discrete Mathematics 190(1-3): 95-105 (1998)
- [j20]Gregory Gutin, Benny Sudakov, Anders Yeo: Note on alternating directed cycles. Discrete Mathematics 191(1-3): 101-107 (1998)
- [j19]Jørgen Bang-Jensen, Gregory Gutin: Generalizations of tournaments: A survey. Journal of Graph Theory 28(4): 171-202 (1998)
- [j18]Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. Journal of Graph Theory 29(2): 111-132 (1998)
- 1997
- [j17]Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Combinatorics, Probability & Computing 6(3): 255-261 (1997)
- [j16]Jørgen Bang-Jensen, Gregory Gutin: Vertex heaviest paths and cycles in quasi-transitive digraphs. Discrete Mathematics 163(1-3): 217-223 (1997)
- [j15]Jørgen Bang-Jensen, Gregory Gutin: Paths and cycles in extended and decomposable digraphs, . Discrete Mathematics 164(1-3): 5-19 (1997)
- [j14]Jørgen Bang-Jensen, Gregory Gutin: Alternating cycles and paths in edge-coloured multigraphs: A survey. Discrete Mathematics 165-166: 39-60 (1997)
- [j13]Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann: A classification of locally semicomplete digraphs. Discrete Mathematics 167-168: 101-114 (1997)
- [j12]Noga Alon, Gregory Gutin: Properly colored Hamilton cycles in edge-colored complete graphs. Random Struct. Algorithms 11(2): 179-186 (1997)
- 1996
- [j11]Gregory Gutin, Anders Yeo: Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discrete Applied Mathematics 69(1-2): 75-82 (1996)
- [j10]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)
- [j9]Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: On k-strong and k-cyclic digraphs. Discrete Mathematics 162(1-3): 1-11 (1996)
- [j8]Jørgen Bang-Jensen, Gregory Gutin, Hao Li: Sufficient conditions for a digraph to be Hamiltonian. Journal of Graph Theory 22(2): 181-187 (1996)
- 1995
- [j7]David Blokh, Gregory Gutin: Maximizing Traveling Salesman Problem for Special Matrices. Discrete Applied Mathematics 56(1): 83-86 (1995)
- [j6]Jørgen Bang-Jensen, Gregory Gutin, Jing Huang: Weakly Hamiltonian-connected ordinary multipartite tournaments. Discrete Mathematics 138(1-3): 63-74 (1995)
- [j5]Gregory Gutin: Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. Discrete Mathematics 141(1-3): 153-162 (1995)
- [j4]Gregory Gutin: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey. Journal of Graph Theory 19(4): 481-505 (1995)
- 1994
- [j3]Gregory Gutin: Minimizing and maximizing the diameter in orientations of graphs. Graphs and Combinatorics 10(2-4): 225-230 (1994)
- 1993
- [j2]
- [j1]Gregory Gutin: Finding a Longest Path in a Complete Multipartite Digraph. SIAM J. Discrete Math. 6(2): 270-273 (1993)
Coauthor Index
[j110] [j109] [j108] [j107] [i59] [i57] [j106] [j105] [j104] [j102] [j101] [j100] [c34] [c33] [c30] [c29] [i55] [i54] [i52] [i50] [i49] [j98] [j93] [j91] [c28] [c27] [i47] [i46] [i45] [i44] [i43] [i41] [i40] [j88] [j87] [j86] [j85] [c26] [c25] [c24] [c23] [i36] [i35] [i34] [i32] [j82] [j79] [j78] [c19] [c18] [c16] [i31] [i29] [i25] [i24] [j73] [j72] [j71] [j70] [j68] [c14] [c12] [i15] [j67] [j66] [i9] [j65] [j64] [j63] [j62] [j61] [j59] [j58] [j57] [c7] [c6] [i6] [i5] [i4] [j55] [j54] [j52] [j51] [c4] [c3] [c2] [i3] [i2] [i1] [j49] [j46] [j45] [j44] [j43] [j42] [j41] [j40] [j39] [j38] [j37] [j36] [j35] [j34] [j31] [j30] [j29] [j26] [c1] [j24] [j20] [j18] [j17] [j11] [j9]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:10 CEST by the dblp team