Federico Mancini

University of Bergen

other persons with the same name:

• Federico Mancini 0002 - IBM

	2012
c12		Federico Mancini, Samson Gejibo, Khalid A. Mughal, Remi Valvik, Jørn Klungsøyr: Secure Mobile Data Collection Systems for Low-Budget Settings. ARES 2012: 196-205
c11		Samson Gejibo, Federico Mancini, Khalid A. Mughal, Remi Valvik, Jørn Klungsøyr: Challenges in Implementing an End-to-End Secure Protocol for Java ME-Based Mobile Data Collection in Low-Budget Settings. ESSoS 2012: 38-45
c10		Samson Gejibo, Federico Mancini, Khalid A. Mughal, Remi Valvik, Jørn Klungsøyr: Secure data storage for mobile data collection systems. MEDES 2012: 131-144
	2011
j10		Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan: Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22(3): 438-456 (2011)
j9		Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the complexity of reconstructing H-free graphs from their Star Systems. Journal of Graph Theory 68(2): 113-124 (2011)
	2010
j8		Federico Mancini: Minimum fill-in and treewidth of split+ke and split+kv graphs. Discrete Applied Mathematics 158(7): 747-754 (2010)
j7		Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos: Characterizing and computing minimal cograph completions. Discrete Applied Mathematics 158(7): 755-764 (2010)
j6		Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner: Rooted directed path graphs are leaf powers. Discrete Mathematics 310(4): 897-910 (2010)
j5		Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with partial information. Theor. Comput. Sci. 411(7-9): 1202-1211 (2010)
c9		Federico Mancini, Dag Hovland, Khalid A. Mughal: Investigating the Limitations of Java Annotations for Input Validation. ARES 2010: 513-518
c8		Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger: A Parameterized Algorithm for Chordal Sandwich. CIAC 2010: 120-130
	2009
j4		Pinar Heggernes, Federico Mancini: Dynamically maintaining split graphs. Discrete Applied Mathematics 157(9): 2057-2069 (2009)
j3		Pinar Heggernes, Federico Mancini: Minimal split completions. Discrete Applied Mathematics 157(12): 2659-2669 (2009)
c7		Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan: Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON 2009: 398-407
	2008
j2		Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Minimal comparability completions of arbitrary graphs. Discrete Applied Mathematics 156(5): 705-718 (2008)
c6		Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos: Characterizing and Computing Minimal Cograph Completions. FAW 2008: 147-158
c5		Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN 2008: 194-205
c4		Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
	2007
c3		Federico Mancini: Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. ISAAC 2007: 881-892
	2006
j1		Federico Mancini, Pinar Heggernes: A completely dynamic algorithm for split graphs. Electronic Notes in Discrete Mathematics 27: 69-70 (2006)
c2		Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC 2006: 419-428
c1		Pinar Heggernes, Federico Mancini: Minimal Split Completions of Graphs. LATIN 2006: 592-604

Coauthor Index

Colors in the list of coauthors

Last update Tue May 21 05:20:31 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page