| Reversing transitions in bounded Petri nets K Barylska, E Erofeev, M Koutny, Ł Mikulski, M Piątkowski Fundamenta Informaticae 157 (4), 341-357, 2018 | 29 | 2018 |
| Characterising Petri net solvable binary words E Best, E Erofeev, U Schlachter, H Wimmel International Conference on Applications and Theory of Petri Nets and …, 2016 | 20 | 2016 |
| Generating All Minimal Petri Net Unsolvable Binary Words. E Erofeev, K Barylska, L Mikulski, M Piatkowski Stringology, 33-46, 2016 | 18* | 2016 |
| On Binary Words Being Petri Net Solvable. K Barylska, E Best, E Erofeev, L Mikulski, M Piatkowski ATAED@ Petri Nets/ACSD, 1-15, 2015 | 17 | 2015 |
| Conditions for Petri net solvable binary words K Barylska, E Best, E Erofeev, Ł Mikulski, M Piątkowski Transactions on Petri Nets and Other Models of Concurrency XI, 137-159, 2016 | 12 | 2016 |
| Reachability Graphs of Two-Transition Petri Nets. E Erofeev, H Wimmel ATAED@ Petri Nets/ACSD, 39-54, 2017 | 8 | 2017 |
| On the Parameterized Complexity of d-Restricted Boolean Net Synthesis R Tredup, E Erofeev International Conference on Theory and Applications of Models of Computation …, 2020 | 7 | 2020 |
| Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems. RR Devillers, E Erofeev, T Hujsa ATAED@ Petri Nets/ACSD, 6-22, 2019 | 7 | 2019 |
| Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach R Devillers, E Erofeev, T Hujsa Transactions on Petri Nets and Other Models of Concurrency XIV, 172-191, 2019 | 7 | 2019 |
| Synthesis of weighted marked graphs from constrained labelled transition systems R Devillers, E Erofeev, T Hujsa ATAED@ Petri Nets/ACSD 2018, 2018 | 7 | 2018 |
| Characterisation of a class of Petri net solvable transition systems E Erofeev Universität Oldenburg, 2018 | 6 | 2018 |
| On the parameterized complexity of synthesizing boolean petri nets with restricted dependency R Tredup, E Erofeev arXiv preprint arXiv:2009.08871, 2020 | 5 | 2020 |
| Target-oriented Petri net synthesis E Best, R Devillers, E Erofeev, H Wimmel Fundamenta Informaticae 175 (1-4), 97-122, 2020 | 5 | 2020 |
| Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond R Devillers, E Erofeev, T Hujsa Transactions on Petri Nets and Other Models of Concurrency XV, 75-100, 2021 | 4 | 2021 |
| A new property of choice-free Petri net systems E Best, R Devillers, E Erofeev Application and Theory of Petri Nets and Concurrency: 41st International …, 2020 | 4 | 2020 |
| On the Complexity of Synthesis of nop-Free Boolean Petri Nets. R Tredup, E Erofeev ATAED@ Petri Nets, 66-84, 2020 | 3 | 2020 |
| Occupancy number restricted Boolean Petri net synthesis: a fixed-parameter algorithm E Erofeev, R Tredup International Colloquium on Theoretical Aspects of Computing, 143-160, 2020 | 2 | 2020 |
| The Complexity of Boolean State Separation R Tredup, E Erofeev International Colloquium on Theoretical Aspects of Computing, 123-142, 2020 | 2 | 2020 |
| Space-Time Viewpoints for Concurrent Processes Represented by Relational Structures. IB Virbitskaite, EN Bozhenkova, E Erofeev CS&P, 222-233, 2015 | 2 | 2015 |
| On the parameterized complexity of the synthesis of Boolean nets with restricted place environments R Tredup, E Erofeev Theoretical Computer Science 890, 36-69, 2021 | 1 | 2021 |
