dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

David Huygens Coauthor index pubzone.org

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

DBLP keys2008
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman: Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks 52(4): 287-298 (2008)
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Huygens, Martine Labbé, Ali Ridha Mahjoub, Pierre Pesneau: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Networks 49(1): 116-133 (2007)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Huygens, Ali Ridha Mahjoub: Integer programming formulations for the two 4-hop-constrained paths problem. Networks 49(2): 135-144 (2007)
2006
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau: On the k edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34(5): 577-582 (2006)
2004
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Huygens, Ali Ridha Mahjoub, Pierre Pesneau: Two Edge-Disjoint Hop-Constrained Paths and Polyhedra. SIAM J. Discrete Math. 18(2): 287-312 (2004)

Coauthor Index

1Julie Christophe [5]
2Geir Dahl [2]
3Sophie Dewez [5]
4Jean-Paul Doignon [5]
5Sourour Elloumi [5]
6Gilles Fasbender [5]
7Philippe Grégoire [5]
8Martine Labbé [4] [5]
9Ali Ridha Mahjoub [1] [2] [3] [4]
10Hadrien Mélot [5]
11Pierre Pesneau [1] [2] [4]
12Hande Yaman [5]

Last update Thu May 31 18:55:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page