No. Title Author Year
1 Three Is Enough for Steiner Trees Arrighi, Emmanuel et al. 2021
2 Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach Jaffke, Lars et al. 2020
3 Width Notions for Ordering-Related Problems Arrighi, Emmanuel et al. 2020
4 A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem Lokshtanov, Daniel et al. 2019
5 Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth de Oliveira Oliveira, Mateus 2017
6 On Supergraphs Satisfying CMSO Properties de Oliveira Oliveira, Mateus 2017
7 Representations of Monotone Boolean Functions by Linear Programs de Oliveira Oliveira, Mateus et al. 2017
8 Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping Komusiewicz, Christian et al. 2017
9 Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function de Oliveira Oliveira, Mateus 2016
Current Page :
Number of result pages: 1
Number of documents: 9


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