Federico Mancini

Affiliations:
  • Università degli Studi Roma Tre, Italy
  • Norwegian Defence Research Establishment, Kjeller, Norway (former)
  • University of Bergen, Norway (PhD 2008)


According to our database1, Federico Mancini authored at least 33 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Towards data-driven autonomous cyber defence for military unmanned vehicles - threats & attacks.
Proceedings of the IEEE Military Communications Conference, 2022

2020
A Security Reference Model for Autonomous Vehicles in Military Operations.
Proceedings of the 8th IEEE Conference on Communications and Network Security, 2020

2019
Challenges for Risk and Security Modelling in Enterprise Architecture.
Proceedings of the Practice of Enterprise Modeling, 2019

2018
Using Smart Cards to Enhance Security of Android Smartphones in Tactical Scenarios.
Proceedings of the 2018 IEEE International Conference on Communications Workshops, 2018

2017
Data Leakage Prevention for Secure Cross-Domain Information Exchange.
IEEE Commun. Mag., 2017

Data loss prevention for cross-domain instant messaging.
Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

An Internal/Insider Threat Score for Data Loss Prevention and Detection.
Proceedings of the 3rd ACM on International Workshop on Security And Privacy Analytics, 2017

2016
Data Loss Prevention Based on Text Classification in Controlled Environments.
Proceedings of the Information Systems Security - 12th International Conference, 2016

2015
Integrity attestation in military IoT.
Proceedings of the 2nd IEEE World Forum on Internet of Things, 2015

2014
High Assurance information exchange based on Publish-Subscribe and ABAC methods.
Proceedings of the 2014 IEEE Military Communications Conference, 2014

2013
Secure cloud storage for remote mobile data collection.
Proceedings of the Second Nordic Symposium on Cloud Computing & Internet Technologies, 2013

The Integration of Trusted Platform Modules into a Tactical Identity Management System.
Proceedings of the 32th IEEE Military Communications Conference, 2013

Identity Management and Integrity Protection in Publish-Subscribe Systems.
Proceedings of the Policies and Research in Identity Management, 2013

2012
Secure data storage for mobile data collection systems.
Proceedings of the International Conference on Management of Emergent Digital EcoSystems, 2012

Secure data storage for Java ME-based mobile data collection systems.
Proceedings of the IEEE 14th International Conference on e-Health Networking, 2012

Challenges in Implementing an End-to-End Secure Protocol for Java ME-Based Mobile Data Collection in Low-Budget Settings.
Proceedings of the Engineering Secure Software and Systems - 4th International Symposium, 2012

Secure Mobile Data Collection Systems for Low-Budget Settings.
Proceedings of the Seventh International Conference on Availability, 2012

2011
On the complexity of reconstructing <i>H</i>-free graphs from their Star Systems.
J. Graph Theory, 2011

Strongly chordal and chordal bipartite graphs are sandwich monotone.
J. Comb. Optim., 2011

2010
Clustering with partial information.
Theor. Comput. Sci., 2010

Rooted directed path graphs are leaf powers.
Discret. Math., 2010

Minimum fill-in and treewidth of split+ke and split+kv graphs.
Discret. Appl. Math., 2010

Characterizing and computing minimal cograph completions.
Discret. Appl. Math., 2010

A Parameterized Algorithm for Chordal Sandwich.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Investigating the Limitations of Java Annotations for Input Validation.
Proceedings of the ARES 2010, 2010

2009
Minimal split completions.
Discret. Appl. Math., 2009

Dynamically maintaining split graphs.
Discret. Appl. Math., 2009

2008
Minimal comparability completions of arbitrary graphs.
Discret. Appl. Math., 2008

On the Complexity of Reconstructing H -free Graphs from Their Star Systems.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Minimum Fill-In and Treewidth of Split+ <i>ke</i> and Split+ <i>kv</i> Graphs.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
A completely dynamic algorithm for split graphs.
Electron. Notes Discret. Math., 2006

Minimal Split Completions of Graphs.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006


  Loading...