No. Title Author Year
1 Complexity of the Steiner Network Problem with Respect to the Number of Terminals Eiben, Eduard et al. 2019
2 Integer Programming in Parameterized Complexity: Three Miniatures Gavenciak, Tomás et al. 2019
3 Parameterized Complexity of Fair Vertex Evaluation Problems Knop, Dusan et al. 2019
4 Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters Bredereck, Robert et al. 2019
5 Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints Knop, Dusan et al. 2019
6 Evaluating and Tuning n-fold Integer Programming Altmanová, Katerina et al. 2018
7 Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices Dvorák, Pavel et al. 2018
8 Target Set Selection in Dense Graph Classes Dvorák, Pavel et al. 2018
9 Combinatorial n-fold Integer Programming and Applications Knop, Dusan et al. 2017
10 Voting and Bribing in Single-Exponential Time Knop, Dusan et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI