Cs-Dm
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
Not So Easy Problems for Tree Decomposable Graphs
A further generalization of the colourful Caratheodory theorem
Sparse Sums of Positive Semidefinite Matrices
A Step towards an Easy Interconversion of Various Number Systems
Computing the obstacle number of a plane graph
How Not to Characterize Planar-emulable Graphs
Geometry of Complex Networks and Topological Centrality
Applications of Derandomization Theory in Coding
A simple algorithm for random colouring G(n, d/n) using (2+epsilon)d colours
Upgrading Subgroup Triple Product Property Triples
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets
Bottom-Left Placement Theorem for Rectangle Packing
On the Complexity of Planar Covering of Small Graphs
Matroidal Degree-Bounded Minimum Spanning Trees
Approximating the Permanent with Fractional Belief Propagation
Linear Index Coding via Semidefinite Programming
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal
Bounds for graph regularity and removal lemmas
On counting untyped lambda terms
Greedy Algorithms for Multi-Queue Buffer Management with Class Segregation
Velocity Polytopes of Periodic Graphs and a No-Go Theorem for Digital Physics
