Gregory Gutin | Academic Influence

Q: What Schools Are Affiliated With Gregory Gutin

Gregory Gutin is affiliated with the following schools: Kansas State University, University of Haifa, Tel Aviv University, Francisk Skorina Gomel State University, Royal Holloway, University of London

Why Is Gregory Gutin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gregory Z. Gutin is a scholar in theoretical computer science and discrete mathematics. He received his PhD in Mathematics in 1993 from Tel Aviv University under the supervision of Noga Alon. Since September 2000 Gutin has been Professor in Computer Science at Royal Holloway, University of London.

(See a Problem?)

Gregory Gutin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Digraphs - theory, algorithms and applications (2002) (1878)
The traveling salesman problem and its variations (2007) (1218)
The traveling salesman problem (2006) (1097)
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP (2001) (257)
Solving MAX-r-SAT Above a Tight Lower Bound (2009) (145)
When the greedy algorithm fails (2004) (134)
A memetic algorithm for the generalized traveling salesman problem (2008) (132)
Construction heuristics for the asymmetric TSP (2001) (104)
Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (2010) (100)
A characterization of horizontal visibility graphs and combinatorics on words (2010) (90)
Digraphs - Theory, Algorithms and Applications, Second Edition (2009) (85)
Alternating cycles and paths in edge-coloured multigraphs: A survey (1994) (84)
A probabilistic approach to problems parameterized above or below tight bounds (2009) (79)
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey (1995) (78)
Algorithms with large domination ratio (2004) (75)
Level of repair analysis and minimum cost homomorphisms of graphs (2005) (75)
FPT algorithms and kernels for the Directed k-Leaf problem (2008) (75)
Properly colored Hamilton cycles in edge-colored complete graphs (1997) (74)
A classification of locally semicomplete digraphs (1997) (68)
Generalizations of tournaments: A survey (1998) (66)
Vertex Cover Problem Parameterized Above and Below Tight Bounds (2009) (66)
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (2002) (64)
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (2010) (63)
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (2010) (62)
A dichotomy for minimum cost graph homomorphisms (2008) (61)
An approximate algorithm for combinatorial optimization problems with two parameters (1995) (61)
Transformations of generalized ATSP into ATSP (2003) (60)
The Linear Arrangement Problem Parameterized Above Guaranteed Value (2005) (55)
Exponential neighbourhood local search for the traveling salesman problem (1999) (55)
Extracting pure network submatrices in linear programs using signed graphs (2004) (51)
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem (2012) (51)
Note on Max Lin-2 above Average (2009) (50)
Finding a Longest Path in a Complete Multipartite Digraph (1993) (49)
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach (2014) (48)
Exponential Neighborhoods and Domination Analysis for the TSP (2007) (47)
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem (2009) (46)
Spanning Directed Trees with Many Leaves (2008) (46)
(Non-)existence of polynomial kernels for the Test Cover problem (2012) (46)
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications (2012) (44)
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (2010) (44)
Minimum leaf out-branching and related problems (2008) (43)
Minimum cost and list homomorphisms to semicomplete digraphs (2005) (41)
Batched bin packing (2005) (40)
Minimizing and maximizing the diameter in orientations of graphs (1994) (38)
The radii of n-partite tournaments (1986) (37)
Iterative Plan Construction for the Workflow Satisfiability Problem (2013) (37)
Sufficient conditions for a digraph to be Hamiltonian (1996) (37)
Hamiltonian paths and cycles in hypertournaments (1997) (35)
TSP tour domination and Hamilton cycle decompositions of regular digraphs (2001) (34)
Local search heuristics for the multidimensional assignment problem (2008) (34)
Parameterized Algorithms for Directed Maximum Leaf Problems (2007) (33)
Systems of Linear Equations over F2 and Problems Parameterized above Average (2010) (33)
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value (2005) (33)
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (1998) (32)
Some Parameterized Problems On Digraphs (2008) (32)
Mathematical programming and game theory for decision making (2008) (31)
Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour (1999) (31)
Fixed-Parameter Complexity of Minimum Profile Problems (2006) (31)
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs (1995) (30)
Domination analysis of combinatorial optimization problems (2003) (29)
Kernels in planar digraphs (2005) (29)
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average (2011) (29)
Process planning for rotational parts using the generalized travelling salesman problem (2003) (28)
Valued Workflow Satisfiability Problem (2015) (28)
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables (2010) (28)
Alternating cycles and trails in 2-edge-coloured complete multigraphs (1998) (28)
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (2011) (28)
Properly Coloured Cycles and Paths: Results and Open Problems (2008) (28)
Constraint expressions and workflow satisfiability (2013) (27)
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (1993) (26)
Maximum balanced subgraph problem parameterized above lower bound (2012) (26)
Betweenness parameterized above tight lower bound (2009) (26)
Structural Parameterizations of the Mixed Chinese Postman Problem (2014) (25)
Anti-matroids (2002) (25)
Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem (2007) (25)
Characterization of edge‐colored complete graphs with properly colored Hamilton paths (2006) (24)
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth (2016) (24)
Generalized Traveling Salesman Problem Reduction Algorithms (2008) (24)
Rural postman parameterized by the number of components of required edges (2017) (24)
Minimum Leaf Out-Branching Problems (2008) (23)
Better Algorithms and Bounds for Directed Maximum Leaf Problems (2007) (23)
Parameterized complexity of the k-arc Chinese Postman Problem (2014) (23)
Parameterized complexity of MaxSat Above Average (2011) (22)
A selection of useful theoretical tools for the design and analysis of optimization heuristics (2009) (22)
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs (2006) (21)
Domination Analysis of Combinatorial Optimization Algorithms and Problems (2005) (19)
On complexity of Minimum Leaf Out-Branching problem (2008) (19)
Weakly Hamiltonian-connected ordinary multipartite tournaments (1995) (19)
Connected (g, f)-factors and supereulerian digraphs (1999) (19)
Note on maximal bisection above tight lower bound (2010) (19)
On the parameterized complexity of the workflow satisfiability problem (2012) (19)
Chinese Postman Problem on edge-colored multigraphs (2015) (18)
On Cycles in Multipartite Tournaments (1993) (18)
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs (1998) (18)
On k-strong and k-cyclic digraphs (1996) (18)
Upper domination and upper irredundance perfect graphs (1998) (18)
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments (1997) (17)
Algorithms for the workflow satisfiability problem engineered for counting constraints (2015) (17)
On-line bin Packing with Two Item Sizes (2006) (17)
Kings in semicomplete multipartite digraphs (2000) (17)
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems (2008) (17)
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem (2010) (17)
Orientations of digraphs almost preserving diameter (2002) (17)
Parameterized Study of the Test Cover Problem (2012) (16)
Minimum cost homomorphisms to semicomplete multipartite digraphs (2005) (16)
The bi-objective workflow satisfiability problem and workflow resiliency (2015) (16)
Vertex heaviest paths and cycles in quasi-transitive digraphs (1997) (16)
Paths and cycles in extended and decomposable digraphs, (1997) (16)
Resiliency Policies in Access Control Revisited (2016) (16)
Sucient conditions for a digraph to be Hamiltonian (1996) (16)
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs (2007) (16)
The Workflow Satisfiability Problem with User-Independent Constraints (2014) (15)
On the number of quasi‐kernels in digraphs (2004) (15)
Note on alternating directed cycles (1998) (15)
Parameterized complexity of k-Chinese Postman Problem (2013) (15)
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations (2015) (15)
Connectivity of Digraphs (2009) (15)
Domination analysis for minimum multiprocessor scheduling (2006) (15)
Paths , Trees and Cycles in Tournaments (2003) (14)
Arc‐disjoint strong spanning subdigraphs of semicomplete compositions (2019) (14)
Strong subgraph k‐connectivity (2018) (14)
Maximizing Traveling Salesman Problem for Special Matrices (1995) (14)
Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms (2000) (13)
A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound (2009) (13)
Empirical evaluation of construction heuristics for the multidimensional assignment problem (2009) (13)
Parameterized Traveling Salesman Problem: Beating the Average (2016) (13)
Note on the Path Covering Number of a Semicomplete Multipartite Digraph (1997) (12)
The Greedy Algorithm for the Symmetric TSP (2007) (12)
Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs (1994) (12)
Minimum Cost Homomorphism Dichotomy for Oriented Cycles (2008) (12)
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints (2014) (12)
Algorithms for generating convex sets in acyclic digraphs (2007) (12)
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs (1999) (12)
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs (2018) (11)
Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound (2009) (11)
Better Than Optimal: Fast Identification of Custom Instruction Candidates (2009) (11)
Simultaneously Satisfying Linear Equations Over $\mathbb{F}_2$: MaxLin2 and Max-$r$-Lin2 Parameterized Above Average (2011) (11)
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs (2002) (11)
Cryptographic Enforcement of Information Flow Policies Without Public Information (2014) (11)
Parameterizations of Test Cover with Bounded Test Sizes (2012) (11)
Upper bounds on ATSP neighborhood size (2003) (11)
Tolerance-based greedy algorithms for the traveling salesman problem (2007) (11)
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs (2007) (11)
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems (2006) (11)
Introduction to the Minimum Cost Homomorphism Problem for Directed and Undirected Graphs (2007) (10)
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (2017) (10)
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints (2012) (10)
Construction Heuristics and Domination Analysis for the Asymmetric TSP (1999) (10)
Parameterized algorithms for load coloring problem (2013) (10)
Proper orientation number of triangle‐free bridgeless outerplanar graphs (2019) (10)
Strong Subgraph Connectivity of Digraphs (2021) (10)
Assignment problem based algorithms are impractical for the generalized TSP (2003) (10)
Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs (2017) (10)
Characterization of edge-colored complete graphs with properly colored Hamilton paths (2006) (10)
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis (2015) (10)
Colorings and Related Topics (2003) (10)
On the number of quasi-kernels in digraphs (2001) (10)
On the number of connected convex subgraphs of a connected acyclic digraph (2009) (9)
An Algorithm for Finding Connected Convex Subgraphs of an Acyclic Digraph (2008) (9)
A new bound for 3-satisfiable MaxSat and its algorithmic application (2011) (9)
Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp1 (2005) (9)
Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs (2001) (8)
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs (2006) (8)
An algorithm for finding input-output constrained convex sets in an acyclic digraph (2008) (8)
Parameterized Resiliency Problems via Integer Linear Programming (2016) (8)
TSP heuristics with large domination number (1998) (8)
Parameterized Pre-coloring Extension and List Coloring Problems (2019) (8)
Parameterized and Exact Computation (2013) (8)
Parameterized and Approximation Algorithms for the Load Coloring Problem (2014) (8)
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (2009) (7)
Polynomial algorithms for the TSP and the QAP with a factorial domination number (1998) (7)
Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems (2008) (7)
Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph (1996) (7)
Cryptographic enforcement of information flow policies without public information via tree partitions (2016) (7)
The effect of social distancing on the reach of an epidemic in social networks (2020) (7)
Note on Perfect Forests (2015) (7)
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs (2000) (7)
A Multivariate Approach for Checking Resiliency in Access Control (2016) (7)
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs (2019) (7)
On the Satisfiability of Workflows with Release Points (2017) (7)
$k$-Distinct In- and Out-Branchings in Digraphs (2016) (7)
Parameterized Complexity of Satisfying Almost All Linear Equations over F2 (2013) (7)
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound (2012) (6)
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem (2014) (6)
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (2009) (6)
Proximity and Remoteness in Directed and Undirected Graphs (2020) (6)
Traveling Salesman Problems (2013) (6)
Parameterized Rural Postman and Conjoining Bipartite Matching Problems (2013) (6)
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs (2007) (6)
On n-partite Tournaments with Unique n-cycle (2006) (6)
Path-Contractions, Edge Deletions and Connectivity Preservation (2017) (6)
Basic Terminology, Notation and Results (2018) (6)
Further Extension of the TSP Assign Neighborhood (2005) (6)
Parameterized Eulerian strong component arc deletion problem on tournaments (2011) (6)
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian (2000) (5)
Multipartite tournaments with small number of cycles (2006) (5)
Note on Upper Bounds for TSP Domination Number (2006) (5)
Tolerance-based algorithms for the traveling salesman problem (2008) (5)
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (2007) (5)
Strong Subgraph Connectivity of Digraphs: A Survey (2018) (5)
Netflix Games: Local Public Goods with Capacity Constraints (2019) (5)
Note on edge-colored graphs and digraphs without properly colored cycles (2007) (5)
Odd properly colored cycles in edge-colored graphs (2016) (5)
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs (2014) (4)
Seismic Vessel Problem (2004) (4)
Alternative parameterizations of Metric Dimension (2018) (4)
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables (2012) (4)
Lower Bounds for Maximum Weighted Cut (2021) (4)
Acyclicity in edge-colored graphs (2016) (4)
Kernelization, Constraint Satisfaction Problems Parameterized above Average (2016) (4)
On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments (2007) (4)
An Approach to Parameterized Resiliency Problems Using Integer Linear Programming (2016) (4)
A Memetic Algorithm for the Multidimensional Assignment Problem (2009) (4)
Searching for Maximum Out-Degree Vertices in Tournaments (2018) (3)
The Authorization Policy Existence Problem (2016) (3)
Note on Large Subsets of Binary Vectors with Similar Distances (2012) (3)
Polynomailly solvable cases of the supermodular set function minimization problem (1998) (3)
Constraint Branching in Workflow Satisfiability Problem (2020) (3)
Local Search Algorithms for the Generalized Traveling Salesman Problem (2010) (3)
Parameterized Rural Postman Problem (2013) (3)
A Survey on Graph Problems Parameterized Above and Below Guaranteed Values (2022) (3)
Hamilton cycles in digraphs of unitary matrices (2004) (3)
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels (2010) (3)
Parameterized resiliency problems (2019) (3)
Clustering without replication in combinatorial circuits (2019) (3)
Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies (2015) (3)
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete (2003) (3)
Unique Stable Matchings (2021) (3)
A note on the cardinality of certain classes of unlabeled multipartite tournaments (1998) (3)
Pattern-Based Plan Construction for the Workflow Satisfiability Problem (2013) (3)
Note on Perfect Forests in Digraphs (2015) (3)
Interview with Vadim G. Vizing (2000) (3)
Approximation algorithms for general cluster routing problem (2020) (3)
Worst case analysis of GREEDY, max-regret and other heuristics for multidimensional assignment and traveling salesman problems (2006) (3)
The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs (2017) (3)
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games (2020) (3)
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (2006) (3)
Component Order Connectivity in Directed Graphs (2020) (2)
Solving the Workflow Satisfiability Problem using General Purpose Solvers (2021) (2)
Valued Authorization Policy Existence Problem (2021) (2)
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (2011) (2)
Problems from Dagstuhl Seminar 07281 : Structure Theory and FPT Algorithmics for Graphs , Digraphs and Hypergraphs (2007) (2)
Convex Sets in Acyclic Digraphs (2007) (2)
Strong subgraph k-connectivity bounds (2018) (2)
Bounded and Approximate Strong Satisfiability in Workflows (2019) (2)
Algorithms and Their Complexity (2009) (2)
Component Order Connectivity in Directed Graphs (2022) (2)
Parameterized Constraint Satisfaction Problems: a Survey (2017) (2)
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms (2020) (2)
Out-branchings with extremal number of leaves (2010) (2)
When n-cycles in n-partite tournaments are longest cycles (2004) (2)
Uniqueness of DP-Nash Subgraphs and D-sets in Capacitated Graphs of Netflix Games (2020) (2)
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs (2010) (2)
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths (2015) (2)
Introduction to Domination Analysis (2004) (2)
Acyclic Digraphs (2018) (2)
Connectivity and Traversability (2003) (2)
On the Hajo's number of graphs (2000) (2)
Independence and Cliques (2013) (2)
Special Issue on Parameterized Complexity of Discrete Optimization (2011) (2)
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (2020) (2)
Remarks on hamiltonian digraphs (2001) (2)
A Heuristic for the Resource-Constrained Traveling Salesman Problem (2002) (1)
Packing strong subgraph in digraphs (2021) (1)
Strong subgraph k-arc-connectivity (2018) (1)
Strong Subgraph 2-Arc-Connectivity and Arc-Strong Connectivity of Cartesian Product of Digraphs (2022) (1)
Flows in Networks (2009) (1)
Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2) (2013) (1)
Orientations of Graphs and Digraphs (2009) (1)
Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation (2010) (1)
Note on semi-proper orientations of outerplanar graphs (2020) (1)
Parameterized and Approximation Algorithms for the Load Coloring Problem (2016) (1)
Theory and Methodology Construction heuristics for the asymmetric TSP (2001) (1)
FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (2009) (1)
Finding all Stable Matchings with Assignment Constraints (2022) (1)
r-Simple k-Path and Related Problems Parameterized by k/r (2021) (1)
Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory (2011) (1)
Feedback Sets and Vertex Orderings (2009) (1)
Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances (2012) (1)
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application (2010) (1)
Perfect forests in graphs and their extensions (2021) (1)
London Algorithmics 2008: Theory and practice (2009) (1)
Note on weighted proper orientations of outerplanar graphs (2020) (1)
Convergence and correctness of belief propagation for weighted min–max flow (2022) (1)
Preference Swaps for the Stable Matching Problem (2021) (1)
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming (2010) (1)
Results on the Small Quasi-Kernel Conjecture (2022) (0)
engineered for counting constraints (2015) (0)
Mediated digraphs and quantum nonlocality (2004) (0)
M ay 2 00 8 Gadget Graphs for Edge-coloured Graphs (2009) (0)
Restricted Hamiltonian Paths and Cycles (2009) (0)
Constructing edge-disjoint Steiner trees in Cartesian product networks (2023) (0)
Disjoint Paths and Trees (2002) (0)
Paths and Cycles of Prescribed Lengths (2009) (0)
The smallest number of vertices in a 2-arc-strong digraph which has no good pair. (2020) (0)
Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms (2017) (0)
Hamiltonicity and Related Problems (2002) (0)
Sparse Subdigraphs with Prescribed Connectivity (2009) (0)
1 M ar 2 01 8 Strong Subgraph k-connectivity (2018) (0)
Note on 4-Kings in Bipartite Hypertournaments (2020) (0)
Orientations of Graphs (2002) (0)
Short Introduction to Domination Analysis in Combinatorial Optimization (2004) (0)
Conjecture on Hamilton Cycles in Digraphs of Unitary Matrices (2004) (0)
NII Shonan Meeting on: Parameterized Complexity and the Understanding, Design and Analysis of Heuristics (2013) (0)
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming (2011) (0)
D S ] 8 F eb 2 00 7 Parameterized Algorithms for Directed Maximum Leaf Problems ( Extended Abstract ) (2007) (0)
Max Lin Above Average Problem and Lower Bounds for Maxima of Pseudo-boolean Functions (2010) (0)
Classes of Digraphs (2009) (0)
On the Hajj Os Number of Graphs (1997) (0)
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications (2011) (0)
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings (2021) (0)
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value (2007) (0)
Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles (2009) (0)
Approximation algorithms with constant ratio for general cluster routing problems (2021) (0)
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Dagstuhl Seminar (2007) (0)
A problem of nding an acceptable variant in somegeneralized project (1996) (0)
M ay 2 01 8 Strong subgraph k-arc-connectivity (2018) (0)
An Approach to Parameterized Resiliency Problems Using Fourier-Motzkin Elimination for Integer Linear Programming (2016) (0)
Algorithmic Aspects of Hamiltonian Path and Cycle Problems in Some Classes of Digraphs (1994) (0)
Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions (2021) (0)
Upper Domination Perfect Graphs (1995) (0)
N ov 2 01 5 Note on Perfect Forests in Digraphs (2018) (0)
Kernelization, Permutation CSPs Parameterized above Average (2016) (0)
Note: A Graph-Theoretical Approach to Level of Repair Analysis (2004) (0)
Parameterized TSP: Beating the Average (2014) (0)
Minimum Cost Homomorphisms of Digraphs (2005) (0)
On d-panconnected tournaments with large semidegrees (2021) (0)
Valued Authorization Policy Existence Problem: Theory and Experiments (2021) (0)
Branching in digraphs with many and few leaves: Structural and algorithmic results (2018) (0)
Editor’s Note: Special Issue Dedicated to the 60th Birthday of Gregory Gutin (2018) (0)
Cycle Structure of Digraphs (2002) (0)
An LP-based approximation algorithm for the generalized traveling salesman path problem (2022) (0)
Pattern-Based Approach to the Workﬂow Satisﬁability Problem with User-Independent Constraints 1 (2022) (0)
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis (2021) (0)
Kings in multipartite hypertournaments (2020) (0)
A problem of finding an acceptable variant in generalized project networks (1996) (0)
Public Goods in Networks with Constraints on Sharing (2019) (0)
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem (2015) (0)
Smallest number of vertices in a 2-arc-strong digraph without good pairs (2022) (0)
Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism (2023) (0)
Chapter 5 Tolerance-based algorithms for the traveling salesman problem (2009) (0)
Solving Routing Problems via Important Cuts (2022) (0)
Exact capacitated domination: On the computational complexity of uniqueness (2020) (0)
Generalized Noise Role Mining (2022) (0)
Generalizations of Digraphs: Edge-Coloured Multigraphs (2009) (0)
A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem (2021) (0)
Fixed parameterized algorithms for generalized feedback vertex set problems (2023) (0)
Domination Analysis in Combinatorial Optimization (2009) (0)
Parameterized Complexity of Satisfying Almost All Linear Equations over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} (2012) (0)
Parameterizations of Test Cover with Bounded Test Sizes (2014) (0)
D S ] 1 3 Ja n 20 08 Parameterized Minimum Leaf Out-Branching Problems (2008) (0)
On r-Simple k-Path and Related Problems Parameterized by k/r (2018) (0)
Generalizations of Digraphs (2002) (0)
Linkages in Digraphs (2009) (0)
Algorithms for Workflow Satisfiability Problem with User-independent Constraints (2020) (0)
Packings, Coverings and Decompositions (2009) (0)
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths (2022) (0)
Guest Editorial: Special Issue on Parameterized and Exact Computation (2015) (0)
Parameterized Rural Postman and Conjoining Matching Problems (2013) (0)
Strong subgraph 2-arc-connectivity of Cartesian product of digraphs (2022) (0)
Parameterized Algorithmics: Experimental Research (2021) (0)
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$ (2011) (0)
Parameterized Minimum Leaf Out-Branching Problems (2008) (0)
Algorithms for the workflow satisfiability problem engineered for counting constraints (2015) (0)
Bounds on Maximum Weight Directed Cut (2023) (0)
Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound (2012) (0)
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods (2018) (0)
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 (2007) (0)
(1, 1)-Cluster Editing is Polynomial-time Solvable (2022) (0)
Syddansk Universitet Out-branchings with extremal number of leaves (2008) (0)
Syddansk Universitet Chinese Postman Problem on edge-colored multigraphs (2016) (0)
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs (2022) (0)
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables (2012) (0)
Syddansk Universitet Acyclicity in edge-colored graphs (2016) (0)
Applications of Digraphs and Edge-Coloured Graphs (2009) (0)
Guest Editorial: Special Issue on Parameterized and Exact Computation (2014) (0)
Report on NII Shonan Meeting 2013-018 (2014) (0)

This paper list is powered by the following services:

Other Resources About Gregory Gutin

What Schools Are Affiliated With Gregory Gutin?

Gregory Gutin is affiliated with the following schools: