Gregory Gutin

发表

Structural Parameterizations of the Mixed Chinese Postman Problem

Gregory Gutin, Mark Jones, Magnus Wahlström, 2014, ESA.

Digraphs - theory, algorithms and applications

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 2002 .

A Multivariate Approach for Checking Resiliency in Access Control

Gregory Gutin, Jason Crampton, Rémi Watrigant, 2016, AAIM.

Sufficient conditions for a digraph to be Hamiltonian

Gregory Gutin, Jørgen Bang-Jensen, Hao Li, 1996, J. Graph Theory.

TSP tour domination and Hamilton cycle decompositions of regular digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2001, Oper. Res. Lett..

When n-cycles in n-partite tournaments are longest cycles

Gregory Gutin, Arash Rafiey, G. Gutin, 2004, Discret. Math..

On-line bin Packing with Two Item Sizes

Gregory Gutin, Anders Yeo, Tommy R. Jensen, 2006, Algorithmic Oper. Res..

On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1999, Discret. Appl. Math..

Note on Perfect Forests in Digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2015, J. Graph Theory.

Tolerance-based greedy algorithms for the traveling salesman problem

Gerold Jäger, Gregory Gutin, Boris Goldengorin, 2007 .

Orientations of digraphs almost preserving diameter

Gregory Gutin, Anders Yeo, G. Gutin, 2002, Discret. Appl. Math..

Connected (g, f)-factors and supereulerian digraphs

Gregory Gutin, G. Gutin, 1999, Ars Comb..

Remarks on hamiltonian digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2001, Australas. J Comb..

Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem pdf

Gregory Gutin, Daniel Karapetyan, G. Gutin, 2010, Eur. J. Oper. Res..

On Cycles in Multipartite Tournaments

Gregory Gutin, G. Gutin, 1993, J. Comb. Theory, Ser. B.

Upper bounds on ATSP neighborhood size

Gregory Gutin, Anders Yeo, G. Gutin, 2003, Discret. Appl. Math..

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1998, J. Graph Theory.

Parameterized and Approximation Algorithms for the Load Coloring Problem

Gregory Gutin, Mark Jones, Bin Sheng, 2016, Algorithmica.

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average

Michael R. Fellows, Gregory Gutin, Mark Jones, 2011, FSTTCS.

Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints pdf

Gregory Gutin, Daniel Karapetyan, Andrei V. Gagarin, 2015, FAW.

Parameterized complexity of the k-arc Chinese Postman Problem

Gregory Gutin, Mark Jones, Bin Sheng, 2014, J. Comput. Syst. Sci..

Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms

Nalan Gülpinar, Gautam Mitra, Gregory Gutin, 2000, Comput. Optim. Appl..

Parameterizations of Test Cover with Bounded Test Sizes

Gregory Gutin, Mark Jones, Robert Crowston, 2014, Algorithmica.

Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs pdf

Gregory Gutin, Arvind Gupta, Eun Jung Kim, 2007, ArXiv.

Editor’s Note: Special Issue Dedicated to the 60th Birthday of Gregory Gutin

Gregory Gutin, 2018, Algorithmica.

Minimum leaf out-branching and related problems

Gregory Gutin, Eun Jung Kim, Igor Razgon, 2008, Theor. Comput. Sci..

Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems

Gregory Gutin, 2009, Electron. Notes Discret. Math..

Note on Perfect Forests pdf

Gregory Gutin, 2016, J. Graph Theory.

A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound pdf

Stefan Szeider, Gregory Gutin, Anders Yeo, 2009, ArXiv.

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Stefan Szeider, Gregory Gutin, Anders Yeo, 2007, Theory of Computing Systems.

Algorithms and Their Complexity

Gregory Gutin, Jørgen Bang-Jensen, 2009 .

Minimum cost homomorphisms to semicomplete multipartite digraphs

Gregory Gutin, Anders Yeo, Arash Rafiey, 2005, Discret. Appl. Math..

A probabilistic approach to problems parameterized above or below tight bounds

Stefan Szeider, Gregory Gutin, Anders Yeo, 2009, J. Comput. Syst. Sci..

Fixed-Parameter Tractability of Satisfying beyond the Number of Variables

Saket Saurabh, Venkatesh Raman, Gregory Gutin, 2012, SAT.

Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs pdf

Gregory Gutin, Ruijuan Li, G. Gutin, 2017, ArXiv.

Kings in semicomplete multipartite digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2000, J. Graph Theory.

On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations

Gregory Gutin, Mark Jones, Magnus Wahlström, 2016, ACM Trans. Priv. Secur..

On the parameterized complexity of the workflow satisfiability problem

