
Search the dblp DataBase
Angèle M. Hamel:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Alejandro LópezOrtiz, Spyros Angelopoulos, Angèle M. Hamel
Optimal Scheduling of Contract Algorithms for Anytime Problems. [Citation Graph (0, 0)][DBLP] AAAI, 2006, pp: [Conf]
 JeanCharles Grégoire, Angèle M. Hamel
You Can Get There from Here: Routing in the Internet. [Citation Graph (0, 0)][DBLP] CAAN, 2004, pp:173182 [Conf]
 Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro LópezOrtiz, Tomás Vinar
Finding Hidden Independent Sets in Interval Graphs. [Citation Graph (0, 0)][DBLP] COCOON, 2003, pp:182191 [Conf]
 Ziv BarJoseph, Erik D. Demaine, David K. Gifford, Angèle M. Hamel, Tommi Jaakkola, Nathan Srebro
Kary Clustering with Optimal Leaf Ordering for Gene Expression Data. [Citation Graph (0, 0)][DBLP] WABI, 2002, pp:506520 [Conf]
 Ziv BarJoseph, Erik D. Demaine, David K. Gifford, Nathan Srebro, Angèle M. Hamel, Tommi Jaakkola
Kary Clustering with Optimal Leaf Ordering for Gene Expression Data. [Citation Graph (0, 0)][DBLP] Bioinformatics, 2003, v:19, n:9, pp:10701078 [Journal]
 Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro LópezOrtiz, S. Srinivasa Rao, Mohammad Ali Safari
Longest increasing subsequences in sliding windows. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:321, n:23, pp:405414 [Journal]
 Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro LópezOrtiz, Tomás Vinar
Finding hidden independent sets in interval graphs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:310, n:13, pp:287307 [Journal]
Optimal Scheduling of Contract Algorithms with Soft Deadlines. [Citation Graph (, )][DBLP]
Sorting with networks of data structures. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
