Pascal Su

According to our database, Pascal Su authored at least 8 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Mastermind with a linear number of queries.

Anders Martinsson, Pascal Su

Comb. Probab. Comput., March, 2024

2021

Properties of Randomness in Graph Theory and Algorithms.

Pascal Su

PhD thesis, 2021

<i>K</i>_<i>r</i>-factors in graphs with low independence number.

Charlotte Knierim, Pascal Su

J. Comb. Theory B, 2021

An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability.

Rajko Nenadov, Angelika Steger, Pascal Su

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2019

Improved Bounds on the Multicolor Ramsey Numbers of Paths and Even Cycles.

Charlotte Knierim, Pascal Su

Electron. J. Comb., 2019

2018

Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees.

Pawel Gawrychowski, Fabian Kuhn, Jakub Lopuszanski, Konstantinos Panagiotou, Pascal Su

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes.

Fabian Kuhn, Konstantinos Panagiotou, Pascal Su

CoRR, 2017

2015

Bipartite Kneser graphs are Hamiltonian.

Torsten Mütze, Pascal Su

Electron. Notes Discret. Math., 2015