Federico Mancini

University of Bergen

other persons with the same name:

• Federico Mancini - IBM

	2012
20		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
	2011
19		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)
18		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
17		Federico Mancini, Dag Hovland, Khalid A. Mughal: Investigating the Limitations of Java Annotations for Input Validation. ARES 2010: 513-518
16		Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger: A Parameterized Algorithm for Chordal Sandwich. CIAC 2010: 120-130
15		Federico Mancini: Minimum fill-in and treewidth of split+ke and split+kv graphs. Discrete Applied Mathematics 158(7): 747-754 (2010)
14		Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos: Characterizing and computing minimal cograph completions. Discrete Applied Mathematics 158(7): 755-764 (2010)
13		Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner: Rooted directed path graphs are leaf powers. Discrete Mathematics 310(4): 897-910 (2010)
12		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)
	2009
11		Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan: Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON 2009: 398-407
10		Pinar Heggernes, Federico Mancini: Minimal split completions. Discrete Applied Mathematics 157(12): 2659-2669 (2009)
9		Pinar Heggernes, Federico Mancini: Dynamically maintaining split graphs. Discrete Applied Mathematics 157(9): 2057-2069 (2009)
	2008
8		Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos: Characterizing and Computing Minimal Cograph Completions. FAW 2008: 147-158
7		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
6		Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
5		Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Minimal comparability completions of arbitrary graphs. Discrete Applied Mathematics 156(5): 705-718 (2008)
	2007
4		Federico Mancini: Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. ISAAC 2007: 881-892
	2006
3		Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC 2006: 419-428
2		Pinar Heggernes, Federico Mancini: Minimal Split Completions of Graphs. LATIN 2006: 592-604
1		Federico Mancini, Pinar Heggernes: A completely dynamic algorithm for split graphs. Electronic Notes in Discrete Mathematics 27: 69-70 (2006)

Coauthor Index

1	Hans L. Bodlaender	[6] [12]
2	Andreas Brandstädt	[13]
3	Michael R. Fellows (Mike Fellows)	[6] [12]
4	Fedor V. Fomin	[7] [18]
5	Samson Gejibo	[20]
6	Pinar Heggernes	[1] [2] [3] [5] [6] [9] [10] [11] [12] [16] [19]
7	Dag Hovland	[17]
8	Christian Hundt	[13]
9	Jørn Klungsøyr	[20]
10	Jan Kratochvíl	[7] [18]
11	Daniel Lokshtanov	[7] [8] [14] [18]
12	Khalid A. Mughal	[17] [20]
13	Jesper Nederlof	[16]
14	Charis Papadopoulos	[3] [5] [6] [8] [11] [12] [14] [19]
15	Frances A. Rosamond	[6] [12]
16	R. Sritharan	[11] [19]
17	Jan Arne Telle	[7] [18]
18	Remi Valvik	[20]
19	Yngve Villanger	[16]
20	Peter Wagner	[13]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page