Gregory Z. Gutin

419 papers A* 7A 5B 16C 16Misc 6Journal 334Unranked 21

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Public Goods Games in Directed Networks with Constraints on Sharing. AAAI Argyrios Deligkas, Gregory Z. Gutin, Mark Jones, Philip R. Neary, Anders Yeo
2025	J	`jnl`	A survey on graph problems parameterized above and below guaranteed values. Comput. Sci. Rev. Gregory Z. Gutin, Matthias Mnich
2025	J	`jnl`	Acceleration of Timing-Aware Gate-Level Logic Simulation Through One-Pass GPU Parallelism. IEEE Trans. Computers Weijie Fang, Yanggeng Fu, Jiaquan Gao, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang
2025	J	`jnl`	Bi-objective Optimization in Role Mining. ACM Trans. Priv. Secur. Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2025	J	`jnl`	Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs. CoRR Gregory Z. Gutin, Mads Anker Nielsen, Anders Yeo, Yacong Zhou
2025	J	`jnl`	Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs. CoRR Jiangdong Ai, Qiwen Guo, Gregory Z. Gutin, Yimin Hao, Anders Yeo
2025	J	`jnl`	Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. J. Graph Theory Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou
2025	J	`jnl`	On k-anti-traceability of oriented graphs. Discret. Math. Bin Chen, Stefanie Gerke, Gregory Z. Gutin, Hui Lei, Heis Parker-Cox, Yacong Zhou
2025	J	`jnl`	Oriented discrepancy of Hamilton cycles and paths in digraphs. CoRR Qiwen Guo, Gregory Z. Gutin, Yongxin Lan, Qi Shao, Anders Yeo, Yacong Zhou
2025	J	`jnl`	Public Goods Games in Directed Networks with Constraints on Sharing. CoRR Argyrios Deligkas, Gregory Z. Gutin, Mark Jones, Philip R. Neary, Anders Yeo
2024	J	`jnl`	Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs. CoRR Chen Wang, Chao Wang, Gregory Z. Gutin, Xiaoyan Zhang
2024	J	`jnl`	Bi-objective Optimization in Role Mining. CoRR Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2024	J	`jnl`	Bounds on Maximum Weight Directed Cut. SIAM J. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Convergence and correctness of belief propagation for weighted min-max flow. Discret. Appl. Math. Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang
2024	J	`jnl`	Finding all stable matchings with assignment constraints. Games Econ. Behav. Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2024	J	`jnl`	Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Note on disjoint cycles in multipartite tournaments. Discret. Math. Gregory Z. Gutin, Wei Li, Shujing Wang, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. CoRR Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou
2024	J	`jnl`	On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Public goods in networks with constraints on sharing. J. Econ. Theory Stefanie Gerke, Gregory Z. Gutin, Sung-Ha Hwang, Philip R. Neary
2024	J	`jnl`	Speeding up deferred acceptance. CoRR Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary, Alexander Vickery, Anders Yeo
2024	J	`jnl`	Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs. Discuss. Math. Graph Theory Yiling Dong, Gregory Z. Gutin, Yuefang Sun
2024	J	`jnl`	Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree. CoRR Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou
2023	J	`jnl`	(1,1)-Cluster Editing is polynomial-time solvable. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2023	J	`jnl`	Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism. CoRR Weijie Fang, Yanggeng Fu, Jiaquan Gao, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang
2023	J	`jnl`	An LP-based approximation algorithm for the generalized traveling salesman path problem. Theor. Comput. Sci. Jian Sun, Gregory Z. Gutin, Ping Li, Peihao Shi, Xiaoyan Zhang
2023	J	`jnl`	Bounds on Maximum Weight Directed Cut. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2023	J	`jnl`	Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	A*	`conf`	Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Exact capacitated domination: On the computational complexity of uniqueness. Discret. Appl. Math. Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Fixed parameterized algorithms for generalized feedback vertex set problems. Theor. Comput. Sci. Bin Sheng, Gregory Z. Gutin
2023	J	`jnl`	Lower Bounds for Maximum Weighted Cut. SIAM J. Discret. Math. Gregory Z. Gutin, Anders Yeo
2023	J	`jnl`	Preference swaps for the stable matching problem. Theor. Comput. Sci. Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2023	J	`jnl`	Proper orientation, proper biorientation and semi-proper orientation numbers of graphs. J. Comb. Optim. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Hui Lei, Yongtang Shi
2023	J	`jnl`	Results on the small quasi-kernel conjecture. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2023	J	`jnl`	Solving the Workflow Satisfiability Problem Using General Purpose Solvers. IEEE Trans. Dependable Secur. Comput. Daniel Karapetyan, Gregory Z. Gutin
2023	J	`jnl`	Some coordination problems are harder than others. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Streaming Algorithms for the k-Submodular Cover Problem. CoRR Wenqi Wang, Gregory Z. Gutin, Yaping Mao, Donglei Du, Xiaoyan Zhang
2023	J	`jnl`	Unique stable matchings. Games Econ. Behav. Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2022	J	`jnl`	(1, 1)-Cluster Editing is Polynomial-time Solvable. CoRR Gregory Z. Gutin, Anders Yeo
2022	J	`jnl`	A Survey on Graph Problems Parameterized Above and Below Guaranteed Values. CoRR Gregory Z. Gutin, Matthias Mnich
2022	J	`jnl`	Approximation algorithms with constant ratio for general cluster routing problems. J. Comb. Optim. Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun
2022	J	`jnl`	Component Order Connectivity in Directed Graphs. Algorithmica Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2022	J	`jnl`	Extended path partition conjecture for semicomplete and acyclic compositions. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou
2022	C	`conf`	Generalized Noise Role Mining. SACMAT Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2022	J	`jnl`	Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths. IEEE Trans. Inf. Theory Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang
2022	J	`jnl`	Kings in multipartite hypertournaments. J. Graph Theory Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin
2022	J	`jnl`	On Discret. Math. Samvel Kh. Darbinyan, Gregory Z. Gutin
2022	J	`jnl`	Packing strong subgraph in digraphs. Discret. Optim. Yuefang Sun, Gregory Z. Gutin, Xiaoyan Zhang
2022	J	`jnl`	Perfect forests in graphs and their extensions. J. Graph Theory Gregory Z. Gutin, Anders Yeo
2022	J	`jnl`	Results on the Small Quasi-Kernel Conjecture. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2022	J	`jnl`	Smallest number of vertices in a 2-arc-strong digraph without good pairs. Theor. Comput. Sci. Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu
2022	J	`jnl`	Strong subgraph 2-arc-connectivity of Cartesian product of digraphs. CoRR Yiling Dong, Gregory Z. Gutin, Yuefang Sun
2022	J	`jnl`	Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2021	C	`conf`	A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem. COCOA Jian Sun, Gregory Z. Gutin, Xiaoyan Zhang
2021	J	`jnl`	Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou
2021	J	`jnl`	Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. J. Graph Theory Zan-Bo Zhang, Xiaoyan Zhang, Gregory Z. Gutin, Dingjun Lou
2021	J	`jnl`	Lower Bounds for Maximum Weighted Cut. CoRR Gregory Z. Gutin, Anders Yeo
2021	J	`jnl`	On d-panconnected tournaments with large semidegrees. CoRR Samvel Kh. Darbinyan, Gregory Z. Gutin
2021	J	`jnl`	Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2021	B	`conf`	Perfect Forests in Graphs and Their Extensions. MFCS Gregory Z. Gutin, Anders Yeo
2021	J	`jnl`	Perfect Forests in Graphs and Their Extensions. CoRR Gregory Z. Gutin, Anders Yeo
2021	J	`jnl`	Preference Swaps for the Stable Matching Problem. CoRR Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2021	J	`jnl`	Proximity and remoteness in directed and undirected graphs. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda
2021	J	`jnl`	Solving the Workflow Satisfiability Problem using General Purpose Solvers. CoRR Daniel Karapetyan, Gregory Z. Gutin
2021	J	`jnl`	Strong Subgraph Connectivity of Digraphs. Graphs Comb. Yuefang Sun, Gregory Z. Gutin
2021	J	`jnl`	Strong Subgraph Connectivity of Digraphs: A Survey. J. Interconnect. Networks Yuefang Sun, Gregory Z. Gutin
2021	C	`conf`	The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings. COCOA Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu
2021	J	`jnl`	Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. CoRR Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
2021	J	`jnl`	Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. ACM Trans. Priv. Secur. Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
2021	C	`conf`	Valued Authorization Policy Existence Problem. SACMAT Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2021	J	`jnl`	Valued Authorization Policy Existence Problem: Theory and Experiments. CoRR Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
2020	J	`jnl`	Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2020	Misc	`conf`	Approximation Algorithms for General Cluster Routing Problem. COCOON Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun
2020	J	`jnl`	Approximation algorithms for general cluster routing problem. CoRR Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun
2020	J	`jnl`	Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs. Discret. Math. Gregory Z. Gutin, Yuefang Sun
2020	J	`jnl`	Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2020	B	`conf`	Component Order Connectivity in Directed Graphs. IPEC Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	J	`jnl`	Component Order Connectivity in Directed Graphs. CoRR Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	C	`conf`	Constraint Branching in Workflow Satisfiability Problem. SACMAT Gregory Z. Gutin, Daniel Karapetyan
2020	J	`jnl`	Exact capacitated domination: on the computational complexity of uniqueness. CoRR Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2020	J	`jnl`	Note on 4-Kings in Bipartite Hypertournaments. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin
2020	A	`conf`	Parameterized Pre-Coloring Extension and List Coloring Problems. STACS Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2020	J	`jnl`	Proper orientation number of triangle-free bridgeless outerplanar graphs. J. Graph Theory Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu
2020	J	`jnl`	Proximity and Remoteness in Directed and Undirected Graphs. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda
2020	J	`jnl`	The Authorization Policy Existence Problem. IEEE Trans. Dependable Secur. Comput. Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2020	Misc	`conf`	Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games. COCOON Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2020	J	`jnl`	p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
2019	J	`jnl`	Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2019	J	`jnl`	Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs. CoRR Gregory Z. Gutin, Yuefang Sun
2019	J	`jnl`	Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. Discret. Math. Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai
2019	C	`conf`	Bounded and Approximate Strong Satisfiability in Workflows. SACMAT Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
2019	J	`jnl`	Bounded and Approximate Strong Satisfiability in Workflows. CoRR Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
2019	J	`jnl`	Clustering without replication in combinatorial circuits. J. Comb. Optim. Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani
2019	A*	`conf`	On r-Simple k-Path and Related Problems Parameterized by k/r. SODA Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
2019	J	`jnl`	Parameterized Pre-coloring Extension and List Coloring Problems. CoRR Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2019	J	`jnl`	Parameterized resiliency problems. Theor. Comput. Sci. Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant
2019	J	`jnl`	Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2019	J	`jnl`	Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. J. Artif. Intell. Res. Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
2019	J	`jnl`	Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu
2019	J	`jnl`	Strong subgraph k-connectivity. J. Graph Theory Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang
2019	—	`conf`	The Workflow Satisfiability Problem with User-Independent Constraints. GC Gregory Z. Gutin
2018	—	`ch.`	Acyclic Digraphs. Classes of Directed Graphs Gregory Z. Gutin
2018	J	`jnl`	Alternative parameterizations of Metric Dimension. CoRR Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2018	J	`jnl`	Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. CoRR Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai
2018	—	`ch.`	Basic Terminology, Notation and Results. Classes of Directed Graphs Jørgen Bang-Jensen, Gregory Z. Gutin
2018	—	`book`	Classes of Directed Graphs. Jørgen Bang-Jensen, Gregory Z. Gutin
2018	J	`jnl`	Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. J. Comput. Syst. Sci. Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi
2018	J	`jnl`	Lower and Upper Bound for Computing the Size of All Second Neighbourhoods. CoRR Gregory Z. Gutin, George B. Mertzios, Felix Reidl
2018	J	`jnl`	On r-Simple k-Path and Related Problems Parameterized by k/r. CoRR Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
2018	J	`jnl`	Searching for Maximum Out-Degree Vertices in Tournaments. CoRR Gregory Z. Gutin, George B. Mertzios, Felix Reidl
2018	J	`jnl`	Strong Subgraph Connectivity of Digraphs: A Survey. CoRR Yuefang Sun, Gregory Z. Gutin
2018	J	`jnl`	Strong Subgraph k-connectivity. CoRR Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang
2018	J	`jnl`	Strong subgraph k-arc-connectivity. CoRR Yuefang Sun, Gregory Z. Gutin
2018	J	`jnl`	Strong subgraph k-connectivity bounds. CoRR Yuefang Sun, Gregory Z. Gutin
2017	J	`jnl`	Acyclicity in edge-colored graphs. Discret. Math. Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2017	J	`jnl`	Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2017	J	`jnl`	Cryptographic enforcement of information flow policies without public information via tree partitions. J. Comput. Secur. Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering
2017	J	`jnl`	Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. CoRR Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi
2017	J	`jnl`	Note on Perfect Forests in Digraphs. J. Graph Theory Gregory Z. Gutin, Anders Yeo
2017	J	`jnl`	Odd properly colored cycles in edge-colored graphs. Discret. Math. Gregory Z. Gutin, Bin Sheng, Magnus Wahlström
2017	C	`conf`	On the Satisfiability of Workflows with Release Points. SACMAT Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2017	—	`ch.`	Parameterized Constraint Satisfaction Problems: a Survey. The Constraint Satisfaction Problem Gregory Z. Gutin, Anders Yeo
2017	C	`conf`	Parameterized Resiliency Problems via Integer Linear Programming. CIAC Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant
2017	J	`jnl`	Parameterized and Approximation Algorithms for the Load Coloring Problem. Algorithmica Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng
2017	J	`jnl`	Parameterized complexity of the k-arc Chinese Postman Problem. J. Comput. Syst. Sci. Gregory Z. Gutin, Mark Jones, Bin Sheng
2017	A	`conf`	Path-Contractions, Edge Deletions and Connectivity Preservation. ESA Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2017	J	`jnl`	Path-contractions, edge deletions and connectivity preservation. CoRR Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2017	J	`jnl`	Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2017	J	`jnl`	Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs. CoRR Gregory Z. Gutin, Ruijuan Li
2017	—	`conf`	The Authorization Policy Existence Problem. CODASPY Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2017	J	`jnl`	The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs. CoRR Bin Sheng, Ruijuan Li, Gregory Z. Gutin
2017	J	`jnl`	The bi-objective workflow satisfiability problem and workflow resiliency. J. Comput. Secur. Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant
2017	A*	`conf`	k-Distinct In- and Out-Branchings in Digraphs. ICALP Gregory Z. Gutin, Felix Reidl, Magnus Wahlström
2016	J	`jnl`	$k$-Distinct In- and Out-Branchings in Digraphs. CoRR Gregory Z. Gutin, Felix Reidl, Magnus Wahlström
2016	C	`conf`	A Multivariate Approach for Checking Resiliency in Access Control. AAIM Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	A Multivariate Approach for Checking Resiliency in Access Control. CoRR Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	Acyclicity in Edge-Colored Graphs. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2016	J	`jnl`	Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Comb. Optim. David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
2016	J	`jnl`	An Approach to Parameterized Resiliency Problems Using Integer Linear Programming. CoRR Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	Cryptographic Enforcement of Information Flow Policies without Public Information via Tree Partitions. CoRR Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering
2016	—	`ch.`	Kernelization, Constraint Satisfaction Problems Parameterized above Average. Encyclopedia of Algorithms Gregory Z. Gutin
2016	—	`ch.`	Kernelization, Permutation CSPs Parameterized above Average. Encyclopedia of Algorithms Gregory Z. Gutin
2016	J	`jnl`	Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
2016	J	`jnl`	Note on Perfect Forests. J. Graph Theory Gregory Z. Gutin
2016	J	`jnl`	On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2016	J	`jnl`	Parameterizations of Test Cover with Bounded Test Sizes. Algorithmica Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo
2016	J	`jnl`	Parameterized Traveling Salesman Problem: Beating the Average. SIAM J. Discret. Math. Gregory Z. Gutin, Viresh Patel
2016	J	`jnl`	Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. CoRR Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
2016	J	`jnl`	Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
2016	C	`conf`	Resiliency Policies in Access Control Revisited. SACMAT Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	The Authorization Policy Existence Problem. CoRR Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
2016	J	`jnl`	The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. SIAM J. Discret. Math. Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2016	J	`jnl`	Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis. Inf. Process. Lett. Gregory Z. Gutin, Magnus Wahlström
2015	J	`jnl`	Algorithms for the workflow satisfiability problem engineered for counting constraints. CoRR David A. Cohen, Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones
2015	J	`jnl`	Chinese Postman Problem on Edge-Colored Multigraphs. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2015	B	`conf`	Cryptographic Enforcement of Information Flow Policies Without Public Information. ACNS Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering
2015	J	`jnl`	Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica Gregory Z. Gutin, Stefan Szeider
2015	J	`jnl`	Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths. CoRR Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
2015	J	`jnl`	Note on Perfect Forests in Digraphs. CoRR Gregory Z. Gutin, Anders Yeo
2015	J	`jnl`	Note on Perfect Forests. CoRR Gregory Z. Gutin
2015	J	`jnl`	On the Workflow Satisfiability Problem with Class-Independent Constraints. CoRR Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones
2015	B	`conf`	On the Workflow Satisfiability Problem with Class-independent Constraints. IPEC Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones
2015	B	`conf`	Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies. DBSec Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones
2015	J	`jnl`	Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. CoRR Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones
2015	B	`conf`	Parameterized and Approximation Algorithms for the Load Coloring Problem. IPEC Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng
2015	Misc	`conf`	Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints. FAW Daniel Karapetyan, Andrei V. Gagarin, Gregory Z. Gutin
2015	A	`conf`	Structural Parameterizations of the Mixed Chinese Postman Problem. ESA Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2015	J	`jnl`	The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency. CoRR Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant
2015	J	`jnl`	Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis. CoRR Gregory Z. Gutin, Magnus Wahlström
2015	C	`conf`	Valued Workflow Satisfiability Problem. SACMAT Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan
2015	J	`jnl`	Valued Workflow Satisfiability Problem. CoRR Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan
2014	J	`jnl`	Cryptographic Enforcement of Information Flow Policies without Public Information. CoRR Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering
2014	Misc	`conf`	Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. FAW David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
2014	J	`jnl`	Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2014	J	`jnl`	Iterative Plan Construction for the Workflow Satisfiability Problem. J. Artif. Intell. Res. David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
2014	J	`jnl`	Parameterized Complexity of the $k$-Arc Chinese Postman Problem. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng
2014	A	`conf`	Parameterized Complexity of the k-Arc Chinese Postman Problem. ESA Gregory Z. Gutin, Mark Jones, Bin Sheng
2014	J	`jnl`	Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
2014	B	`conf`	Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. WG Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
2014	J	`jnl`	Parameterized TSP: Beating the Average. CoRR Gregory Z. Gutin, Viresh Patel
2014	J	`jnl`	Parameterized algorithms for load coloring problem. Inf. Process. Lett. Gregory Z. Gutin, Mark Jones
2014	J	`jnl`	Parameterized and Approximation Algorithms for the Load Coloring Problem. CoRR Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng
2014	J	`jnl`	Pattern Backtracking Algorithm for the Workflow Satisfiability Problem. CoRR Daniel Karapetyan, Andrei V. Gagarin, Gregory Z. Gutin
2014	B	`conf`	Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. IPEC Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
2014	J	`jnl`	Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. CoRR Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
2014	J	`jnl`	Report on NII Shonan Meeting 2013-018. Bull. EATCS Gregory Z. Gutin, Dimitrios M. Thilikos
2014	J	`jnl`	Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo
2014	J	`jnl`	Structural Parameterizations of the Mixed Chinese Postman Problem. CoRR Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2013	J	`jnl`	(Non-)existence of polynomial kernels for the Test Cover problem. Inf. Process. Lett. Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo
2013	J	`jnl`	A new bound for 3-satisfiable MaxSat and its algorithmic application. Inf. Comput. Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo
2013	J	`jnl`	Constraint Expressions and Workflow Satisfiability CoRR Jason Crampton, Gregory Z. Gutin
2013	C	`conf`	Constraint expressions and workflow satisfiability. SACMAT Jason Crampton, Gregory Z. Gutin
2013	J	`jnl`	Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2013	—	`conf`	Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. FAW-AAIM Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan
2013	Misc	`conf`	Maximum Balanced Subgraph Problem Parameterized above Lower Bound. COCOON Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia
2013	J	`jnl`	Maximum balanced subgraph problem parameterized above lower bound. Theor. Comput. Sci. Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia
2013	J	`jnl`	On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem. ACM Trans. Inf. Syst. Secur. Jason Crampton, Gregory Z. Gutin, Anders Yeo
2013	J	`jnl`	Parameterized Algorithms for Load Coloring Problem. CoRR Gregory Z. Gutin, Mark Jones
2013	J	`jnl`	Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2). NII Shonan Meet. Rep. Gregory Z. Gutin, Kazuo Iwama, Dimitrios M. Thilikos
2013	J	`jnl`	Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$. Theory Comput. Syst. Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2013	J	`jnl`	Parameterized Complexity of k-Chinese Postman Problem. CoRR Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo
2013	J	`jnl`	Parameterized Rural Postman and Conjoining Bipartite Matching Problems. CoRR Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2013	B	`ed.`	Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers IPEC Gregory Z. Gutin, Stefan Szeider
2013	J	`jnl`	Parameterized complexity of MaxSat Above Average. Theor. Comput. Sci. Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Parameterized complexity of k-Chinese Postman Problem. Theor. Comput. Sci. Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo
2013	J	`jnl`	Pattern-Based Plan Construction for the Workflow Satisfiability Problem. CoRR David A. Cohen, Jason Crampton, Gregory Z. Gutin, Mark Jones
2012	J	`jnl`	(Non-)existence of Polynomial Kernels for the Test Cover Problem CoRR Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo
2012	J	`jnl`	A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2012	J	`jnl`	An algorithm for finding input-output constrained convex sets in an acyclic digraph. J. Discrete Algorithms Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo
2012	—	`conf`	Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey. The Multivariate Algorithmic Revolution and Beyond Gregory Z. Gutin, Anders Yeo
2012	J	`jnl`	Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones
2012	—	`conf`	Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. FSTTCS Robert Crowston, Gregory Z. Gutin, Mark Jones
2012	J	`jnl`	Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur. J. Oper. Res. Daniel Karapetyan, Gregory Z. Gutin
2012	J	`jnl`	Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci. Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2012	A	`conf`	Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints CoRR Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan
2012	J	`jnl`	Fixed-parameter tractability of satisfying beyond the number of variables CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2012	J	`jnl`	Maximum Balanced Subgraph Problem Parameterized Above Lower Bound CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia
2012	J	`jnl`	Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances CoRR Gregory Z. Gutin, Mark Jones
2012	J	`jnl`	Note on Large Subsets of Binary Vectors with Similar Distances. SIAM J. Discret. Math. Gregory Z. Gutin, Mark Jones
2012	J	`jnl`	On the Parameterized Complexity of the Workflow Satisfiability Problem CoRR Jason Crampton, Gregory Z. Gutin, Anders Yeo
2012	A*	`conf`	On the parameterized complexity of the workflow satisfiability problem. CCS Jason Crampton, Gregory Z. Gutin, Anders Yeo
2012	J	`jnl`	Parameterizations of Test Cover with Bounded Test Sizes CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo
2012	J	`jnl`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2012	B	`conf`	Parameterized Complexity of MaxSat above Average. LATIN Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2012	J	`jnl`	Parameterized Eulerian strong component arc deletion problem on tournaments. Inf. Process. Lett. Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2012	J	`jnl`	Parameterized Study of the Test Cover Problem CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
2012	B	`conf`	Parameterized Study of the Test Cover Problem. MFCS Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
2011	J	`jnl`	A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. Evol. Comput. Daniel Karapetyan, Gregory Z. Gutin
2011	J	`jnl`	A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application CoRR Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	B	`conf`	A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2011	J	`jnl`	Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey CoRR Gregory Z. Gutin, Anders Yeo
2011	J	`jnl`	Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width CoRR Gregory Z. Gutin, Anders Yeo
2011	J	`jnl`	Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. Theor. Comput. Sci. Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem. Eur. J. Oper. Res. Daniel Karapetyan, Gregory Z. Gutin
2011	J	`jnl`	Local search heuristics for the multidimensional assignment problem. J. Heuristics Daniel Karapetyan, Gregory Z. Gutin
2011	J	`jnl`	Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming CoRR Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2011	J	`jnl`	Parameterized Complexity of MaxSat Above Average CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$ CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	—	`conf`	Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo
2011	J	`jnl`	Solving MAX- Algorithmica Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2011	J	`jnl`	Special Issue on Parameterized Complexity of Discrete Optimization. Discret. Optim. Michael R. Fellows, Fedor V. Fomin, Gregory Z. Gutin
2011	J	`jnl`	Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2010	J	`jnl`	A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem CoRR Daniel Karapetyan, Gregory Z. Gutin
2010	B	`conf`	A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application. IPEC Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2010	J	`jnl`	A memetic algorithm for the generalized traveling salesman problem. Nat. Comput. Gregory Z. Gutin, Daniel Karapetyan
2010	J	`jnl`	Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2010	J	`jnl`	All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels CoRR Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2010	—	`conf`	All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. ESA (1) Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2010	J	`jnl`	Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2010	J	`jnl`	FPT algorithms and kernels for the Directed k-Leaf problem. J. Comput. Syst. Sci. Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo
2010	J	`jnl`	Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems CoRR Gregory Z. Gutin, Mark Jones, Anders Yeo
2010	J	`jnl`	Lin-Kernighan Heuristic Adaptation for the Generalized Traveling Salesman Problem CoRR Daniel Karapetyan, Gregory Z. Gutin
2010	J	`jnl`	Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2010	J	`jnl`	Local Search Algorithms for the Generalized Traveling Salesman Problem CoRR Daniel Karapetyan, Gregory Z. Gutin
2010	J	`jnl`	Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. Australas. J Comb. Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
2010	J	`jnl`	Note on Max Lin-2 above Average. Inf. Process. Lett. Robert Crowston, Gregory Z. Gutin, Mark Jones
2010	J	`jnl`	Note on Maximal Bisection above Tight Lower Bound CoRR Gregory Z. Gutin, Anders Yeo
2010	J	`jnl`	Note on maximal bisection above tight lower bound. Inf. Process. Lett. Gregory Z. Gutin, Anders Yeo
2010	B	`conf`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2010	A*	`conf`	Solving MAX-r-SAT Above a Tight Lower Bound. SODA Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2010	—	`conf`	Systems of Linear Equations over F SWAT Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa
2010	J	`jnl`	Systems of Linear Equations over F CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa
2010	J	`jnl`	The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. Discret. Appl. Math. Gregory Z. Gutin, Eun Jung Kim
2009	J	`jnl`	A Memetic Algorithm for the Multidimensional Assignment Problem CoRR Gregory Z. Gutin, Daniel Karapetyan
2009	—	`conf`	A Memetic Algorithm for the Multidimensional Assignment Problem. SLS Gregory Z. Gutin, Daniel Karapetyan
2009	J	`jnl`	A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	—	`conf`	A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	J	`jnl`	A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Comput. Gregory Z. Gutin, Daniel Karapetyan
2009	Misc	`conf`	Algorithm for Finding COCOON Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	J	`jnl`	Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem CoRR Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	J	`jnl`	Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo
2009	—	`conf`	Better Than Optimal: Fast Identification of Custom Instruction Candidates. CSE (2) Joseph Reddington, Gregory Z. Gutin, Adrian Johnstone, Elizabeth Scott, Anders Yeo
2009	J	`jnl`	Convex Sets in Acyclic Digraphs. Order Paul Balister, Stefanie Gerke, Gregory Z. Gutin
2009	—	`book`	Digraphs - Theory, Algorithms and Applications, Second Edition. Jørgen Bang-Jensen, Gregory Z. Gutin
2009	—	`ch.`	Domination Analysis in Combinatorial Optimization. Encyclopedia of Optimization Gregory Z. Gutin
2009	J	`jnl`	Empirical evaluation of construction heuristics for the multidimensional assignment problem CoRR Daniel Karapetyan, Gregory Z. Gutin, Boris Goldengorin
2009	J	`jnl`	FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs CoRR Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon
2009	—	`conf`	Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. IWPEC Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon
2009	J	`jnl`	Generalized Traveling Salesman Problem Reduction Algorithms. Algorithmic Oper. Res. Gregory Z. Gutin, Daniel Karapetyan
2009	—	`conf`	Local Search Heuristics for the Multidimensional Assignment Problem. Graph Theory, Computational Intelligence and Thought Gregory Z. Gutin, Daniel Karapetyan
2009	J	`jnl`	Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Graphs Comb. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2009	J	`jnl`	Minimum leaf out-branching and related problems. Theor. Comput. Sci. Gregory Z. Gutin, Igor Razgon, Eun Jung Kim
2009	J	`jnl`	Note on Max Lin-2 above Average CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones
2009	J	`jnl`	On complexity of Minimum Leaf Out-Branching problem. Discret. Appl. Math. Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim
2009	J	`jnl`	On the number of connected convex subgraphs of a connected acyclic digraph. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2009	J	`jnl`	Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2009	J	`jnl`	Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems. Electron. Notes Discret. Math. Gregory Z. Gutin
2009	—	`conf`	Properly Coloured Cycles and Paths: Results and Open Problems. Graph Theory, Computational Intelligence and Thought Gregory Z. Gutin, Eun Jung Kim
2009	J	`jnl`	Solving MAX-2-SAT Above a Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	J	`jnl`	Spanning Directed Trees with Many Leaves. SIAM J. Discret. Math. Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2009	—	`ch.`	Traveling Salesman Problem. Encyclopedia of Optimization Gregory Z. Gutin
2009	J	`jnl`	Vertex Cover Problem Parameterized Above and Below Tight Bounds CoRR Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2008	J	`jnl`	A Memetic Algorithm for the Generalized Traveling Salesman Problem CoRR Gregory Z. Gutin, Daniel Karapetyan
2008	J	`jnl`	A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
2008	B	`conf`	An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. WG Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo
2008	J	`jnl`	FPT Algorithms and Kernels for the Directed $k$-Leaf Problem CoRR Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo
2008	J	`jnl`	Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2008	J	`jnl`	Generalized Traveling Salesman Problem Reduction Algorithms CoRR Gregory Z. Gutin, Daniel Karapetyan
2008	J	`jnl`	Local Search Heuristics For The Multidimensional Assignment Problem CoRR Gregory Z. Gutin, Daniel Karapetyan
2008	C	`conf`	Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2008	J	`jnl`	Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discret. Math. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2008	J	`jnl`	Minimum Leaf Out-Branching Problems CoRR Gregory Z. Gutin, Eun Jung Kim, Igor Razgon
2008	C	`conf`	Minimum Leaf Out-Branching Problems. AAIM Gregory Z. Gutin, Igor Razgon, Eun Jung Kim
2008	J	`jnl`	Minimum cost homomorphisms to semicomplete multipartite digraphs. Discret. Appl. Math. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2008	J	`jnl`	Note on edge-colored graphs and digraphs without properly colored cycles. Australas. J Comb. Gregory Z. Gutin
2008	J	`jnl`	On Complexity of Minimum Leaf Out-branching Problem CoRR Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim
2008	J	`jnl`	Properly Coloured Cycles and Paths: Results and Open Problems CoRR Gregory Z. Gutin, Eun Jung Kim
2008	J	`jnl`	Some Parameterized Problems On Digraphs. Comput. J. Gregory Z. Gutin, Anders Yeo
2008	J	`jnl`	Spanning directed trees with many leaves CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2008	J	`jnl`	Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems. J. Heuristics Gregory Z. Gutin, Boris Goldengorin, Jing Huang
2007	—	`conf`	07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2007	—	`conf`	07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2007	J	`jnl`	Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo
2007	J	`jnl`	Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	—	`conf`	Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	J	`jnl`	Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops CoRR Eun Jung Kim, Gregory Z. Gutin
2007	J	`jnl`	Convex sets in acyclic digraphs CoRR Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin
2007	—	`ch.`	Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. NICSO Gregory Z. Gutin, Daniel Karapetyan, Natalio Krasnogor
2007	J	`jnl`	Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs CoRR Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
2007	J	`jnl`	Note on edge-colored graphs and digraphs without properly colored cycles CoRR Gregory Z. Gutin
2007	J	`jnl`	On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments CoRR Gregory Z. Gutin, Eun Jung Kim
2007	J	`jnl`	Parameterized Algorithms for Directed Maximum Leaf Problems CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	A*	`conf`	Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	—	`ed.`	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege
2007	J	`jnl`	The Greedy Algorithm for the Symmetric TSP. Algorithmic Oper. Res. Gregory Z. Gutin, Anders Yeo
2007	J	`jnl`	The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2006	J	`jnl`	Characterization of edge-colored complete graphs with properly colored Hamilton paths. J. Graph Theory Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Z. Gutin, Tommy R. Jensen, Arash Rafiey
2006	J	`jnl`	Domination analysis for minimum multiprocessor scheduling. Discret. Appl. Math. Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo
2006	J	`jnl`	Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discret. Optim. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2006	J	`jnl`	Fixed-Parameter Complexity of Minimum Profile Problems CoRR Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2006	—	`conf`	Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2006	J	`jnl`	Hamilton cycles in digraphs of unitary matrices. Discret. Math. Gregory Z. Gutin, Arash Rafiey, Simone Severini, Anders Yeo
2006	J	`jnl`	Level of repair analysis and minimum cost homomorphisms of graphs. Discret. Appl. Math. Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso
2006	J	`jnl`	Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs CoRR Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
2006	J	`jnl`	Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs CoRR Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2006	J	`jnl`	Minimum cost and list homomorphisms to semicomplete digraphs. Discret. Appl. Math. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2006	J	`jnl`	Multipartite tournaments with small number of cycles. Australas. J Comb. Gregory Z. Gutin, Arash Rafiey
2006	J	`jnl`	Note on Upper Bounds for TSP Domination Number. Algorithmic Oper. Res. Gregory Z. Gutin, Angela Koller, Anders Yeo
2006	J	`jnl`	On Graphs Comb. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2006	J	`jnl`	On-line bin Packing with Two Item Sizes. Algorithmic Oper. Res. Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo
2006	C	`conf`	The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2006	J	`jnl`	The traveling salesman problem. Discret. Optim. Gregory Z. Gutin, Abraham P. Punnen
2006	B	`conf`	Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. WAOA Gregory Z. Gutin, Boris Goldengorin, Jing Huang
2005	J	`jnl`	A problem of finding an acceptable variant in generalized project networks. Adv. Decis. Sci. David Blokh, Gregory Z. Gutin, Anders Yeo
2005	J	`jnl`	Batched bin packing. Discret. Optim. Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo
2005	—	`conf`	Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2005	J	`jnl`	Further Extension of the TSP Assign Neighborhood. J. Heuristics Gregory Z. Gutin, Fred W. Glover
2005	J	`jnl`	Kernels in planar digraphs. J. Comput. Syst. Sci. Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo
2005	C	`conf`	Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. AAIM Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso
2005	J	`jnl`	Mediated digraphs and quantum nonlocality. Discret. Appl. Math. Gregory Z. Gutin, Nick S. Jones, Arash Rafiey, Simone Severini, Anders Yeo
2005	J	`jnl`	Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs CoRR Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2005	J	`jnl`	Minimum Cost and List Homomorphisms to Semicomplete Digraphs CoRR Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2005	—	`conf`	Optimal On-Line Bin Packing with Two Item Sizes. ACiD Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo
2005	J	`jnl`	The Linear Arrangement Problem Parameterized Above Guaranteed Value CoRR Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2004	J	`jnl`	Algorithms with large domination ratio. J. Algorithms Noga Alon, Gregory Z. Gutin, Michael Krivelevich
2004	J	`jnl`	Extracting pure network submatrices in linear programs using signed graphs. Discret. Appl. Math. Nalan Gülpinar, Gregory Z. Gutin, Gautam Mitra, Alexei E. Zverovitch
2004	J	`jnl`	On the number of quasi-kernels in digraphs. J. Graph Theory Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
2004	J	`jnl`	When Discret. Math. Gregory Z. Gutin, Arash Rafiey
2004	J	`jnl`	When the greedy algorithm fails. Discret. Optim. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2003	J	`jnl`	Assignment problem based algorithms are impractical for the generalized TSP. Australas. J Comb. Gregory Z. Gutin, Anders Yeo
2003	—	`ch.`	Colorings and Related Topics. Handbook of Graph Theory Zsolt Tuza, Gregory Z. Gutin, Michael Plurnmer, Alan Tucker, Edmund Kieran Burke, Dominique de Werra, Jeffrey H. Kingston
2003	—	`ch.`	Connectivity and Traversability. Handbook of Graph Theory Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin
2003	J	`jnl`	Domination analysis of combinatorial optimization problems. Discret. Appl. Math. Gregory Z. Gutin, Alek Vainshtein, Anders Yeo
2003	J	`jnl`	Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2003	J	`jnl`	Transformations of generalized ATSP into ATSP. Oper. Res. Lett. David Ben-Arieh, Gregory Z. Gutin, M. Penn, Anders Yeo, Alexey Zverovich
2003	J	`jnl`	Upper bounds on ATSP neighborhood size. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2002	J	`jnl`	Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs Comb. Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
2002	J	`jnl`	Anti-matroids. Oper. Res. Lett. Gregory Z. Gutin, Anders Yeo
2002	—	`book`	Digraphs - theory, algorithms and applications. Jørgen Bang-Jensen, Gregory Z. Gutin
2002	J	`jnl`	Orientations of digraphs almost preserving diameter. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2002	J	`jnl`	Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2002	J	`jnl`	Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo, Alexey Zverovich
2001	J	`jnl`	Construction heuristics for the asymmetric TSP. Eur. J. Oper. Res. Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich
2001	J	`jnl`	Remarks on hamiltonian digraphs. Australas. J Comb. Gregory Z. Gutin, Anders Yeo
2001	J	`jnl`	Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. Graphs Comb. Gregory Z. Gutin, Anders Yeo
2001	J	`jnl`	TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Lett. Gregory Z. Gutin, Anders Yeo
2000	J	`jnl`	Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms. Comput. Optim. Appl. Nalan Gülpinar, Gregory Z. Gutin, Gautam Mitra, István Maros
2000	J	`jnl`	Kings in semicomplete multipartite digraphs. J. Graph Theory Gregory Z. Gutin, Anders Yeo
2000	J	`jnl`	Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. Discret. Math. Gregory Z. Gutin, Meike Tewes, Anders Yeo
2000	J	`jnl`	On the Hajo's number of graphs. Discret. Math. Gregory Z. Gutin, Alexandr V. Kostochka, Bjarne Toft
2000	J	`jnl`	Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian. J. Comb. Theory B Gregory Z. Gutin, Anders Yeo
1999	J	`jnl`	Connected (g, f)-factors and supereulerian digraphs. Ars Comb. Gregory Z. Gutin
1999	—	`conf`	Construction Heuristics and Domination Analysis for the Asymmetric TSP. WAE Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich
1999	J	`jnl`	Exponential neighbourhood local search for the traveling salesman problem. Comput. Oper. Res. Gregory Z. Gutin
1999	J	`jnl`	On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1999	J	`jnl`	Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Comput. Oper. Res. Gregory Z. Gutin, Anders Yeo
1998	J	`jnl`	A note on the cardinality of certain classes of unlabeled multipartite tournaments. Discret. Math. Gregory Z. Gutin
1998	J	`jnl`	A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1998	J	`jnl`	Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1998	J	`jnl`	Generalizations of tournaments: A survey. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin
1998	J	`jnl`	Note on alternating directed cycles. Discret. Math. Gregory Z. Gutin, Benny Sudakov, Anders Yeo
1998	J	`jnl`	Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. Discret. Appl. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1998	J	`jnl`	Upper domination and upper irredundance perfect graphs. Discret. Math. Gregory Z. Gutin, Vadim E. Zverovich
1997	J	`jnl`	A classification of locally semicomplete digraphs. Discret. Math. Jørgen Bang-Jensen, Yubao Guo, Gregory Z. Gutin, Lutz Volkmann
1997	J	`jnl`	Alternating cycles and paths in edge-coloured multigraphs: A survey. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1997	J	`jnl`	Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Comb. Probab. Comput. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1997	J	`jnl`	Paths and cycles in extended and decomposable digraphs Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1997	J	`jnl`	Properly colored Hamilton cycles in edge-colored complete graphs. Random Struct. Algorithms Noga Alon, Gregory Z. Gutin
1997	J	`jnl`	Vertex heaviest paths and cycles in quasi-transitive digraphs. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin
1996	J	`jnl`	A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang
1996	J	`jnl`	An approximate algorithm for combinatorial optimization problems with two parameters. Australas. J Comb. David Blokh, Gregory Z. Gutin
1996	J	`jnl`	On k-strong and k-cyclic digraphs. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1996	J	`jnl`	Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
1996	J	`jnl`	Sufficient conditions for a digraph to be Hamiltonian. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Hao Li
1995	J	`jnl`	Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. Discret. Math. Gregory Z. Gutin
1995	J	`jnl`	Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey. J. Graph Theory Gregory Z. Gutin
1995	J	`jnl`	Maximizing Traveling Salesman Problem for Special Matrices. Discret. Appl. Math. David Blokh, Gregory Z. Gutin
1995	J	`jnl`	Weakly Hamiltonian-connected ordinary multipartite tournaments. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang
1994	J	`jnl`	Minimizing and maximizing the diameter in orientations of graphs. Graphs Comb. Gregory Z. Gutin
1994	J	`jnl`	Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs. Australas. J Comb. Gregory Z. Gutin
1993	J	`jnl`	Finding a Longest Path in a Complete Multipartite Digraph. SIAM J. Discret. Math. Gregory Z. Gutin
1993	J	`jnl`	On Cycles in Multipartite Tournaments. J. Comb. Theory B Gregory Z. Gutin