Gregory Gutin, Anders Yeo, Jason Crampton, 2012, CCS '12.

Local search heuristics for the multidimensional assignment problem

Gregory Gutin, Daniel Karapetyan, G. Gutin, 2008, J. Heuristics.

An Approach to Parameterized Resiliency Problems Using Integer Linear Programming pdf

Gregory Gutin, Jason Crampton, Rémi Watrigant, 2016, ArXiv.

Level of repair analysis and minimum cost homomorphisms of graphs

Gregory Gutin, Anders Yeo, Arash Rafiey, 2005, Discret. Appl. Math..

Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games

Gregory Gutin, Anders Yeo, Philip R. Neary, 2020, COCOON.

Solving MAX-r-SAT Above a Tight Lower Bound

Noga Alon, Stefan Szeider, Gregory Gutin, 2010, SODA.

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1997, Combinatorics, Probability and Computing.

Note on alternating directed cycles

Benny Sudakov, Gregory Gutin, Anders Yeo, 1998, Discret. Math..

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2006, Discret. Optim..

Hamilton cycles in digraphs of unitary matrices

Simone Severini, Gregory Gutin, Anders Yeo, 2006, Discret. Math..

Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances pdf

Gregory Gutin, Mark Jones, 2012, ArXiv.

Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem

Gregory Gutin, Natalio Krasnogor, Daniel Karapetyan, 2007, NICSO.

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels pdf

Leo van Iersel, Gregory Gutin, Matthias Mnich, 2010, ArXiv.

On the Workflow Satisfiability Problem with Class-independent Constraints

Gregory Gutin, Mark Jones, Jason Crampton, 2015, IPEC.

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms pdf

Gregory Gutin, Magnus Wahlström, Bart M. P. Jansen, 2020, ArXiv.

Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials

Gregory Gutin, Magnus Wahlström, Meirav Zehavi, 2017, J. Comput. Syst. Sci..

On the number of connected convex subgraphs of a connected acyclic digraph

Gregory Gutin, Anders Yeo, G. Gutin, 2009, Discret. Appl. Math..

Construction Heuristics and Domination Analysis for the Asymmetric TSP

Fred W. Glover, Gregory Gutin, Anders Yeo, 1999, WAE.

Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints pdf

Gregory Gutin, Mark Jones, Robert Crowston, 2012, FAW-AAIM.

A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem

Gregory Gutin, Daniel Karapetyan, G. Gutin, 2010, Evolutionary Computation.

Upper domination and upper irredundance perfect graphs

Gregory Gutin, Vadim E. Zverovich, 1998, Discret. Math..

Domination analysis of combinatorial optimization problems

Gregory Gutin, Anders Yeo, Alek Vainshtein, 2003, Discret. Appl. Math..

Strong Subgraph Connectivity of Digraphs: A Survey pdf

Gregory Gutin, Yuefang Sun, 2018, ArXiv.

Parameterized Eulerian strong component arc deletion problem on tournaments

Gregory Gutin, Mark Jones, Robert Crowston, 2011, Inf. Process. Lett..

Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints

Gregory Gutin, Mark Jones, Jason Crampton, 2014, FAW.

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

Stefan Szeider, Gregory Gutin, Anders Yeo, 2010, Algorithmica.

Pattern-Based Plan Construction for the Workflow Satisfiability Problem pdf

Gregory Gutin, Mark Jones, Jason Crampton, 2013, ArXiv.

Kernelization, Permutation CSPs Parameterized above Average

Gregory Gutin, 2016, Encyclopedia of Algorithms.

Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey

Gregory Gutin, G. Gutin, 1995, J. Graph Theory.

Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2)

Dimitrios M. Thilikos, Gregory Gutin, Kazuo Iwama, 2013, NII Shonan Meet. Rep..

(Non-)existence of polynomial kernels for the Test Cover problem pdf

Gregory Gutin, Anders Yeo, Gabriele Muciaccia, 2013, Inf. Process. Lett..

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1998, Discret. Appl. Math..

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem

Fedor V. Fomin, Saket Saurabh, Gregory Gutin, 2009, COCOON.

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Leo van Iersel, Gregory Gutin, Matthias Mnich, 2012, J. Comput. Syst. Sci..

Note on Large Subsets of Binary Vectors with Similar Distances

Gregory Gutin, Mark Jones, 2012, SIAM J. Discret. Math..

Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour

Gregory Gutin, Anders Yeo, G. Gutin, 1999, Comput. Oper. Res..

Strong subgraph k‐connectivity pdf

Gregory Gutin, Anders Yeo, Xiaoyan Zhang, 2018, J. Graph Theory.

07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs

