Paperback. Zustand: FINE. Clean, unworn copy. No writing or markings. Binding is sound and tight. 24 cm 239 pages. Includes bibliographical references and index. x, 238 p. : ill. -- Please feel free to request additional information, or detailed photos. Ships with tracking and insurance. Canadian orders ship via courier.
Verlag: Springer-Verlag New York Inc, 2010
ISBN 10: 3642174922 ISBN 13: 9783642174926
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 78,52
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 238 pages. 9.00x6.00x0.25 inches. In Stock.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 79,71
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 515 pages. 9.50x6.25x1.25 inches. In Stock.
Verlag: Cambridge University Press, 2019
ISBN 10: 1107057760 ISBN 13: 9781107057760
Sprache: Englisch
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 90,48
Anzahl: 4 verfügbar
In den WarenkorbZustand: New.
Verlag: Springer Berlin Heidelberg, 2010
ISBN 10: 3642174922 ISBN 13: 9783642174926
Sprache: Englisch
Anbieter: moluna, Greven, Deutschland
Zustand: New. Unique visibilityState-of-the-art surveyFast-track conference proceedingsThe Complexity of Satisfaction on Sparse Graphs.- Protrusions in Graphs and Their Applications.- Parameterized Complexity Results in Symmetry Breaking.- On the.
EUR 120,04
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 632 pages. 9.50x6.50x1.50 inches. In Stock.
Verlag: Springer, Berlin, Springer Berlin Heidelberg, Springer, 2010
ISBN 10: 3642174922 ISBN 13: 9783642174926
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Neuware - TheInternationalSymposiumonParameterizedandExactComputation(IPEC, formerly IWPEC) is an international symposium series that covers research in all aspects of parameterized and exact algorithms and complexity. Started in 2004 as a biennial workshop, it became an annual event from 2008. The four previous meetings of the IPEC/IWPEC series were held in Bergen, Norway(2004),Zu rich,Switzerland(2006),Victoria,Canada(2008)andCop- hagen, Denmark (2009). On recommendations of the Steering Committee, from this year, the word symposium replaces the word workshop in the name, and it gets a new abbreviation IPEC (rhyming with the old one IWPEC). IPEC 2010 was the fth symposium in the series, held in Chennai, India, during December 13-15, 2010. The symposium was co-located with the 30th Foundations of Software Technology and Theoretical Computer Science conf- ence (FSTTCS 2010), a premier theory conference in India. At IPEC 2010, we had three plenary speakers: Anuj Dawar (University of Cambridge, UK), Fedor V. Fomin (University of Bergen, Norway) and Toby Walsh (NICTA and University of New South Wales, Australia). The abstracts accompanyingtheirtalksareincludedintheseproceedings.Wethankthespe- ers for accepting our invitation and for their abstracts. Inresponseto the callforpapers,32papersweresubmitted. Eachsubmission was reviewed by at least four reviewers. The reviewers were either Program Committee members or invited external reviewers. The Program Committee held electronic meetings using the EasyChair system, went through extensive discussions,andselected19ofthesubmissionsforpresentationatthes ymposium and inclusion in this LNCS volume.
Verlag: Springer International Publishing, 2015
ISBN 10: 3319212745 ISBN 13: 9783319212746
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Gebundene Ausgabe. Zustand: Sehr gut. Gebraucht - Sehr gut SG - leichte Beschädigungen oder Verschmutzungen, ungelesenes Mängelexemplar, gestempelt - This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity 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. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.