No. Title Author Year
1 An Open Pouring Problem Frei, Fabian et al. 2020
2 First-Order Model-Checking in Random Graphs and Complex Networks Dreier, Jan et al. 2020
3 Hard Problems on Random Graphs Dreier, Jan et al. 2020
4 Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size Dreier, Jan et al. 2020
5 Randomization in Non-Uniform Finite Automata Ďuriš, Pavol et al. 2020
6 Front Matter, Table of Contents, Preface, Conference Organization Rossmanith, Peter et al. 2019
7 Hardness of FO Model-Checking on Random Graphs Dreier, Jan et al. 2019
8 LIPIcs, Volume 138, MFCS'19, Complete Volume Rossmanith, Peter et al. 2019
9 Motif Counting in Preferential Attachment Graphs Dreier, Jan et al. 2019
10 The Complexity of Packing Edge-Disjoint Paths Dreier, Jan et al. 2019
11 An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem Chen, Li-Hsuan et al. 2017
12 Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451) Kratsch, Stefan et al. 2015
13 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
14 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: 14


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