Erik D. Demaine, Dániel Marx, Gregory Gutin, 2007, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.

Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound pdf

Gregory Gutin, Mark Jones, Robert Crowston, 2012, ArXiv.

Chinese Postman Problem on edge-colored multigraphs

Gregory Gutin, Mark Jones, Magnus Wahlström, 2015, Discret. Appl. Math..

A Memetic Algorithm for the Multidimensional Assignment Problem

Gregory Gutin, Daniel Karapetyan, 2009, SLS.

Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

Gregory Gutin, Daniel Karapetyan, G. Gutin, 2010, Eur. J. Oper. Res..

The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth

Gregory Gutin, Mark Jones, Magnus Wahlström, 2016, SIAM J. Discret. Math..

Guest Editorial: Special Issue on Parameterized and Exact Computation

Stefan Szeider, Gregory Gutin, 2014, Algorithmica.

Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions pdf

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2020, J. Graph Theory.

Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound

Gregory Gutin, Mark Jones, Robert Crowston, 2012, FSTTCS.

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming pdf

Stefan Szeider, Gregory Gutin, Anders Yeo, 2010, IPEC.

Convex Sets in Acyclic Digraphs

Gregory Gutin, Paul N. Balister, Stefanie Gerke, 2007, Order.

k-Distinct In- and Out-Branchings in Digraphs

Gregory Gutin, Magnus Wahlström, Felix Reidl, 2017, ICALP.

Alternating cycles and paths in edge-coloured multigraphs: A survey

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1994, Discret. Math..

Better Than Optimal: Fast Identification of Custom Instruction Candidates

Gregory Gutin, Anders Yeo, Joseph Reddington, 2009, 2009 International Conference on Computational Science and Engineering.

Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey pdf

Gregory Gutin, Anders Yeo, G. Gutin, 2011, The Multivariate Algorithmic Revolution and Beyond.

Parameterized complexity of MaxSat Above Average

Saket Saurabh, Venkatesh Raman, Gregory Gutin, 2013, Theor. Comput. Sci..

Constraint expressions and workflow satisfiability

Gregory Gutin, Jason Crampton, G. Gutin, 2013, SACMAT '13.

Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory pdf

Gregory Gutin, Mark Jones, Robert Crowston, 2011, ArXiv.

$k$-Distinct In- and Out-Branchings in Digraphs

Gregory Gutin, Magnus Wahlström, Felix Reidl, 2016, ICALP.

Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies pdf

Gregory Gutin, Mark Jones, Jason Crampton, 2015, DBSec.

Vertex Cover Problem Parameterized Above and Below Tight Bounds

Gregory Gutin, Eun Jung Kim, Michael Lampis, 2009, Theory of Computing Systems.

Parameterized Traveling Salesman Problem: Beating the Average

Gregory Gutin, Viresh Patel, 2016, SIAM J. Discret. Math..

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach

Michael R. Fellows, Gregory Gutin, Mark Jones, 2014, J. Comput. Syst. Sci..

A note on the cardinality of certain classes of unlabeled multipartite tournaments

Gregory Gutin, 1998, Discret. Math..

Constraint Branching in Workflow Satisfiability Problem

Gregory Gutin, Daniel Karapetyan, 2020, SACMAT.

FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs pdf

Gregory Gutin, Daniel Karapetyan, Igor Razgon, 2009, ArXiv.

Acyclic Digraphs

Gregory Gutin, G. Gutin, 2018, Classes of Directed Graphs.

When the greedy algorithm fails

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2004, Discret. Optim..

Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems

Jing Huang, Gregory Gutin, Boris Goldengorin, 2006, WAOA.

Parameterized algorithms for load coloring problem pdf

Gregory Gutin, Mark Jones, 2014, Inf. Process. Lett..

Note on 4-Kings in Bipartite Hypertournaments pdf

Gregory Gutin, Stefanie Gerke, Jiangdong Ai, 2020, ArXiv.

Digraphs - Theory, Algorithms and Applications, Second Edition

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 2009, Springer Monographs in Mathematics.

Generalized Traveling Salesman Problem Reduction Algorithms

Gregory Gutin, Daniel Karapetyan, G. Gutin, 2008, Algorithmic Oper. Res..

Iterative Plan Construction for the Workflow Satisfiability Problem

Gregory Gutin, Mark Jones, Jason Crampton, 2013, J. Artif. Intell. Res..

On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments pdf

Gregory Gutin, Eun Jung Kim, Eun Jung Kim, 2007, ArXiv.

Parameterized Pre-coloring Extension and List Coloring Problems

Gregory Gutin, Magnus Wahlström, Sebastian Ordyniak, 2019, STACS.

Assignment problem based algorithms are impractical for the generalized TSP

