Frédéric Gardi Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBertrand Estellon, Frédéric Gardi, Karim Nouioua: High-Performance Local Search for Task Scheduling with Human Resource Allocation. SLS 2009: 1-15
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThierry Benoist, Bertrand Estellon, Frédéric Gardi, Antoine Jeanjean: High-Performance Local Search for Solving Real-Life Inventory Routing Problems. SLS 2009: 105-109
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Gardi: Mutual exclusion scheduling with interval graphs or related classes, Part I. Discrete Applied Mathematics 157(1): 19-35 (2009)
2008
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Gardi: Mutual exclusion scheduling with interval graphs or related classes. Part II. Discrete Applied Mathematics 156(5): 794-812 (2008)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBertrand Estellon, Frédéric Gardi, Karim Nouioua: Two local search approaches for solving real-life car sequencing problems. European Journal of Operational Research 191(3): 928-944 (2008)
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Gardi: The Roberts characterization of proper and unit interval graphs. Discrete Mathematics 307(22): 2906-2908 (2007)
2006
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Gardi: Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms. 4OR 4(1): 87-90 (2006)
2004
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Gardi: On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications. LATIN 2004: 129-140
2003
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Gardi: Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems. DMTCS 2003: 168-180

Coauthor Index

1Thierry Benoist [8]
2Bertrand Estellon [5] [8] [9]
3Antoine Jeanjean [8]
4Karim Nouioua [5] [9]

Copyright © Wed Dec 16 17:29:03 2009 by Michael Ley (ley@uni-trier.de)