Federico Mancini - Citegraph

Author Info

Name	Affiliation	Papers
FEDERICO MANCINI	Department of Informatics, University of Bergen, N-5020 Bergen, Norway	20
Collaborators	Citations	PageRank
24	78	9.79
Referers	Referees	References
145	289	251

Search Limit

100289

Publications (20 rows)

Collaborators (24 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
An Internal/Insider Threat Score for Data Loss Prevention and Detection.	3	0.42	2017
Data Leakage Prevention for Secure Cross-Domain Information Exchange.	1	0.43	2017
Data Loss Prevention For Cross-Domain Instant Messaging	0	0.34	2017
Data Loss Prevention Based On Text Classification In Controlled Environments	4	0.52	2016
Challenges in implementing an end-to-end secure protocol for java ME-Based mobile data collection in low-budget settings	4	0.94	2012
Secure data storage for mobile data collection systems	7	0.74	2012
Secure data storage for Java ME-based mobile data collection systems	1	0.39	2012
Strongly chordal and chordal bipartite graphs are sandwich monotone	1	0.37	2011
Rooted directed path graphs are leaf powers	7	0.68	2010
Investigating the Limitations of Java Annotations for Input Validation	2	0.36	2010
Clustering with partial information	10	0.59	2010
Characterizing and computing minimal cograph completions	5	0.47	2010
Dynamically maintaining split graphs	4	0.39	2009
Minimal split completions	3	0.41	2009
Minimal comparability completions of arbitrary graphs	7	0.68	2008
On the complexity of reconstructing H-free graphs from their Star Systems	1	0.37	2008
Minimum fill-in and treewidth of split+ke and split+kv graphs	3	0.39	2007
Minimal split completions of graphs	9	0.54	2006
Making arbitrary graphs transitively orientable: minimal comparability completions	4	0.40	2006
A completely dynamic algorithm for split graphs	2	0.36	2006