No. | Title | Author | Year |
---|---|---|---|
1 | Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach | Jaffke, Lars et al. | 2020 |
2 | Extension Complexity, MSO Logic, and Treewidth | Kolman, Petr et al. | 2016 |
3 | On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems | Knauer, Christian et al. | 2011 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 3 |