| 2008 |
|---|
| 9 | | Spyros Angelopoulos,
Alejandro López-Ortiz,
Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms with Soft Deadlines.
AAAI 2008: 868-873 |
| 2006 |
|---|
| 8 | | Alejandro López-Ortiz,
Spyros Angelopoulos,
Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problems.
AAAI 2006 |
| 2005 |
|---|
| 7 | | Alejandro López-Ortiz,
Angèle M. Hamel:
Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers
Springer 2005 |
| 2004 |
|---|
| 6 | EE | Jean-Charles Grégoire,
Angèle M. Hamel:
You Can Get There from Here: Routing in the Internet.
CAAN 2004: 173-182 |
| 5 | EE | Therese C. Biedl,
Brona Brejová,
Erik D. Demaine,
Angèle M. Hamel,
Alejandro López-Ortiz,
Tomás Vinar:
Finding hidden independent sets in interval graphs.
Theor. Comput. Sci. 310(1-3): 287-307 (2004) |
| 4 | EE | Michael H. Albert,
Alexander Golynski,
Angèle M. Hamel,
Alejandro López-Ortiz,
S. Srinivasa Rao,
Mohammad Ali Safari:
Longest increasing subsequences in sliding windows.
Theor. Comput. Sci. 321(2-3): 405-414 (2004) |
| 2003 |
|---|
| 3 | EE | Therese C. Biedl,
Brona Brejová,
Erik D. Demaine,
Angèle M. Hamel,
Alejandro López-Ortiz,
Tomás Vinar:
Finding Hidden Independent Sets in Interval Graphs.
COCOON 2003: 182-191 |
| 2 | | Ziv Bar-Joseph,
Erik D. Demaine,
David K. Gifford,
Nathan Srebro,
Angèle M. Hamel,
Tommi Jaakkola:
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data.
Bioinformatics 19(9): 1070-1078 (2003) |
| 2002 |
|---|
| 1 | EE | Ziv Bar-Joseph,
Erik D. Demaine,
David K. Gifford,
Angèle M. Hamel,
Tommi Jaakkola,
Nathan Srebro:
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data.
WABI 2002: 506-520 |
