This volume presents cutting-edge research in theoretical computer science and discrete mathematics. The 20th International Conference on Computing and Combinatorics (COCOON 2014) brought together researchers to share advancements in areas such as sampling and randomized methods, logic, algebra, and automata. The collection explores parameterized complexity, computational complexity, and algorithms for computational biology and geometry. Additionally, it covers approximation algorithms, graph theory, game theory, cryptography, scheduling algorithms, circuit complexity, and computational social networks.

This collection of papers from the 2014 COCOON conference offers a snapshot of current research in theoretical computer science and combinatorics. The breadth of topics, from algorithmic complexity to computational social networks, suggests a text aimed at specialists and researchers in these fields. The inclusion of papers from a dedicated workshop on computational social networks indicates a focus on emerging interdisciplinary areas.