|
|
|
|
|
Max Bannach and Sebastian Berndt
Research on the similarity of a graph to being a tree?called the treewidth of the graph?has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Johannes K. Fichte, Markus Hecher, Michael Morak and Stefan Woltran
Efficient exact parameterized algorithms are an active research area. Such algorithms exhibit a broad interest in the theoretical community. In the last few years, implementations for computing various parameters (parameter detection) have been establish...
ver más
|
|
|
|
|
|
|
|
|
|
|
Robert Ganian and Sebastian Ordyniak
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science. ILP is NP-complete, and until recently we have lacked a systematic study of the complex...
ver más
|
|
|
|
|
|