default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYu Hin Au
Person information
- affiliation: University of Saskatchewan, Department of Mathematics and Statistics, Department of Mathematics and Statistics, Saskatoon, SK, Canada
- affiliation: Milwaukee School of Engineering, Department of Mathematics, Milwaukee, WI, USA
- affiliation (PhD 2014): University of Waterloo, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2014
[b1]Yu Hin Au:
A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization. University of Waterloo, Ontario, Canada, 2014
Journal Articles
- 2024
- [j7]Yu Hin (Gary) Au:
Decompositions of Unit Hypercubes and the Reversion of a Generalized Möbius Series. Electron. J. Comb. 31(2) (2024) - 2020
- [j6]Yu Hin (Gary) Au, Fatemeh Bagherzadeh, Murray R. Bremner:
Enumeration and Asymptotic Formulas for Rectangular Partitions of the Hypercube. J. Integer Seq. 23(1): 20.1.4 (2020) - 2018
- [j5]Yu Hin (Gary) Au, Levent Tunçel
:
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. Discret. Optim. 27: 103-129 (2018) - 2016
- [j4]Yu Hin Au, Levent Tunçel:
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods. SIAM J. Discret. Math. 30(1): 411-451 (2016) - 2015
- [j3]Yu Hin Au:
Generalized de Bruijn words for primitive words and powers. Discret. Math. 338(12): 2320-2331 (2015) - 2011
- [j2]Yu Hin Au, Aaron Robertson, Jeffrey O. Shallit:
Van der Waerden's Theorem and Avoidability in Words. Integers 11: A7 (2011) - 2009
- [j1]Yu Hin Au, Levent Tunçel:
On the polyhedral lift-and-project methods and the fractional stable set polytope. Discret. Optim. 6(2): 206-213 (2009)
Conference and Workshop Papers
- 2011
- [c1]Yu Hin Au, Levent Tunçel:
Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. IPCO 2011: 14-26
Informal and Other Publications
- 2024
- [i6]Yu Hin Au, Levent Tunçel:
On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász-Schrijver SDP Hierarchy. CoRR abs/2401.01476 (2024) - 2023
- [i5]Yu Hin Au, Levent Tunçel:
Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator. CoRR abs/2303.08971 (2023) - 2020
- [i4]Yu Hin Au, Nathan Lindzey, Levent Tunçel:
Matchings, hypergraphs, association schemes, and semidefinite optimization. CoRR abs/2008.08628 (2020) - 2016
- [i3]Yu Hin Au, Levent Tunçel:
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. CoRR abs/1608.07647 (2016) - 2013
- [i2]Yu Hin Au, Levent Tunçel:
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods. CoRR abs/1312.5972 (2013) - 2008
- [i1]Yu Hin Au, Aaron Robertson, Jeffrey O. Shallit:
Van der Waerden's Theorem and Avoidability in Words. CoRR abs/0812.2466 (2008)
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 2024-05-31 18:42 CEST 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:
