Math-Co
A complex network approach to robustness and vulnerability of spatially organized water distribution networks
Conflict-Free Coloring Made Stronger
Linear Codes, Target Function Classes, and Network Computing Capacity
The Two Bicliques Problem is in NP intersection coNP
Extension results for boolean maps and a class of systems of linear inequalities
Connectivity threshold for Bluetooth graphs
Dense locally testable codes cannot have constant rate and distance
On cobweb posets most relevant codings
The Complexity of Approximately Counting Stable Roommate Assignments
Logical complexity of graphs: a survey
Fast Mojette Transform for Discrete Tomography
Some 0/1 polytopes need exponential size extended formulations
Optimal Polygonal Representation of Planar Graphs
Universal Cycles for Minimum Coverings of Pairs by Triples, with Application to 2-Radius Sequences
Asymptotic Enumeration of Non-crossing Partitions on Surfaces
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs
On minimum integer representations of weighted games
Acyclic and Star Colorings of Cographs
Cops and Robber Game with a Fast Robber on Interval, Chordal, and Planar Graphs
The Cover Time of Deterministic Random Walks
Minimal non-extensible precolorings and implicit-relations
On Symmetry of Independence Polynomials
