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 |
Connecting the Dots (with Minimum Crossings) |
Agrawal, Akanksha et al. |
2019 |

4 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |

5 |
Decomposition of Map Graphs with Applications |
Fomin, Fedor V. et al. |
2019 |

6 |
Exact and Approximate Digraph Bandwidth |
Jain, Pallavi et al. |
2019 |

7 |
Exploring the Kernelization Borders for Hitting Cycles |
Agrawal, Akanksha et al. |
2019 |

8 |
Going Far From Degeneracy |
Fomin, Fedor V. et al. |
2019 |

9 |
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) |
Fomin, Fedor V. et al. |
2019 |

10 |
Packing Arc-Disjoint Cycles in Tournaments |
Bessy, Stéphane et al. |
2019 |

11 |
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices |
Agrawal, Akanksha et al. |
2019 |

12 |
Parameterized Complexity of Conflict-Free Matchings and Paths |
Agrawal, Akanksha et al. |
2019 |

13 |
Parameterized Complexity of Multi-Node Hubs |
Saurabh, Saket et al. |
2019 |

14 |
Parameterized Streaming Algorithms for Min-Ones d-SAT |
Agrawal, Akanksha et al. |
2019 |

15 |
Path Contraction Faster Than 2^n |
Agrawal, Akanksha et al. |
2019 |

16 |
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces |
Carpenter, Timothy et al. |
2018 |

17 |
Balanced Judicious Bipartition is Fixed-Parameter Tractable |
Lokshtanov, Daniel et al. |
2018 |

18 |
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS |
Lokshtanov, Daniel et al. |
2018 |

19 |
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy |
Agrawal, Akanksha et al. |
2018 |

20 |
Erdös-Pósa Property of Obstructions to Interval Graphs |
Agrawal, Akanksha et al. |
2018 |

21 |
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming |
Fomin, Fedor V. et al. |
2018 |

22 |
On the Parameterized Complexity of Contraction to Generalization of Trees |
Agrawal, Akanksha et al. |
2018 |

23 |
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers |
Bishnu, Arijit et al. |
2018 |

24 |
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems |
Agrawal, Akanksha et al. |
2018 |

25 |
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity |
Lokshtanov, Daniel et al. |
2018 |

26 |
Reducing CMSO Model Checking to Highly Connected Graphs |
Lokshtanov, Daniel et al. |
2018 |

27 |
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number |
Misra, Pranabendu et al. |
2018 |

28 |
A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
Lokshtanov, Daniel et al. |
2017 |

29 |
Communication Complexity of Pairs of Graph Families with Applications |
Kolay, Sudeshna et al. |
2017 |

30 |
Covering Vectors by Spaces: Regular Matroids |
Fomin, Fedor V. et al. |
2017 |