WorldCat Identities

Fomin, Fedor V.

Overview
Works: 50 works in 185 publications in 2 languages and 3,442 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, Other
Publication Timeline
.
Most widely held works by Fedor V Fomin
Graph-theoretic concepts in computer science : 32nd international workshop, WG 2006, Bergen, Norway, June 22-24, 2006 : revised papers by Fedor V Fomin( )

21 editions published between 2006 and 2007 in English and held by 542 WorldCat member libraries worldwide

Annotation
Exact exponential algorithms by Fedor V Fomin( )

18 editions published between 2010 and 2013 in English and German and held by 480 WorldCat member libraries worldwide

'Exact Exponential Algorithms' provides an introduction to the area and explains the most common algorithmic techniques involved. Thorough exercises are included, in addition to notes and suggestions for further reading
Parameterized and exact computation : 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009 : revised selected papers by Jianer Chen( )

14 editions published between 2009 and 2010 in English and held by 439 WorldCat member libraries worldwide

This book constitutes the refereed best selected papers of the 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009, held in Copenhagen, Denmark, in September 2009. The 25 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 52 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, implementation issues of parameterized and exact algorithms, high-performance computing and fixed-parameter tractability
Automata, languages, and programming : 40th international colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, proceedings by Fedor V Fomin( )

16 editions published in 2013 in English and held by 401 WorldCat member libraries worldwide

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
Algorithm theory - SWAT 2012 : 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4-6, 2012 ; proceedings by SWAT (Symposium)( )

8 editions published between 2010 and 2012 in English and held by 379 WorldCat member libraries worldwide

From the back cover: 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 by Fedor V Fomin( )

11 editions published in 2013 in English and held by 377 WorldCat member libraries worldwide

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
Parameterized algorithms by Marek Cygan( )

11 editions published in 2015 in English and held by 288 WorldCat member libraries worldwide

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
Computer science - theory and applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018 : proceedings by CSR( )

6 editions published in 2018 in English and held by 164 WorldCat member libraries worldwide

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
The multivariate algorithmic revolution and beyond : essays dedicated to Michael R. Fellows on the occasion of his 60th birthday by Hans L Bodlaender( )

7 editions published in 2012 in English and held by 71 WorldCat member libraries worldwide

Annotation
Graph-Theoretic Concepts in Computer Science (vol. # 4271) 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers by Fedor V Fomin( )

7 editions published in 2006 in English and Undetermined and held by 50 WorldCat member libraries worldwide

Parameterized and Exact Computation 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers by Jianer Chen( )

3 editions published in 2009 in English and Undetermined and held by 40 WorldCat member libraries worldwide

Kernelization : theory of parameterized preprocessing by Fedor V Fomin( )

5 editions published in 2019 in English and held by 38 WorldCat member libraries worldwide

"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"--
Algorithm Theory - SWAT 2012 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings by Fedor V Fomin( )

6 editions published in 2012 in English and held by 33 WorldCat member libraries worldwide

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 by Fedor V Fomin( )

1 edition published in 2012 in English and held by 20 WorldCat member libraries worldwide

Algorithm theory 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4-6, 2012 ; proceedings( )

3 editions published in 2012 in English and held by 7 WorldCat member libraries worldwide

Parameterized and exact computation : 5th international workshop, IWPEC 2010, Chennai, India, December 13-15, 2010, proceedings by IWPEC (Workshop)( )

1 edition published in 2010 in English and held by 6 WorldCat member libraries worldwide

New upper bounds on the decomposability of planar graphs and fixed parameter algorithms by Fedor V Fomin( Book )

4 editions published between 2002 and 2003 in English and held by 6 WorldCat member libraries worldwide

Dominating sets in planar graphs : branch-width and exponential speed-up by Fedor V Fomin( Book )

3 editions published in 2003 in English and held by 5 WorldCat member libraries worldwide

On the domination search number by Fedor V Fomin( Book )

2 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.54 (from 0.47 for Algorithm ... to 0.95 for Algorithm ...)

Graph-theoretic concepts in computer science : 32nd international workshop, WG 2006, Bergen, Norway, June 22-24, 2006 : revised papers Graph-Theoretic Concepts in Computer Science (vol. # 4271) 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers
Covers
Exact exponential algorithmsParameterized and exact computation : 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009 : revised selected papersGraph-Theoretic Concepts in Computer Science (vol. # 4271) 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised PapersParameterized and Exact Computation 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
Alternative Names
Fedor Fomin researcher

Languages
English (145)

German (1)