No. Title Author Year
1 Differential Games, Locality, and Model Checking for FO Logic of Graphs Gajarský, Jakub et al. 2022
2 Computing Shrub-Depth Decompositions Gajarský, Jakub et al. 2020
3 Algorithmic Properties of Sparse Digraphs Kreutzer, Stephan et al. 2019
4 First-Order Interpretations of Bounded Expansion Classes Gajarský, Jakub et al. 2018
5 On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface Atserias, Albert et al. 2018
6 Current Trends and New Perspectives for First-Order Model Checking (Invited Talk) Kreutzer, Stephan 2017
7 Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs Eickmeyer, Kord et al. 2017
8 Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs Kreutzer, Stephan et al. 2017
9 Kernelization and Sparseness: the Case of Dominating Set Drange, Pål Grønås et al. 2016
10 Routing with Congestion in Acyclic Digraphs Amiri, Saeed Akhoondian et al. 2016
11 The Generalised Colouring Numbers on Classes of Bounded Expansion Kreutzer, Stephan et al. 2016
12 Front Matter, Table of Contents, Preface, Conference Organisation, External Reviewers Kreutzer, Stephan 2015
13 Graph Searching Games and Width Measures for Directed Graphs Akhoondian Amiri, Saeed et al. 2015
14 LIPIcs, Volume 41, CSL'15, Complete Volume Kreutzer, Stephan 2015
15 Characterisations of Nowhere Dense Graphs (Invited Talk) Grohe, Martin et al. 2013
16 Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) Fomin, Fedor V. et al. 2011
17 Domination Problems in Nowhere-Dense Classes Dawar, Anuj et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 17

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