Target set selection problem for honeycomb networks

Testing Booleanity and the Uncertainty Principle

Testing first-order properties for subclasses of sparse graphs

Testing of random matrices

Textbook of Semi-discrete Calculus

The asymptotic behavior of Grassmannian codes

The Average Size of Giant Components Between the Double-Jump

The Bethe Partition Function of Log-supermodular Graphical Models

The black-and-white coloring problem on circle graphs

The Block Neighborhood

The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function

The Černy conjecture

The Choquet integral for the aggregation of interval scales in multicriteria decision making

The complexity of planar graph choosability

The complexity of tangent words

The complexity of the independence and matching clutter of a graph

The complexity of UNO

The Cost of Perfection for Matchings in Graphs

The Cover Time of Deterministic Random Walks

The Degree Distribution of Random k-Trees