Gerhard J. Woeginger – författare

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.

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 selectedfrom 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.

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.

This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996.An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work.The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.

This volume contains the papers selected for presentation at IPCO VII, the Seventh Conference on Integer Programming and Combinatorial Optimization, Graz,Austria,June9{11,1999.Thismeetingisaforumforresearchersandpr- titioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, compu- tion, and applications of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu- tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nite programs. IPCO was established in 1988 when the rst IPCO program committee was formed. IPCO I took place in Waterloo (Canada) in 1990, IPCO II was held in Pittsburgh (USA) in 1992, IPCO III in Erice (Italy) 1993, IPCO IV in Cop- hagen (Denmark) 1995, IPCO V in Vancouver (Canada) 1996, and IPCO VI in Houston (USA) 1998.IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place: 1990, 1992, 1993, 1995,1996,1998,1999,2001,2002,2004,2005,2007,2008,::::::Since the MPS meeting is triennial, IPCO conferences are held twice in everythree-year period. As a rule, in even years IPCO is held somewhere in Northern America, and in odd years it is held somewhere in Europe. In response to the call for papers for IPCO'99, the program committee - ceived99submissions,indicatingastrongandgrowinginterestintheconference.

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.

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.

This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms; fixed-parameter tractability results; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; and implementation issues of parameterized and exact algorithms.