Gregory Gutin, Anders Yeo, 2003, Australas. J Comb..

Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number

Gregory Gutin, Anders Yeo, 2002, Discret. Appl. Math..

Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs

Gregory Gutin, Anders Yeo, 2001, Graphs Comb..

Maximizing Traveling Salesman Problem for Special Matrices

Gregory Gutin, David Blokh, 1995, Discret. Appl. Math..

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Stefan Szeider, Gregory Gutin, Anders Yeo, 2006, CIAC.

Algorithms with large domination ratio

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

On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem

Gregory Gutin, Anders Yeo, Jason Crampton, 2013, TSEC.

Minimizing and maximizing the diameter in orientations of graphs

Gregory Gutin, G. Gutin, 1994, Graphs Comb..

Note on Max Lin-2 above Average

Gregory Gutin, Mark Jones, Robert Crowston, 2010, Inf. Process. Lett..

Alternative parameterizations of Metric Dimension

Gregory Gutin, Magnus Wahlström, M. S. Ramanujan, 2020, Theor. Comput. Sci..

On the Satisfiability of Workflows with Release Points

Gregory Gutin, Jason Crampton, Rémi Watrigant, 2017, SACMAT.

Report on NII Shonan Meeting 2013-018

Dimitrios M. Thilikos, Gregory Gutin, 2014, Bull. EATCS.

Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width pdf

Gregory Gutin, Anders Yeo, G. Gutin, 2011, Discret. Appl. Math..

The Greedy Algorithm for the Symmetric TSP

Gregory Gutin, Anders Yeo, G. Gutin, 2007, Algorithmic Oper. Res..

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs pdf

Gregory Gutin, Anders Yeo, Pavol Hell, 2006, ArXiv.

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments

Gregory Gutin, Dingjun Lou, Zan-Bo Zhang, 2021, J. Graph Theory.

Local Search Algorithms for the Generalized Traveling Salesman Problem pdf

Gregory Gutin, Gregory Gutin, Daniel Karapetyan, 2010, ArXiv.

Minimum Leaf Out-Branching Problems pdf

Gregory Gutin, Eun Jung Kim, Igor Razgon, 2008, AAIM.

Parameterized Complexity of MaxSat above Average

Saket Saurabh, Venkatesh Raman, Gregory Gutin, 2012, LATIN.

On r-Simple k-Path and Related Problems Parameterized by k/r

Gregory Gutin, Magnus Wahlström, Meirav Zehavi, 2018, SODA.

Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs

Gregory Gutin, Mark Jones, Magnus Wahlström, 2014, WG.

Parameterized Rural Postman and Conjoining Bipartite Matching Problems pdf

Gregory Gutin, Magnus Wahlström, Anders Yeo, 2013, ArXiv.

Basic Terminology, Notation and Results

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 2018, Classes of Directed Graphs.

Properly colored Hamilton cycles in edge-colored complete graphs

Noga Alon, Gregory Gutin, N. Alon, 1997, Random Struct. Algorithms.

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods pdf

Gregory Gutin, George B. Mertzios, Felix Reidl, 2018, ArXiv.

Solving MAX-r-SAT Above a Tight Lower Bound

Noga Alon, Stefan Szeider, Gregory Gutin, 2010, SODA '10.

On the number of quasi‐kernels in digraphs

Eng Guan Tay, Gregory Gutin, Anders Yeo, 2001, J. Graph Theory.

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

Gregory Gutin, Anders Yeo, Arash Rafiey, 2009, Graphs Comb..

Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs

Gregory Gutin, Eun Jung Kim, Arash Rafiey, 2010, Australas. J Comb..

Multipartite tournaments with small number of cycles

Gregory Gutin, Arash Rafiey, G. Gutin, 2006, Australas. J Comb..

Batched bin packing

Gregory Gutin, Anders Yeo, Tommy R. Jensen, 2005, Discret. Optim..

An algorithm for finding input-output constrained convex sets in an acyclic digraph

Gregory Gutin, Anders Yeo, Joseph Reddington, 2012, J. Discrete Algorithms.

On k-strong and k-cyclic digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1996, Discret. Math..

Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation pdf

Gregory Gutin, Mark Jones, Robert Crowston, 2010, ArXiv.

Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis pdf

Gregory Gutin, Magnus Wahlström, 2016, Inf. Process. Lett..

Paths and cycles in extended and decomposable digraphs,

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1997, Discret. Math..

The traveling salesman problem

Gregory Gutin, Abraham P. Punnen, G. Gutin, 2006, Discret. Optim..

Parameterized Resiliency Problems via Integer Linear Programming

Gregory Gutin, Martin Koutecký, Jason Crampton, 2017, CIAC.

