Search
for Author
All Reviews
Fomin, Fedor V.
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
Date Reviewed
1
-
5
of
6
reviews
Exact algorithms via monotone local search
Fomin F., Gaspers S., Lokshtanov D., Saurabh S. Journal of the ACM 66(2): 1-23, 2019. Type: Article
Many important problems are NP-complete; this means that, unless P = NP, we cannot have a polynomial-time (feasible) algorithm for solving all instances of this problem. For each such problem, there is an exhaustive search algorithm th...
...
Apr 26 2021
Parameterized algorithms
Cygan M., Fomin F., Kowalik Ł., Lokshtanov D., Marx D., Pilipczuk M., Pilipczuk M., Saurabh S., Springer International Publishing, New York, NY, 2015. 613 pp. Type: Book (978-3-319212-74-6), Reviews: (2 of 2)
There are 36 definitions of complexity like the 36 flavors of ice cream! In simplest terms, complexity refers to the amount of resources consumed to execute an algorithm (resources here imply running time, space, computational effort, ...
...
Apr 13 2017
Parameterized algorithms
Cygan M., Fomin F., Kowalik Ł., Lokshtanov D., Marx D., Pilipczuk M., Pilipczuk M., Saurabh S., Springer International Publishing, New York, NY, 2015. 613 pp. Type: Book (978-3-319212-74-6), Reviews: (1 of 2)
The topic of parameterized algorithms is one of the main subjects in modern computer science. In this type of algorithm analysis, the running time is a function of the size of the input data and of a set of one or more parameters. The ...
...
Feb 12 2016
Parameterized complexity of connected even/odd subgraph problems
Fomin F., Golovach P. Journal of Computer and System Sciences 80(1): 157-179, 2014. Type: Article
The notion of fixed parameter tractability involves relaxed polynomial-time complexity, which admits algorithms whose runtimes are exponential, but only in terms of some parameter that is expected to be small. More formally, a problem ...
...
Jan 2 2014
Equitable colorings of bounded treewidth graphs
Bodlaender H., Fomin F. Theoretical Computer Science 349(1): 22-30, 2005. Type: Article
Bodlaender and Fomin prove that an equitable
k
-coloring can be found in polynomial time on graphs of bounded treewidth. It follows that an
l
-bounded
k
-coloring also has a polynomial solution on graphs of bounded tr...
...
Jul 10 2006
Display
5
10
15
25
50
100
per column
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy