No. Title Author Year
1 Tatamibari Is NP-Complete Adler, Aviv et al. 2020
2 Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class Demaine, Erik D. et al. 2019
3 Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy Demaine, Erik D. et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 3


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