Parameterized Algorithms by Cygan Marek (40 results)
- Softcover
Seller: HPB-Ruby, Dallas, TX, U.S.A.HPB-Ruby
Contact seller5-star sellerCondition: Used - Very good
£ 20.99
£ 2.78 shippingShips within U.S.A.Quantity: 1 available
paperback. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority.
- Hardcover
Seller: HPB-Red, Dallas, TX, U.S.A.HPB-Red
Contact seller5-star sellerCondition: Used - Good
£ 42.98
£ 2.78 shippingShips within U.S.A.Quantity: 1 available
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 53.12
£ 1.96 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
- Softcover
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
£ 55.15
Free ShippingShips within U.S.A.Quantity: 10 available
Condition: Brand New. New. Delivery takes 25-30 days. Excellent Customer Service.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 56.50
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 55.81
£ 1.96 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Springer International Publishing AG, CH, 2016
- Softcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
£ 62.00
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. 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 and 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 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. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work. Softcover reprint of the original 1st ed. 2015.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
£ 47.32
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 48.05
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 50.80
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 66.11
£ 1.96 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
- Hardcover
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
£ 68.13
Free ShippingShips within U.S.A.Quantity: 10 available
Condition: Brand New. New. Delivery takes 25-30 days. Excellent Customer Service.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
£ 55.91
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
£ 61.48
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
- Hardcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 78.65
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 66.16
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 78.74
£ 2.96 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 613.
Parameterized Algorithms
Cygan, Marek/ Fomin, Fedor V./ Kowalik, Lukasz/ Lokshtanov, Daniel/ Marx, Daniel
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 75.76
£ 12.50 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. reprint edition. 632 pages. 9.25x6.10x1.34 inches. In Stock.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 102.92
£ 2.96 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 620.
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: Used - Fine
£ 63.44
£ 56.13 shippingShips from Germany to U.S.A.Quantity: 1 available
Gebundene Ausgabe. Condition: 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.
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 105.60
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 632 pages. 9.50x6.50x1.50 inches. In Stock.
Language: English
Published by Springer International Publishing AG, CH, 2016
- Softcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
£ 56.16
£ 65.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. Softcover reprint of the original 1st ed. 2015.
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 70.80
£ 56.13 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 appli…cation 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 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. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
Language: English
Published by Springer International Publishing AG, Cham, 2016
- Softcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
£ 128.04
Free ShippingShips within U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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, branc…hing 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 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. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
£ 128.99
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 121.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Parameterized Algorithms
Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 152.13
£ 1.96 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Springer International Publishing AG, Cham, 2016
- Softcover
Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contact seller5-star sellerCondition: New
£ 202.13
£ 27.43 shippingShips from Australia to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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, branc…hing 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 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. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller5-star sellerCondition: New
£ 44.32
£ 9.42 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 51.92
£ 19.70 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 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. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work. 632 pp. Englisch.