Parameterized Constraint Satisfaction Problems: a Survey

Gregory Gutin, Anders Yeo, 2017, The Constraint Satisfaction Problem.

The Authorization Policy Existence Problem

Gregory Gutin, Jason Crampton, Rémi Watrigant, 2016, IEEE Transactions on Dependable and Secure Computing.

Parameterized resiliency problems

Gregory Gutin, Martin Koutecký, Jason Crampton, 2019, Theor. Comput. Sci..

Systems of Linear Equations over F2 and Problems Parameterized above Average

Gregory Gutin, Mark Jones, Robert Crowston, 2010, SWAT.

Vertex heaviest paths and cycles in quasi-transitive digraphs

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1997, Discret. Math..

FPT algorithms and kernels for the Directed k-Leaf problem

Gregory Gutin, Anders Yeo, Eun Jung Kim, 2008, J. Comput. Syst. Sci..

Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

Gregory Gutin, Daniel Karapetyan, Igor Razgon, 2009, IWPEC.

A dichotomy for minimum cost graph homomorphisms

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

Domination Analysis in Combinatorial Optimization

Gregory Gutin, G. Gutin, 2009, Encyclopedia of Optimization.

A memetic algorithm for the generalized traveling salesman problem

Gregory Gutin, Daniel Karapetyan, G. Gutin, 2008, Natural Computing.

Extracting pure network submatrices in linear programs using signed graphs

Nalan Gülpinar, Gregory Gutin, Gautam Mitra, 2004, Discret. Appl. Math..

An algorithm for finding input-output constrained convex sets in an acyclic digraph

Gregory Gutin, Anders Yeo, Joseph Reddington, 2008, J. Discrete Algorithms.

A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application

Gregory Gutin, Mark Jones, Anders Yeo, 2011, FCT.

Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms pdf

Gregory Gutin, Magnus Wahlström, Meirav Zehavi, 2017, ArXiv.

Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs

Eng Guan Tay, Gregory Gutin, Anders Yeo, 2002, Graphs Comb..

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

Gregory Gutin, Anders Yeo, Arash Rafiey, 2008, Graphs Comb..

Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian

Gregory Gutin, Anders Yeo, G. Gutin, 2000, J. Comb. Theory, Ser. B.

Approximation algorithms for general cluster routing problem

Gregory Gutin, Donglei Du, Jian Sun, 2020, COCOON.

Algorithms for generating convex sets in acyclic digraphs

Gregory Gutin, Anders Yeo, Paul N. Balister, 2007, J. Discrete Algorithms.

Component Order Connectivity in Directed Graphs pdf

Gregory Gutin, Magnus Wahlström, Jørgen Bang-Jensen, 2020, IPEC.

Searching for Maximum Out-Degree Vertices in Tournaments pdf

Gregory Gutin, George B. Mertzios, Felix Reidl, 2018, ArXiv.

Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

Stefan Kratsch, Gregory Gutin, Magnus Wahlström, 2015, Algorithmica.

Strong subgraph k-connectivity bounds pdf

Gregory Gutin, Yuefang Sun, 2018, ArXiv.

Path-Contractions, Edge Deletions and Connectivity Preservation

Gregory Gutin, Magnus Wahlström, M. S. Ramanujan, 2017, ESA.

Note on maximal bisection above tight lower bound pdf

Gregory Gutin, Anders Yeo, 2010, Inf. Process. Lett..

Characterization of edge‐colored complete graphs with properly colored Hamilton paths

Gregory Gutin, Arash Rafiey, Tommy R. Jensen, 2006, J. Graph Theory.

Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph

Gregory Gutin, Anders Yeo, G. Gutin, 1996, Discret. Appl. Math..

A problem of finding an acceptable variant in generalized project networks

Gregory Gutin, Anders Yeo, David Blokh, 2005, Adv. Decis. Sci..

Parameterized Algorithms for Directed Maximum Leaf Problems pdf

Noga Alon, Fedor V. Fomin, Saket Saurabh, 2007, ICALP.

Cryptographic enforcement of information flow policies without public information via tree partitions

Gregory Gutin, Mark Jones, Jason Crampton, 2016, J. Comput. Secur..

Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths

Gregory Gutin, Mark Jones, Bin Sheng, 2016, Inf. Process. Lett..

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications

Gregory Gutin, Mark Jones, Robert Crowston, 2011, Algorithmica.

Parameterized and Approximation Algorithms for the Load Coloring Problem

Gregory Gutin, Mark Jones, Bin Sheng, 2015, IPEC.

Odd properly colored cycles in edge-colored graphs

Gregory Gutin, Magnus Wahlström, Bin Sheng, 2016, Discret. Math..

Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs

