No. Title Author Year
1 Front Matter, Table of Contents, Preface, Conference Organization Rossmanith, Peter et al. 2019
2 Hardness of FO Model-Checking on Random Graphs Dreier, Jan et al. 2019
3 LIPIcs, Volume 138, MFCS'19, Complete Volume Rossmanith, Peter et al. 2019
4 Motif Counting in Preferential Attachment Graphs Dreier, Jan et al. 2019
5 The Complexity of Packing Edge-Disjoint Paths Dreier, Jan et al. 2019
6 An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem Chen, Li-Hsuan et al. 2017
7 Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451) Kratsch, Stefan et al. 2015
8 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
9 A Fine-grained Analysis of a Simple Independent Set Algorithm Kneis, Joachim et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 9


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