No. Title Author Year
1 Connecting the Dots (with Minimum Crossings) Agrawal, Akanksha et al. 2019
2 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
3 Parameterized Complexity of Multi-Node Hubs Saurabh, Saket et al. 2019
4 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
5 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
6 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
7 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
8 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
9 Reducing CMSO Model Checking to Highly Connected Graphs Lokshtanov, Daniel et al. 2018
10 Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Misra, Pranabendu et al. 2018
Current Page :
Number of result pages: 3
Number of documents: 21


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