Gregory Gutin, G. Gutin, 1995, Discret. Math..

Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs pdf

Gregory Gutin, Yuefang Sun, G. Gutin, 2019, Discret. Math..

Anti-matroids

Gregory Gutin, Anders Yeo, 2002, Oper. Res. Lett..

The bi-objective workflow satisfiability problem and workflow resiliency pdf

Gregory Gutin, Jason Crampton, Rémi Watrigant, 2017, J. Comput. Secur..

Transformations of generalized ATSP into ATSP

David Ben-Arieh, Gregory Gutin, Anders Yeo, 2003, Oper. Res. Lett..

Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs

Gregory Gutin, G. Gutin, 1994, Australas. J Comb..

Domination analysis for minimum multiprocessor scheduling

Gregory Gutin, Anders Yeo, Tommy R. Jensen, 2006, Discret. Appl. Math..

Special Issue on Parameterized Complexity of Discrete Optimization

Michael R. Fellows, Fedor V. Fomin, Gregory Gutin, 2011, Discret. Optim..

Fixed-Parameter Complexity of Minimum Profile Problems

Stefan Szeider, Gregory Gutin, Anders Yeo, 2007, Algorithmica.

A selection of useful theoretical tools for the design and analysis of optimization heuristics

Gregory Gutin, Daniel Karapetyan, G. Gutin, 2009, Memetic Comput..

The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops pdf

Gregory Gutin, Eun Jung Kim, Eun Jung Kim, 2007, Discret. Appl. Math..

Note on edge-colored graphs and digraphs without properly colored cycles pdf

Gregory Gutin, G. Gutin, 2007, Australas. J Comb..

Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

Gregory Gutin, Mark Jones, Anders Yeo, 2010, Theor. Comput. Sci..

Valued Workflow Satisfiability Problem

Gregory Gutin, Jason Crampton, Daniel Karapetyan, 2015, SACMAT.

Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs

Gregory Gutin, Anders Yeo, Meike Tewes, 2000, Discret. Math..

Rural postman parameterized by the number of components of required edges

Gregory Gutin, Magnus Wahlström, Anders Yeo, 2017, J. Comput. Syst. Sci..

A Probabilistic Approach to Problems Parameterized above or below Tight Bounds

Stefan Szeider, Gregory Gutin, Anders Yeo, 2009, IWPEC.

Resiliency Policies in Access Control Revisited

Gregory Gutin, Jason Crampton, Rémi Watrigant, 2016, SACMAT.

Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP

Gregory Gutin, Anders Yeo, Alexey Zverovich, 2001, Discret. Appl. Math..

Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints

Gregory Gutin, Daniel Karapetyan, Andrew J. Parkes, 2016, J. Artif. Intell. Res..

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

Gregory Gutin, Jørgen Bang-Jensen, Jing Huang, 1993, Discret. Math..

Empirical evaluation of construction heuristics for the multidimensional assignment problem pdf

Gregory Gutin, Boris Goldengorin, Daniel Karapetyan, 2009, ArXiv.

Further Extension of the TSP Assign Neighborhood

Fred W. Glover, Gregory Gutin, F. Glover, 2005, J. Heuristics.

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem

Fedor V. Fomin, Saket Saurabh, Gregory Gutin, 2009, J. Comput. Syst. Sci..

Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

Stefan Kratsch, Gregory Gutin, Magnus Wahlström, 2014, IPEC.

Maximum balanced subgraph problem parameterized above lower bound pdf

Gregory Gutin, Mark Jones, Robert Crowston, 2013, Theor. Comput. Sci..

Mediated digraphs and quantum nonlocality

Simone Severini, Gregory Gutin, Anders Yeo, 2005, Discret. Appl. Math..

Parameterized complexity of k-Chinese Postman Problem

Gregory Gutin, Anders Yeo, Gabriele Muciaccia, 2013, Theor. Comput. Sci..

Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound pdf

Gregory Gutin, Matthias Mnich, Anders Yeo, 2009, ArXiv.

Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems

Jing Huang, Gregory Gutin, Boris Goldengorin, 2008, J. Heuristics.

On the Hajo's number of graphs

Alexandr V. Kostochka, Gregory Gutin, Bjarne Toft, 2000, Discret. Math..

On complexity of Minimum Leaf Out-Branching problem pdf

Gregory Gutin, Peter Dankelmann, Eun Jung Kim, 2008, Discret. Appl. Math..

Local Search Heuristics for the Multidimensional Assignment Problem

Gregory Gutin, Daniel Karapetyan, 2009, Graph Theory, Computational Intelligence and Thought.

Kernels in planar digraphs

