|
|
|
|
|
Ronald de Haan and Stefan Szeider
We present a list of parameterized problems together with a complexity classification of whether they allow a fixed-parameter tractable reduction to SAT or not. These problems are parameterized versions of problems whose complexity lies at the second lev...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christos Makris and Georgios Pispirigos
Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its appar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Guanggang Song, Bin Li and Yuqing He
Container terminals are the typical representatives of complex supply chain logistics hubs with multiple compound attributes and multiple coupling constraints, and their operations are provided with the strong characteristics of dynamicity, nonlinearity,...
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
|
|
|
|
|
|