No. Title Author Year
1 Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond Dreier, Jan et al. 2023
2 The Online Simple Knapsack Problem with Reservation and Removability Burjons, Elisabet et al. 2023
3 Lower Bounds for Conjunctive and Disjunctive Turing Kernels Burjons, Elisabet et al. 2021
4 Online Simple Knapsack with Reservation Costs Böckenhauer, Hans-Joachim et al. 2021
5 Parameterized Complexity (Dagstuhl Seminar 01311) Downey, Rodney G. et al. 2021
6 An Open Pouring Problem Frei, Fabian et al. 2020
7 First-Order Model-Checking in Random Graphs and Complex Networks Dreier, Jan et al. 2020
8 Hard Problems on Random Graphs Dreier, Jan et al. 2020
9 Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size Dreier, Jan et al. 2020
10 Randomization in Non-Uniform Finite Automata Ďuriš, Pavol et al. 2020
11 Front Matter, Table of Contents, Preface, Conference Organization Rossmanith, Peter et al. 2019
12 Hardness of FO Model-Checking on Random Graphs Dreier, Jan et al. 2019
13 LIPIcs, Volume 138, MFCS'19, Complete Volume Rossmanith, Peter et al. 2019
14 Motif Counting in Preferential Attachment Graphs Dreier, Jan et al. 2019
15 The Complexity of Packing Edge-Disjoint Paths Dreier, Jan et al. 2019
16 An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem Chen, Li-Hsuan et al. 2017
17 Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451) Kratsch, Stefan et al. 2015
18 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
19 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: 19

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