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


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