default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAngèle M. Foley
Person information
- affiliation: Wilfrid Laurier University, Waterloo, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j35]Nancy Mae Eagles, Angèle M. Foley, Alice Huang, Elene Karangozishvili, Annan Yu
:
$H$-Chromatic Symmetric Functions. Electron. J. Comb. 29(1) (2022)- [j34]Yingjun Dai, Angèle M. Foley, Chính T. Hoàng:
On coloring a class of claw-free and hole-twin-free graphs. Discret. Appl. Math. 323: 162-170 (2022) - [j33]D. Marc Kilgour, Jean-Charles Grégoire, Angèle M. Foley:
Weighted scoring elections: is Borda best? Soc. Choice Welf. 58(2): 365-391 (2022) - [j32]D. Marc Kilgour, Jean-Charles Grégoire, Angèle M. Foley:
Correction to: Weighted scoring elections: is Borda best? Soc. Choice Welf. 58(2): 393-394 (2022) - [j31]Yingjun Dai, Angèle M. Foley, Chính T. Hoàng:
Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs. Theor. Comput. Sci. 914: 14-22 (2022) - 2021
- [j30]Angèle M. Foley, Ronald C. King:
Determinantal and Pfaffian identities for ninth variation skew Schur functions and Q-functions. Eur. J. Comb. 93: 103271 (2021) - [j29]Angèle M. Foley, Joshua Kazdan, Larissa Kröll, Sofía Martínez Alberga, Oleksii Melnyk, Alexander Tenenbaum:
Spiders and their Kin: An Investigation of Stanley's Chromatic Symmetric Function for Spiders and Related Graphs. Graphs Comb. 37(1): 87-110 (2021) - 2020
- [j28]Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia:
The Intersection of Two Vertex Coloring Problems. Graphs Comb. 36(1): 125-138 (2020) - 2019
- [j27]Angèle M. Foley, Chính T. Hoàng, Owen D. Merkel:
Classes of Graphs with e-Positive Chromatic Symmetric Function. Electron. J. Comb. 26(3): 3 (2019) - [j26]Angèle M. Hamel, Chính T. Hoàng, Jake E. Tuero:
Chromatic symmetric functions and H-free graphs. Graphs Comb. 35(4): 815-825 (2019) - 2018
- [j25]Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray:
A coloring algorithm for -free line graphs. Discret. Appl. Math. 234: 76-85 (2018) - [j24]Angèle M. Foley, Ronald C. King:
Factorial characters of the classical Lie groups. Eur. J. Comb. 70: 325-353 (2018) - [j23]Angèle M. Foley, Ronald C. King:
Factorial Q-functions and Tokuyama identities for classical Lie groups. Eur. J. Comb. 73: 89-113 (2018) - [j22]Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng:
On the Structure of (Even Hole, Kite)-Free Graphs. Graphs Comb. 34(5): 989-999 (2018) - 2017
- [j21]Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait:
On color-critical (P5, co-P5)-free graphs. Discret. Appl. Math. 216: 142-148 (2017) - [j20]Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia:
Characterizations of (4K1, C4, C5)-free graphs. Discret. Appl. Math. 231: 166-174 (2017) - [j19]Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel:
Optimal scheduling of contract algorithms with soft deadlines. J. Sched. 20(3): 267-277 (2017) - 2016
- [j18]Jean-Charles Grégoire, Angèle M. Hamel:
Models for video-on-demand scheduling with costs. EURO J. Comput. Optim. 4(2): 125-135 (2016) - [j17]Jean-Charles Grégoire, Angèle M. Hamel, D. Marc Kilgour:
Pricing for a Hybrid Delivery Model of Video Streaming. SIGMETRICS Perform. Evaluation Rev. 44(3): 33-36 (2016) - 2015
- [j16]Angèle M. Hamel, Ronald C. King:
Tokuyama's Identity for Factorial Schur $P$ and $Q$ Functions. Electron. J. Comb. 22(2): 2 (2015) - [j15]Angèle M. Hamel, Ronald C. King:
Half-turn symmetric alternating sign matrices and Tokuyama type factorisation for orthogonal group characters. J. Comb. Theory A 131: 1-31 (2015) - 2014
- [j14]Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving. J. Artif. Intell. Res. 51: 533-554 (2014) - 2013
- [j13]Angèle M. Hamel:
Review of enumerative combinatorics, volume 1, second edition by Richard P. Stanley. SIGACT News 44(3): 28-31 (2013) - 2011
- [j12]Angèle M. Hamel, Ronald C. King:
Lattice Path Proofs of Extended Bressoud-Wei and Koike Skew Schur Function Identities. Electron. J. Comb. 18(1) (2011) - [j11]Angèle M. Hamel, Ronald C. King:
Extended Bressoud-Wei and Koike skew Schur function identities. J. Comb. Theory A 118(2): 545-557 (2011) - [j10]Angèle M. Hamel, Ronald C. King:
Bijective Proof of a Symplectic Dual Pair Identity. SIAM J. Discret. Math. 25(2): 539-560 (2011) - 2010
- [j9]Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro:
Sorting with networks of data structures. Discret. Appl. Math. 158(15): 1579-1586 (2010) - 2004
- [j8]Therese 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) - [j7]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
- [j6]Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Nathan Srebro, Angèle M. Hamel, Tommi S. Jaakkola:
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. Bioinform. 19(9): 1070-1078 (2003) - 2001
- [j5]Angèle M. Hamel:
Pfaffian Identities: A Combinatorial Approach. J. Comb. Theory A 94(2): 205-217 (2001) - 1997
- [j4]Angèle M. Hamel, Michael Anthony Steel:
The Length of a Leaf Coloration on a Random Binary Tree. SIAM J. Discret. Math. 10(3): 359-372 (1997) - 1996
- [j3]Angèle M. Hamel:
Pfaffians and Determinants for Schur Q-Functions. J. Comb. Theory A 75(2): 328-340 (1996) - 1995
- [j2]Angèle M. Hamel, Ian P. Goulden:
Planar decompositions of tableaux and Schur function determinants. Eur. J. Comb. 16(5): 461-477 (1995) - [j1]I. P. Goulden, Angèle M. Hamel:
Shift Operators and Factorial Symmetric Functions. J. Comb. Theory A 69(1): 51-60 (1995)
Conference and Workshop Papers
- 2021
- [c11]Angèle M. Foley, Jean-Charles Grégoire:
Fighting Reluctance: Engagement, Participation, and Trust. GECON 2021: 185-188 - 2019
- [c10]Jean-Charles Grégoire, Angèle M. Foley:
Voting for Superior Services: How to Exploit Cloud Hierarchies. GECON 2019: 63-70 - [c9]Yingjun Dai, Angèle M. Foley, Chính T. Hoàng:
On Coloring a Class of Claw-free Graphs: To the memory of Frédéric Maffray. LAGOS 2019: 369-377 - 2017
- [c8]Jean-Charles Grégoire, Angèle M. Hamel, D. Marc Kilgour:
Pooling Supply and Demand: Collaboration for Community Broadcasts. GECON 2017: 106-116 - 2014
- [c7]Jean-Charles Grégoire, Angèle M. Hamel:
On scheduling live media streaming in the cloud - A study. WoWMoM 2014: 1-6 - 2011
- [c6]Jean-Charles Grégoire, Angèle M. Hamel:
ALPINe: Another Location Privacy Information Network. ANT/MobiWIS 2011: 601-609 - 2008
- [c5]Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms with Soft Deadlines. AAAI 2008: 868-873 - 2006
- [c4]Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problems. AAAI 2006: 874-879 - 2004
- [c3]Jean-Charles Grégoire, Angèle M. Hamel:
You Can Get There from Here: Routing in the Internet. CAAN 2004: 173-182 - 2003
- [c2]Therese 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 - 2002
- [c1]Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Angèle M. Hamel, Tommi S. Jaakkola, Nathan Srebro:
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. WABI 2002: 506-520
Editorship
- 2005
- [e1]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. Lecture Notes in Computer Science 3405, Springer 2005, ISBN 3-540-27873-7 [contents]
Informal and Other Publications
- 2019
- [i2]Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia:
The intersection of two vertex coloring problems. CoRR abs/1904.08180 (2019) - 2015
- [i1]Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng:
A Coloring Algorithm for $4K_1$-free line graphs. CoRR abs/1506.05719 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
