Math-Co
Palette-colouring: a belief-propagation approach
On the approximability and exact algorithms for vector domination and related problems in graphs
Dynamic Programming for Graphs on Surfaces
Constraint satisfaction problems in clausal form
Packing directed circuits exactly
Simplicial blowups and discrete normal surfaces in simpcomp
Small (2,s)-colorable graphs without 1-obstacle representations
Evolving Graph Representation and Visualization
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
