Search the dblp DataBase

Publications of Author

1. Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel
   Optimal Scheduling of Contract Algorithms for Anytime Problems. [Citation Graph (0, 0)][DBLP]
   AAAI, 2006, pp:- [Conf]
   
2. Jean-Charles Grégoire, Angèle M. Hamel
   You Can Get There from Here: Routing in the Internet. [Citation Graph (0, 0)][DBLP]
   CAAN, 2004, pp:173-182 [Conf]
   
3. 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. [Citation Graph (0, 0)][DBLP]
   COCOON, 2003, pp:182-191 [Conf]
   
4. 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. [Citation Graph (0, 0)][DBLP]
   WABI, 2002, pp:506-520 [Conf]
   
5. 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. [Citation Graph (0, 0)][DBLP]
   Bioinformatics, 2003, v:19, n:9, pp:1070-1078 [Journal]
   
6. 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. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:321, n:2-3, pp:405-414 [Journal]
   
7. 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. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:310, n:1-3, pp:287-307 [Journal]
   
8. 
   Optimal Scheduling of Contract Algorithms with Soft Deadlines. [Citation Graph (, )][DBLP]
   
   
9. 
   Sorting with networks of data structures. [Citation Graph (, )][DBLP]