34 citations · 40 across the 6 of their papers we have counts for
7 papers
An O(n) time algorithm for finding Hamilton cycles with high probability
Rajko Nenadov, Angelika Steger, Pascal Su
We design a randomized algorithm that finds a Hamilton cycle in time with high probability in a random graph with edge probability . T…
Mastermind with a Linear Number of Queries
Anders Martinsson, Pascal Su
Since the 1960s Mastermind has been studied for the combinatorial and information theoretical interest the game has to offer. Many results have been discovered starting with Erdős…
The Chromatic Number of Dense Random Block Graphs
Anders Martinsson, Konstantinos Panagiotou, Pascal Su +1
The chromatic number of a graph , that is, the smallest number of colors required to color the vertices of so that no two adjacent vertices are assigned the same colo…
-Factors in Graphs with Low Independence Number
Charlotte Knierim, Pascal Su
A classical result by Hajnal and Szemerédi from 1970 determines the minimal degree conditions necessary to guarantee for a graph to contain a -factor. Namely, any graph on …
Improved bounds on the multicolor Ramsey numbers of paths and even cycles
Charlotte Knierim, Pascal Su
We study the multicolor Ramsey numbers for paths and even cycles, and , which are the smallest integers such that every coloring of the complete graph $K_N…
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes
Fabian Kuhn, Konstantinos Panagiotou, Pascal Su
We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a giv…
Bipartite Kneser graphs are Hamiltonian
Torsten Mütze, Pascal Su
For integers and the Kneser graph has as vertices all -element subsets of and an edge between any two vertices (=sets) th…