Fedor V. Fomin – författare

Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors provide an overview of basic methods and important results, with accessible explanations of the most recent advances in the area, such as meta-kernelization, representative sets, polynomial lower bounds, and lossy kernelization. The text is divided into four parts, which cover the different theoretical aspects of the area: upper bounds, meta-theorems, lower bounds, and beyond kernelization. The methods are demonstrated through extensive examples using a single data set. Written to be self-contained, the book only requires a basic background in algorithmics and will be of use to professionals, researchers and graduate students in theoretical computer science, optimization, combinatorics, and related fields.

This Festschrift was published in honor of Hans L. advisor, Jan van Leeuwen. Chapter “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.

Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.

This book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018. The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions. combinatorics in computer science;

The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held on the island of Sotra close to the city of Bergen on the west coast of Norway. The workshop was organized by the Algorithms Research Group at the Department of Informatics, University of Bergen, and it took place from June 22 to June 24. The 78 participants of WG 2006 came from the universities and research institutes of 17 di?erent countries. The WG 2006 workshop continues the series of 31 previous WG workshops. Since 1975,WG has taken place 20 times in Germany, four times in The Neth- lands, twice in Austria as well as oncein France,in Italy, in Slovakia,in Switz- land and in the Czech Republic, and has now been held for the ?rst time in Norway. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer s- ence, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The talks showed how recent researchresults from algorithmic graph theory can be used in computer science and which graph-theoreticquestions arisefrom new developments in computer science. There were two fascinating invited lectures by Hans Bodlaender (Utrecht, The Netherlands) and Tandy Warnow (Austin, USA).

The Workshop on Parameterized and Exact Computation (IWPEC) is an - ternational workshop series that covers research in all aspects of parameterized and exact algorithms and complexity, and especially encourages the study of parameterized and exact computations for real-world applications and algori- mic engineering. The goal of the workshop is to present recent research results, including signi?cant work-in-progress,and to identify and explore directions for future research. IWPEC2009wasthefourthworkshopintheseries,heldinCopenhagen,D- mark, during September 10-11, 2009. The workshop was part of ALGO 2009, which also hosted the 17th European Symposium on Algorithms (ESA 2009), the 9th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2009), and the 7th Workshop on Appr- imation and Online Algorithms (WAOA 2009). Three previous meetings of the IWPEC series were held in Bergen, Norway, 2004, Zu ..rich, Switzerland, 2006, and Victoria, Canada, 2008. At IWPEC 2009, we had two plenary speakers,Noga Alon (Tel Aviv Univ- sity, Israel) and Hans Bodlaender (Utrecht University, The Netherlands), giving 50-minutetalkseach.ProfessorAlonspokeon"ColorCoding,BalancedHashing andApproximateCounting," andProfessorBodlaenderon"Kernelization:New Upper and Lower Bound Techniques." Their respective abstracts accompanying the talks are included in these proceedings. InresponsetotheCallforPapers,52papersweresubmitted.Eachsubmission was reviewed by at least three reviewers (most by at least four). The reviewers were either Program Committee members or invited external reviewers. The ProgramCommittee held electronic meetings using the EasyChair system, went throughthoroughdiscussions,andselected25ofthesubmissionsforpresentation at the workshop and inclusion in this LNCS volume.

For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in ?nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able? De?nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi?cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.

For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in ?nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able? De?nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi?cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.

Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.

This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures.

This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions.

This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions.