Bipartite Kneser graphs are Hamiltonian. - Torsten Mütze; Pascal Su (Electron. Notes Discret. Math., 2015)

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes. - Fabian Kuhn; Konstantinos Panagiotou; Pascal Su (CoRR, 2017)

Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. - Pawel Gawrychowski; Fabian Kuhn; Jakub Lopuszanski; Konstantinos Panagiotou; Pascal Su (SODA, 2018)

Improved Bounds on the Multicolor Ramsey Numbers of Paths and Even Cycles. - Charlotte Knierim; Pascal Su (Electron. J. Comb., 2019)

An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability. - Rajko Nenadov; Angelika Steger; Pascal Su (ITCS, 2021)

Kr-factors in graphs with low independence number. - Charlotte Knierim; Pascal Su (J. Comb. Theory B, 2021)

Properties of Randomness in Graph Theory and Algorithms. - Pascal Su (2021)

Mastermind with a linear number of queries. - Anders Martinsson; Pascal Su (Comb. Probab. Comput., 2024)