Cs-Dm
An f-chromatic spanning forest of edge-colored complete bipartite graphs
An analysis of a random algorithm for estimating all the matchings
The Graver Complexity of Integer Programming
A Full Derandomization of Schoenings k-SAT Algorithm
On Bounded Integer Programming
The Complexity of Approximating Bounded-Degree Boolean sharp CSP
Twice-Ramanujan Sparsifiers
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
Matrix Graph Grammars as a Model of Computation
The Complexity of Partition Functions on Hermitian Matrices
A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Periodicity in tilings
On the Shuffle Automaton Size for Words
Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels
Monadic second-order model-checking on decomposable matroids
Exact Exponential Time Algorithms for Max Internal Spanning Tree
The finite harmonic oscillator and its associated sequences
Decisive Markov Chains
Putting Dots in Triangles
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Interval Edge Colorings of Mobius Ladders
