1. 2018
  2. 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

  3. Forthcoming

    Strong Subgraph k-connectivity

    Sun, Y., Gutin, G., Yeo, A. & Zhang, X., 5 Nov 2018, (Accepted/In press) In : Journal of Graph Theory.

    Research output: Contribution to journalArticle

  4. Forthcoming

    Path-contractions, edge deletions and connectivity preservation

    Gutin, Z., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 30 Oct 2018, (Accepted/In press) In : Journal of Computer and System Sciences.

    Research output: Contribution to journalArticle

  5. Forthcoming

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

    Gutin, G., Wahlstrom, M. & Zehavi, M., 27 Sep 2018, (Accepted/In press) Proceedings of SODA 2019.

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

  6. E-pub ahead of print

    Binary constraint satisfaction problems defined by excluded topological minors

    Cohen, D., Cooper, M. C., Jeavons, P. G. & Zivny, S., 25 Sep 2018, In : Infor. and Computation. 20 p.

    Research output: Contribution to journalArticle

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

  8. E-pub ahead of print

    On Singleton Arc Consistency for CSPs Defined by Monotone Patterns

    Cohen, D., Cooper, M., Živný, S. & Carbonnel, C., 13 Aug 2018, In : Algorithmica. p. 1-29 29 p.

    Research output: Contribution to journalArticle

  9. 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 journalArticle

  10. Forthcoming

    Multi-budgeted directed cuts

    Kratsch, S., Li, S., Marx, D., Pilipczuk, M. & Wahlstrom, M., 29 Jun 2018, (Accepted/In press) IPEC 2018. 18. (Leibniz International Proceedings in Informatics (LIPIcs))

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

  11. Published

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

    Pilipczuk, M. & Wahlstrom, M., 23 May 2018, In : ACM Transactions on Computation Theory (TOCT). 10, 3, 18 p., 13

    Research output: Contribution to journalArticle

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

  13. E-pub ahead of print

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

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

    Research output: Contribution to journalArticle

  14. E-pub ahead of print

    k-distinct in- and out-branchings in digraphs

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

    Research output: Contribution to journalArticle

  15. 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 journalArticle

  16. Unpublished

    Complexity, Proofs and Algebra

    Tzameret, I., 2018, (Unpublished)

    Research output: Other contribution

  17. Published

    Parameterized Algorithms for Zero Extension and Metric Labelling Problems

    Reidl, F. & Wahlstrom, M., 2018, ICALP 2018 Track A. (Leibniz International Proceedings in Informatics )

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

  18. 2017
  19. Published

    Binarisation for Valued Constraint Satisfaction Problems

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

    Research output: Contribution to journalArticle

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

  21. 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. (LIPICS; vol. 87)

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

  22. Published

    Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra

    Lagerkvist, V. & Wahlstrom, M., 23 Aug 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

  23. 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 journalArticle

  24. Published

    On the Satisfiability of Workflows with Release Points

    Gutin, G., Crampton, J. & Watrigant, R., 21 Jun 2017, Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM

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

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

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

  27. Published

    Uniform, Integral and Efficient Proofs for the Determinant Identities

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

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

  28. Published

    Cryptographic Enforcement of Information Flow Policies without Public Information via Tree Partitions

    Crampton, J., Farley, N., Gutin, G., Jones, M. & Poettering, B., 31 May 2017, In : Journal of Computer Security. p. 1-25 25 p.

    Research output: Contribution to journalArticle

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

  30. Published

    Odd Properly Colored Cycles in Edge-Colored Graphs

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

    Research output: Contribution to journalArticle

  31. E-pub ahead of print

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

    Williams, C. & Crampton, J., 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

  32. 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, p. 83-115 33 p.

    Research output: Contribution to journalArticle

  33. Published

    Parameterized Complexity of the k-Arc Chinese Postman Problem

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

    Research output: Contribution to journalArticle

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

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

  36. 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, p. 196-202 7 p.

    Research output: Contribution to journalArticle

  37. Published

    The power of propagation: when GAC is enough.

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

    Research output: Contribution to journalArticle

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

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

  40. Published

    LP-branching algorithms based on biased graphs

    Wahlström, M., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Vol. PRDA17, p. 1559-1570 12 p. (Proceedings)

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

  41. Submitted

    On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns

    Cohen, D., Carbonnel, C., Cooper, M. & Živný, S., 2017, (Submitted) 27 p.

    Research output: Contribution to conferencePaper

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

  43. 2016
  44. 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 journalArticle

  45. Published

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

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

    Research output: Contribution to journalArticle

  46. E-pub ahead of print

    Parameterized and Approximation Algorithms for the Load Coloring Problem

    Barbero, F., Gutin, G., Jones, M. & Sheng, B., 30 Nov 2016, In : Algorithmica. p. 1-19 19 p.

    Research output: Contribution to journalArticle

  47. Published

    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 journalArticle

  48. Published

    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 journalArticle

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

  50. Published

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

    Crampton, J. & Sellwood, J., 2 Jul 2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 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

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

  52. E-pub ahead of print

    Note on Perfect Forests in Digraphs

    Gutin, G. & Yeo, A., 17 Jun 2016, In : Journal of Graph Theory.

    Research output: Contribution to journalArticle

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

  54. 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 conferencePaper

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

  56. Published

    A Theoretical Framework for Constraint Propagator Triggering

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

    Research output: Contribution to conferencePaper

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

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

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

  60. 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 journalArticle

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

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

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

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

  65. Published

    Proof complexity lower bounds from algebraic circuit complexity

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

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

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

  67. 2015
  68. Published

    Obligations in PTaCL

    Williams, C. & Crampton, J., 22 Sep 2015, Security and Trust Management. Springer, Vol. 9331, p. 220 235 p. (Lecture Notes in Computer Science; vol. 9331)

    Research output: Chapter in Book/Report/Conference proceedingChapter

  69. Forthcoming

    Provably Pointless Propagator Calls

    Cohen, D., Jefferson, C. & Petrie, K., Aug 2015, (Accepted/In press)

    Research output: Contribution to conferencePaper

  70. Forthcoming

    Tractable Classes of Binary CSPs Defined by Excluded Topological Minors

    Cohen, D., Cooper, M., Zivny, S. & Jeavons, P., Jul 2015, (Accepted/In press) p. 1945-1951 7 p.

    Research output: Contribution to conferencePaper

  71. Published
  72. Published

    Relationship-based Access Control for an Open-source Medical Records System

    Rizvi, S. Z. R., Fong, P. W. L., Crampton, J. & Sellwood, J., 1 Jun 2015, Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT. ACM, Vol. 2015-June, p. 113-124 12 p.

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

  73. Published

    Relationships, Paths and Principal Matching: A New Approach to Access Control

    Crampton, J. & Sellwood, J., 29 May 2015, In : ArXiv.org.

    Research output: Contribution to journalArticle

  74. Published

    Maximizing the minimum load for random processing times

    Gerke, S., Panagiotou, K., Schwartz, J. & Steger, A., 13 Jan 2015, In : ACM Transactions on Algorithms (TALG). 11, 3, 19 p., 17

    Research output: Contribution to journalArticle

  75. Published

    Access Control in Publicly Verifiable Outsourced Computation

    Alderman, J., Janson, C., Cid, C. & Crampton, J., 2015, Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security - ASIACCS 2015. ACM, p. 657-662

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

  76. Published

    Controllability and matchings in random bipartite graphs

    Balister, P. & Gerke, S., 2015, Surveys in combinatorics 2015. Cambridge University Press, Vol. 424, p. 119-145 (London Math. Soc. Lecture Series)

    Research output: Chapter in Book/Report/Conference proceedingChapter

  77. Forthcoming

    Cryptographic Enforcement of Information Flow Policies without Public Information

    Crampton, J., Farley, N., Gutin, G., Jones, M. & Poettering, B., 2015, (Accepted/In press) 13th International Conference on Applied Cryptography and Network Security (ACNS 2015) . (Lecture Notes in Computer Science)

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

  78. Unpublished

    Håstad‘s Separation of Constant-Depth Circuits Using Sipser Functions

    Tzameret, I., 2015, (Unpublished) Expository Note. 15 p.

    Research output: Book/ReportOther report

  79. Forthcoming

    On Missing Attributes in Access Control: Non-deterministic and Probabilistic Attribute Retrieval

    Crampton, J., Morisset, C. & Zannone, N., 2015, (Accepted/In press) 20th ACM Symposium on Access Control Models and Technologies. ACM

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

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

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

  82. Forthcoming

    Parameterized and Approximation Algorithms for the Load Coloring Problem

    Barbero, F., Gutin, G., Jones, M. & Sheng, B., 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 proceedingConference contribution

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

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

  85. Published

    Short Proofs for the Determinant Identities

    Hrubes, P. & Tzameret, I., 2015, In : SIAM Journal on Computing. 44, 2, p. 340–383 44 p.

    Research output: Contribution to journalArticle

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

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

  88. 2014
  89. Published

    Non-commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs

    Li, F., Tzameret, I. & Wang, Z., 30 Dec 2014, ArXiV. p. 1 32 p.

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

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

  91. Published

    Randomized Rounding in the Presence of a Cardinality Constraint

    Doerr, B. & Wahlström, M., 1 Sep 2014, In : ACM Journal of Experimental Algorithmics. 19, 2

    Research output: Contribution to journalArticle

  92. Published

    Attribute-Based Encryption for Access Control Using Elementary Operations

    Crampton, J. & Pinto, A., 2014, 27th Computer Security Foundations Symposium. IEEE, p. 125-139

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

  93. Published

    Authorized workflow schemas: deciding realizability through $\mathsf{LTL }(\mathsf{F })$ model checking

    Crampton, J., Huth, M. & Huan-Pu Kuo, J., 2014, In : International Journal on Software Tools for Technology Transfer. 16, 1, p. 31-48

    Research output: Contribution to journalArticle

  94. Published

    Caching and Auditing in the RPPM Model

    Crampton, J. & Sellwood, J., 2014, Security and Trust Management - 10th International Workshop. Springer, p. 49-64 16 p. (Lecture Notes in Computer Science; vol. 8743)

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

  95. Published

    Calculation of Discrepancy Measures and Applications

    Doerr, C., Gnewuch, M. & Wahlström, M., 2014, A Panorama of Discrepancy Theory. Chen, W., Srivastav, A. & Travaglini, G. (eds.). Springer, p. 621-678 58 p. (Lecture Notes in Mathematics; vol. 2107)

    Research output: Chapter in Book/Report/Conference proceedingChapter

  96. Forthcoming

    Clique cover and graph separation: New incompressibility results

    Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M. & Wahlström, M., 2014, (Accepted/In press) In : ACM Transactions on Computation Theory (TOCT). 6, 2

    Research output: Contribution to journalArticle

  97. Forthcoming

    Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal

    Kratsch, S. & Wahlström, M., 2014, (Accepted/In press) In : ACM Transactions on Algorithms (TALG). 10, 4, 20 p.

    Research output: Contribution to journalArticle

  98. Published

    Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints

    Cohen, D., Crampton, J., Gagarin, A., Gutin, G. & Jones, M., 2014, FAW 2014. (Lecture Notes in Computer Science; vol. 8497)

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

  99. Published

    Half-integrality, LP-branching and FPT Algorithms

    Wahlström, M., 2014, SODA. Chekuri, C. (ed.). SIAM, p. 1762-1781 20 p.

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

  100. Published

    Kernelization, Matroid Methods

    Wahlström, M., 2014, Encyclopedia of Algorithms. Springer, p. 1-6 6 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  101. Published

    Monotonicity and Completeness in Attribute-Based Access Control

    Crampton, J. & Morisset, C., 2014, Security and Trust Management - 10th International Workshop. Springer, p. 33-48

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

  102. Published

    Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs

    Gutin, G., Jones, M., Sheng, B. & Wahlström, M., 2014, Proceedings of WG 2014.

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

  103. Published

    Path Conditions and Principal Matching: A New Approach to Access Control

    Crampton, J. & Sellwood, J., 2014, 19th ACM Symposium on Access Control Models and Technologies. ACM, p. 187-198

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

  104. Published

    Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

    Gutin, G., Kratsch, S. & Wahlström, M., 2014, Proceedings of IPEC 2014.

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

  105. Published

    Polynomially Closed Co-clones

    Lagerkvist, V. & Wahlström, M., 2014, Proceedings of ISMVL 2014: IEEE 44th International Symposium on Multiple-Valued Logic. IEEE, p. 85-90 6 p.

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

Previous 1 2 3 4 5 Next