default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGregory Z. Gutin
Person information
- affiliation: Royal Holloway, University of London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j192]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: 122-130 (2024)- [j191]Gregory Z. Gutin, Wei Li, Shujing Wang, Anders Yeo, Yacong Zhou:
Note on disjoint cycles in multipartite tournaments. Discret. Math. 347(10): 114126 (2024) - [j190]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): 913 (2024) - [j189]Stefanie Gerke, Gregory Z. Gutin, Sung-Ha Hwang, Philip R. Neary:
Public goods in networks with constraints on sharing. J. Econ. Theory 219: 105844 (2024) - [j188]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): 413-426 (2024) - [j187]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. SIAM J. Discret. Math. 38(3): 2370-2391 (2024) - [i137]Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR abs/2401.10074 (2024) - [i136]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Bi-objective Optimization in Role Mining. CoRR abs/2403.16757 (2024) - [i135]Chen Wang, Chao Wang, Gregory Z. Gutin, Xiaoyan Zhang:
Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs. CoRR abs/2404.16540 (2024) - [i134]Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou:
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. CoRR abs/2407.17051 (2024) - [i133]Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary, Alexander Vickery, Anders Yeo:
Speeding up deferred acceptance. CoRR abs/2409.06865 (2024) - [i132]Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou:
Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree. CoRR abs/2409.07680 (2024) - 2023
- [j186]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Exact capacitated domination: On the computational complexity of uniqueness. Discret. Appl. Math. 332: 155-169 (2023) - [j185]Gregory Z. Gutin, Anders Yeo:
(1,1)-Cluster Editing is polynomial-time solvable. Discret. Appl. Math. 340: 259-271 (2023) - [j184]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Results on the small quasi-kernel conjecture. Discret. Math. 346(7): 113435 (2023) - [j183]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Unique stable matchings. Games Econ. Behav. 141: 529-547 (2023) - [j182]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): 40 (2023) - [j181]Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström:
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133: 23-40 (2023) - [j180]Gregory Z. Gutin, Anders Yeo:
Lower Bounds for Maximum Weighted Cut. SIAM J. Discret. Math. 37(2): 1142-1161 (2023) - [j179]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): 222-230 (2023) - [j178]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: 180-190 (2023) - [j177]Bin Sheng, Gregory Z. Gutin:
Fixed parameterized algorithms for generalized feedback vertex set problems. Theor. Comput. Sci. 953: 113798 (2023) - [j176]Daniel Karapetyan, Gregory Z. Gutin:
Solving the Workflow Satisfiability Problem Using General Purpose Solvers. IEEE Trans. Dependable Secur. Comput. 20(6): 4474-4485 (2023) - [c67]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: 2642-2650 - [i131]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. CoRR abs/2304.10202 (2023) - [i130]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 abs/2304.13398 (2023) - [i129]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 abs/2305.07124 (2023) - [i128]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR abs/2307.01109 (2023) - [i127]Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Some coordination problems are harder than others. CoRR abs/2311.03195 (2023) - [i126]Wenqi Wang, Gregory Z. Gutin, Yaping Mao, Donglei Du, Xiaoyan Zhang:
Streaming Algorithms for the k-Submodular Cover Problem. CoRR abs/2312.03593 (2023) - 2022
- [j175]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. Algorithmica 84(9): 2767-2784 (2022) - [j174]Yuefang Sun, Gregory Z. Gutin, Xiaoyan Zhang:
Packing strong subgraph in digraphs. Discret. Optim. 46: 100745 (2022) - [j173]Samvel Kh. Darbinyan, Gregory Z. Gutin:
On d-panconnected tournaments with large semidegrees. Discret. Math. 345(8): 112931 (2022) - [j172]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou:
Extended path partition conjecture for semicomplete and acyclic compositions. Discret. Math. 345(11): 113019 (2022) - [j171]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): 2499-2514 (2022) - [j170]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin:
Kings in multipartite hypertournaments. J. Graph Theory 99(1): 82-89 (2022) - [j169]Gregory Z. Gutin, Anders Yeo:
Perfect forests in graphs and their extensions. J. Graph Theory 101(3): 572-592 (2022) - [j168]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: 148-171 (2022) - [j167]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): 28:1-28:32 (2022) - [j166]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): 3870-3878 (2022) - [c66]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Generalized Noise Role Mining. SACMAT 2022: 91-102 - [i125]Yiling Dong, Gregory Z. Gutin, Yuefang Sun:
Strong subgraph 2-arc-connectivity of Cartesian product of digraphs. CoRR abs/2201.09093 (2022) - [i124]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Results on the Small Quasi-Kernel Conjecture. CoRR abs/2207.12157 (2022) - [i123]Gregory Z. Gutin, Matthias Mnich:
A Survey on Graph Problems Parameterized Above and Below Guaranteed Values. CoRR abs/2207.12278 (2022) - [i122]Gregory Z. Gutin, Anders Yeo:
(1, 1)-Cluster Editing is Polynomial-time Solvable. CoRR abs/2210.07722 (2022) - 2021
- [j165]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda:
Proximity and remoteness in directed and undirected graphs. Discret. Math. 344(3): 112252 (2021) - [j164]Yuefang Sun, Gregory Z. Gutin:
Strong Subgraph Connectivity of Digraphs. Graphs Comb. 37(3): 951-970 (2021) - [j163]Zan-Bo Zhang, Xiaoyan Zhang, Gregory Z. Gutin, Dingjun Lou:
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. J. Graph Theory 96(2): 171-191 (2021) - [j162]Yuefang Sun, Gregory Z. Gutin:
Strong Subgraph Connectivity of Digraphs: A Survey. J. Interconnect. Networks 21(4): 2142004:1-2142004:16 (2021) - [j161]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35(1): 575-596 (2021) - [j160]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
r-Simple k-Path and Related Problems Parameterized by k/r. ACM Trans. Algorithms 17(1): 10:1-10:64 (2021) - [j159]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): 21:1-21:22 (2021) - [c65]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: 318-332 - [c64]Jian Sun, Gregory Z. Gutin, Xiaoyan Zhang:
A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem. COCOA 2021: 641-652 - [c63]Gregory Z. Gutin, Anders Yeo:
Perfect Forests in Graphs and Their Extensions. MFCS 2021: 54:1-54:13 - [c62]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem. SACMAT 2021: 83-94 - [i121]Gregory Z. Gutin, Anders Yeo:
Lower Bounds for Maximum Weighted Cut. CoRR abs/2104.05536 (2021) - [i120]Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. CoRR abs/2104.05983 (2021) - [i119]Gregory Z. Gutin, Anders Yeo:
Perfect Forests in Graphs and Their Extensions. CoRR abs/2105.00254 (2021) - [i118]Daniel Karapetyan, Gregory Z. Gutin:
Solving the Workflow Satisfiability Problem using General Purpose Solvers. CoRR abs/2105.03273 (2021) - [i117]Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
Valued Authorization Policy Existence Problem: Theory and Experiments. CoRR abs/2106.05761 (2021) - [i116]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou:
Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions. CoRR abs/2111.09633 (2021) - [i115]Samvel Kh. Darbinyan, Gregory Z. Gutin:
On d-panconnected tournaments with large semidegrees. CoRR abs/2112.08807 (2021) - [i114]Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference Swaps for the Stable Matching Problem. CoRR abs/2112.15361 (2021) - 2020
- [j158]Gregory Z. Gutin, Yuefang Sun:
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs. Discret. Math. 343(5): 111816 (2020) - [j157]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): 256-266 (2020) - [j156]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory 95(2): 267-289 (2020) - [j155]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. 806: 133-143 (2020) - [j154]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. IEEE Trans. Dependable Secur. Comput. 17(6): 1333-1344 (2020) - [c61]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games. COCOON 2020: 360-371 - [c60]Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun:
Approximation Algorithms for General Cluster Routing Problem. COCOON 2020: 472-483 - [c59]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. IPEC 2020: 2:1-2:16 - [c58]Gregory Z. Gutin, Daniel Karapetyan:
Constraint Branching in Workflow Satisfiability Problem. SACMAT 2020: 93-103 - [c57]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. STACS 2020: 19:1-19:18 - [i113]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda:
Proximity and Remoteness in Directed and Undirected Graphs. CoRR abs/2001.10253 (2020) - [i112]Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Exact capacitated domination: on the computational complexity of uniqueness. CoRR abs/2003.07106 (2020) - [i111]Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun:
Approximation algorithms for general cluster routing problem. CoRR abs/2006.12929 (2020) - [i110]Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Component Order Connectivity in Directed Graphs. CoRR abs/2007.06896 (2020) - [i109]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 abs/2009.08158 (2020) - [i108]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin:
Note on 4-Kings in Bipartite Hypertournaments. CoRR abs/2011.05878 (2020)
2010 – 2019
- 2019
- [j153]Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai:
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. Discret. Math. 342(8): 2297-2305 (2019) - [j152]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: 85-122 (2019) - [j151]Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani:
Clustering without replication in combinatorial circuits. J. Comb. Optim. 38(2): 481-501 (2019) - [j150]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. 101: 1-20 (2019) - [j149]Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang:
Strong subgraph k-connectivity. J. Graph Theory 92(1): 5-18 (2019) - [j148]Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant:
Parameterized resiliency problems. Theor. Comput. Sci. 795: 478-491 (2019) - [c56]Gregory Z. Gutin:
The Workflow Satisfiability Problem with User-Independent Constraints. GC 2019: 1-4 - [c55]Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
Bounded and Approximate Strong Satisfiability in Workflows. SACMAT 2019: 179-184 - [c54]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
On r-Simple k-Path and Related Problems Parameterized by k/r. SODA 2019: 1750-1769 - [i107]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR abs/1903.12225 (2019) - [i106]Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
Bounded and Approximate Strong Satisfiability in Workflows. CoRR abs/1904.07234 (2019) - [i105]Gregory Z. Gutin, Yuefang Sun:
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs. CoRR abs/1906.08052 (2019) - [i104]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu:
Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs. CoRR abs/1907.06379 (2019) - [i103]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-coloring Extension and List Coloring Problems. CoRR abs/1907.12061 (2019) - 2018
- [j147]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi:
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. J. Comput. Syst. Sci. 95: 69-85 (2018) - [j146]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
k-distinct in- and out-branchings in digraphs. J. Comput. Syst. Sci. 95: 86-97 (2018) - [p6]Jørgen Bang-Jensen, Gregory Z. Gutin:
Basic Terminology, Notation and Results. Classes of Directed Graphs 2018: 1-34 - [p5]Gregory Z. Gutin:
Acyclic Digraphs. Classes of Directed Graphs 2018: 125-172 - [e3]Jørgen Bang-Jensen, Gregory Z. Gutin:
Classes of Directed Graphs. Springer Monographs in Mathematics, Springer 2018, ISBN 978-3-319-71839-2 [contents] - [i102]Gregory Z. Gutin, George B. Mertzios, Felix Reidl:
Searching for Maximum Out-Degree Vertices in Tournaments. CoRR abs/1801.04702 (2018) - [i101]Yuefang Sun, Gregory Z. Gutin:
Strong subgraph k-connectivity bounds. CoRR abs/1803.00281 (2018) - [i100]Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang:
Strong Subgraph k-connectivity. CoRR abs/1803.00284 (2018) - [i99]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Alternative parameterizations of Metric Dimension. CoRR abs/1804.10670 (2018) - [i98]Gregory Z. Gutin, George B. Mertzios, Felix Reidl:
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods. CoRR abs/1805.01684 (2018) - [i97]Yuefang Sun, Gregory Z. Gutin:
Strong subgraph k-arc-connectivity. CoRR abs/1805.01687 (2018) - [i96]Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
On r-Simple k-Path and Related Problems Parameterized by k/r. CoRR abs/1806.09108 (2018) - [i95]Yuefang Sun, Gregory Z. Gutin:
Strong Subgraph Connectivity of Digraphs: A Survey. CoRR abs/1808.02740 (2018) - [i94]Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai:
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. CoRR abs/1812.08809 (2018) - 2017
- [j145]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. Algorithmica 79(1): 211-229 (2017) - [j144]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. 217: 196-202 (2017) - [j143]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in edge-colored graphs. Discret. Math. 340(2): 1-8 (2017) - [j142]Gregory Z. Gutin, Bin Sheng, Magnus Wahlström:
Odd properly colored cycles in edge-colored graphs. Discret. Math. 340(4): 817-821 (2017) - [j141]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant:
The bi-objective workflow satisfiability problem and workflow resiliency. J. Comput. Secur. 25(1): 83-115 (2017) - [j140]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering:
Cryptographic enforcement of information flow policies without public information via tree partitions. J. Comput. Secur. 25(6): 511-535 (2017) - [j139]Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. 83(1): 121-131 (2017) - [j138]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized complexity of the k-arc Chinese Postman Problem. J. Comput. Syst. Sci. 84: 107-119 (2017) - [j137]Gregory Z. Gutin, Anders Yeo:
Note on Perfect Forests in Digraphs. J. Graph Theory 85(2): 372-377 (2017) - [c53]Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant:
Parameterized Resiliency Problems via Integer Linear Programming. CIAC 2017: 164-176 - [c52]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. CODASPY 2017: 163-165 - [c51]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-Contractions, Edge Deletions and Connectivity Preservation. ESA 2017: 47:1-47:13 - [c50]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
k-Distinct In- and Out-Branchings in Digraphs. ICALP 2017: 58:1-58:13 - [c49]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
On the Satisfiability of Workflows with Release Points. SACMAT 2017: 207-217 - [p4]Gregory Z. Gutin, Anders Yeo:
Parameterized Constraint Satisfaction Problems: a Survey. The Constraint Satisfaction Problem 2017: 179-203 - [i93]Gregory Z. Gutin, Ruijuan Li:
Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs. CoRR abs/1704.01389 (2017) - [i92]Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström:
Path-contractions, edge deletions and connectivity preservation. CoRR abs/1704.06622 (2017) - [i91]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi:
Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. CoRR abs/1706.03698 (2017) - [i90]Bin Sheng, Ruijuan Li, Gregory Z. Gutin:
The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs. CoRR abs/1707.06503 (2017) - 2016
- [j136]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo:
Parameterizations of Test Cover with Bounded Test Sizes. Algorithmica 74(1): 367-384 (2016) - [j135]Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström:
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica 75(2): 383-402 (2016) - [j134]Gregory Z. Gutin, Magnus Wahlström:
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis. Inf. Process. Lett. 116(3): 223-226 (2016) - [j133]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. 116(6): 433-436 (2016) - [j132]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Comb. Optim. 32(1): 3-24 (2016) - [j131]Gregory Z. Gutin:
Note on Perfect Forests. J. Graph Theory 82(3): 233-235 (2016) - [j130]Gregory Z. Gutin, Viresh Patel:
Parameterized Traveling Salesman Problem: Beating the Average. SIAM J. Discret. Math. 30(1): 220-238 (2016) - [j129]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. SIAM J. Discret. Math. 30(4): 2177-2205 (2016) - [j128]Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. 19(3): 8:1-8:29 (2016) - [c48]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
A Multivariate Approach for Checking Resiliency in Access Control. AAIM 2016: 173-184 - [c47]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
Resiliency Policies in Access Control Revisited. SACMAT 2016: 101-111 - [r4]Gregory Z. Gutin:
Kernelization, Constraint Satisfaction Problems Parameterized above Average. Encyclopedia of Algorithms 2016: 1011-1013 - [r3]Gregory Z. Gutin:
Kernelization, Permutation CSPs Parameterized above Average. Encyclopedia of Algorithms 2016: 1031-1033 - [i89]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Acyclicity in Edge-Colored Graphs. CoRR abs/1601.01824 (2016) - [i88]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
A Multivariate Approach for Checking Resiliency in Access Control. CoRR abs/1604.01550 (2016) - [i87]Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin:
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. CoRR abs/1604.05636 (2016) - [i86]Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
An Approach to Parameterized Resiliency Problems Using Integer Linear Programming. CoRR abs/1605.08738 (2016) - [i85]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering:
Cryptographic Enforcement of Information Flow Policies without Public Information via Tree Partitions. CoRR abs/1608.08386 (2016) - [i84]Gregory Z. Gutin, Felix Reidl, Magnus Wahlström:
$k$-Distinct In- and Out-Branchings in Digraphs. CoRR abs/1612.03607 (2016) - [i83]Pierre Bergé, Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
The Authorization Policy Existence Problem. CoRR abs/1612.06191 (2016) - 2015
- [j127]Gregory Z. Gutin, Stefan Szeider:
Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica 71(3): 539-540 (2015) - [c46]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering:
Cryptographic Enforcement of Information Flow Policies Without Public Information. ACNS 2015: 389-408 - [c45]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones:
Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies. DBSec 2015: 330-345 - [c44]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
Structural Parameterizations of the Mixed Chinese Postman Problem. ESA 2015: 668-679 - [c43]Daniel Karapetyan, Andrei V. Gagarin, Gregory Z. Gutin:
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints. FAW 2015: 138-149 - [c42]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. IPEC 2015: 43-54 - [c41]Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
On the Workflow Satisfiability Problem with Class-independent Constraints. IPEC 2015: 66-77 - [c40]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan:
Valued Workflow Satisfiability Problem. SACMAT 2015: 3-13 - [i82]Gregory Z. Gutin:
Note on Perfect Forests. CoRR abs/1501.01079 (2015) - [i81]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan:
Valued Workflow Satisfiability Problem. CoRR abs/1501.07814 (2015) - [i80]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones:
Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. CoRR abs/1503.01382 (2015) - [i79]David A. Cohen, Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. CoRR abs/1504.02420 (2015) - [i78]Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
On the Workflow Satisfiability Problem with Class-Independent Constraints. CoRR abs/1504.03561 (2015) - [i77]Gregory Z. Gutin, Magnus Wahlström:
Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis. CoRR abs/1508.06829 (2015) - [i76]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths. CoRR abs/1510.03564 (2015) - [i75]Gregory Z. Gutin, Anders Yeo:
Note on Perfect Forests in Digraphs. CoRR abs/1511.01661 (2015) - [i74]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on Edge-Colored Multigraphs. CoRR abs/1512.06283 (2015) - [i73]Jason Crampton, Gregory Z. Gutin, Daniel Karapetyan, Rémi Watrigant:
The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency. CoRR abs/1512.07019 (2015) - 2014
- [j126]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica 68(3): 739-757 (2014) - [j125]Gregory Z. Gutin, Dimitrios M. Thilikos:
Report on NII Shonan Meeting 2013-018. Bull. EATCS 112 (2014) - [j124]Gregory Z. Gutin, Mark Jones:
Parameterized algorithms for load coloring problem. Inf. Process. Lett. 114(8): 446-449 (2014) - [j123]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Iterative Plan Construction for the Workflow Satisfiability Problem. J. Artif. Intell. Res. 51: 555-577 (2014) - [j122]Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo:
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. 80(4): 687-696 (2014) - [c39]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized Complexity of the k-Arc Chinese Postman Problem. ESA 2014: 530-541 - [c38]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. FAW 2014: 48-59 - [c37]Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström:
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. IPEC 2014: 208-220 - [c36]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. WG 2014: 250-262 - [i72]Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström:
Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs. CoRR abs/1402.2137 (2014) - [i71]Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized Complexity of the $k$-Arc Chinese Postman Problem. CoRR abs/1403.1512 (2014) - [i70]Gregory Z. Gutin, Viresh Patel:
Parameterized TSP: Beating the Average. CoRR abs/1408.0531 (2014) - [i69]Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström:
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. CoRR abs/1409.7261 (2014) - [i68]Gregory Z. Gutin, Mark Jones, Magnus Wahlström:
Structural Parameterizations of the Mixed Chinese Postman Problem. CoRR abs/1410.5191 (2014) - [i67]Jason Crampton, Naomi Farley, Gregory Z. Gutin, Mark Jones, Bertram Poettering:
Cryptographic Enforcement of Information Flow Policies without Public Information. CoRR abs/1410.5567 (2014) - [i66]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. CoRR abs/1412.3023 (2014) - [i65]Daniel Karapetyan, Andrei V. Gagarin, Gregory Z. Gutin:
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem. CoRR abs/1412.7834 (2014) - 2013
- [j121]Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo:
A new bound for 3-satisfiable MaxSat and its algorithmic application. Inf. Comput. 231: 117-124 (2013) - [j120]Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
(Non-)existence of polynomial kernels for the Test Cover problem. Inf. Process. Lett. 113(4): 123-126 (2013) - [j119]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$. Theory Comput. Syst. 52(4): 719-728 (2013) - [j118]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 53(4): 690-691 (2013) - [j117]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized complexity of MaxSat Above Average. Theor. Comput. Sci. 511: 77-84 (2013) - [j116]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia:
Maximum balanced subgraph problem parameterized above lower bound. Theor. Comput. Sci. 513: 53-64 (2013) - [j115]Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
Parameterized complexity of k-Chinese Postman Problem. Theor. Comput. Sci. 513: 124-128 (2013) - [j114]Jason Crampton, Gregory Z. Gutin, Anders Yeo:
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem. ACM Trans. Inf. Syst. Secur. 16(1): 4 (2013) - [c35]Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan:
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. FAW-AAIM 2013: 198-209 - [c34]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia:
Maximum Balanced Subgraph Problem Parameterized above Lower Bound. COCOON 2013: 434-445 - [c33]Jason Crampton, Gregory Z. Gutin:
Constraint expressions and workflow satisfiability. SACMAT 2013: 73-84 - [e2]Gregory Z. Gutin, Stefan Szeider:
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8246, Springer 2013, ISBN 978-3-319-03897-1 [contents] - [i64]Jason Crampton, Gregory Z. Gutin:
Constraint Expressions and Workflow Satisfiability. CoRR abs/1301.3402 (2013) - [i63]David A. Cohen, Jason Crampton, Gregory Z. Gutin, Mark Jones:
Pattern-Based Plan Construction for the Workflow Satisfiability Problem. CoRR abs/1306.3649 (2013) - [i62]Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
Parameterized Complexity of k-Chinese Postman Problem. CoRR abs/1308.0482 (2013) - [i61]Gregory Z. Gutin, Mark Jones:
Parameterized Algorithms for Load Coloring Problem. CoRR abs/1308.1820 (2013) - [i60]Gregory Z. Gutin, Magnus Wahlström, Anders Yeo:
Parameterized Rural Postman and Conjoining Bipartite Matching Problems. CoRR abs/1308.2599 (2013) - [i59]Gregory Z. Gutin, Kazuo Iwama, Dimitrios M. Thilikos:
Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2). NII Shonan Meet. Rep. 2013 (2013) - 2012
- [j113]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica 64(1): 56-68 (2012) - [j112]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica 64(1): 112-125 (2012) - [j111]Gregory Z. Gutin, Anders Yeo:
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. Discret. Appl. Math. 160(15): 2323-2328 (2012) - [j110]Daniel Karapetyan, Gregory Z. Gutin:
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur. J. Oper. Res. 219(2): 234-251 (2012) - [j109]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Eulerian strong component arc deletion problem on tournaments. Inf. Process. Lett. 112(6): 249-251 (2012) - [j108]Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci. 78(1): 151-163 (2012) - [j107]Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo:
An algorithm for finding input-output constrained convex sets in an acyclic digraph. J. Discrete Algorithms 13: 47-58 (2012) - [j106]Gregory Z. Gutin, Mark Jones:
Note on Large Subsets of Binary Vectors with Similar Distances. SIAM J. Discret. Math. 26(3): 1108-1111 (2012) - [c32]Gregory Z. Gutin, Anders Yeo:
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey. The Multivariate Algorithmic Revolution and Beyond 2012: 257-286 - [c31]Jason Crampton, Gregory Z. Gutin, Anders Yeo:
On the parameterized complexity of the workflow satisfiability problem. CCS 2012: 857-868 - [c30]Robert Crowston, Gregory Z. Gutin, Mark Jones:
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. FSTTCS 2012: 400-411 - [c29]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat above Average. LATIN 2012: 184-194 - [c28]Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo:
Parameterized Study of the Test Cover Problem. MFCS 2012: 283-295 - [c27]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT 2012: 355-368 - [i58]Gregory Z. Gutin, Mark Jones:
Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances. CoRR abs/1202.6260 (2012) - [i57]Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
(Non-)existence of Polynomial Kernels for the Test Cover Problem. CoRR abs/1204.4368 (2012) - [i56]Jason Crampton, Gregory Z. Gutin, Anders Yeo:
On the Parameterized Complexity of the Workflow Satisfiability Problem. CoRR abs/1205.0852 (2012) - [i55]Robert Crowston, Gregory Z. Gutin, Mark Jones:
Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound. CoRR abs/1207.3586 (2012) - [i54]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo:
Parameterizations of Test Cover with Bounded Test Sizes. CoRR abs/1209.6528 (2012) - [i53]Jason Crampton, Robert Crowston, Gregory Z. Gutin, Mark Jones, M. S. Ramanujan:
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. CoRR abs/1210.3978 (2012) - [i52]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo:
Fixed-parameter tractability of satisfying beyond the number of variables. CoRR abs/1212.0106 (2012) - [i51]Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo:
Parameterized Study of the Test Cover Problem. CoRR abs/1212.0117 (2012) - [i50]Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia:
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound. CoRR abs/1212.6848 (2012) - 2011
- [j105]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011) - [j104]Michael R. Fellows, Fedor V. Fomin, Gregory Z. Gutin:
Special Issue on Parameterized Complexity of Discrete Optimization. Discret. Optim. 8(1): 1 (2011) - [j103]Daniel Karapetyan, Gregory Z. Gutin:
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. Evol. Comput. 19(3): 345-371 (2011) - [j102]Daniel Karapetyan, Gregory Z. Gutin:
Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem. Eur. J. Oper. Res. 208(3): 221-232 (2011) - [j101]Daniel Karapetyan, Gregory Z. Gutin:
Local search heuristics for the multidimensional assignment problem. J. Heuristics 17(3): 201-249 (2011) - [j100]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2): 422-429 (2011) - [j99]Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. 48(2): 402-410 (2011) - [j98]Gregory Z. Gutin, Mark Jones, Anders Yeo:
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. Theor. Comput. Sci. 412(41): 5744-5751 (2011) - [c26]Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT 2011: 138-147 - [c25]Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo:
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011: 229-240 - [i49]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory. CoRR abs/1104.1135 (2011) - [i48]Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application. CoRR abs/1104.2818 (2011) - [i47]Gregory Z. Gutin, Anders Yeo:
Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width. CoRR abs/1106.1049 (2011) - [i46]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. CoRR abs/1106.3527 (2011) - [i45]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments. CoRR abs/1106.4454 (2011) - [i44]Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat Above Average. CoRR abs/1108.4501 (2011) - [i43]Gregory Z. Gutin, Anders Yeo:
Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey. CoRR abs/1108.4803 (2011) - [i42]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$. CoRR abs/1110.5915 (2011) - 2010
- [j97]Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. Australas. J Comb. 46: 217-232 (2010) - [j96]Gregory Z. Gutin, Eun Jung Kim:
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. Discret. Appl. Math. 158(4): 319-330 (2010) - [j95]Robert Crowston, Gregory Z. Gutin, Mark Jones:
Note on Max Lin-2 above Average. Inf. Process. Lett. 110(11): 451-454 (2010) - [j94]Gregory Z. Gutin, Anders Yeo:
Note on maximal bisection above tight lower bound. Inf. Process. Lett. 110(21): 966-969 (2010) - [j93]Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo:
FPT algorithms and kernels for the Directed k-Leaf problem. J. Comput. Syst. Sci. 76(2): 144-152 (2010) - [j92]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. 76(7): 650-662 (2010) - [j91]Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. 76(8): 872-878 (2010) - [j90]Gregory Z. Gutin, Daniel Karapetyan:
A memetic algorithm for the generalized traveling salesman problem. Nat. Comput. 9(1): 47-60 (2010) - [c24]Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. ESA (1) 2010: 326-337 - [c23]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application. IPEC 2010: 84-94 - [c22]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC 2010: 158-169 - [c21]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517 - [c20]Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa:
Systems of Linear Equations over F2 and Problems Parameterized above Average. SWAT 2010: 164-175 - [i41]Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa:
Systems of Linear Equations over F2 and Problems Parameterized Above Average. CoRR abs/1002.0286 (2010) - [i40]Daniel Karapetyan, Gregory Z. Gutin:
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. CoRR abs/1003.4314 (2010) - [i39]Daniel Karapetyan, Gregory Z. Gutin:
Lin-Kernighan Heuristic Adaptation for the Generalized Traveling Salesman Problem. CoRR abs/1003.5330 (2010) - [i38]Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation. CoRR abs/1004.0526 (2010) - [i37]Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels. CoRR abs/1004.1956 (2010) - [i36]Gregory Z. Gutin, Anders Yeo:
Note on Maximal Bisection above Tight Lower Bound. CoRR abs/1005.2848 (2010) - [i35]Daniel Karapetyan, Gregory Z. Gutin:
Local Search Algorithms for the Generalized Traveling Salesman Problem. CoRR abs/1005.5525 (2010) - [i34]Gregory Z. Gutin, Mark Jones, Anders Yeo:
Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems. CoRR abs/1010.5881 (2010)
2000 – 2009
- 2009
- [b2]Jørgen Bang-Jensen, Gregory Z. Gutin:
Digraphs - Theory, Algorithms and Applications, Second Edition. Springer Monographs in Mathematics, Springer 2009, ISBN 978-1-84800-997-4, pp. I-XXII, 1-795 - [j89]Gregory Z. Gutin, Daniel Karapetyan:
Generalized Traveling Salesman Problem Reduction Algorithms. Algorithmic Oper. Res. 4(2): 144-154 (2009) - [j88]Gregory Z. Gutin, Anders Yeo:
On the number of connected convex subgraphs of a connected acyclic digraph. Discret. Appl. Math. 157(7): 1660-1662 (2009) - [j87]Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim:
On complexity of Minimum Leaf Out-Branching problem. Discret. Appl. Math. 157(13): 3000-3004 (2009) - [j86]Gregory Z. Gutin:
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems. Electron. Notes Discret. Math. 32: 75-82 (2009) - [j85]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Graphs Comb. 25(4): 521-531 (2009) - [j84]Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo:
Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms 7(4): 509-518 (2009) - [j83]Gregory Z. Gutin, Daniel Karapetyan:
A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Comput. 1(1): 25-34 (2009) - [j82]Paul Balister, Stefanie Gerke, Gregory Z. Gutin:
Convex Sets in Acyclic Digraphs. Order 26(1): 95-100 (2009) - [j81]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Spanning Directed Trees with Many Leaves. SIAM J. Discret. Math. 23(1): 466-476 (2009) - [j80]Gregory Z. Gutin, Igor Razgon, Eun Jung Kim:
Minimum leaf out-branching and related problems. Theor. Comput. Sci. 410(45): 4571-4579 (2009) - [c19]Gregory Z. Gutin, Daniel Karapetyan:
Local Search Heuristics for the Multidimensional Assignment Problem. Graph Theory, Computational Intelligence and Thought 2009: 100-115 - [c18]Gregory Z. Gutin, Eun Jung Kim:
Properly Coloured Cycles and Paths: Results and Open Problems. Graph Theory, Computational Intelligence and Thought 2009: 200-208 - [c17]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. COCOON 2009: 37-46 - [c16]Joseph Reddington, Gregory Z. Gutin, Adrian Johnstone, Elizabeth Scott, Anders Yeo:
Better Than Optimal: Fast Identification of Custom Instruction Candidates. CSE (2) 2009: 17-24 - [c15]Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon:
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. IWPEC 2009: 222-233 - [c14]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245 - [c13]Gregory Z. Gutin, Daniel Karapetyan:
A Memetic Algorithm for the Multidimensional Assignment Problem. SLS 2009: 125-129 - [r2]Gregory Z. Gutin:
Domination Analysis in Combinatorial Optimization. Encyclopedia of Optimization 2009: 792-802 - [r1]Gregory Z. Gutin:
Traveling Salesman Problem. Encyclopedia of Optimization 2009: 3935-3944 - [i33]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem. CoRR abs/0903.0938 (2009) - [i32]Gregory Z. Gutin, Daniel Karapetyan:
A Memetic Algorithm for the Multidimensional Assignment Problem. CoRR abs/0906.0862 (2009) - [i31]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound. CoRR abs/0906.1356 (2009) - [i30]Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon:
FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. CoRR abs/0906.1359 (2009) - [i29]Daniel Karapetyan, Gregory Z. Gutin, Boris Goldengorin:
Empirical evaluation of construction heuristics for the multidimensional assignment problem. CoRR abs/0906.2960 (2009) - [i28]Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. CoRR abs/0907.4488 (2009) - [i27]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-2-SAT Above a Tight Lower Bound. CoRR abs/0907.4573 (2009) - [i26]Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. CoRR abs/0907.5427 (2009) - [i25]Robert Crowston, Gregory Z. Gutin, Mark Jones:
Note on Max Lin-2 above Average. CoRR abs/0911.5384 (2009) - 2008
- [j79]Gregory Z. Gutin:
Note on edge-colored graphs and digraphs without properly colored cycles. Australas. J Comb. 42: 137-140 (2008) - [j78]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008) - [j77]Gregory Z. Gutin, Anders Yeo:
Some Parameterized Problems On Digraphs. Comput. J. 51(3): 363-371 (2008) - [j76]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum cost homomorphisms to semicomplete multipartite digraphs. Discret. Appl. Math. 156(12): 2429-2435 (2008) - [j75]Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008) - [j74]Gregory Z. Gutin, Boris Goldengorin, Jing Huang:
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems. J. Heuristics 14(2): 169-181 (2008) - [j73]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discret. Math. 22(4): 1624-1639 (2008) - [c12]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM 2008: 224-234 - [c11]Gregory Z. Gutin, Igor Razgon, Eun Jung Kim:
Minimum Leaf Out-Branching Problems. AAIM 2008: 235-246 - [c10]Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo:
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. WG 2008: 206-217 - [i24]Gregory Z. Gutin, Eun Jung Kim, Igor Razgon:
Minimum Leaf Out-Branching Problems. CoRR abs/0801.1979 (2008) - [i23]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Spanning directed trees with many leaves. CoRR abs/0803.0701 (2008) - [i22]Gregory Z. Gutin, Daniel Karapetyan:
A Memetic Algorithm for the Generalized Traveling Salesman Problem. CoRR abs/0804.0722 (2008) - [i21]Gregory Z. Gutin, Daniel Karapetyan:
Generalized Traveling Salesman Problem Reduction Algorithms. CoRR abs/0804.0735 (2008) - [i20]Gregory Z. Gutin, Eun Jung Kim:
Properly Coloured Cycles and Paths: Results and Open Problems. CoRR abs/0805.3901 (2008) - [i19]Gregory Z. Gutin, Daniel Karapetyan:
Local Search Heuristics For The Multidimensional Assignment Problem. CoRR abs/0806.3258 (2008) - [i18]Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim:
On Complexity of Minimum Leaf Out-branching Problem. CoRR abs/0808.0980 (2008) - [i17]Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo:
FPT Algorithms and Kernels for the Directed $k$-Leaf Problem. CoRR abs/0810.4946 (2008) - 2007
- [j72]Gregory Z. Gutin, Anders Yeo:
The Greedy Algorithm for the Symmetric TSP. Algorithmic Oper. Res. 2(1) (2007) - [j71]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007) - [c9]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327 - [c8]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362 - [p3]Gregory Z. Gutin, Daniel Karapetyan, Natalio Krasnogor:
Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. NICSO 2007: 199-210 - [e1]Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege:
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007. Dagstuhl Seminar Proceedings 07281, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i16]Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege:
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - [i15]Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege:
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - [i14]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems. CoRR abs/0707.1095 (2007) - [i13]Gregory Z. Gutin:
Note on edge-colored graphs and digraphs without properly colored cycles. CoRR abs/0707.4580 (2007) - [i12]Gregory Z. Gutin, Eun Jung Kim:
On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments. CoRR abs/0708.2544 (2007) - [i11]Eun Jung Kim, Gregory Z. Gutin:
Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops. CoRR abs/0708.2545 (2007) - [i10]Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs. CoRR abs/0712.0804 (2007) - [i9]Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo:
Algorithms for Generating Convex Sets in Acyclic Digraphs. CoRR abs/0712.2661 (2007) - [i8]Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin:
Convex sets in acyclic digraphs. CoRR abs/0712.2678 (2007) - [i7]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems. CoRR abs/cs/0702049 (2007) - 2006
- [j70]Gregory Z. Gutin, Arash Rafiey:
Multipartite tournaments with small number of cycles. Australas. J Comb. 34: 17-22 (2006) - [j69]Gregory Z. Gutin, Angela Koller, Anders Yeo:
Note on Upper Bounds for TSP Domination Number. Algorithmic Oper. Res. 1(1) (2006) - [j68]Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
On-line bin Packing with Two Item Sizes. Algorithmic Oper. Res. 1(2) (2006) - [j67]Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso:
Level of repair analysis and minimum cost homomorphisms of graphs. Discret. Appl. Math. 154(6): 881-889 (2006) - [j66]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum cost and list homomorphisms to semicomplete digraphs. Discret. Appl. Math. 154(6): 890-897 (2006) - [j65]Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
Domination analysis for minimum multiprocessor scheduling. Discret. Appl. Math. 154(18): 2613-2619 (2006) - [j64]Gregory Z. Gutin, Abraham P. Punnen:
The traveling salesman problem. Discret. Optim. 3(1): 1 (2006) - [j63]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discret. Optim. 3(1): 86-94 (2006) - [j62]Gregory Z. Gutin, Arash Rafiey, Simone Severini, Anders Yeo:
Hamilton cycles in digraphs of unitary matrices. Discret. Math. 306(24): 3315-3320 (2006) - [j61]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
On n-partite Tournaments with Unique n-cycle. Graphs Comb. 22(2): 241-249 (2006) - [j60]Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Z. Gutin, Tommy R. Jensen, Arash Rafiey:
Characterization of edge-colored complete graphs with properly colored Hamilton paths. J. Graph Theory 53(4): 333-346 (2006) - [c7]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367 - [c6]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71 - [c5]Gregory Z. Gutin, Boris Goldengorin, Jing Huang:
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. WAOA 2006: 214-225 - [i6]Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. CoRR abs/cs/0602038 (2006) - [i5]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. CoRR abs/cs/0604095 (2006) - [i4]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. CoRR abs/cs/0608101 (2006) - 2005
- [j59]Gregory Z. Gutin, Nick S. Jones, Arash Rafiey, Simone Severini, Anders Yeo:
Mediated digraphs and quantum nonlocality. Discret. Appl. Math. 150(1-3): 41-50 (2005) - [j58]Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
Batched bin packing. Discret. Optim. 2(1): 71-82 (2005) - [j57]Gregory Z. Gutin, Fred W. Glover:
Further Extension of the TSP Assign Neighborhood. J. Heuristics 11(5-6): 501-505 (2005) - [j56]David Blokh, Gregory Z. Gutin, Anders Yeo:
A problem of finding an acceptable variant in generalized project networks. Adv. Decis. Sci. 9(2): 75-81 (2005) - [j55]Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo:
Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005) - [c4]Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso:
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. AAIM 2005: 427-439 - [c3]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD 2005: 81-94 - [c2]Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo:
Optimal On-Line Bin Packing with Two Item Sizes. ACiD 2005: 95-103 - [i3]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost and List Homomorphisms to Semicomplete Digraphs. CoRR abs/cs/0507017 (2005) - [i2]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. CoRR abs/cs/0509091 (2005) - [i1]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CoRR abs/cs/0511030 (2005) - 2004
- [j54]Nalan Gülpinar, Gregory Z. Gutin, Gautam Mitra, Alexei E. Zverovitch:
Extracting pure network submatrices in linear programs using signed graphs. Discret. Appl. Math. 137(3): 359-372 (2004) - [j53]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
When the greedy algorithm fails. Discret. Optim. 1(2): 121-127 (2004) - [j52]Gregory Z. Gutin, Arash Rafiey:
When n-cycles in n-partite tournaments are longest cycles. Discret. Math. 289(1-3): 163-168 (2004) - [j51]Noga Alon, Gregory Z. Gutin, Michael Krivelevich:
Algorithms with large domination ratio. J. Algorithms 50(1): 118-131 (2004) - [j50]Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo:
On the number of quasi-kernels in digraphs. J. Graph Theory 46(1): 48-56 (2004) - 2003
- [j49]Gregory Z. Gutin, Anders Yeo:
Assignment problem based algorithms are impractical for the generalized TSP. Australas. J Comb. 27: 149-154 (2003) - [j48]Gregory Z. Gutin, Alek Vainshtein, Anders Yeo:
Domination analysis of combinatorial optimization problems. Discret. Appl. Math. 129(2-3): 513-520 (2003) - [j47]Gregory Z. Gutin, Anders Yeo:
Upper bounds on ATSP neighborhood size. Discret. Appl. Math. 129(2-3): 533-538 (2003) - [j46]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. J. Graph Theory 44(3): 193-207 (2003) - [j45]David Ben-Arieh, Gregory Z. Gutin, M. Penn, Anders Yeo, Alexey Zverovich:
Transformations of generalized ATSP into ATSP. Oper. Res. Lett. 31(3): 357-365 (2003) - [p2]Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin:
Connectivity and Traversability. Handbook of Graph Theory 2003: 193-339 - [p1]Zsolt Tuza, Gregory Z. Gutin, Michael Plurnmer, Alan Tucker, Edmund Kieran Burke, Dominique de Werra, Jeffrey H. Kingston:
Colorings and Related Topics. Handbook of Graph Theory 2003: 340-483 - 2002
- [b1]Jørgen Bang-Jensen, Gregory Z. Gutin:
Digraphs - theory, algorithms and applications. Springer 2002, ISBN 978-1-85233-611-0, pp. I-XXII, 1-754 - [j44]Gregory Z. Gutin, Anders Yeo, Alexey Zverovich:
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discret. Appl. Math. 117(1-3): 81-86 (2002) - [j43]Gregory Z. Gutin, Anders Yeo:
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. Discret. Appl. Math. 119(1-2): 107-116 (2002) - [j42]Gregory Z. Gutin, Anders Yeo:
Orientations of digraphs almost preserving diameter. Discret. Appl. Math. 121(1-3): 129-138 (2002) - [j41]Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo:
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs Comb. 18(3): 499-506 (2002) - [j40]Gregory Z. Gutin, Anders Yeo:
Anti-matroids. Oper. Res. Lett. 30(2): 97-99 (2002) - 2001
- [j39]Gregory Z. Gutin, Anders Yeo:
Remarks on hamiltonian digraphs. Australas. J Comb. 23: 115-118 (2001) - [j38]Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich:
Construction heuristics for the asymmetric TSP. Eur. J. Oper. Res. 129(3): 555-568 (2001) - [j37]Gregory Z. Gutin, Anders Yeo:
Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. Graphs Comb. 17(3): 473-477 (2001) - [j36]Gregory Z. Gutin, Anders Yeo:
TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Lett. 28(3): 107-111 (2001) - 2000
- [j35]Nalan Gülpinar, Gregory Z. Gutin, Gautam Mitra, István Maros:
Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms. Comput. Optim. Appl. 15(3): 235-247 (2000) - [j34]Gregory Z. Gutin, Alexandr V. Kostochka, Bjarne Toft:
On the Hajo's number of graphs. Discret. Math. 213(1-3): 153-161 (2000) - [j33]Gregory Z. Gutin, Meike Tewes, Anders Yeo:
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. Discret. Math. 222(1-3): 269-274 (2000) - [j32]Gregory Z. Gutin, Anders Yeo:
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian. J. Comb. Theory B 78(2): 232-242 (2000) - [j31]Gregory Z. Gutin, Anders Yeo:
Kings in semicomplete multipartite digraphs. J. Graph Theory 33(3): 177-183 (2000)
1990 – 1999
- 1999
- [j30]Gregory Z. Gutin:
Connected (g, f)-factors and supereulerian digraphs. Ars Comb. 54 (1999) - [j29]Gregory Z. Gutin:
Exponential neighbourhood local search for the traveling salesman problem. Comput. Oper. Res. 26(4): 313-320 (1999) - [j28]Gregory Z. Gutin, Anders Yeo:
Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Comput. Oper. Res. 26(4): 321-327 (1999) - [j27]Jørgen Bang-Jensen, Gregory Z. Gutin:
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. Discret. Appl. Math. 95(1-3): 41-60 (1999) - [c1]Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich:
Construction Heuristics and Domination Analysis for the Asymmetric TSP. WAE 1999: 85-94 - 1998
- [j26]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. Discret. Appl. Math. 82(1-3): 247-250 (1998) - [j25]Gregory Z. Gutin:
A note on the cardinality of certain classes of unlabeled multipartite tournaments. Discret. Math. 186(1-3): 277-280 (1998) - [j24]Jørgen Bang-Jensen, Gregory Z. Gutin:
Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discret. Math. 188(1-3): 61-72 (1998) - [j23]Gregory Z. Gutin, Vadim E. Zverovich:
Upper domination and upper irredundance perfect graphs. Discret. Math. 190(1-3): 95-105 (1998) - [j22]Gregory Z. Gutin, Benny Sudakov, Anders Yeo:
Note on alternating directed cycles. Discret. Math. 191(1-3): 101-107 (1998) - [j21]Jørgen Bang-Jensen, Gregory Z. Gutin:
Generalizations of tournaments: A survey. J. Graph Theory 28(4): 171-202 (1998) - [j20]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. J. Graph Theory 29(2): 111-132 (1998) - 1997
- [j19]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Comb. Probab. Comput. 6(3): 255-261 (1997) - [j18]Jørgen Bang-Jensen, Gregory Z. Gutin:
Vertex heaviest paths and cycles in quasi-transitive digraphs. Discret. Math. 163(1-3): 217-223 (1997) - [j17]Jørgen Bang-Jensen, Gregory Z. Gutin:
Paths and cycles in extended and decomposable digraphs, . Discret. Math. 164(1-3): 5-19 (1997) - [j16]Jørgen Bang-Jensen, Gregory Z. Gutin:
Alternating cycles and paths in edge-coloured multigraphs: A survey. Discret. Math. 165-166: 39-60 (1997) - [j15]Jørgen Bang-Jensen, Yubao Guo, Gregory Z. Gutin, Lutz Volkmann:
A classification of locally semicomplete digraphs. Discret. Math. 167-168: 101-114 (1997) - [j14]Noga Alon, Gregory Z. Gutin:
Properly colored Hamilton cycles in edge-colored complete graphs. Random Struct. Algorithms 11(2): 179-186 (1997) - 1996
- [j13]David Blokh, Gregory Z. Gutin:
An approximate algorithm for combinatorial optimization problems with two parameters. Australas. J Comb. 14: 157-164 (1996) - [j12]Gregory Z. Gutin, Anders Yeo:
Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discret. Appl. Math. 69(1-2): 75-82 (1996) - [j11]Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang:
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Discret. Math. 161(1-3): 1-12 (1996) - [j10]Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
On k-strong and k-cyclic digraphs. Discret. Math. 162(1-3): 1-11 (1996) - [j9]Jørgen Bang-Jensen, Gregory Z. Gutin, Hao Li:
Sufficient conditions for a digraph to be Hamiltonian. J. Graph Theory 22(2): 181-187 (1996) - 1995
- [j8]David Blokh, Gregory Z. Gutin:
Maximizing Traveling Salesman Problem for Special Matrices. Discret. Appl. Math. 56(1): 83-86 (1995) - [j7]Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang:
Weakly Hamiltonian-connected ordinary multipartite tournaments. Discret. Math. 138(1-3): 63-74 (1995) - [j6]Gregory Z. Gutin:
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. Discret. Math. 141(1-3): 153-162 (1995) - [j5]Gregory Z. Gutin:
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey. J. Graph Theory 19(4): 481-505 (1995) - 1994
- [j4]Gregory Z. Gutin:
Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs. Australas. J Comb. 10: 231-236 (1994) - [j3]Gregory Z. Gutin:
Minimizing and maximizing the diameter in orientations of graphs. Graphs Comb. 10(2-4): 225-230 (1994) - 1993
- [j2]Gregory Z. Gutin:
On Cycles in Multipartite Tournaments. J. Comb. Theory B 58(2): 319-321 (1993) - [j1]Gregory Z. Gutin:
Finding a Longest Path in a Complete Multipartite Digraph. SIAM J. Discret. Math. 6(2): 270-273 (1993)
Coauthor Index
Andrei V. Gagarin
aka: Andrei Gagarin
aka: Andrei Gagarin
[j145] [j144] [j143] [j140] [j138] [j136] [j133] [j132] [j129] [j128] [i89] [i85] [c46] [c45] [c44] [c42] [c41] [i80] [i79] [i78] [i76] [i74] [j126] [j124] [j123] [j122] [c39] [c38] [c36] [i72] [i71] [i68] [i67] [i66] [j121] [j119] [j117] [j116] [c35] [c34] [i63] [i61] [j113] [j109] [j106] [c30] [c29] [c28] [c27] [i58] [i55] [i54] [i53] [i52] [i51] [i50] [j98] [c26] [c25] [i49] [i48] [i45] [i44] [i42] [j95] [c23] [c20] [i41] [i38] [i34] [i25]
[j191] [j188] [j187] [i137] [i134] [i133] [i132] [j186] [j185] [j184] [j183] [j180] [j179] [c67] [i131] [i129] [i128] [i127] [j175] [j169] [i124] [i122] [c63] [i121] [i119] [i114] [j156] [c61] [c59] [i112] [i110] [j149] [i107] [i100] [j144] [j143] [j139] [j137] [p4] [j136] [j133] [i89] [i76] [i75] [i74] [j126] [j122] [j121] [j120] [j119] [j118] [j115] [j114] [i62] [i60] [j113] [j112] [j111] [j109] [j108] [j107] [c32] [c31] [c28] [c27] [i57] [i56] [i54] [i52] [i51] [j105] [j100] [j98] [c26] [c25] [i49] [i48] [i47] [i46] [i45] [i43] [i42] [j94] [j93] [j92] [j91] [c24] [c23] [c22] [c21] [i38] [i37] [i36] [i34] [j88] [j85] [j84] [c17] [c16] [c14] [i33] [i31] [i27] [i26] [j78] [j77] [j76] [j75] [j73] [c12] [c10] [i17] [j72] [j71] [i9] [j69] [j68] [j67] [j66] [j65] [j63] [j62] [j61] [c7] [c6] [i6] [i5] [i4] [j59] [j58] [j56] [j55] [c4] [c3] [c2] [i3] [i2] [i1] [j53] [j50] [j49] [j48] [j47] [j46] [j45] [j44] [j43] [j42] [j41] [j40] [j39] [j38] [j37] [j36] [j33] [j32] [j31] [j28] [c1] [j26] [j22] [j20] [j19] [j12] [j10]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
