Author of the publication

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

, , , , and . Journal of Computer Security, 25 (6): 511-535 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem., , and . ACM Trans. Inf. Syst. Secur., 16 (1): 4 (2013)Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis., , and . ACM Trans. Priv. Secur., 24 (3): 21:1-21:22 (2021)Strong Subgraph Connectivity of Digraphs: A Survey., and . J. Interconnect. Networks, 21 (4): 2142004:1-2142004:16 (2021)Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths., , , , and . IEEE Trans. Inf. Theory, 68 (6): 3870-3878 (2022)p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms., , , , and . J. Comput. Syst. Sci., (May 2023)Exact capacitated domination: on the computational complexity of uniqueness., , and . CoRR, (2020)Packing strong subgraph in digraphs., , and . Discret. Optim., (2022)Solving MAX-r-SAT Above a Tight Lower Bound., , , , and . SODA, page 511-517. SIAM, (2010)07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs., , , and . Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, volume 07281 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)Approximation algorithms with constant ratio for general cluster routing problems., , , , and . J. Comb. Optim., 44 (4): 2499-2514 (2022)