


Остановите войну!
for scientists:


default search action
Gregory 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
- 2023
- [j184]Gregory Z. Gutin
, Philip R. Neary, Anders Yeo
:
Exact capacitated domination: On the computational complexity of uniqueness. Discret. Appl. Math. 332: 155-169 (2023) - [j183]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo
, Yacong Zhou:
Results on the small quasi-kernel conjecture. Discret. Math. 346(7): 113435 (2023) - [j182]Gregory Z. Gutin, Philip R. Neary, Anders Yeo
:
Unique stable matchings. Games Econ. Behav. 141: 529-547 (2023) - [j181]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) - [j180]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) - [j179]Gregory Z. Gutin, Anders Yeo:
Lower Bounds for Maximum Weighted Cut. SIAM J. Discret. Math. 37(2): 1142-1161 (2023) - [j178]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) - [j177]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) - [j176]Bin Sheng, Gregory Z. Gutin:
Fixed parameterized algorithms for generalized feedback vertex set problems. Theor. Comput. Sci. 953: 113798 (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 - [i129]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. CoRR abs/2304.10202 (2023) - [i128]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) - [i127]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) - [i126]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) - 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]