default search action
Swee Hong Chan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Swee Hong Chan, Igor Pak:
Linear extensions and continued fractions. Eur. J. Comb. 122: 104018 (2024) - [j9]Swee Hong Chan
, Igor Pak:
Computational complexity of counting coincidences. Theor. Comput. Sci. 1015: 114776 (2024) - [c1]Swee Hong Chan
Equality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial Hierarchy. STOC 2024: 875-883 - [i7]Swee Hong Chan, Igor Pak:
Equality cases of the Stanley-Yan log-concave matroid inequality. CoRR abs/2407.19608 (2024) - 2023
- [j8]Swee Hong Chan, Igor Pak, Greta Panova:
Extensions of the Kahn-Saks inequality for posets of width two. Comb. Theory 3(1) (2023) - [j7]Swee Hong Chan, Igor Pak, Greta Panova:
Effective Poset Inequalities. SIAM J. Discret. Math. 37(3): 1842-1880 (2023) - [i6]Swee Hong Chan, Igor Pak:
Computational complexity of counting coincidences. CoRR abs/2308.10214 (2023) - [i5]Swee Hong Chan, Igor Pak:
Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy. CoRR abs/2309.05764 (2023) - [i4]Swee Hong Chan, Igor Pak:
Linear extensions of finite posets. CoRR abs/2311.02743 (2023) - 2022
- [j6]Swee Hong Chan, Igor Pak, Greta Panova:
Log-Concavity in Planar Random Walks. Comb. 42(6): 1011-1026 (2022) - [i3]Swee Hong Chan, Igor Pak, Greta Panova:
Effective poset inequalities. CoRR abs/2205.02798 (2022) - 2021
- [j5]Swee Hong Chan, Igor Pak, Greta Panova:
Sorting probability of Catalan posets. Adv. Appl. Math. 129: 102221 (2021) - [i2]Swee Hong Chan, Igor Pak:
Log-concave poset inequalities. CoRR abs/2110.10740 (2021)
2010 – 2019
- 2019
- [j4]Swee Hong Chan:
A Bijection between Necklaces and Multisets with Divisible Subset Sum. Electron. J. Comb. 26(1): 1 (2019) - [j3]Swee Hong Chan
Rotor Walks on Transient Graphs and the Wired Spanning Forest. SIAM J. Discret. Math. 33(4): 2369-2393 (2019) - 2018
- [j2]Swee Hong Chan
Abelian sandpile model and Biggs-Merino polynomial for directed graphs. J. Comb. Theory A 154: 145-171 (2018) - [i1]Swee Hong Chan
Abelian networks IV. Dynamics of nonhalting networks. CoRR abs/1804.03322 (2018) - 2015
- [j1]Swee Hong Chan
Quasi-periodic Tiling with Multiplicity: A Lattice Enumeration Approach. Discret. Comput. Geom. 54(3): 647-662 (2015)
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-12-10 20:49 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: