Cs-Dm
Patience of Matrix Games
Optimal Cuts and Bisections on the Real Line in Polynomial Time
On Threshold Models over Finite Networks
On the Number of Disjoint Pairs of S-permutation Matrices
On the threshold-width of graphs
Computing with voting trees
Beyond the Vizings bound for at most seven colors
Pirates and Treasure
Linear kernels and single-exponential algorithms via protrusion decompositions
The Cover Time of Random Walks on Graphs
Formalizing Frankls Conjecture: FC-families
On Rainbow Cycles and Paths
Total Game Coloring of Graphs
The Collatz conjecture and De Bruijn graphs
Non-redundant random generation algorithms for weighted context-free languages
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems
The v{C}erny conjecture
Cactus Graphs and Some Algorithms
Faster Approximation of Max Flow for Directed Graphs
Independent subsets of powers of paths, and Fibonacci cubes
Reduction of constraint systems
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology
