No. Title Author Year
1 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
2 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
3 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
4 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
5 On the Parameterized Complexity of Contraction to Generalization of Trees Agrawal, Akanksha et al. 2018
6 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
7 Reducing CMSO Model Checking to Highly Connected Graphs Lokshtanov, Daniel et al. 2018
8 A Linear-Time Parameterized Algorithm for Node Unique Label Cover Lokshtanov, Daniel et al. 2017
9 Communication Complexity of Pairs of Graph Families with Applications Kolay, Sudeshna et al. 2017
10 Covering Vectors by Spaces: Regular Matroids Fomin, Fedor V. et al. 2017
Current Page :
Number of result pages: 5
Number of documents: 50


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