Planar decompositions of tableaux and Schur function determinants. - Angèle M. Hamel; Ian P. Goulden (Eur. J. Comb., 1995)

Shift Operators and Factorial Symmetric Functions. - I. P. Goulden; Angèle M. Hamel (J. Comb. Theory A, 1995)

Pfaffians and Determinants for Schur Q-Functions. - Angèle M. Hamel (J. Comb. Theory A, 1996)

The Length of a Leaf Coloration on a Random Binary Tree. - Angèle M. Hamel; Michael Anthony Steel (SIAM J. Discret. Math., 1997)

Pfaffian Identities: A Combinatorial Approach. - Angèle M. Hamel (J. Comb. Theory A, 2001)

K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. - Ziv Bar-Joseph; Erik D. Demaine; David K. Gifford; Nathan Srebro; Angèle M. Hamel; Tommi S. Jaakkola (Bioinform., 2003)

You Can Get There from Here: Routing in the Internet. - Jean-Charles Grégoire; Angèle M. Hamel (CAAN, 2004)

Longest increasing subsequences in sliding windows. - Michael H. Albert; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; S. Srinivasa Rao 001; Mohammad Ali Safari (Theor. Comput. Sci., 2004)

Finding hidden independent sets in interval graphs. - Therese Biedl; Brona Brejová; Erik D. Demaine; Angèle M. Hamel; Alejandro López-Ortiz; Tomás Vinar (Theor. Comput. Sci., 2004)

Optimal Scheduling of Contract Algorithms for Anytime Problems. - Alejandro López-Ortiz; Spyros Angelopoulos 001; Angèle M. Hamel (AAAI, 2006)

Sorting with networks of data structures. - Therese Biedl; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; J. Ian Munro (Discret. Appl. Math., 2010)

Lattice Path Proofs of Extended Bressoud-Wei and Koike Skew Schur Function Identities. - Angèle M. Hamel; Ronald C. King (Electron. J. Comb., 2011)

Extended Bressoud-Wei and Koike skew Schur function identities. - Angèle M. Hamel; Ronald C. King (J. Comb. Theory A, 2011)

ALPINe: Another Location Privacy Information Network. - Jean-Charles Grégoire; Angèle M. Hamel (ANT/MobiWIS, 2011)

Bijective Proof of a Symplectic Dual Pair Identity. - Angèle M. Hamel; Ronald C. King (SIAM J. Discret. Math., 2011)

Review of enumerative combinatorics, volume 1, second edition by Richard P. Stanley. - Angèle M. Hamel (SIGACT News, 2013)

On scheduling live media streaming in the cloud - A study. - Jean-Charles Grégoire; Angèle M. Hamel (WoWMoM, 2014)

Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving. - Alejandro López-Ortiz; Spyros Angelopoulos 001; Angèle M. Hamel (J. Artif. Intell. Res., 2014)

Tokuyama's Identity for Factorial Schur $P$ and $Q$ Functions. - Angèle M. Hamel; Ronald C. King (Electron. J. Comb., 2015)

A Coloring Algorithm for $4K_1$-free line graphs. - Dallas J. Fraser; Angèle M. Hamel; Chính T. Hoàng (CoRR, 2015)

Half-turn symmetric alternating sign matrices and Tokuyama type factorisation for orthogonal group characters. - Angèle M. Hamel; Ronald C. King (J. Comb. Theory A, 2015)

Models for video-on-demand scheduling with costs. - Jean-Charles Grégoire; Angèle M. Hamel (EURO J. Comput. Optim., 2016)

Pricing for a Hybrid Delivery Model of Video Streaming. - Jean-Charles Grégoire; Angèle M. Hamel; D. Marc Kilgour (SIGMETRICS Perform. Evaluation Rev., 2016)

Pooling Supply and Demand: Collaboration for Community Broadcasts. - Jean-Charles Grégoire; Angèle M. Hamel; D. Marc Kilgour (GECON, 2017)

