| Publication | Date of Publication | Type |
|---|
| The hardness of local certification of finite-state dynamics | 2024-05-31 | Paper |
| On the parameterized complexity of freezing dynamics | 2024-05-08 | Paper |
| Symmetrizable Boolean networks | 2024-05-02 | Paper |
| A meta-theorem for distributed certification | 2024-01-25 | Paper |
| Energy-efficient distributed algorithms for synchronous networks | 2024-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065460 | 2023-11-14 | Paper |
| Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs | 2023-04-21 | Paper |
| Three notes on distributed property testing | 2023-02-03 | Paper |
| Local certification of graphs with bounded genus | 2022-12-08 | Paper |
| A meta-theorem for distributed certification | 2022-11-11 | Paper |
| Distributed interactive proofs for the recognition of some geometric intersection graph classes | 2022-11-11 | Paper |
| Computing the probability of getting infected: on the counting complexity of bootstrap percolation | 2022-10-25 | Paper |
| On the complexity of generalized Q2R automaton | 2022-05-05 | Paper |
| Computational Complexity of Biased Diffusion-Limited Aggregation | 2022-04-20 | Paper |
| On the impact of treewidth in the computational complexity of freezing dynamics | 2022-03-22 | Paper |
| On the complexity of asynchronous freezing cellular automata | 2021-11-25 | Paper |
| The role of randomness in the broadcast congested clique model | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5010393 | 2021-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5010156 | 2021-08-24 | Paper |
| Compact distributed certification of planar graphs | 2021-06-30 | Paper |
| Freezing sandpiles and Boolean threshold networks: equivalence and complexity | 2021-04-23 | Paper |
| Compact Distributed Certification of Planar Graphs | 2021-03-15 | Paper |
| On the complexity of the stability problem of binary freezing totalistic cellular automata | 2020-09-17 | Paper |
| The complexity of the asynchronous prediction of the majority automata | 2020-09-17 | Paper |
| On the effects of firing memory in the dynamics of conjunctive networks | 2020-09-03 | Paper |
| Graph reconstruction in the congested clique | 2020-06-09 | Paper |
| Finding connected secluded subgraphs | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111877 | 2020-05-27 | Paper |
| The Impact of Locality in the Broadcast Congested Clique Model | 2020-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5219752 | 2020-03-12 | Paper |
| On distributed Merlin-Arthur decision protocols | 2020-03-03 | Paper |
| The impact of locality on the detection of cycles in the broadcast congested clique model | 2020-02-12 | Paper |
| On the effects of firing memory in the dynamics of conjunctive networks | 2019-12-05 | Paper |
| Computational Complexity of Biased Diffusion Limited Aggregation | 2019-04-22 | Paper |
| Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques | 2019-03-11 | Paper |
| Two rounds are enough for reconstructing any graph (class) in the congested clique model | 2019-01-30 | Paper |
| A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton | 2018-07-06 | Paper |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | 2018-05-23 | Paper |
| On the computational complexity of the freezing non-strict majority automata | 2018-03-08 | Paper |
| Fixing improper colorings of graphs | 2018-02-16 | Paper |
| On the complexity of two-dimensional signed majority cellular automata | 2017-10-11 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators | 2016-12-22 | Paper |
| Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques | 2016-10-21 | Paper |
| PSPACE-completeness of majority automata networks | 2015-12-08 | Paper |
| Fixing improper colorings of graphs | 2015-02-20 | Paper |
| The complexity of the majority rule on planar graphs | 2015-02-06 | Paper |
| Computational complexity of threshold automata networks under different updating schemes | 2014-11-26 | Paper |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | 2014-09-02 | Paper |
| The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism | 2014-08-07 | Paper |
