Swee Hong Chan

18 papers A* 1Journal 17
YearRankTypeTitle / Venue / Authors
2024 J jnl
Computational complexity of counting coincidences.
Theor. Comput. Sci.
Swee Hong Chan, Igor Pak
2024 A* conf
Equality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial Hierarchy.
STOC
Swee Hong Chan, Igor Pak
2024 J jnl
Equality cases of the Stanley-Yan log-concave matroid inequality.
CoRR
Swee Hong Chan, Igor Pak
2024 J jnl
Linear extensions and continued fractions.
Eur. J. Comb.
Swee Hong Chan, Igor Pak
2023 J jnl
Computational complexity of counting coincidences.
CoRR
Swee Hong Chan, Igor Pak
2023 J jnl
Effective Poset Inequalities.
SIAM J. Discret. Math.
Swee Hong Chan, Igor Pak, Greta Panova
2023 J jnl
Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy.
CoRR
Swee Hong Chan, Igor Pak
2023 J jnl
Extensions of the Kahn-Saks inequality for posets of width two.
Comb. Theory
Swee Hong Chan, Igor Pak, Greta Panova
2023 J jnl
Linear extensions of finite posets.
CoRR
Swee Hong Chan, Igor Pak
2022 J jnl
Effective poset inequalities.
CoRR
Swee Hong Chan, Igor Pak, Greta Panova
2022 J jnl
Log-Concavity in Planar Random Walks.
Comb.
Swee Hong Chan, Igor Pak, Greta Panova
2021 J jnl
Log-concave poset inequalities.
CoRR
Swee Hong Chan, Igor Pak
2021 J jnl
Sorting probability of Catalan posets.
Adv. Appl. Math.
Swee Hong Chan, Igor Pak, Greta Panova
2019 J jnl
A Bijection between Necklaces and Multisets with Divisible Subset Sum.
Electron. J. Comb.
Swee Hong Chan
2019 J jnl
Rotor Walks on Transient Graphs and the Wired Spanning Forest.
SIAM J. Discret. Math.
Swee Hong Chan
2018 J jnl
Abelian networks IV. Dynamics of nonhalting networks.
CoRR
Swee Hong Chan, Lionel Levine
2018 J jnl
Abelian sandpile model and Biggs-Merino polynomial for directed graphs.
J. Comb. Theory A
Swee Hong Chan
2015 J jnl
Quasi-periodic Tiling with Multiplicity: A Lattice Enumeration Approach.
Discret. Comput. Geom.
Swee Hong Chan