No. Title Author Year
1 Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391) Král’, Daniel et al. 2022
2 Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class Demaine, Erik D. et al. 2019
3 A Fast Parameterized Algorithm for Co-Path Set Sullivan, Blair D. et al. 2017
4 Being Even Slightly Shallow Makes Life Hard Muzi, Irene et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 4


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