| 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
Advances in Applied Mathematics | 2024-05-08 | Paper |
Symmetrizable Boolean networks
Information Sciences | 2024-05-02 | Paper |
A meta-theorem for distributed certification
Algorithmica | 2024-01-25 | Paper |
Energy-efficient distributed algorithms for synchronous networks
Structural Information and Communication Complexity | 2024-01-11 | Paper |
scientific article; zbMATH DE number 7765409 (Why is no real title available?)
(available as arXiv preprint) | 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
Discrete Applied Mathematics | 2022-12-08 | Paper |
A meta-theorem for distributed certification
(available as arXiv preprint) | 2022-11-11 | Paper |
Distributed interactive proofs for the recognition of some geometric intersection graph classes
(available as arXiv preprint) | 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
Advances in Applied Mathematics | 2022-05-05 | Paper |
Computational Complexity of Biased Diffusion-Limited Aggregation
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
On the impact of treewidth in the computational complexity of freezing dynamics
(available as arXiv preprint) | 2022-03-22 | Paper |
On the complexity of asynchronous freezing cellular automata
Information and Computation | 2021-11-25 | Paper |
The role of randomness in the broadcast congested clique model
Information and Computation | 2021-11-25 | Paper |
| Computational complexity of the stability problem for elementary cellular automata | 2021-08-25 | Paper |
| Mining a class of decision problems for one-dimensional cellular automata | 2021-08-24 | Paper |
Compact distributed certification of planar graphs
Algorithmica | 2021-06-30 | Paper |
Freezing sandpiles and Boolean threshold networks: equivalence and complexity
Advances in Applied Mathematics | 2021-04-23 | Paper |
Compact Distributed Certification of Planar Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
On the complexity of the stability problem of binary freezing totalistic cellular automata
Information and Computation | 2020-09-17 | Paper |
The complexity of the asynchronous prediction of the majority automata
Information and Computation | 2020-09-17 | Paper |
On the effects of firing memory in the dynamics of conjunctive networks
Discrete and Continuous Dynamical Systems | 2020-09-03 | Paper |
Graph reconstruction in the congested clique
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Finding connected secluded subgraphs
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Finding connected secluded subgraphs
(available as arXiv preprint) | 2020-05-27 | Paper |
The impact of locality in the broadcast congested clique model
SIAM Journal on Discrete Mathematics | 2020-03-20 | Paper |
| Naming game automata network | 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
Cellular Automata and Discrete Complex Systems | 2019-12-05 | Paper |
Computational Complexity of Biased Diffusion Limited Aggregation
(available as arXiv preprint) | 2019-04-22 | Paper |
Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
Algorithmica | 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
Lecture Notes in Computer Science | 2018-07-06 | Paper |
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Algorithmica | 2018-05-23 | Paper |
| On the computational complexity of the freezing non-strict majority automata | 2018-03-08 | Paper |
Fixing improper colorings of graphs
Theoretical Computer Science | 2018-02-16 | Paper |
On the complexity of two-dimensional signed majority cellular automata
Journal of Computer and System Sciences | 2017-10-11 | Paper |
Brief announcement: Deterministic graph connectivity in the broadcast congested clique
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
PSPACE-completeness of majority automata networks
Theoretical Computer Science | 2015-12-08 | Paper |
The complexity of the majority rule on planar graphs
Advances in Applied Mathematics | 2015-02-06 | Paper |
Computational complexity of threshold automata networks under different updating schemes
Theoretical Computer Science | 2014-11-26 | Paper |
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Lecture Notes in Computer Science | 2014-09-02 | Paper |
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
Structural Information and Communication Complexity | 2014-08-07 | Paper |
