A note on constructive canonical splitter strategies in nowhere-dense graph classes

Information Processing Letters

On the generalized coloring numbers

Computer Science Review

Decomposition horizons and a characterization of stable hereditary classes of graphs

European Journal of Combinatorics

Discrepancy and sparsity

Journal of Combinatorial Theory, Series B

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes

First-order Logic with Connectivity Operators

ACM Transactions on Computational Logic

On Solution Discovery via Reconfiguration

Classes of graphs with low complexity: The case of classes with bounded linear rankwidth

European Journal of Combinatorics

Constant Round Distributed Domination on Graph Classes with Bounded Expansion

On low rank-width colorings

European Journal of Combinatorics

Lossy Kernels for Connected Dominating Set on Sparse Graphs

SIAM Journal on Discrete Mathematics

Algorithmic Properties of Sparse Digraphs

36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany

Distributed Dominating Set Approximations beyond Planar Graphs

ACM Transactions on Algorithms

Greedy domination on biclique-free graphs

Information Processing Letters

Polynomial bounds for centered colorings on proper minor-closed graph classes

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

ACM Trans. Algorithms

Progressive Algorithms for Domination and Independence

36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany

Coloring and Covering Nowhere Dense Graphs

SIAM J. Discrete Math.

Distributed Domination on Graph Classes of Bounded Expansion

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, July 16-18, 2018

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness

17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy

First-Order Interpretations of Bounded Expansion Classes

45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic

Lossy Kernels for Connected Dominating Set on Sparse Graphs

35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France

On the number of types in sparse graphs

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018

Parameterized circuit complexity of model-checking on sparse structures

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018

Reconfiguration on nowhere dense graph classes

Electronic Journal of Combinatorics