Fedor V. Fomin – författare

Visar alla böcker från författaren . Handla med fri frakt och snabb leverans.

29 produkter

Kategorier

29 produkter

Kernelization
Theory of Parameterized Preprocessing
AvFedor V. Fomin,Daniel Lokshtanovm. fl.
Inbunden, Engelska, 2019
891 kr
Skickas inom 10-15 vardagar
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.
Kernelization
Theory of Parameterized Preprocessing
AvMeirav Zehavi,Saket Saurabhm. fl.
E-bok
Engelska, 2019
1 040 kr
Läs direkt efter köp
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.
Kernelization
Theory of Parameterized Preprocessing
AvMeirav Zehavi,Saket Saurabhm. fl.
E-bok
PDF, Engelska, 2019
1 040 kr
Läs direkt efter köp
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.
Del 12160 - Lecture Notes in Computer Science
Treewidth, Kernels, and Algorithms
Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
AvFedor V. Fomin,Stefan Kratschm. fl.
Häftad, Engelska, 2020
729 kr
Skickas inom 10-15 vardagar
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
Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
AvErik Jan van Leeuwen,Stefan Kratschm. fl.
E-bok
Engelska, 2020
894 kr
Läs direkt efter köp
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
AvMarek Cygan,Fedor V. Fominm. fl.
Inbunden, Engelska, 2015
816 kr
Skickas inom 10-15 vardagar
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.
Parameterized Algorithms
AvSaket Saurabh,Michal Pilipczukm. fl.
E-bok
PDF, Engelska, 2015
813 kr
Läs direkt efter köp
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.
Parameterized Algorithms
AvMarek Cygan,Fedor V. Fominm. fl.
Häftad, Engelska, 2016
600 kr
Skickas inom 10-15 vardagar
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.
Del 10846 - Lecture Notes in Computer Science
Computer Science – Theory and Applications
13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings
AvFedor V. Fomin,Vladimir V. Podolskii
Häftad, Engelska, 2018
1 086 kr
Skickas inom 10-15 vardagar
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. The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science.
Computer Science - Theory and Applications
13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings
AvVladimir V. Podolskii,Fedor V. Fomin
E-bok
Engelska, 2018
1 413 kr
Läs direkt efter köp
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. The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science.
Graph-Theoretic Concepts in Computer Science
32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers
AvFedor V. Fomin
Häftad, Engelska, 2006
546 kr
Skickas inom 10-15 vardagar
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).
Graph-Theoretic Concepts in Computer Science
32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers
AvFedor V. Fomin
E-bok
PDF, Engelska, 2006
710 kr
Läs direkt efter köp
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).
Parameterized and Exact Computation
4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
AvJianer Chen,Fedor V. Fomin
Häftad, Engelska, 2010
563 kr
Skickas inom 10-15 vardagar
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.
Parameterized and Exact Computation
4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
AvFedor V. Fomin,Jianer Chen
E-bok
PDF, Engelska, 2009
710 kr
Läs direkt efter köp
Exact Exponential Algorithms
AvFedor V. Fomin,Dieter Kratsch
Inbunden, Engelska, 2010
816 kr
Skickas inom 10-15 vardagar
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.
Exact Exponential Algorithms
AvDieter Kratsch,Fedor V. Fomin
E-bok
PDF, Engelska, 2010
710 kr
Läs direkt efter köp
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.
Exact Exponential Algorithms
AvFedor V. Fomin,Dieter Kratsch
Häftad, Engelska, 2012
546 kr
Skickas inom 10-15 vardagar
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.
Multivariate Algorithmic Revolution and Beyond
Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday
AvHans L. Bodlaender,Rodney Downeym. fl.
Häftad, Engelska, 2012
546 kr
Skickas inom 10-15 vardagar
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.
Multivariate Algorithmic Revolution and Beyond
Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday
AvDaniel Marx,Fedor V. Fominm. fl.
E-bok
PDF, Engelska, 2012
710 kr
Läs direkt efter köp
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.
Algorithm Theory -- SWAT 2012
13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012, Proceedings
AvFedor V. Fomin,Petteri Kaski
Häftad, Engelska, 2012
546 kr
Skickas inom 10-15 vardagar
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.
Algorithm Theory -- SWAT 2012
13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012, Proceedings
AvPetteri Kaski,Fedor V. Fomin
E-bok
PDF, Engelska, 2012
710 kr
Läs direkt efter köp
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.
Automata, Languages, and Programming
40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
AvFedor V. Fomin,Rusins Freivaldsm. fl.
Häftad, Engelska, 2013
563 kr
Skickas inom 10-15 vardagar
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. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.
Automata, Languages, and Programming
40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
AvDavid Peleg,Marta Kwiatkowskam. fl.
E-bok
PDF, Engelska, 2013
710 kr
Läs direkt efter köp
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. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.
Automata, Languages, and Programming
40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II
AvFedor V. Fomin,Rusins Freivaldsm. fl.
Häftad, Engelska, 2013
563 kr
Skickas inom 10-15 vardagar
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. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.
Automata, Languages, and Programming
40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II
AvDavid Peleg,Marta Kwiatkowskam. fl.
E-bok
PDF, Engelska, 2013
710 kr
Läs direkt efter köp
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. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.
Del 15983 - Lecture Notes in Computer Science
Computing and Combinatorics
31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part I
AvFedor V. Fomin,Mingyu Xiao
Häftad, Engelska, 2025
829 kr
Skickas inom 5-8 vardagar
This two-volume set, LNCS 15983 and 15984, constitutes the referred proceedings of the 31st International Computing and Combinatorics Conference, COCOON 2025, held in Chengdu, China, during August 15–17, 2025.The 54 full papers were carefully reviewed and selected from 191 submissions. COCOON 2025 provided an excellent venue for researchers working in the topical sections as follows:Part I: Approximation Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Economics and Computation.Part II: Graph Algorithms and Graph Theory, Learning and Data-Related Theory, Parameterized Algorithms, String Algorithms and Discrete Structures.
Computing and Combinatorics
31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, 2025, Proceedings, Part I
AvMingyu Xiao,Fedor V. Fomin
E-bok
Engelska, 2025
1 026 kr
Läs direkt efter köp
This two-volume set, LNCS 15983 and 15984, constitutes the referred proceedings of the 31st International Computing and Combinatorics Conference, COCOON 2025, held in Chengdu, China, during August 15–17, 2025.The 54 full papers were carefully reviewed and selected from 191 submissions. COCOON 2025 provided an excellent venue for researchers working in the topical sections as follows:Part I: Approximation Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Economics and Computation.Part II: Graph Algorithms and Graph Theory, Learning and Data-Related Theory, Parameterized Algorithms, String Algorithms and Discrete Structures.
Del 15984 - Lecture Notes in Computer Science
Computing and Combinatorics
31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part II
AvFedor V. Fomin,Mingyu Xiao
Häftad, Engelska, 2025
829 kr
Skickas inom 10-15 vardagar
This two-volume set, LNCS 15983 and 15984, constitutes the referred proceedings of the 31st International Computing and Combinatorics Conference, COCOON 2025, held in Chengdu, China, during August 15–17, 2025.The 54 full papers were carefully reviewed and selected from 191 submissions. COCOON 2025 provided an excellent venue for researchers working in the topical sections as follows:Part I: Approximation Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Economics and Computation.Part II: Graph Algorithms and Graph Theory, Learning and Data-Related Theory, Parameterized Algorithms, String Algorithms and Discrete Structures.
Computing and Combinatorics
31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, 2025, Proceedings, Part II
AvMingyu Xiao,Fedor V. Fomin
E-bok
Engelska, 2025
1 026 kr
Läs direkt efter köp
This two-volume set, LNCS 15983 and 15984, constitutes the referred proceedings of the 31st International Computing and Combinatorics Conference, COCOON 2025, held in Chengdu, China, during August 15–17, 2025.The 54 full papers were carefully reviewed and selected from 191 submissions. COCOON 2025 provided an excellent venue for researchers working in the topical sections as follows:Part I: Approximation Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Economics and Computation.Part II: Graph Algorithms and Graph Theory, Learning and Data-Related Theory, Parameterized Algorithms, String Algorithms and Discrete Structures.

Fedor V. Fomin – författare

Kernelization

Kernelization

Kernelization

Treewidth, Kernels, and Algorithms

Treewidth, Kernels, and Algorithms

Parameterized Algorithms

Parameterized Algorithms

Parameterized Algorithms

Computer Science – Theory and Applications

Computer Science - Theory and Applications

Graph-Theoretic Concepts in Computer Science

Graph-Theoretic Concepts in Computer Science

Parameterized and Exact Computation

Parameterized and Exact Computation

Exact Exponential Algorithms

Exact Exponential Algorithms

Exact Exponential Algorithms

Multivariate Algorithmic Revolution and Beyond

Multivariate Algorithmic Revolution and Beyond

Algorithm Theory -- SWAT 2012

Algorithm Theory -- SWAT 2012

Automata, Languages, and Programming

Automata, Languages, and Programming

Automata, Languages, and Programming

Automata, Languages, and Programming

Computing and Combinatorics

Computing and Combinatorics

Computing and Combinatorics

Computing and Combinatorics