Pascal Su

ETH Zürich
Pascal Su
Institut für Theoretische Informatik
CAB G 33.2
Universitätstrasse 6
8092 Zürich

Phone: +41 44 632 55 12


Bipartite Kneser graphs are Hamiltonian
(joint with T.Mütze)

Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees
(joint with P.Gawrychowski, F.Kuhn, J.Łopuszański, K.Panagiotou)

Improved bounds on the multicolor Ramsey numbers of paths and even cycles
(joint with C.Knierim)

K-factors in graphs with low independence number
(joint with C.Knierim)

An O(n) time algorithm for finding Hamilton cycles with high probability
(joint with R.Nenadov and A.Steger)

The Chromatic Number of Dense Random Block Graphs (preprint)
(joint with A.Martinsson, K.Panagiotou and M.Trujić)

Mastermind with a linear number of queries (preprint)
(joint with A.Martinsson)