Professor Gregory Gutin

  1. 2020
  2. Forthcoming

    Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions

    Bang-Jensen, J., Gutin, G. & Yeo, A., 28 Mar 2020, (Accepted/In press) In : Journal of Graph Theory.

    Research output: Contribution to journalArticle

  3. Forthcoming

    Proper orientation number of triangle-free bridgeless outerplanar graphs

    Ai, J., Gerke, S., Gutin, G., Shi, Y. & Taoqiu, Z., 18 Mar 2020, (Accepted/In press) In : Journal of Graph Theory.

    Research output: Contribution to journalArticle

  4. Published

    Parameterized Pre-Coloring Extension and List Coloring Problems

    Gutin, G., Majumdar, D., Ordyniak, S. & Wahlström, M., 27 Feb 2020, LIPIcs, Proceedings of STACS 2020. Vol. 154. p. 1-18 18 p. 15

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  5. Forthcoming

    Algorithms for Workflow Satisfiability Problem with User-independent Constraints

    Gutin, G. & Karapetyan, D., 9 Feb 2020, (Accepted/In press) In : International Journal of Graph Computing.

    Research output: Contribution to journalArticle

  6. E-pub ahead of print

    Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

    Gutin, G. & Sun, Y., 16 Jan 2020, In : Discrete Mathematics. 343, 5, p. 1-4 4 p., 111816.

    Research output: Contribution to journalArticle

  7. 2019
  8. Published

    Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints

    Karapetyan, D., Parkes, A., Gutin, G. & Gagarin, A., 5 Sep 2019, In : Journal of Artificial Intelligence Research. 66, p. 1-38 38 p.

    Research output: Contribution to journalArticle

  9. E-pub ahead of print

    Parameterized Resiliency Problems

    Crampton, J., Gutin, G., Koutecky, M. & Watrigant, R., 7 Aug 2019, In : Theoretical Computer Science. p. 1-14 14 p.

    Research output: Contribution to journalArticle

  10. Published

    Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs

    Sun, Y., Gutin, G. & Ai, J., Aug 2019, In : Discrete Mathematics. 342, 8, p. 2297-2305 9 p.

    Research output: Contribution to journalArticle

  11. Published

    Clustering without replication in combinatorial circuits

    Donovan, Z., Gutin, G., Mkrtchyan, V. & Subramani, K., Aug 2019, In : Journal of Combinatorial Optimization. 38, 2, p. 481-501 21 p.

    Research output: Contribution to journalArticle

  12. Published

    Bounded and Approximate Strong Satisfiability in Workflows

    Crampton, J., Gutin, G. & Majumdar, D., 28 May 2019, Proceedings of ACM SACMAT 2019. ACM, p. 179-184 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  13. Published

    Path-contractions, edge deletions and connectivity preservation

    Gutin, Z., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., May 2019, In : Journal of Computer and System Sciences. 101, p. 1-20 20 p.

    Research output: Contribution to journalArticle

  14. E-pub ahead of print

    Alternative parameterizations of Metric Dimension

    Gutin, G., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 25 Jan 2019, In : Theoretical Computer Science. p. 1-11 11 p.

    Research output: Contribution to journalArticle

  15. Published

    On r-Simple k-Path and Related Problems Parameterized by k/r

    Gutin, G., Wahlstrom, M. & Zehavi, M., Jan 2019, Proceedings of SODA 2019. p. 1750-1769 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  16. 2018
  17. E-pub ahead of print

    Strong subgraph k‐connectivity

    Sun, Y., Gutin, G., Yeo, A. & Zhang, X., 28 Nov 2018, In : Journal of Graph Theory. p. 1-14 14 p.

    Research output: Contribution to journalArticle

  18. E-pub ahead of print

    The Authorization Policy Existence Problem

    Berge, P., Crampton, J., Gutin, G. & Watrigant, R., 28 Nov 2018, In : IEEE Transactions on Dependable and Secure Computing. p. 1-12 12 p.

    Research output: Contribution to journalArticle

  19. Published

    Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials

    Gutin, G., Reidl, F., Wahlstrom, M. & Zehavi, M., Aug 2018, In : Journal of Computer and System Sciences. 95, p. 69-85 17 p.

    Research output: Contribution to journalArticle

  20. Published

    k-distinct in- and out-branchings in digraphs

    Gutin, G., Reidl, F. & Wahlstrom, M., Aug 2018, In : Journal of Computer and System Sciences. 95, p. 86-97 13 p.

    Research output: Contribution to journalArticle

  21. 2017
  22. Published

    Path-Contractions, Edge Deletions and Connectivity Preservation

    Gutin, G., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 3 Sep 2017, The 25th Annual European Symposium on Algorithms (ESA 2017). p. 1-13 13 p. 47. (LIPICS; vol. 87).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  23. Published

    Parameterized and Approximation Algorithms for the Load Coloring Problem

    Barbero, F., Gutin, G., Jones, M. & Sheng, B., Sep 2017, In : Algorithmica. 79, 1, p. 211–229 19 p.

    Research output: Contribution to journalArticle

  24. Published

    Cryptographic enforcement of information flow policies without public information via tree partitions

    Crampton, J., Farley, N., Gutin, G., Jones, M. & Poettering, B., 24 Aug 2017, In : Journal of Computer Security. 25, 6, p. 511-535 25 p.

    Research output: Contribution to journalArticle

  25. Published

    On the Satisfiability of Workflows with Release Points

    Crampton, J., Gutin, G. & Watrigant, R., 7 Jun 2017, Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM, p. 207-217 11 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  26. E-pub ahead of print

    Parameterized Resiliency Problems via Integer Linear Programming

    Crampton, J., Gutin, G., Koutecky, M. & Watrigant, R., 14 Apr 2017, CIAC 2017, 10th International Conference on Algorithms and Complexity May 26, 2017 - May 28, 2017. Springer, Vol. 10236. p. 164-176 13 p. (Lecture Notes in Computer Science; vol. 10236).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  27. Published

    Odd properly colored cycles in edge-colored graphs

    Gutin, G., Sheng, B. & Wahlstrom, M., Apr 2017, In : Discrete Mathematics. 340, 4, p. 817–821 5 p.

    Research output: Contribution to journalArticle

  28. Published

    The bi-objective workflow satisfiability problem and workflow resiliency

    Crampton, J., Gutin, G., Karapetyan, D. & Watrigant, R., 16 Mar 2017, In : Journal of Computer Security. 25, 1, p. 83-115 33 p.

    Research output: Contribution to journalArticle

  29. Published

    Parameterized complexity of the k-arc Chinese Postman Problem

    Gutin, G., Jones, M. & Sheng, B., Mar 2017, In : Journal of Computer and System Sciences. 84, p. 107–119 13 p.

    Research output: Contribution to journalArticle

  30. Published

    Acyclicity in edge-colored graphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 6 Feb 2017, In : Discrete Mathematics. 340, 2, p. 1-8 8 p.

    Research output: Contribution to journalArticle

  31. Published

    Rural Postman Parameterized by the Number of Components of Required Edges

    Gutin, G., Wahlström, M. & Yeo, A., 1 Feb 2017, In : Journal of Computer and System Sciences. 83, 1, p. 121-131 11 p.

    Research output: Contribution to journalArticle

  32. Published

    Chinese Postman Problem on edge-colored multigraphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 30 Jan 2017, In : Discrete Applied Mathematics. 217, Part 2, p. 196-202 7 p.

    Research output: Contribution to journalArticle

  33. Published

    k-Distinct In- and Out-Branchings in Digraphs

    Gutin, G., Reidl, F. & Wahlstrom, M., 2017, 44th International Colloquium on Automata, Languages, and Programming: ICALP 2017. Dagstuhl, p. 1-13 13 p. (Leibniz International Proceedings in Informatics ; vol. 80).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  34. Published

    Parameterized Complexity of the Workflow Satisfiability Problem

    Cohen, D., Crampton, J., Gutin, Z. & Wahlstrom, M., 2017, Combinatorial Optimization and Graph Algorithms. Fukunaga, T. & Kawarabayashi, K. (eds.). Springer-Verlag, p. 101-120 20 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  35. 2016
  36. Published

    On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations

    Crampton, J., Gagarin, A., Gutin, G., Jones, M. & Wahlstrom, M., 12 Dec 2016, In : ACM Transactions on Privacy and Security. 19, 3, p. 1-29 29 p.

    Research output: Contribution to journalArticle

  37. Published

    Algorithms for the workflow satisfiability problem engineered for counting constraints

    Cohen, D., Crampton, J., Gagarin, A., Gutin, G. & Jones, M., Jul 2016, In : Journal of Combinatorial Optimization. 32, 1, p. 3–24 22 p.

    Research output: Contribution to journalArticle

  38. Published

    Note on Perfect Forests

    Gutin, G., Jul 2016, In : Journal of Graph Theory. 82, 3, p. 233-235 3 p.

    Research output: Contribution to journalArticle

  39. E-pub ahead of print

    Note on Perfect Forests in Digraphs

    Gutin, G. & Yeo, A., 17 Jun 2016, In : Journal of Graph Theory. 85, 2, p. 372-377 6 p.

    Research output: Contribution to journalArticle

  40. Published

    Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths

    Barbero, F., Gutin, G., Jones, M., Sheng, B. & Yeo, A., Jun 2016, In : Information Processing Letters. 116, 6, p. 433–436 4 p.

    Research output: Contribution to journalArticle

  41. Published

    Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis

    Gutin, G. & Wahlstrom, M., Mar 2016, In : Information Processing Letters. 116, 3, p. 223-226 4 p.

    Research output: Contribution to journalArticle

  42. E-pub ahead of print

    Parameterized Traveling Salesman Problem: Beating the Average

    Gutin, G. & Patel, V., 4 Feb 2016, In : SIAM Journal on Discrete Mathematics. 30, 1, p. 220-238 19 p.

    Research output: Contribution to journalArticle

  43. E-pub ahead of print

    Cryptographic Enforcement of Information Flow Policies Without Public Information

    Crampton, J., Farley, N., Gutin, G., Jones, M. & Poettering, B., 9 Jan 2016, 13th International Conference on Applied Cryptography and Network Security (ACNS 2015) . Malkin, T., Kolesnikov, V., Bishop Lewko, A. & Polychronakis, M. (eds.). p. 389-408 20 p. (Lecture Notes in Computer Science; vol. 9092).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  44. Published

    Parameterizations of Test Cover with Bounded Test Sizes

    Crowston, R., Gutin, G., Jones, M., Muciaccia, G. & Yeo, A., Jan 2016, In : Algorithmica. 74, 1, p. 367-384 18 p.

    Research output: Contribution to journalArticle

  45. Published

    A Multivariate Approach for Checking Resiliency in Access Control

    Crampton, J., Gutin, G. & Watrigant, R., 2016, Algorithmic Aspects in Information and Management: AAIM 2016. Springer-Verlag, p. 173-184 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  46. Forthcoming

    Resiliency Policies in Access Control Revisited

    Crampton, J., Gutin, G. & Watrigant, R., 2016, (Accepted/In press) Proceedings of 21st ACM Symposium on Access Control Models and Technologies (SACMAT 2016). ACM

    Research output: Chapter in Book/Report/Conference proceedingChapter

  47. Published

    The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth

    Gutin, G., Jones, M. & Wahlstrom, M., 2016, In : SIAM Journal on Discrete Mathematics. 30, 4, p. 2177-2205 29 p.

    Research output: Contribution to journalArticle

  48. 2015
  49. Published

    Parameterized and Approximation Algorithms for the Load Coloring Problem

    Barbero, F., Gutin, G., Jones, M. & Sheng, B., 9 Nov 2015, 10th International Symposium on Parameterized and Exact Computation. Schloss Dagstuhl –Leibniz Center for Informatics, p. 43-54 12 p. (LIPIcs).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  50. Forthcoming

    On the Workflow Satisfiability Problem with Class-Independent Constraints

    Crampton, J., Gagarin, A., Gutin, G. & Jones, M., 2015, (Accepted/In press) 10th International Symposium on Parameterized and Exact Computation. Schloss Dagstuhl –Leibniz Center for Informatics, (LIPIcs).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  51. Forthcoming

    Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies

    Crampton, J., Farley, N., Gutin, G. & Jones, M., 2015, (Accepted/In press) 29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy: DBSec 2015. Springer-Verlag

    Research output: Chapter in Book/Report/Conference proceedingChapter

  52. Forthcoming

    Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints

    Karapetyan, D., Gagarin, A. & Gutin, G., 2015, (Accepted/In press) FAW 2015, Lecture Notes in Computer Science.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  53. Published

    Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

    Gutin, G., Kratsch, S. & Wahlström, M., 2015, In : Algorithmica. p. 1-20 20 p.

    Research output: Contribution to journalArticle

  54. Published

    Structural Parameterizations of the Mixed Chinese Postman Problem

    Gutin, G., Jones, M. & Wahlstrom, M., 2015, 23rd Europ. Symp. Algorithms (ESA 2015). Springer-Verlag, Vol. 9294. p. 668-679 (Lect. Notes Comput. Sci.).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  55. Published

    Valued Workflow Satisfiability Problem

    Crampton, J., Gutin, G. & Karapetyan, D., 2015, Proceedings of the 20th ACM Symposium on Access Control Models and Technologies. p. 3-13 11 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  56. 2014
  57. Published

    Iterative Plan Construction for the Workflow Satisfiability Problem

    Cohen, D., Crampton, J., Gagarin, A., Gutin, G. & Jones, M., 21 Nov 2014, In : Journal of Artificial Intelligence Research. 51, p. 555-577 23 p.

    Research output: Contribution to journalArticle

Previous 1 2 3 4 Next