Author of the publication

Governance Foundations for the European Cybersecurity Community.

, , , , , , and . CyberSec4Europe, volume 1807 of Communications in Computer and Information Science, page 132-148. Springer, (2022)

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

Generalized Parametric Multi-terminal Flows Problem., , and . WG, volume 2880 of Lecture Notes in Computer Science, page 71-80. Springer, (2003)Parallel Algorithms for Searching In X+Y., and . ICPP (3), page 16-19. Pennsylvania State University Press, (1989)0-271-00686-2.Modeling Parallel Branch-and-Bound for Asynchronous Implementations., and . Parallel Processing of Discrete Optimization Problems, volume 22 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 45-56. DIMACS/AMS, (1994)Governance Foundations for the European Cybersecurity Community., , , , , , and . CyberSec4Europe, volume 1807 of Communications in Computer and Information Science, page 132-148. Springer, (2022)Embedding Tori in Partitioned Optical Passive Star Networks., , and . SIROCCO, page 40-52. Carleton Scientific, (1997)SCOOP: Solving Combinatorial Optimization Problems in Parallel., and . Solving Combinatorial Optimization Problems in Parallel, volume 1054 of Lecture Notes in Computer Science, page 1-6. Springer, (1996)A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem., and . Euro-Par, volume 1685 of Lecture Notes in Computer Science, page 272-279. Springer, (1999)The Minimum Range Assignment Problem on Linear Radio Networks., , , , and . ESA, volume 1879 of Lecture Notes in Computer Science, page 143-154. Springer, (2000)A Performance Comparison Between Graph and Hypergraph Topologies for Passive Star WDM Lightwave Networks., , and . Comput. Networks, 30 (8): 805-819 (1998)DIAL M for Mobility: Discrete Algorithms and Methods for Mobile Computing and Communications., and . Mob. Networks Appl., 6 (6): 491-492 (2001)