| Publication | Date of Publication | Type |
|---|
Indiscernibles and flatness in monadically stable and monadically NIP classes
| 2024-11-14 | Paper |
Flipper games for monadically stable graph classes
| 2024-11-14 | Paper |
Nowhere dense classes of graphs
Foundations of Computing | 2024-11-05 | Paper |
Discrepancy and sparsity
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Transducing paths in graph classes with unbounded shrubdepth
European Journal of Combinatorics | 2024-10-07 | Paper |
Distributed domination on sparse graph classes
European Journal of Combinatorics | 2024-10-07 | Paper |
Combinatorial and algorithmic aspects of monadic stability
| 2024-09-11 | Paper |
Twin-width and permutations
Logical Methods in Computer Science | 2024-09-04 | Paper |
Elimination distance to bounded degree on planar graphs preprint
Fundamenta Informaticae | 2024-08-27 | Paper |
Algorithms and data structures for first-order logic with connectivity under vertex failures
| 2024-06-24 | Paper |
Structural Properties of the First-Order Transduction Quasiorder
| 2024-04-10 | Paper |
First-Order Logic with Connectivity Operators
| 2024-04-10 | Paper |
scientific article; zbMATH DE number 7803608 (Why is no real title available?)
| 2024-02-12 | Paper |
Token sliding on graphs of girth five
Algorithmica | 2024-01-25 | Paper |
scientific article; zbMATH DE number 7788458 (Why is no real title available?)
| 2024-01-15 | Paper |
Solution discovery via reconfiguration for problems in P
| 2023-11-22 | Paper |
scientific article; zbMATH DE number 7764115 (Why is no real title available?)
| 2023-11-13 | Paper |
First-order Logic with Connectivity Operators
ACM Transactions on Computational Logic | 2023-11-03 | Paper |
scientific article; zbMATH DE number 7724246 (Why is no real title available?)
| 2023-08-08 | Paper |
Token sliding on graphs of girth five
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
First-Order Model Checking on Structurally Sparse Graph Classes
| 2023-02-07 | Paper |
Flipper games for monadically stable graph classes
| 2023-01-31 | Paper |
Local planar domination revisited
| 2022-11-11 | Paper |
Modulo-Counting First-Order Logic on Bounded Expansion Classes
| 2022-11-07 | Paper |
On the first-order transduction quasiorder of hereditary classes of graphs
| 2022-08-30 | Paper |
Algorithmic properties of sparse digraphs
| 2022-07-18 | Paper |
Progressive algorithms for domination and independence
| 2022-07-18 | Paper |
Elimination Distance to Bounded Degree on Planar Graphs
| 2022-07-18 | Paper |
Combinatorial and Algorithmic Aspects of Monadic Stability
| 2022-06-29 | Paper |
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes
| 2022-06-28 | Paper |
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
| 2022-04-22 | Paper |
Transducing paths in graph classes with unbounded shrubdepth
| 2022-03-31 | Paper |
On the parameterized complexity of reconfiguration of connected dominating sets
Algorithmica | 2022-03-25 | Paper |
Constant round distributed domination on graph classes with bounded expansion
| 2022-03-22 | Paper |
Algorithms and data structures for first-order logic with connectivity under vertex failures
| 2021-11-05 | Paper |
Polynomial bounds for centered colorings on proper minor-closed graph classes
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
First-order interpretations of bounded expansion classes
| 2021-07-28 | Paper |
Discrepancy and Sparsity
| 2021-05-08 | Paper |
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
ACM Journal of Experimental Algorithmics | 2021-04-21 | Paper |
Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
European Journal of Combinatorics | 2021-04-14 | Paper |
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
European Journal of Combinatorics | 2021-02-08 | Paper |
Linear rankwidth meets stability
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On the number of types in sparse graphs
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Parameterized circuit complexity of model-checking on sparse structures
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
scientific article; zbMATH DE number 7297863 (Why is no real title available?)
| 2021-01-19 | Paper |
Regular partitions of gentle graphs
Acta Mathematica Hungarica | 2020-12-18 | Paper |
Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
| 2020-12-16 | Paper |
First-order interpretations of bounded expansion classes
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Model-checking on ordered structures
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Lossy kernels for connected dominating set on sparse graphs
| 2020-08-05 | Paper |
Neighborhood complexity and kernelization for nowhere dense classes of graphs
| 2020-05-27 | Paper |
On low rank-width colorings
European Journal of Combinatorics | 2019-11-28 | Paper |
Distributed Dominating Set Approximations beyond Planar Graphs
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Polynomial bounds for centered colorings on proper minor-closed graph classes
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
| 2019-10-01 | Paper |
Lossy kernels for connected dominating set on sparse graphs
SIAM Journal on Discrete Mathematics | 2019-09-30 | Paper |
Polynomial kernels and wideness properties of nowhere dense graph classes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Greedy domination on biclique-free graphs
Information Processing Letters | 2019-03-11 | Paper |
Progressive Algorithms for Domination and Independence
| 2018-11-16 | Paper |
Coloring and covering nowhere dense graphs
SIAM Journal on Discrete Mathematics | 2018-10-31 | Paper |
Reconfiguration on nowhere dense graph classes
The Electronic Journal of Combinatorics | 2018-08-15 | Paper |
Polynomial kernels and wideness properties of nowhere dense graph classes
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Deciding first-order properties of nowhere dense graphs
Journal of the ACM | 2018-05-17 | Paper |
Structural properties and constant factor-approximation of strong distance-\(r\) dominating sets in sparse directed graphs
| 2018-04-19 | Paper |
The generalised colouring numbers on classes of bounded expansion
| 2018-03-21 | Paper |
On low rank-width colorings
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
A local constant factor MDS approximation for bounded genus graphs
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
On the generalised colouring numbers of graphs that exclude a fixed minor
European Journal of Combinatorics | 2017-09-11 | Paper |
First-order and monadic second-order model-checking on ordered structures
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Characterisations of nowhere dense graphs (invited talk)
| 2017-02-21 | Paper |
Graph searching games and width measures for directed graphs
| 2017-01-24 | Paper |
Colouring and covering nowhere dense graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On the generalised colouring numbers of graphs that exclude a fixed minor
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Deciding first-order properties of nowhere dense graphs
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Directed Width Measures and Monotonicity of Directed Graph Searching
| 2014-08-20 | Paper |
Vertex disjoint paths in upward planar graphs
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Decomposition horizons and a characterization of stable hereditary classes of graphs
| N/A | Paper |
Twin-width and permutations
| N/A | Paper |
