Author: Fedor V. Fomin
Publisher: Springer Nature
ISBN: 303042071X
Category : Computers
Languages : en
Pages : 350
Book Description
This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. 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.
Treewidth, Kernels, and Algorithms
Author: Fedor V. Fomin
Publisher: Springer Nature
ISBN: 303042071X
Category : Computers
Languages : en
Pages : 350
Book Description
This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. 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.
Publisher: Springer Nature
ISBN: 303042071X
Category : Computers
Languages : en
Pages : 350
Book Description
This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. 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.
Parameterized Algorithms
Author: Marek Cygan
Publisher: Springer
ISBN: 3319212753
Category : Computers
Languages : en
Pages : 618
Book Description
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.
Publisher: Springer
ISBN: 3319212753
Category : Computers
Languages : en
Pages : 618
Book Description
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.
Algorithms and Data Structures
Author: Frank Dehne
Publisher: Springer
ISBN: 364240104X
Category : Computers
Languages : en
Pages : 550
Book Description
This book constitutes the refereed proceedings of the 13th Algorithms and Data Structures Symposium, WADS 2013, held in London, ON, Canada, August 2013. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 44 revised full papers presented in this volume were carefully reviewed and selected from 139 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Publisher: Springer
ISBN: 364240104X
Category : Computers
Languages : en
Pages : 550
Book Description
This book constitutes the refereed proceedings of the 13th Algorithms and Data Structures Symposium, WADS 2013, held in London, ON, Canada, August 2013. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 44 revised full papers presented in this volume were carefully reviewed and selected from 139 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Combinatorial Algorithms
Author: Adele Anna Rescigno
Publisher: Springer Nature
ISBN: 3031630211
Category :
Languages : en
Pages : 557
Book Description
Publisher: Springer Nature
ISBN: 3031630211
Category :
Languages : en
Pages : 557
Book Description
Combinatorial Algorithms
Author: Paola Flocchini
Publisher: Springer Nature
ISBN: 3030799875
Category : Computers
Languages : en
Pages : 588
Book Description
This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format. The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Publisher: Springer Nature
ISBN: 3030799875
Category : Computers
Languages : en
Pages : 588
Book Description
This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format. The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Algorithms and Complexity
Author: Marios Mavronicolas
Publisher: Springer Nature
ISBN: 3031304489
Category : Computers
Languages : en
Pages : 412
Book Description
This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13–16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.
Publisher: Springer Nature
ISBN: 3031304489
Category : Computers
Languages : en
Pages : 412
Book Description
This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13–16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.
Algorithms – ESA 2013
Author: Hans L. Bodlaender
Publisher: Springer
ISBN: 3642404502
Category : Computers
Languages : en
Pages : 846
Book Description
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
Publisher: Springer
ISBN: 3642404502
Category : Computers
Languages : en
Pages : 846
Book Description
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
Kernelization
Author: Fedor V. Fomin
Publisher: Cambridge University Press
ISBN: 1107057760
Category : Computers
Languages : en
Pages : 531
Book Description
A complete introduction to recent advances in preprocessing analysis, or kernelization, with extensive examples using a single data set.
Publisher: Cambridge University Press
ISBN: 1107057760
Category : Computers
Languages : en
Pages : 531
Book Description
A complete introduction to recent advances in preprocessing analysis, or kernelization, with extensive examples using a single data set.
WALCOM: Algorithms and Computation
Author: Chun-Cheng Lin
Publisher: Springer Nature
ISBN: 3031270517
Category : Computers
Languages : en
Pages : 398
Book Description
This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.
Publisher: Springer Nature
ISBN: 3031270517
Category : Computers
Languages : en
Pages : 398
Book Description
This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.
Algorithms and Data Structures
Author: Zachary Friggstad
Publisher: Springer
ISBN: 303024766X
Category : Computers
Languages : en
Pages : 610
Book Description
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Publisher: Springer
ISBN: 303024766X
Category : Computers
Languages : en
Pages : 610
Book Description
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.