On color-critical (P5, co-P5)-free graphs. - Harjinder S. Dhaliwal; Angèle M. Hamel; Chính T. Hoàng; Frédéric Maffray; Tyler J. D. McConnell; Stefan A. Panait (Discret. Appl. Math., 2017)

Characterizations of (4K1, C4, C5)-free graphs. - Dallas J. Fraser; Angèle M. Hamel; Chính T. Hoàng; Kevin Holmes; Tom P. LaMantia (Discret. Appl. Math., 2017)

Optimal scheduling of contract algorithms with soft deadlines. - Spyros Angelopoulos 001; Alejandro López-Ortiz; Angèle M. Hamel (J. Sched., 2017)

A coloring algorithm for -free line graphs. - Dallas J. Fraser; Angèle M. Hamel; Chính T. Hoàng; Frédéric Maffray (Discret. Appl. Math., 2018)

Factorial characters of the classical Lie groups. - Angèle M. Foley; Ronald C. King (Eur. J. Comb., 2018)

Factorial Q-functions and Tokuyama identities for classical Lie groups. - Angèle M. Foley; Ronald C. King (Eur. J. Comb., 2018)

On the Structure of (Even Hole, Kite)-Free Graphs. - Dallas J. Fraser; Angèle M. Hamel; Chính T. Hoàng (Graphs Comb., 2018)

Voting for Superior Services: How to Exploit Cloud Hierarchies. - Jean-Charles Grégoire; Angèle M. Foley (GECON, 2019)

Classes of Graphs with e-Positive Chromatic Symmetric Function. - Angèle M. Foley; Chính T. Hoàng; Owen D. Merkel (Electron. J. Comb., 2019)

On Coloring a Class of Claw-free Graphs: To the memory of Frédéric Maffray. - Yingjun Dai; Angèle M. Foley; Chính T. Hoàng (LAGOS, 2019)

Chromatic symmetric functions and H-free graphs. - Angèle M. Hamel; Chính T. Hoàng; Jake E. Tuero (Graphs Comb., 2019)

The Intersection of Two Vertex Coloring Problems. - Angèle M. Foley; Dallas J. Fraser; Chính T. Hoàng; Kevin Holmes; Tom P. LaMantia (Graphs Comb., 2020)

Fighting Reluctance: Engagement, Participation, and Trust. - Angèle M. Foley; Jean-Charles Grégoire (GECON, 2021)

Determinantal and Pfaffian identities for ninth variation skew Schur functions and Q-functions. - Angèle M. Foley; Ronald C. King (Eur. J. Comb., 2021)

Spiders and their Kin: An Investigation of Stanley's Chromatic Symmetric Function for Spiders and Related Graphs. - Angèle M. Foley; Joshua Kazdan; Larissa Kröll; Sofía Martínez Alberga; Oleksii Melnyk; Alexander Tenenbaum (Graphs Comb., 2021)

$H$-Chromatic Symmetric Functions. - Nancy Mae Eagles; Angèle M. Foley; Alice Huang; Elene Karangozishvili; Annan Yu (Electron. J. Comb., 2022)

On coloring a class of claw-free and hole-twin-free graphs. - Yingjun Dai; Angèle M. Foley; Chính T. Hoàng (Discret. Appl. Math., 2022)

Weighted scoring elections: is Borda best? - D. Marc Kilgour; Jean-Charles Grégoire; Angèle M. Foley (Soc. Choice Welf., 2022)

Correction to: Weighted scoring elections: is Borda best? - D. Marc Kilgour; Jean-Charles Grégoire; Angèle M. Foley (Soc. Choice Welf., 2022)

Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs. - Yingjun Dai; Angèle M. Foley; Chính T. Hoàng (Theor. Comput. Sci., 2022)

Condorcet efficiency: Weighted Bucklin vs. weighted scoring and Borda. - D. Marc Kilgour; Jean-Charles Grégoire; Angèle M. Foley (Math. Soc. Sci., 2025)