Gregory Z. Gutin

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 139

Top Venues

CoRR

J. Graph Theory

Discret. Math.

J. Comput. Syst. Sci.

Publications

Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR (2024)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou
On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory 105 (3) (2024)
Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang
Convergence and correctness of belief propagation for weighted min-max flow. Discret. Appl. Math. 354 (2024)
Gregory Z. Gutin, Wei Li, Shujing Wang, Anders Yeo, Yacong Zhou
Note on disjoint cycles in multipartite tournaments. Discret. Math. 347 (10) (2024)
Yiling Dong, Gregory Z. Gutin, Yuefang Sun
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs. Discuss. Math. Graph Theory 44 (3) (2024)
Chen Wang, Chao Wang, Gregory Z. Gutin, Xiaoyan Zhang
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs. CoRR (2024)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Bi-objective Optimization in Role Mining. CoRR (2024)
Stefanie Gerke, Gregory Z. Gutin, Sung-Ha Hwang, Philip R. Neary
Public goods in networks with constraints on sharing. J. Econ. Theory 219 (2024)
Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. CoRR (2024)
Daniel Karapetyan, Gregory Z. Gutin
Solving the Workflow Satisfiability Problem Using General Purpose Solvers. IEEE Trans. Dependable Secur. Comput. 20 (6) (2023)
Gregory Z. Gutin, Anders Yeo
Lower Bounds for Maximum Weighted Cut. SIAM J. Discret. Math. 37 (2) (2023)
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133 (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Some coordination problems are harder than others. CoRR (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR (2023)
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940 (Part) (2023)
Weijie Fang, Yanggeng Fu, Jiaquan Gao, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang
Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism. CoRR (2023)
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Exact capacitated domination: On the computational complexity of uniqueness. Discret. Appl. Math. 332 (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR (2023)
Wenqi Wang, Gregory Z. Gutin, Yaping Mao, Donglei Du, Xiaoyan Zhang
Streaming Algorithms for the k-Submodular Cover Problem. CoRR (2023)
Gregory Z. Gutin, Anders Yeo
(1,1)-Cluster Editing is polynomial-time solvable. Discret. Appl. Math. 340 (2023)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
Bounds on Maximum Weight Directed Cut. CoRR (2023)
Jian Sun, Gregory Z. Gutin, Ping Li, Peihao Shi, Xiaoyan Zhang
An LP-based approximation algorithm for the generalized traveling salesman path problem. Theor. Comput. Sci. 941 (2023)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
Results on the small quasi-kernel conjecture. Discret. Math. 346 (7) (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI (2023)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Hui Lei, Yongtang Shi
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs. J. Comb. Optim. 45 (1) (2023)
Bin Sheng, Gregory Z. Gutin
Fixed parameterized algorithms for generalized feedback vertex set problems. Theor. Comput. Sci. 953 (2023)
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Unique stable matchings. Games Econ. Behav. 141 (2023)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
Results on the Small Quasi-Kernel Conjecture. CoRR (2022)
Samvel Kh. Darbinyan, Gregory Z. Gutin
-panconnected tournaments with large semidegrees. Discret. Math. 345 (8) (2022)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. 25 (4) (2022)
Gregory Z. Gutin, Matthias Mnich
A Survey on Graph Problems Parameterized Above and Below Guaranteed Values. CoRR (2022)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou
Extended path partition conjecture for semicomplete and acyclic compositions. Discret. Math. 345 (11) (2022)
Yiling Dong, Gregory Z. Gutin, Yuefang Sun
Strong subgraph 2-arc-connectivity of Cartesian product of digraphs. CoRR (2022)
Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths. IEEE Trans. Inf. Theory 68 (6) (2022)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Generalized Noise Role Mining. SACMAT (2022)
Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu
Smallest number of vertices in a 2-arc-strong digraph without good pairs. Theor. Comput. Sci. 936 (2022)
Bin Sheng, Gregory Z. Gutin
Solving Routing Problems via Important Cuts. CoRR (2022)
Gregory Z. Gutin, Anders Yeo
Perfect forests in graphs and their extensions. J. Graph Theory 101 (3) (2022)
Gregory Z. Gutin, Anders Yeo
(1, 1)-Cluster Editing is Polynomial-time Solvable. CoRR (2022)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. Algorithmica 84 (9) (2022)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin
Kings in multipartite hypertournaments. J. Graph Theory 99 (1) (2022)
Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun
Approximation algorithms with constant ratio for general cluster routing problems. J. Comb. Optim. 44 (4) (2022)
Yuefang Sun, Gregory Z. Gutin, Xiaoyan Zhang
Packing strong subgraph in digraphs. Discret. Optim. 46 (2022)
Jian Sun, Gregory Z. Gutin, Xiaoyan Zhang
A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem. COCOA (2021)
Yuefang Sun, Gregory Z. Gutin
Strong Subgraph Connectivity of Digraphs: A Survey. J. Interconnect. Networks 21 (4) (2021)
Gregory Z. Gutin, Anders Yeo
Perfect Forests in Graphs and Their Extensions. CoRR (2021)
Daniel Karapetyan, Gregory Z. Gutin
Solving the Workflow Satisfiability Problem using General Purpose Solvers. CoRR (2021)
Yuefang Sun, Gregory Z. Gutin
Strong Subgraph Connectivity of Digraphs. Graphs Comb. 37 (3) (2021)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda
Proximity and remoteness in directed and undirected graphs. Discret. Math. 344 (3) (2021)
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
Preference Swaps for the Stable Matching Problem. CoRR (2021)
Samvel Kh. Darbinyan, Gregory Z. Gutin
On d-panconnected tournaments with large semidegrees. CoRR (2021)
Gregory Z. Gutin, Anders Yeo
Lower Bounds for Maximum Weighted Cut. CoRR (2021)
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. CoRR (2021)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou
Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions. CoRR (2021)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem. CoRR (2021)
Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings. COCOA (2021)
Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar
Valued Authorization Policy Existence Problem. SACMAT (2021)
Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
. ACM Trans. Algorithms 17 (1) (2021)
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. ACM Trans. Priv. Secur. 24 (3) (2021)
Gregory Z. Gutin, Anders Yeo
Perfect Forests in Graphs and Their Extensions. MFCS (2021)
Zan-Bo Zhang, Xiaoyan Zhang, Gregory Z. Gutin, Dingjun Lou
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. J. Graph Theory 96 (2) (2021)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35 (1) (2021)
Gregory Z. Gutin, Yuefang Sun
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs. Discret. Math. 343 (5) (2020)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu
Proper orientation number of triangle-free bridgeless outerplanar graphs. J. Graph Theory 95 (2) (2020)
Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun
Approximation algorithms for general cluster routing problem. CoRR (2020)
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Exact capacitated domination: on the computational complexity of uniqueness. CoRR (2020)
Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun
Approximation Algorithms for General Cluster Routing Problem. COCOON (2020)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. 806 (2020)
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games. COCOON (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. CoRR (2020)
Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant
The Authorization Policy Existence Problem. IEEE Trans. Dependable Secur. Comput. 17 (6) (2020)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin
Note on 4-Kings in Bipartite Hypertournaments. CoRR (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. IPEC (2020)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda
Proximity and Remoteness in Directed and Undirected Graphs. CoRR (2020)
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory 95 (2) (2020)
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR (2020)
Gregory Z. Gutin, Daniel Karapetyan
Constraint Branching in Workflow Satisfiability Problem. SACMAT (2020)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-Coloring Extension and List Coloring Problems. STACS (2020)
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
Bounded and Approximate Strong Satisfiability in Workflows. SACMAT (2019)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu
Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs. CoRR (2019)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-coloring Extension and List Coloring Problems. CoRR (2019)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. 101 (2019)
Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant
Parameterized resiliency problems. Theor. Comput. Sci. 795 (2019)
Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar
Bounded and Approximate Strong Satisfiability in Workflows. CoRR (2019)
Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. J. Artif. Intell. Res. 66 (2019)
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR (2019)
Gregory Z. Gutin
The Workflow Satisfiability Problem with User-Independent Constraints. GC (2019)
Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang
Strong subgraph k-connectivity. J. Graph Theory 92 (1) (2019)
Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
On r-Simple k-Path and Related Problems Parameterized by k/r. SODA (2019)
Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani
Clustering without replication in combinatorial circuits. J. Comb. Optim. 38 (2) (2019)
Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. Discret. Math. 342 (8) (2019)
Gregory Z. Gutin, Yuefang Sun
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs. CoRR (2019)
Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
On r-Simple k-Path and Related Problems Parameterized by k/r. CoRR (2018)
Gregory Z. Gutin, Felix Reidl, Magnus Wahlström
-distinct in- and out-branchings in digraphs. J. Comput. Syst. Sci. 95 (2018)
Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. CoRR (2018)
Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang
Strong Subgraph k-connectivity. CoRR (2018)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Alternative parameterizations of Metric Dimension. CoRR (2018)
Yuefang Sun, Gregory Z. Gutin
Strong subgraph k-arc-connectivity. CoRR (2018)
Yuefang Sun, Gregory Z. Gutin
Strong subgraph k-connectivity bounds. CoRR (2018)
Gregory Z. Gutin, George B. Mertzios, Felix Reidl
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods. CoRR (2018)

Gregory Z. Gutin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gregory Z. Gutin