 | 2009 |
|---|
| 13 |       | Omid Amini,
Fedor V. Fomin,
Saket Saurabh:
Counting Subgraphs via Homomorphisms.
ICALP (1) 2009: 71-82 |
| 12 | | Omid Amini,
Louis Esperet,
Jan van den Heuvel:
A unified approach to distance-two colouring of planar graphs.
SODA 2009: 273-282 |
| 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 |
| 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) |
