No. Title Author Year
1 A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem Lokshtanov, Daniel et al. 2019
2 Exploring the Kernelization Borders for Hitting Cycles Agrawal, Akanksha et al. 2019
3 Parameterized Complexity of Multi-Node Hubs Saurabh, Saket et al. 2019
4 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
5 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
6 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
7 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy Agrawal, Akanksha et al. 2018
8 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
9 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
10 On the Parameterized Complexity of Contraction to Generalization of Trees Agrawal, Akanksha et al. 2018
Current Page :
Number of result pages: 6
Number of documents: 58


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