Gregory Z. Gutin
Orcid: 0000-0002-2377-0417Affiliations:
- Royal Holloway, University of London, UK
According to our database1,
Gregory Z. Gutin
authored at least 290 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
J. Graph Theory, March, 2024
CoRR, 2024
2023
Discret. Appl. Math., December, 2023
Discret. Appl. Math., June, 2023
<i>p</i>-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms.
J. Comput. Syst. Sci., May, 2023
Theor. Comput. Sci., April, 2023
IEEE Trans. Dependable Secur. Comput., 2023
An LP-based approximation algorithm for the generalized traveling salesman path problem.
Theor. Comput. Sci., 2023
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs.
J. Comb. Optim., 2023
CoRR, 2023
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems.
CoRR, 2023
Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism.
CoRR, 2023
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
2022
IEEE Trans. Inf. Theory, 2022
ACM Trans. Priv. Secur., 2022
Theor. Comput. Sci., 2022
J. Comb. Optim., 2022
Discret. Math., 2022
CoRR, 2022
Proceedings of the SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies, New York, NY, USA, June 8, 2022
2021
Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis.
ACM Trans. Priv. Secur., 2021
<i>r</i>-Simple <i>k</i>-Path and Related Problems Parameterized by <i>k</i>/<i>r</i>.
ACM Trans. Algorithms, 2021
SIAM J. Discret. Math., 2021
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments.
J. Graph Theory, 2021
Proceedings of the SACMAT '21: The 26th ACM Symposium on Access Control Models and Technologies, 2021
A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem.
Proceedings of the Combinatorial Optimization and Applications, 2021
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings.
Proceedings of the Combinatorial Optimization and Applications, 2021
2020
IEEE Trans. Dependable Secur. Comput., 2020
J. Graph Theory, 2020
J. Graph Theory, 2020
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs.
Discret. Math., 2020
CoRR, 2020
Proceedings of the 25th ACM Symposium on Access Control Models and Technologies, 2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
2019
J. Comput. Syst. Sci., 2019
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints.
J. Artif. Intell. Res., 2019
Discret. Math., 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 24th ACM Symposium on Access Control Models and Technologies, 2019
Proceedings of the First International Conference on Graph Computing, 2019
2018
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials.
J. Comput. Syst. Sci., 2018
CoRR, 2018
Proceedings of the Classes of Directed Graphs., 2018
2017
J. Comput. Syst. Sci., 2017
J. Comput. Syst. Sci., 2017
J. Comput. Secur., 2017
Cryptographic enforcement of information flow policies without public information via tree partitions.
J. Comput. Secur., 2017
Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms.
CoRR, 2017
CoRR, 2017
Algorithmica, 2017
Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
2016
Encyclopedia of Algorithms, 2016
Encyclopedia of Algorithms, 2016
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations.
ACM Trans. Priv. Secur., 2016
SIAM J. Discret. Math., 2016
SIAM J. Discret. Math., 2016
Algorithms for the workflow satisfiability problem engineered for counting constraints.
J. Comb. Optim., 2016
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis.
Inf. Process. Lett., 2016
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.
Inf. Process. Lett., 2016
CoRR, 2016
Algorithmica, 2016
Proceedings of the 21st ACM on Symposium on Access Control Models and Technologies, 2016
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
Algorithmica, 2015
Proceedings of the 20th ACM Symposium on Access Control Models and Technologies, 2015
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015
Proceedings of the Algorithms - ESA 2015, 2015
Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies.
Proceedings of the Data and Applications Security and Privacy XXIX, 2015
Proceedings of the Applied Cryptography and Network Security, 2015
2014
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
J. Comput. Syst. Sci., 2014
J. Artif. Intell. Res., 2014
Algorithmica, 2014
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
2013
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem.
ACM Trans. Inf. Syst. Secur., 2013
Theor. Comput. Sci., 2013
Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2).
NII Shonan Meet. Rep., 2013
Theory Comput. Syst., 2013
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$.
Theory Comput. Syst., 2013
Inf. Process. Lett., 2013
Inf. Comput., 2013
Proceedings of the 18th ACM Symposium on Access Control Models and Technologies, 2013
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013
2012
SIAM J. Discret. Math., 2012
J. Discrete Algorithms, 2012
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables.
J. Comput. Syst. Sci., 2012
Inf. Process. Lett., 2012
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem.
Eur. J. Oper. Res., 2012
Discret. Appl. Math., 2012
Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances
CoRR, 2012
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.
Algorithmica, 2012
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.
Algorithmica, 2012
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
Proceedings of the ACM Conference on Computer and Communications Security, 2012
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012
2011
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems.
Theor. Comput. Sci., 2011
Theory Comput. Syst., 2011
J. Comput. Syst. Sci., 2011
J. Heuristics, 2011
Eur. J. Oper. Res., 2011
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem.
Evol. Comput., 2011
Discret. Optim., 2011
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$
CoRR, 2011
CoRR, 2011
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011
2010
Nat. Comput., 2010
J. Comput. Syst. Sci., 2010
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.
J. Comput. Syst. Sci., 2010
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops.
Discret. Appl. Math., 2010
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels
CoRR, 2010
Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation
CoRR, 2010
CoRR, 2010
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs.
Australas. J Comb., 2010
Systems of Linear Equations over F<sub>2</sub> and Problems Parameterized above Average.
Proceedings of the Algorithm Theory, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.
Proceedings of the Algorithms, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
A selection of useful theoretical tools for the design and analysis of optimization heuristics.
Memetic Comput., 2009
J. Discrete Algorithms, 2009
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems.
Electron. Notes Discret. Math., 2009
Discret. Appl. Math., 2009
Empirical evaluation of construction heuristics for the multidimensional assignment problem
CoRR, 2009
CoRR, 2009
CoRR, 2009
Algorithmic Oper. Res., 2009
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009
Algorithm for Finding <i>k</i>-Vertex Out-trees and Its Application to <i>k</i>-Internal Out-branching Problem.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009
Proceedings of the Graph Theory, 2009
Digraphs - Theory, Algorithms and Applications, Second Edition.
Springer Monographs in Mathematics, Springer, ISBN: 978-1-84800-997-4, 2009
2008
SIAM J. Discret. Math., 2008
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems.
J. Heuristics, 2008
Discret. Appl. Math., 2008
Australas. J Comb., 2008
Proceedings of the Algorithmic Aspects in Information and Management, 2008
2007
Proceedings of the Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), 2007
Theory Comput. Syst., 2007
CoRR, 2007
On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments
CoRR, 2007
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007
2006
Characterization of edge-colored complete graphs with properly colored Hamilton paths.
J. Graph Theory, 2006
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs.
Discret. Optim., 2006
Discret. Appl. Math., 2006
Discret. Appl. Math., 2006
Discret. Appl. Math., 2006
2005
Adv. Decis. Sci., 2005
Optimal On-Line Bin Packing with Two Item Sizes.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005
2004
Discret. Math., 2004
Discret. Appl. Math., 2004
2003
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete.
J. Graph Theory, 2003
Discret. Appl. Math., 2003
Australas. J Comb., 2003
2002
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.
Graphs Comb., 2002
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP.
Discret. Appl. Math., 2002
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number.
Discret. Appl. Math., 2002
Digraphs - theory, algorithms and applications.
Springer, ISBN: 978-1-85233-611-0, 2002
2001
Oper. Res. Lett., 2001
Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs.
Graphs Comb., 2001
2000
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian.
J. Comb. Theory, Ser. B, 2000
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.
Discret. Math., 2000
Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms.
Comput. Optim. Appl., 2000
1999
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.
Discret. Appl. Math., 1999
Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour.
Comput. Oper. Res., 1999
Comput. Oper. Res., 1999
Connected (g, f)-factors and supereulerian digraphs.
Ars Comb., 1999
Proceedings of the Algorithm Engineering, 1999
1998
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs.
J. Graph Theory, 1998
Discret. Math., 1998
Discret. Math., 1998
Discret. Appl. Math., 1998
1997
Random Struct. Algorithms, 1997
Discret. Math., 1997
Discret. Math., 1997
Comb. Probab. Comput., 1997
1996
Discret. Math., 1996
Discret. Appl. Math., 1996
An approximate algorithm for combinatorial optimization problems with two parameters.
Australas. J Comb., 1996
1995
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey.
J. Graph Theory, 1995
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs.
Discret. Math., 1995
Discret. Appl. Math., 1995
1994
Australas. J Comb., 1994
1993
SIAM J. Discret. Math., 1993