No. Title Author Year
1 Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures Pilipczuk, Michał et al. 2022
2 First-Order Logic with Connectivity Operators Schirrmacher, Nicole et al. 2022
3 Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391) Král’, Daniel et al. 2022
4 Structural Properties of the First-Order Transduction Quasiorder Nešetřil, Jaroslav et al. 2022
5 PACE Solver Description: PACA-JAVA Dirks, Jona et al. 2021
6 Recursive Backdoors for SAT Mählmann, Nikolas et al. 2021
7 Elimination Distance to Bounded Degree on Planar Graphs Lindermayr, Alexander et al. 2020
8 On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets Lokshtanov, Daniel et al. 2020
9 Algorithmic Properties of Sparse Digraphs Kreutzer, Stephan et al. 2019
10 Progressive Algorithms for Domination and Independence Fabianski, Grzegorz et al. 2019
11 Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness Nadara, Wojciech et al. 2018
12 First-Order Interpretations of Bounded Expansion Classes Gajarský, Jakub et al. 2018
13 Lossy Kernels for Connected Dominating Set on Sparse Graphs Eiben, Eduard et al. 2018
14 Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs Eickmeyer, Kord et al. 2017
15 Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs Kreutzer, Stephan et al. 2017
16 Kernelization and Sparseness: the Case of Dominating Set Drange, Pål Grønås et al. 2016
17 The Generalised Colouring Numbers on Classes of Bounded Expansion Kreutzer, Stephan et al. 2016
18 Graph Searching Games and Width Measures for Directed Graphs Akhoondian Amiri, Saeed et al. 2015
19 Characterisations of Nowhere Dense Graphs (Invited Talk) Grohe, Martin et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 19


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