Publications of Omid Amini
BACK TO COATI PUBLICATION INDEX
Publications of Omid Amini
-
O. Amini.
Algorithmique des décompositions de graphes Applications aux réseaux de télécommunications.
PhD thesis,
École doctorale STIC, Université de Nice-Sophia Antipolis,
November 28 2007.
[Abstract] [bibtex-entry]
-
Omid Amini,
David Coudert,
and Nicolas Nisse.
Non-deterministic graph searching in trees.
Journal of Theoretical Computer Science (TCS),
580:101-121,
May 2015.
[WWW
] [PDF
]
Keywords:
Pathwidth,
Trees,
Graph Searching,
Treewidth.
[Abstract] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
On the approximability of some degree-constrained subgraph problems.
Discrete Applied Mathematics,
160(12):1661 - 1679,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Giroire,
F. Huc,
and S. Pérennes.
Minimal selectors and fault tolerant networks.
Networks,
55(4):326-340,
July 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Havet,
F. Huc,
and S. Thomassé.
WDM and directed star arboricity.
Combinatorics, Probability and Computing,
19:161--182,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Huc,
and S. Pérennes.
On the pathwidth of planar graphs.
SIAM Journal of Discrete Mathematics,
23(3):1311-1316,
August 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Mazoit,
N. Nisse,
and S. Thomassé.
Submodular partition functions.
Discrete Mathematics,
309(20):6000-6008,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
Theoretical Computer Science,
410(38-40):3751-3760,
2009.
[PDF
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
O. Amini,
J.-S. Sereni,
and S. Thomassé.
Guarding art galleries: the extra cost for sculptures is linear.
In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT 2008),
volume 5124 of Lecture Notes in Computer Science,
pages 41-52,
July 2008.
Springer.
[bibtex-entry]
-
O. Amini,
S. Griffiths,
and F. Huc.
4-cycles in mixing digraphs.
In Electronic Notes in Discrete MathematicsVolume 30, The IV Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 07),
volume 30,
Puerto Varas, Chile,
pages 63--68,
February 2008.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
Degree-Constrained Subgraph Problems : Hardness and Approximation Results.
In 6th International Workshop on Approximation and Online Algorithms (ALGO-WAOA 2008),
volume 5426 of Lecture Notes in Computer Science,
Karlsruhe, Germany,
pages 29-42,
September 2008.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
I. Sau,
and S. Saurabh.
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
In The International Workshop on Parameterized and Exact Computation (IWPEC 2008),
volume 5008 of Lecture Notes in Computer Science,
Victoria, Canada,
pages 13-29,
May 2008.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
In The 18th International Symposium on Algorithms and Computation (ISAAC 2007),
volume 4835 of Lecture Notes in Computer Science,
Sendai, Japan,
pages 561-573,
December 2007.
Springer-Verlag.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness of Approximating the Traffic Grooming.
In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
Ile d'Oléron, France,
pages 45-48,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini and B. Reed.
List Colouring Constants of Triangle Free Graphs.
In IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 07),
Puerto Varas, Chile,
pages 6p,
November 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
J-C. Bermond,
F. Giroire,
F. Huc,
and S. Pérennes.
Design of Minimal Fault Tolerant Networks: Asymptotic Bounds.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06),
Trégastel, France,
pages 37--40,
May 2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Coudert,
and N. Nisse.
Some Results on Non-deterministic Graph Searching in Trees.
Research Report,
2013.
[WWW
] [PDF
] [bibtex-entry]
-
O. Amini,
F. Huc,
I. Sau,
and J. Zerovnik.
$(\ell,k)$-Routing on Plane Grids.
Research Report 6480,
INRIA,
March 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
Research Report RR-6690,
INRIA,
October 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Coudert,
and N. Nisse.
Some Results on Non-deterministic Graph Searching in Trees.
Research Report INRIA-00174965,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
L. Esperet,
and J. van den Heuvel.
Frugal Colouring of Graphs.
Research Report 6178,
INRIA,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Havet,
F. Huc,
and S. Thomassé.
WDM and Directed Star Arboricity.
Research Report 6179,
INRIA,
January 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Mazoit,
N. Nisse,
and S. Thomassé.
Submodular partition functions.
Technical report RR-1427-07,
LABRI, Univ. Bordeaux,
April 2007.
Note: Submitted in SIAM J. discrete Maths. [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
Research Report 6236,
INRIA,
June 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
I. Sau,
and S. Saurabh.
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
Research Report 6237,
INRIA,
June 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Giroire,
F. Huc,
and S. Pérennes.
Minimal selectors and fault tolerant networks.
Research report,
INRIA Research Report HAL-00082015,
July 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Huc,
and S. Pérennes.
On the pathwidth of planar graphs.
Research report,
INRIA Research Report HAL-00082035,
July 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:43 2022
