1. 2021
  2. E-pub ahead of print

    Parameterized Pre-coloring Extension and List Coloring Problems

    Gutin, G., Majumdar, D., Ordyniak, S. & Wahlström, M., 29 Mar 2021, In: SIAM Journal on Discrete Mathematics. 35, 1, p. 575-596 22 p.

    Research output: Contribution to journalArticlepeer-review

  3. Forthcoming

    Strong subgraph connectivity of digraphs

    Sun, Y. & Gutin, G., 2 Mar 2021, (Accepted/In press) In: Graphs and Combinatorics.

    Research output: Contribution to journalArticlepeer-review

  4. Published

    Proximity and Remoteness in Directed and Undirected Graphs

    Ai, J., Gerke, S., Gutin, G. & Mafunda, S., Mar 2021, In: Discrete Mathematics. 344, 3, 112252.

    Research output: Contribution to journalArticlepeer-review

  5. Forthcoming

    Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis

    Crampton, J., Gutin, G. & Majumdar, D., 13 Feb 2021, (Accepted/In press) In: ACM Transactions on Privacy and Security.

    Research output: Contribution to journalArticlepeer-review

  6. Forthcoming

    The Effect of Social Distancing on the Reach of an Epidemic in Social Network

    Gutin, G., Hirano, T., Hwang, S-H., Neary, P. & Toda, A. A., 28 Jan 2021, (Accepted/In press) In: Journal of Economic Interaction and Coordination.

    Research output: Contribution to journalArticlepeer-review

  7. Published

    Resolution with Counting: Dag-Like Lower Bounds and Different Moduli

    Part, F. & Tzameret, I., 8 Jan 2021, In: Computational Complexity. 30, 1, 2.

    Research output: Contribution to journalArticlepeer-review

  8. Published

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

    Gutin, G., Wahlström, M. & Zehavi, M., Jan 2021, In: ACM Transactions on Algorithms (TALG). 17, 1, p. 1-64 64 p., 10.

    Research output: Contribution to journalArticlepeer-review

  9. Published

    Solving hard cut problems via flow-augmentation

    Kim, E. J., Kratsch, S., Pilipczuk, M. & Wahlström, M., Jan 2021, Proceedings of SODA 2021. 20 p.

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

  10. Forthcoming

    Valued Authorization Policy Existence Problem

    Crampton, J., Eiben, E., Gutin, G., Karapetyan, D. & Majumdar, D., 2021, (Accepted/In press) Proceedings of 26th ACM SACMAT.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  11. 2020
  12. Published

    Component Order Connectivity in Directed Graphs

    Bang-Jensen, J., Eiben, E., Gutin, G., Wahlström, M. & Yeo, A., 4 Dec 2020, Proceedings of IPEC 2020, LIPIcs . Vol. 180. p. 2:1-2:16 16 p.

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

  13. Published

    Randomized contractions meet lean decompositions

    Cygan, M., Komosa, P., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S. & Wahlström, M., Dec 2020, In: ACM Transactions on Algorithms (TALG). 17, 1, 30 p., 6.

    Research output: Contribution to journalArticlepeer-review

  14. Published

    Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search

    Kaznatcheev, A., Cohen, D. & Jeavons, P., 29 Nov 2020, In: Journal of Artificial Intelligence Research. 69, p. 1077-1102 26 p., 12156.

    Research output: Contribution to journalArticlepeer-review

  15. E-pub ahead of print

    Successive shortest paths in complete graphs with random edge weights

    Gerke, S., Mezei, B. & Sorkin, G., 13 Oct 2020, In: Random Structures and Algorithms. 57, 4, p. 1205-1247 43 p.

    Research output: Contribution to journalArticlepeer-review

  16. E-pub ahead of print

    Approximation algorithms for general cluster routing problem

    Zhang, X., Du, D., Gutin, G., Ming, Q. & Sun, J., 27 Aug 2020, Computing and Combinatorics : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings. Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (eds.). Springer, p. 472-483 12 p. (Lecture Notes in Computer Science; vol. 12273).

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

  17. E-pub ahead of print

    Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games

    Gutin, G., Neary, P. & Yeo, A., 27 Aug 2020, p. 360-371. 12 p.

    Research output: Contribution to conferencePaperpeer-review

  18. Published

    Many visits TSP revisited

    Kowalik, L., Li, S., Nadara, W., Smulewicz, M. & Wahlström, M., 26 Aug 2020, ESA 2020. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 173. p. 1-22 22 p. 66

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

  19. Published

    On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems

    Wahlström, M., 29 Jun 2020, ICALP 2020. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 168. p. 1-14 14 p. 101

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

  20. E-pub ahead of print

    Hamiltonicity, Pancyclicity and Full Cycle Extendability in Multipartite Tournaments

    Zhang, Z., Zhang, X., Gutin, G. & Lou, D., 27 Jun 2020, In: Journal of Graph Theory. p. 1-21 21 p.

    Research output: Contribution to journalArticlepeer-review

  21. Published

    Constraint Branching in Workflow Satisfiability Problem

    Gutin, G. & Karapetyan, D., Jun 2020, SACMAT 2020: Symposium on Access Control Models and Technologies. p. 93-103 11 p.

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

  22. Published

    Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?

    Alekseev, Y., Grigoriev, D., Hirsch, E. & Tzameret, I., Jun 2020, STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery (ACM), p. 54-67 14 p.

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

  23. Published

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

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

    Research output: Contribution to journalArticlepeer-review

  24. Published

    Steepest ascent can be exponential in bounded treewidth problems

    Cohen, D. A., Cooper, M. C., Kaznatcheev, A. & Wallace, M., May 2020, In: Operations Research Letters. 48, 3, p. 217-224 8 p.

    Research output: Contribution to journalArticlepeer-review

  25. Published

    Sparsification of SAT and CSP Problems via Tractable Extensions

    Lagerkvist, V. & Wahlstrom, M., 26 Apr 2020, In: ACM Transactions on Computation Theory (TOCT). 12, 2, p. 1-29 29 p., 13.

    Research output: Contribution to journalArticlepeer-review

  26. E-pub ahead of print

    Proper orientation number of triangle-free bridgeless outerplanar graphs

    Ai, J., Gerke, S., Gutin, G., Shi, Y. & Taoqiu, Z., 20 Apr 2020, In: Journal of Graph Theory. p. 1-11 11 p.

    Research output: Contribution to journalArticlepeer-review

  27. E-pub ahead of print

    Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions

    Bang-Jensen, J., Gutin, G. & Yeo, A., 13 Apr 2020, In: Journal of Graph Theory.

    Research output: Contribution to journalArticlepeer-review

  28. Published

    Algorithms for Workflow Satisfiability Problem with User-independent Constraints

    Gutin, G. & Karapetyan, D., Mar 2020, In: International Journal of Graph Computing. 1, 1, p. 25-38 14 p.

    Research output: Contribution to journalArticlepeer-review

  29. Published

    From classical proof theory to P vs. NP: a guide to bounded theories

    Tzameret, I., 14 Jan 2020, 28th EACSL Annual Conference on Computer Science Logic (CSL) 2020, January 13-16, 2020, Barcelona, Spain. : LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2020. .

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

  30. Published

    Resolution with Counting: Dag-Like Lower Bounds and Different Moduli

    Part, F. & Tzameret, I., 13 Jan 2020, 11th Innovations in Theoretical Computer Science Conference (ITCS) 2020, January, 2020, Seattle, WA, USA. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, p. 1-37 37 p.

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

  31. 2019
  32. E-pub ahead of print

    Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search

    Kaznatcheev, A., Cohen, D. & Jeavons, P., 23 Sep 2019, p. 300-316. 17 p.

    Research output: Contribution to conferencePaperpeer-review

  33. Published

    The asymptotic number of prefix normal words

    Balister, P. & Gerke, S., 13 Sep 2019, In: Theoretical Computer Science. 784, p. 75-80 6 p.

    Research output: Contribution to journalArticlepeer-review

  34. 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 journalArticlepeer-review

  35. 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 journalArticlepeer-review

  36. E-pub ahead of print

    Multi-budgeted Directed Cuts

    Kratsch, S., Pilipczuk, M., Li, S., Marx, D. & Wahlström, M., 2 Aug 2019, In: Algorithmica. p. 1-21 21 p.

    Research output: Contribution to journalArticlepeer-review

  37. 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 journalArticlepeer-review

  38. 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

  39. 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 journalArticlepeer-review

  40. Published

    On Singleton Arc Consistency for CSPs Defined by Monotone Patterns

    Carbonnel, C., Cohen, D., Cooper, M. & Živný, S., Apr 2019, In: Algorithmica. 81, 4, p. 1699–1727 29 p.

    Research output: Contribution to journalArticlepeer-review

  41. Published

    Binary constraint satisfaction problems defined by excluded topological minors

    Cohen, D., Cooper, M. C., Jeavons, P. G. & Zivny, S., Feb 2019, In: Infor. and Computation. 264, p. 12-31 20 p.

    Research output: Contribution to journalArticlepeer-review

  42. 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 journalArticlepeer-review

  43. Published

    Multi-Budgeted Directed Cuts

    Kratsch, S., Li, S., Marx, D., Pilipczuk, M. & Wahlstrom, M., 25 Jan 2019, IPEC 2018. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 115. p. 18:1-18:14 14 p. 18. (Leibniz International Proceedings in Informatics (LIPIcs)).

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

  44. Published

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

    Gutin, G., Wahlstrom, M. & Zehavi, M., Jan 2019, Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 1750-1769 20 p.

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

  45. 2018
  46. 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 journalArticlepeer-review

  47. 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 journalArticlepeer-review

  48. Forthcoming

    On Key Assignment Schemes and Cryptographic Enforcement Mechanisms for Information Flow Policies

    Farley, N., 12 Nov 2018, (Accepted/In press) 187 p.

    Research output: ThesisDoctoral Thesis

  49. E-pub ahead of print

    Domain Reduction for Valued Constraints by Generalising Methods from CSP

    Cohen, D., Cooper, M. & Jguirim1, W., 23 Aug 2018, p. 64-80. 17 p.

    Research output: Contribution to conferencePaperpeer-review

  50. 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 journalArticlepeer-review

  51. 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 journalArticlepeer-review

  52. E-pub ahead of print

    Characterizing Propositional Proofs as Non-commutative Formulas

    Li, F., Tzameret, I. & Wang, Z., 19 Jul 2018, In: SIAM Journal on Computing. 47, 4, p. 1424-1462 39 p.

    Research output: Contribution to journalArticlepeer-review

  53. Published

    Directed Multicut is W[1]-hard, Even for Four Terminal Pairs

    Pilipczuk, M. & Wahlstrom, M., 28 Jun 2018, In: ACM Transactions on Computation Theory (TOCT). 10, 3, p. 1-18 18 p., 13.

    Research output: Contribution to journalArticlepeer-review

  54. Forthcoming

    Resolution with Counting: Dag and Tree-like Lower Bounds over Different Moduli

    Part, F. & Tzameret, I., 18 May 2018, (Accepted/In press).

    Research output: Contribution to conferenceAbstract

  55. Published

    Witnessing matrix identities and proof complexity

    Li, F. & Tzameret, I., 26 Feb 2018, In: International Journal of Algebra and Computation. 28, 2, p. 217–256 40 p.

    Research output: Contribution to journalArticlepeer-review

  56. Unpublished

    Complexity, Proofs and Algebra

    Tzameret, I., 2018, (Unpublished)

    Research output: Other contribution

  57. Published

    Parameterized Algorithms for Zero Extension and Metric Labelling Problems

    Reidl, F. & Wahlstrom, M., 2018, ICALP 2018 Track A. Vol. 107. p. 94:1-94:14 14 p. (Leibniz International Proceedings in Informatics ).

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

  58. 2017
  59. E-pub ahead of print

    Binarisation for Valued Constraint Satisfaction Problems

    Cohen, D., Cooper, M., Jeavons, P., Krokhin, A., Powell, R. & Zivny, S., 3 Oct 2017, In: SIAM Journal on Discrete Mathematics. 31, 4, p. 2279-2300 22 p.

    Research output: Contribution to journalArticlepeer-review

  60. Published

    Proof Complexity Lower Bounds from Algebraic Circuit Complexity

    Forbes, M., Shpilka, A., Tzameret, I. & Wigderson, A., 1 Oct 2017, Theory of Computation (ToC) . p. 1 78 p.

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

  61. 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

  62. 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 journalArticlepeer-review

  63. 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 journalArticlepeer-review

  64. Published

    Uniform, integral and efficient proofs for the determinant identities

    Tzameret, I. & Cook, S., 18 Aug 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, Vol. 32. p. 1-12 12 p.

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

  65. Published

    The power of primitive positive definitions with polynomially many variables

    Lagerkvist, V. & Wahlstrom, M., 1 Jul 2017, In: Journal of Logic and Computation. 27, 5, p. 1465–1488 24 p.

    Research output: Contribution to journalArticlepeer-review

  66. Published

    A Framework for the Cryptographic Enforcement of Information Flow Policies

    Alderman, J., Crampton, J. & Farley, N., 7 Jun 2017, Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM, p. 143-154 12 p.

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

  67. Published

    Attribute Expressions, Policy Tables and Attribute-Based Access Control

    Crampton, J. & Williams, C., 7 Jun 2017, SACMAT'17: Proceedings of the 22nd ACM Symposium on Access Control Models and Technologies. ACM Press, p. 79-90 12 p.

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

  68. Published

    On the Satisfiability of Workflows with Release Points

    Crampton, J., Gutin, G. & Watrigant, R., Jun 2017, SACMAT '17 Abstracts: 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

  69. 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

  70. 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 journalArticlepeer-review

  71. E-pub ahead of print

    Canonical Completeness in Lattice-Based Languages for Attribute-Based Access Control

    Crampton, J. & Williams, C., 22 Mar 2017, 7th ACM Conference on Data and Application Security and Privacy. ACM Press, p. 47-58 12 p.

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

  72. 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 journalArticlepeer-review

  73. 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 journalArticlepeer-review

  74. 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 journalArticlepeer-review

  75. Published

    Rural Postman Parameterized by the Number of Components of Required Edges

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

    Research output: Contribution to journalArticlepeer-review

  76. 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 journalArticlepeer-review

  77. Published

    The power of propagation: when GAC is enough

    Cohen, D. & Jeavons, P., Jan 2017, In: Constraints. 22, p. 3-23 21 p.

    Research output: Contribution to journalArticlepeer-review

  78. Published

    Algebraic Proof Complexity: Progress, Frontiers and Challenges

    Pitassi, T. & Tzameret, I., 2017, Electronic Colloquium on Computation Complexity .

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

  79. 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

  80. Published

    Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra

    Lagerkvist, V. & Wahlstrom, M., 2017, Principles and Practice of Constraint Programming: 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings. Springer, p. 157-171 15 p. (Lecture Notes in Computer Science; vol. 10416).

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

  81. Published

    LP-branching algorithms based on biased graphs

    Wahlström, M., 2017, Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 1559-1570 12 p.

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

  82. 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

  83. Published

    Tree-Based Cryptographic Access Control

    Alderman, J., Farley, N. & Crampton, J., 2017, Computer Security – ESORICS 2017 - 22nd European Symposium on Research in Computer Security, Proceedings. Springer-Verlag, Vol. 10492 . p. 47-64 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10492 LNCS).

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

  84. 2016
  85. Published

    Adversarial resilience of matchings in bipartite random graphs

    Balister, P., Gerke, S. & McDowell, A., 2 Dec 2016, In: Journal of Combinatorics. 8, 1, p. 79-92 14 p.

    Research output: Contribution to journalArticlepeer-review

  86. E-pub ahead of print

    The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth

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

    Research output: Contribution to journalArticlepeer-review

  87. Published

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

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

    Research output: Contribution to journalArticlepeer-review

  88. E-pub ahead of print

    Half-integrality, LP-branching, and FPT Algorithms

    Iwata, Y., Wahlstrom, M. & Yoshida, Y., 9 Aug 2016, In: SIAM Journal on Computing. 45, 4, p. 1377–1411 35 p.

    Research output: Contribution to journalArticlepeer-review

  89. Published

    Algebraic Proof Complexity: Progress, Frontiers and Challenges

    Pitassi, T. & Tzameret, I., 8 Jul 2016, ACM SIGLOG News. Immerman, N. (ed.). New York: ACM, Vol. 3. p. 21-43 23 p.

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

  90. E-pub ahead of print

    Inter-ReBAC: Inter-operation of Relationship-Based Access Control Model Instances

    Crampton, J. & Sellwood, J., 2 Jul 2016, Data and Applications Security and Privacy XXX. Springer-Verlag, Vol. 9766. p. 96-105 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9766).

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

  91. 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 journalArticlepeer-review

  92. 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 journalArticlepeer-review

  93. Published

    On Completeness in Languages for Attribute-Based Access Control

    Crampton, J. & Williams, C., 6 Jun 2016, Proceedings of the 21st ACM on Symposium on Access Control Models and Technologies: SACMAT '16. New York: ACM Press, p. 149-160 12 p.

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

  94. Forthcoming

    The Power of Propagation: When GAC is Enough

    Cohen, D. & Jeavons, P., 6 Jun 2016, (Accepted/In press). 15 p.

    Research output: Contribution to conferencePaperpeer-review

  95. 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 journalArticlepeer-review

  96. Published

    Proof complexity lower bounds from algebraic circuit complexity

    Forbes, M., Shpilka, A., Tzameret, I. & Wigderson, A., 19 May 2016, 31st Conference on Computational Complexity (CCC 2016). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 50. p. 1-17 17 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 50).

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

  97. Published

    A Theoretical Framework for Constraint Propagator Triggering

    Cohen, D., Petrie, K. & Jefferson, C., 12 May 2016. 9 p.

    Research output: Contribution to conferencePaperpeer-review

  98. Published

    ARPPM: Administration in the RPPM model

    Crampton, J. & Sellwood, J., 9 Mar 2016, CODASPY 2016 - Proceedings of the 6th ACM Conference on Data and Application Security and Privacy. ACM, p. 219-230 12 p.

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

  99. 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 journalArticlepeer-review

  100. 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 journalArticlepeer-review

  101. Published

    Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

    Kratsch, S., Marx, D. & Wahlstrom, M., 3 Feb 2016, In: ACM Transactions on Computation Theory (TOCT). 8, 1, p. 1-28 28 p.

    Research output: Contribution to journalArticlepeer-review

  102. Published

    Hybrid Publicly Verifiable Computation

    Alderman, J., Janson, C., Crampton, J. & Cid, C., 2 Feb 2016, Topics in Cryptology - CT-RSA 2016. Sako, K. (ed.). Springer, Vol. 9610. p. 147-163 17 p. (Lecture Notes in Computer Science).

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

  103. 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

  104. 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

  105. Published

    Cryptographic Tools for Cloud Environments

    Alderman, J., Crampton, J. & Martin, K., 2016, Guide to Security Assurance for Cloud Computing. Zhu, S. Y., Hill, R. & Trovati, M. (eds.). Springer, Vol. Guide to Security Assurance for Cloud Computing. p. 15-30 16 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  106. Published

    Directed multicut is W[1]-hard, even for four terminal pairs

    Pilipczuk, M. & Wahlstrom, M., 2016, Proceedings of SODA 2016. Krauthgamer, R. (ed.). SIAM, p. 1167-1178 12 p.

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

Previous 1 2 3 4 5 6 Next