Gregory Gutin, Anders Yeo, Ton Kloks, 2005, J. Comput. Syst. Sci..

Some Parameterized Problems On Digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2008, Comput. J..

Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs pdf

Gregory Gutin, Anders Yeo, Arash Rafiey, 2006, SIAM J. Discret. Math..

Parameterized TSP: Beating the Average pdf

Gregory Gutin, Viresh Patel, 2014, ArXiv.

Algorithms for the workflow satisfiability problem engineered for counting constraints

Gregory Gutin, Mark Jones, Jason Crampton, 2015, Journal of Combinatorial Optimization.

Exponential neighbourhood local search for the traveling salesman problem

Gregory Gutin, G. Gutin, 1999, Comput. Oper. Res..

Parameterized Study of the Test Cover Problem pdf

Saket Saurabh, Gregory Gutin, Mark Jones, 2012, MFCS.

Netflix Games: Local Public Goods with Capacity Constraints

Gregory Gutin, Stefanie Gerke, Sung-Ha Hwang, 2019 .

Acyclicity in edge-colored graphs

Gregory Gutin, Mark Jones, Magnus Wahlström, 2017, Discret. Math..

On n-partite Tournaments with Unique n-cycle

Gregory Gutin, Anders Yeo, Arash Rafiey, 2006, Graphs Comb..

Generalizations of tournaments: A survey

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1998, J. Graph Theory.

Kernelization, Constraint Satisfaction Problems Parameterized above Average

Gregory Gutin, 2016, Encyclopedia of Algorithms.

Alternating cycles and trails in 2-edge-coloured complete multigraphs

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1998, Discret. Math..

Maximum balanced subgraph problem parameterized above lower bound

Gregory Gutin, Mark Jones, Robert Crowston, 2012, Theor. Comput. Sci..

Properly Coloured Cycles and Paths: Results and Open Problems pdf

Gregory Gutin, Eun Jung Kim, Eun Jung Kim, 2008, Graph Theory, Computational Intelligence and Thought.

Kings in Multipartite Hypertournaments.

Gregory Gutin, Stefanie Gerke, Jiangdong Ai, 2020 .

Bounded and Approximate Strong Satisfiability in Workflows

Gregory Gutin, Jason Crampton, Diptapriyo Majumdar, 2019, SACMAT.

Cryptographic Enforcement of Information Flow Policies Without Public Information

Gregory Gutin, Mark Jones, Jason Crampton, 2014, ACNS.

The Workflow Satisfiability Problem with User-Independent Constraints

Gregory Gutin, 2019, 2019 First International Conference on Graph Computing (GC).

The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs pdf

Gregory Gutin, Bin Sheng, Ruijuan Li, 2017, ArXiv.

Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs pdf

Gregory Gutin, Yuefang Sun, Jiangdong Ai, 2018, Discret. Math..

A new bound for 3-satisfiable MaxSat and its algorithmic application

Mark Jones, Gregory Gutin, Anders Yeo, 2013, Inf. Comput..

Note on Upper Bounds for TSP Domination Number

Gregory Gutin, Anders Yeo, Angela Koller, 2006, Algorithmic Oper. Res..

07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs

Erik D. Demaine, Dániel Marx, Gregory Gutin, 2007, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.

Strong subgraph k-arc-connectivity pdf

Gregory Gutin, Yuefang Sun, 2018, ArXiv.

An approximate algorithm for combinatorial optimization problems with two parameters

Gregory Gutin, David Blokh, G. Gutin, 1995, Australas. J Comb..

Weakly Hamiltonian-connected ordinary multipartite tournaments

Gregory Gutin, Jørgen Bang-Jensen, Jing Huang, 1995, Discret. Math..

A classification of locally semicomplete digraphs

Gregory Gutin, Lutz Volkmann, Jørgen Bang-Jensen, 1997, Discret. Math..

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2003, J. Graph Theory.

Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$

Gregory Gutin, Mark Jones, Robert Crowston, 2012, Theory of Computing Systems.

Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs

Gregory Gutin, Anders Yeo, Arash Rafiey, 2005, AAIM.

Parameterized complexity of the k-arc Chinese Postman Problem

Gregory Gutin, Mark Jones, Bin Sheng, 2017, J. Comput. Syst. Sci..

Construction heuristics for the asymmetric TSP

Fred W. Glover, Gregory Gutin, Anders Yeo, 2001, Eur. J. Oper. Res..

Better Algorithms and Bounds for Directed Maximum Leaf Problems pdf

Noga Alon, Fedor V. Fomin, Saket Saurabh, 2007, FSTTCS.

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables

Saket Saurabh, Venkatesh Raman, Gregory Gutin, 2012, Algorithmica.

