Whether the clique-width of graphs in a certain class of graphs is bounded or not, is an
important question from an algorithmic point of view, as many problems that are NP-hard in …

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

The History of Degenerate (Bipartite) Extremal Graph Problems Page 1 BOLYAI SOCIETY
Erdos Centennial MATHEMATICAL STUDIES, 25 pp. 169–264. The History of Degenerate (Bipartite) …

Let G=(V, E) be an undirected weighted graph with| V|= n and| E|= m. Let k≥ 1 be an
integer. We show that G=(V, E) can be preprocessed in O (kmn 1/k) expected time …

Preface These notes are intended for a general mathematical audience. In particular we
have in mind that they could be used as a course for undergraduates. They contain an …

The question of what can be computed, and how efficiently, is at the core of computer
science. Not surprisingly, in distributed systems and networking research, an equally …

Abstract A $(k, g) $-cage is a $ k $-regular graph of girth $ g $ of minimum order. In this
survey, we present the results of over 50 years of searches for cages. We present the …

We give time lower bounds for the distributed approximation of minimum vertex cover (MVC)
and related problems such as minimum dominating set (MDS). In k communication rounds …

This book is a tribute to Paul Erd\H {o} s, the wandering mathematician once described as
the" prince of problem solvers and the absolute monarch of problem posers." It examines …

Submodular function maximization is a central problem in combinatorial optimization,
generalizing many important NP-hard problems including max cut in digraphs, graphs, and …