Gerhard J. Woeginger

Oktay Günlük

This book constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New York, USA in June 2011. The 33 papers presented were carefully reviewed and selected from 110 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings

Integer Programming and Combinatorial Optimization

Alexander S. Kulikov

This book constitutes the proceedings of the 11th International Computer Science Symposium in Russia, CSR 2016, held in St. Petersburg, Russia, in June 2016. The 28 full papers presented in this volume were carefully reviewed and selected from 71 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; computational models and concepts; algorithms for concurrent and distributed systems, networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods.

11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings

Computer Science – Theory and Applications

Amos Fiat

The State of the Art

Online Algorithms

Joachim Parrow

Jos C.M. Baeten

Jan Karel Lenstra

The refereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003. The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems.

30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings

Automata, Languages and Programming

Hans L. Bodlaender

This book constitutes the revised selected papers of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2017, held in Eindhoven, The Netherlands, in June 2017. The 31 full papers presented in this volume were carefully reviewed and selected from 71 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.

43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers

Graph-Theoretic Concepts in Computer Science

Gerhard J. Woeginger

Books

Your next favorite book is out there