Spanning Directed Trees with Many Leaves

Noga Alon, Fedor V. Fomin, Saket Saurabh, 2008, SIAM J. Discret. Math..

Finding a Longest Path in a Complete Multipartite Digraph

Gregory Gutin, G. Gutin, 1993, SIAM J. Discret. Math..

Minimum cost and list homomorphisms to semicomplete digraphs

Gregory Gutin, Anders Yeo, Arash Rafiey, 2005, Discret. Appl. Math..

Proximity and Remoteness in Directed and Undirected Graphs pdf

Gregory Gutin, Stefanie Gerke, Jiangdong Ai, 2020, Discret. Math..

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables

Leo van Iersel, Gregory Gutin, Matthias Mnich, 2010, ESA.

Preference Swaps for the Stable Matching Problem pdf

Gregory Gutin, Anders Yeo, Eduard Eiben, 2021, ArXiv.

Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions pdf

Gregory Gutin, Stefanie Gerke, Jiangdong Ai, 2021, ArXiv.

Perfect Forests in Graphs and Their Extensions pdf

Gregory Gutin, Anders Yeo, 2021, MFCS.

The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings

Yongtang Shi, Gregory Gutin, Ran Gu, 2021, COCOA.

Strong Subgraph Connectivity of Digraphs

Gregory Gutin, Yuefang Sun, G. Gutin, 2021, Graphs and Combinatorics.

Packing Strong Subgraph in Digraphs

Gregory Gutin, Yuefang Sun, Xiaoyan Zhang, 2021 .

r-Simple k-Path and Related Problems Parameterized by k/r

Gregory Gutin, Magnus Wahlström, Meirav Zehavi, 2021, ACM Trans. Algorithms.

Strong subgraph 2-arc-connectivity of Cartesian product of digraphs

Gregory Gutin, Yuefang Sun, Yiling Dong, 2022 .

Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis

Gregory Gutin, Jason Crampton, Diptapriyo Majumdar, 2021, ACM Transactions on Privacy and Security.

Parameterized Pre-Coloring Extension and List Coloring Problems

Gregory Gutin, Magnus Wahlström, Sebastian Ordyniak, 2021, SIAM J. Discret. Math..

Lower Bounds for Maximum Weighted Cut pdf

Gregory Gutin, Anders Yeo, G. Gutin, 2021, ArXiv.

Approximation algorithms with constant ratio for general cluster routing problems

Gregory Gutin, Donglei Du, Jian Sun, 2021, Journal of Combinatorial Optimization.

Parameterized Complexity of Satisfying Almost All Linear Equations over F2

Gregory Gutin, Robert Crowston, Anders Yeo, 2013 .

Polynomial algorithms for the TSP and the QAP with a factorial domination number

Gregory Gutin, G. Gutin, S. Brunel, 1998 .

Introduction to the Minimum Cost Homomorphism Problem for Directed and Undirected Graphs

Gregory Gutin, Eun Jung Kim, G. Gutin, 2007 .

Kings in semicomplete multipartite digraphs

Gregory Gutin, Anders Yeo, 2000 .

TSP heuristics with large domination number

Gregory Gutin, S. Brunel, 1998 .

Traveling Salesman Should not be Greedy: Domination Analysis of Greedy-Type Heuristics for the TSP

Gregory Gutin, Anders Yeo, Alexey Zverovich, 2001 .

Characterization of edge-colored complete graphs with properly colored Hamilton paths

Gregory Gutin, Arash Rafiey, Tommy R. Jensen, 2006 .

Paths , Trees and Cycles in Tournaments

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 2003 .

Properly colored Hamilton cycles in edge-colored complete graphs

Noga Alon, Gregory Gutin, 1997 .

Note on the Path Covering Number of a Semicomplete Multipartite Digraph

Gregory Gutin, Anders Yeo, G. Gutin, 1997 .

Introduction to Domination Analysis

Gregory Gutin, Anders Yeo, G. Gutin, 2004 .

Feedback Sets and Vertex Orderings

Gregory Gutin, Jørgen Bang-Jensen, 2009 .

Problems from Dagstuhl Seminar 07281 : Structure Theory and FPT Algorithmics for Graphs , Digraphs and Hypergraphs

Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, 2007 .

A characterization of horizontal visibility graphs and combinatorics on words

Simone Severini, Gregory Gutin, Toufik Mansour, 2010, 1010.1850.

Sucient conditions for a digraph to be Hamiltonian

Gregory Gutin, Jørgen Bang-Jensen, 1996 .

Hamiltonian paths and cycles in hypertournaments

Gregory Gutin, Anders Yeo, G. Gutin, 1997 .