No. Title Author Year
1 Binary Matrix Completion Under Diameter Constraints Koana, Tomohiro et al. 2021
2 Parameterized Complexity (Dagstuhl Seminar 01311) Downey, Rodney G. et al. 2021
3 Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171) Casteigts, Arnaud et al. 2021
4 Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443) Bordewich, Magnus et al. 2020
5 Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381) Grandi, Umberto et al. 2020
6 Computing Maximum Matchings in Temporal Graphs Mertzios, George B. et al. 2020
7 Faster Binary Mean Computation Under Dynamic Time Warping Schaar, Nathan et al. 2020
8 Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs Fluschnik, Till et al. 2020
9 Parameterized Algorithms for Matrix Completion with Radius Constraints Koana, Tomohiro et al. 2020
10 Front Matter, Table of Contents, Preface, Conference Organization Niedermeier, Rolf et al. 2019
11 LIPIcs, Volume 126, STACS'19, Complete Volume Niedermeier, Rolf et al. 2019
12 Multistage Vertex Cover Fluschnik, Till et al. 2019
13 Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters Bredereck, Robert et al. 2019
14 An Adaptive Version of Brandes' Algorithm for Betweenness Centrality Bentert, Matthias et al. 2018
15 Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments Korenwein, Viatcheslav et al. 2018
16 Front Matter, Table of Contents, Preface, Conference Organization Niedermeier, Rolf et al. 2018
17 LIPIcs, Volume 96, STACS'18, Complete Volume Niedermeier, Rolf et al. 2018
18 Parameterized Dynamic Cluster Editing Luo, Junjie et al. 2018
19 The Complexity of Finding Small Separators in Temporal Graphs Zschoche, Philipp et al. 2018
20 A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs Bredereck, Robert et al. 2017
21 The Power of Linear-Time Data Reduction for Maximum Matching Mertzios, George B. et al. 2017
22 Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems Fluschnik, Till et al. 2016
23 Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents Faliszewski, Piotr et al. 2016
24 LIPIcs, Volume 58, MFCS'16, Complete Volume Faliszewski, Piotr et al. 2016
25 Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs Giannopoulou, Archontia C. et al. 2015
26 The Parameterized Complexity of the Minimum Shared Edges Problem Fluschnik, Till et al. 2015
27 Reflections on Multivariate Algorithmics and Problem Parameterization Niedermeier, Rolf 2010
28 09171 Abstracts Collection -- Adaptive, Output Sensitive, Online and Parameterized Algorithms Barbay, Jérémy et al. 2009
29 09171 Executive Summary -- Adaptive, Output Sensitive, Online and Parameterized Algorithms Barbay, Jérémy et al. 2009
30 A Generalization of Nemhauser and Trotter's Local Optimization Theorem Fellows, Michael R. et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 30


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