No. |
Title |
Author |
Year |
---|

1 |
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443) |
Bordewich, Magnus et al. |
2020 |

2 |
Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381) |
Grandi, Umberto et al. |
2020 |

3 |
Computing Maximum Matchings in Temporal Graphs |
Mertzios, George B. et al. |
2020 |

4 |
Faster Binary Mean Computation Under Dynamic Time Warping |
Schaar, Nathan et al. |
2020 |

5 |
Parameterized Algorithms for Matrix Completion with Radius Constraints |
Koana, Tomohiro et al. |
2020 |

6 |
Front Matter, Table of Contents, Preface, Conference Organization |
Niedermeier, Rolf et al. |
2019 |

7 |
LIPIcs, Volume 126, STACS'19, Complete Volume |
Niedermeier, Rolf et al. |
2019 |

8 |
Multistage Vertex Cover |
Fluschnik, Till et al. |
2019 |

9 |
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters |
Bredereck, Robert et al. |
2019 |

10 |
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality |
Bentert, Matthias et al. |
2018 |

11 |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments |
Korenwein, Viatcheslav et al. |
2018 |

12 |
Front Matter, Table of Contents, Preface, Conference Organization |
Niedermeier, Rolf et al. |
2018 |

13 |
LIPIcs, Volume 96, STACS'18, Complete Volume |
Niedermeier, Rolf et al. |
2018 |

14 |
Parameterized Dynamic Cluster Editing |
Luo, Junjie et al. |
2018 |

15 |
The Complexity of Finding Small Separators in Temporal Graphs |
Zschoche, Philipp et al. |
2018 |

16 |
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs |
Bredereck, Robert et al. |
2017 |

17 |
The Power of Linear-Time Data Reduction for Maximum Matching |
Mertzios, George B. et al. |
2017 |

18 |
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems |
Fluschnik, Till et al. |
2016 |

19 |
Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents |
Faliszewski, Piotr et al. |
2016 |

20 |
LIPIcs, Volume 58, MFCS'16, Complete Volume |
Faliszewski, Piotr et al. |
2016 |

21 |
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs |
Giannopoulou, Archontia C. et al. |
2015 |

22 |
The Parameterized Complexity of the Minimum Shared Edges Problem |
Fluschnik, Till et al. |
2015 |

23 |
Reflections on Multivariate Algorithmics and Problem Parameterization |
Niedermeier, Rolf |
2010 |

24 |
09171 Abstracts Collection -- Adaptive, Output Sensitive, Online and Parameterized Algorithms |
Barbay, Jérémy et al. |
2009 |

25 |
09171 Executive Summary -- Adaptive, Output Sensitive, Online and Parameterized Algorithms |
Barbay, Jérémy et al. |
2009 |

26 |
A Generalization of Nemhauser and Trotter's Local Optimization Theorem |
Fellows, Michael R. et al. |
2009 |