Site Accessibility Statement
Wilfrid Laurier University Faculty of Science
April 18, 2014
 
 
Canadian Excellence

Angèle Hamel



Contact:

email: Angèle Hamel
phone: 519-884-0710
ext: 2984

 

Journal Papers and Preprints





Refereed Journal Papers (since 2004):

A.M. Hamel and R.C. King ``Bijective proof of a symplectic pair identity,'' SIAM Journal of Discrete Mathematics, 25 (2011), 539-560.

 A.M. Hamel and R.C. King, ``Lattice path proofs of extended Bressoud-Wei and Koike skew Schur function identities,'' Electronic Journal of Combinatorics,  18 (1), P47, February 21, 2011, 14 pages.

A.M. Hamel and R.C. King, ``Extended Bressoud--Wei and Koike skew Schur function identities,'' Journal of Combinatorial Theory A, 118 (2011), 545-557.

T. Biedl, A. Golynski, A.M. Hamel, A. Lopez-Ortiz, J.I. Munro, ``Sorting with networks of data structures,''  Discrete Applied Mathematics, 158 (2010), 1579-1586. 

A.M. Hamel and R.C. King, ``Bijective proofs of shifted tableau and alternating sign matrix identities,'' Journal of Algebraic Combinatorics, 25 (2007), 417-458.  arXiv preprint

A.M. Hamel and R.C. King,  ``U-turn alternating sign matrices, symplectic shifted tableaux, and their weighted enumeration'' Journal of Algebraic Combinatorics, 21 (2005), 395-421. arXiv preprint

M.H. Albert, A. Golynski, A.M. Hamel, A. Lopez-Ortiz, S. Rao, M. Ali Safari ``Longest  Increasing Subsequences in Sliding Windows." Theoretical Computer Science, 321 (2004), 405-414.

T. Biedl, B. Brejova, E.D. Demaine, A.M. Hamel, A. Lopez-Ortiz, T. Vinar, ``Finding hidden independent sets in interval graphs.'' Theoretical Computer Science, 310 (2004), 287-307.

 Books Edited:

A. Lopez-Ortiz, A. Hamel, eds. Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004,  Lecture Notes in Computer Science, No. 3405, 2005, 205pp.

Invited Papers:

J.-Ch. Gregoire, A.M. Hamel, ``You can get there from here: Routing in the Internet,'' in A. Lopez-Ortiz, A. Hamel, eds, Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Lecture Notes in Computer Science, No. 3405, 2005, 173-182. 

 Refereed Conference Papers (since 2004):


J.-Ch. Gregoire, A.M. Hamel, ALPINe: Another Location Privacy Information Network, MobiWIS 2011, Niagara Falls, Canada, September 19-21, 2011.


A.Lopez-Ortiz, S. Angelopoulos, A.M.Hamel, Optimal scheduling of contract algorithms with soft deadlines, Twenty-Third National Conference on Artificial Intelligence, AAAI-08, Chicago, USA, July 13-17, 2008.

R.C.King and A.M. Hamel, Combinatorial realisation of Hall-Littlewood polynomials at t= -1, Poster at Formal Power Series and Algebraic Combinatorics Conference (FPSAC), Tianjin, China, July 2-6, 2007.

A. Lopez-Ortiz, S. Angelopoulous, A.M. Hamel, Optimal scheduling of contract algorithms for anytime problems, Twenty First International Conference on Artificial Intelligence, AAAI-06, Boston, MA, USA, July 16-20, 2006.

 T.Biedl, A.Golynski, A.M. Hamel, A. Lopez-Ortiz, I. Munro, ``Sorting with networks of data structures,''  Franco-Canadian Workshop on Combinatorial Algorithms, Hamilton, On, Canada, August 18-20, 2005.

A.M. Hamel and R.C. King, ``Generalised P-functions and Weyl's Denominator Formula,''  Formal Power Series and Algebraic Combinatorics Conference (FPSAC), Vancouver, B.C., Canada, June 28-July 2, 2004, 12 pages.