No. Title Author Year
1 An Adaptive Version of Brandes' Algorithm for Betweenness Centrality Bentert, Matthias et al. 2018
2 Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments Korenwein, Viatcheslav et al. 2018
3 Front Matter, Table of Contents, Preface, Conference Organization Niedermeier, Rolf et al. 2018
4 LIPIcs, Volume 96, STACS'18, Complete Volume Niedermeier, Rolf et al. 2018
5 Parameterized Dynamic Cluster Editing Luo, Junjie et al. 2018
6 The Complexity of Finding Small Separators in Temporal Graphs Zschoche, Philipp et al. 2018
7 A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs Bredereck, Robert et al. 2017
8 The Power of Linear-Time Data Reduction for Maximum Matching Mertzios, George B. et al. 2017
9 Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems Fluschnik, Till et al. 2016
10 Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents Faliszewski, Piotr et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 17

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