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 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Björklund, Andreas et al. 2019
3 Bisection of Bounded Treewidth Graphs by Convolutions Eiben, Eduard et al. 2019
4 Computing the Largest Bond of a Graph Duarte, Gabriel L. et al. 2019
5 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
6 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
7 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
8 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
9 Picking Random Vertices (Invited Talk) Lokshtanov, Daniel 2019
10 The Parameterized Complexity of Finding Point Sets with Hereditary Properties Eppstein, David et al. 2019
11 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
12 Balanced Judicious Bipartition is Fixed-Parameter Tractable Lokshtanov, Daniel et al. 2018
13 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
14 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy Agrawal, Akanksha et al. 2018
15 Erdös-Pósa Property of Obstructions to Interval Graphs Agrawal, Akanksha et al. 2018
16 Front Matter, Table of Contents, Preface, Conference Organization Lokshtanov, Daniel et al. 2018
17 LIPIcs, Volume 89, IPEC'17, Complete Volume Lokshtanov, Daniel et al. 2018
18 On the Parameterized Complexity of Simultaneous Deletion Problems Agrawal, Akanksha et al. 2018
19 Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems Agrawal, Akanksha et al. 2018
20 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
21 Reducing CMSO Model Checking to Highly Connected Graphs Lokshtanov, Daniel et al. 2018
22 A 2lk Kernel for l-Component Order Connectivity Kumar, Mithilesh et al. 2017
23 A Linear-Time Parameterized Algorithm for Node Unique Label Cover Lokshtanov, Daniel et al. 2017
24 Covering Vectors by Spaces: Regular Matroids Fomin, Fedor V. et al. 2017
25 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
26 Matrix Rigidity from the Viewpoint of Parameterized Complexity Fomin, Fedor V. et al. 2017
27 Packing Cycles Faster Than Erdos-Posa Lokshtanov, Daniel et al. 2017
28 Split Contraction: The Untold Story Agrawal, Akanksha et al. 2017
29 Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments Kumar, Mithilesh et al. 2016
30 Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments Kumar, Mithilesh et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 47


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