Omid Amini

	2012
23		Omid Amini, Ignasi Sau, Saket Saurabh: Parameterized complexity of finding small degree-constrained subgraphs. J. Discrete Algorithms 10: 70-83 (2012)
	2011
22		Omid Amini, Fedor V. Fomin, Saket Saurabh: Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. 77(6): 1159-1171 (2011)
21		Omid Amini, Simon Griffiths, Florian Huc: Subgraphs of Weakly Quasi-Random Oriented Graphs. SIAM J. Discrete Math. 25(1): 234-259 (2011)
	2010
20		Omid Amini, Jean-Daniel Boissonnat, Pooran Memari: Geometric tomography with topological guarantees. Symposium on Computational Geometry 2010: 287-296
19		Omid Amini, Jean-Daniel Boissonnat, Pooran Memari: Geometric Tomography With Topological Guarantees CoRR abs/1007.2452: (2010)
18		Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé: WDM and Directed Star Arboricity. Combinatorics, Probability & Computing 19(2): 161-182 (2010)
17		Omid Amini, Madhusudan Manjunath: Riemann-Roch for Sub-Lattices of the Root Lattice An. Electr. J. Comb. 17(1): (2010)
16		Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc: Minimal selectors and fault tolerant networks. Networks 55(4): 326-340 (2010)
	2009
15		Omid Amini, Fedor V. Fomin, Saket Saurabh: Counting Subgraphs via Homomorphisms. ICALP (1) 2009: 71-82
14		Omid Amini, Louis Esperet, Jan van den Heuvel: A unified approach to distance-two colouring of planar graphs. SODA 2009: 273-282
13		Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé: Submodular partition functions. Discrete Mathematics 309(20): 6000-6008 (2009)
12		Omid Amini, Florian Huc, Stéphane Pérennes: On the Path-Width of Planar Graphs. SIAM J. Discrete Math. 23(3): 1311-1316 (2009)
11		Omid Amini, Stéphane Pérennes, Ignasi Sau: Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38-40): 3751-3760 (2009)
	2008
10		Omid Amini, Fedor V. Fomin, Saket Saurabh: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008: 1-12
9		Omid Amini, Ignasi Sau, Saket Saurabh: Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC 2008: 13-29
8		Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé: Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. SWAT 2008: 41-52
7		Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh: Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42
6		Omid Amini, Fedor V. Fomin, Saket Saurabh: Parameterized Algorithms for Partial Cover Problems CoRR abs/0802.1722: (2008)
5		Omid Amini, Bruce A. Reed: List Colouring Constants of Triangle Free Graphs. Electronic Notes in Discrete Mathematics 30: 135-140 (2008)
4		Omid Amini, Simon Griffiths, Florian Huc: 4-cycles in mixing digraphs. Electronic Notes in Discrete Mathematics 30: 63-68 (2008)
	2007
3		Omid Amini, Stéphane Pérennes, Ignasi Sau: Hardness and Approximation of Traffic Grooming. ISAAC 2007: 561-573
2		Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé: WDM and Directed Star Arboricity CoRR abs/0705.0315: (2007)
1		Omid Amini, Louis Esperet, Jan van den Heuvel: Frugal Colouring of Graphs CoRR abs/0705.0422: (2007)

Coauthor Index

1	Louigi Addario-Berry	[8]
2	Jean-Daniel Boissonnat	[19] [20]
3	Louis Esperet	[1] [14]
4	Fedor V. Fomin	[6] [10] [15] [22]
5	Frédéric Giroire	[16]
6	Simon Griffiths	[4] [21]
7	Frédéric Havet	[2] [18]
8	Jan van den Heuvel	[1] [14]
9	Florian Huc	[2] [4] [12] [16] [18] [21]
10	Madhusudan Manjunath	[17]
11	Frédéric Mazoit	[13]
12	Pooran Memari	[19] [20]
13	Nicolas Nisse	[13]
14	David Peleg	[7]
15	Stéphane Pérennes (Stephane Perennes)	[3] [7] [11] [12] [16]
16	Bruce A. Reed	[5]
17	Ignasi Sau (Ignasi Sau Valls)	[3] [7] [9] [11] [23]
18	Saket Saurabh	[6] [7] [9] [10] [15] [22] [23]
19	Jean-Sébastien Sereni	[8]
20	Stéphan Thomassé	[2] [8] [13] [18]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page