Cs-Dm
On the approximability of minmax (regret) network optimization problems
Modelling Mobility: A Discrete Revolution
On the independence polynomial of an antiregular graph
The Plane-Width of Graphs
On the vertices of the k-addiive core
Randomly colouring simple hypergraphs
Decomposition of Binary Signed-Graphic Matroids
Unfolding Manhattan Towers
Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound
Monotonic Mappings Invariant Linearisation of Finite Posets
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
An integration of Eulers pentagonal partition
Some New Equiprojective Polyhedra
Parameterizing by the Number of Numbers
Compressive Sensing over the Grassmann Manifold: a Unified Geometric Framework
Component structure of the vacant set induced by a random walk on a random graph
Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks
Watching Systems in graphs: an extension of Identifying Codes
Probabilistic cellular automata, invariant measures, and perfect sampling
Boxicity of Line Graphs
Coxeter Groups and Asynchronous Cellular Automata
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
