Ulam's Conjecture is True for Connected Graphs

Understanding edge-connectivity in the Internet through core-decomposition

Uniform sampling of undirected and directed graphs with a fixed degree sequence

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

Unsatisfiable (k,(4*2^k/k))-CNF formulas

Unsatisfiable CNF Formulas need many Conflicts

Unsatisfiable Linear CNF Formulas Are Large and Complex

Unsatisfiable Linear k-CNFs Exist, for every k

Untangling planar graphs from a specified vertex position - Hard cases

Upper Bounds for the Number of Hamiltonian Cycles

Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs

Using Grossone to count the number of elements of infinite sets and the connection with bijections