| On simplified NP-complete variants of Monotone 3-Sat A Darmann, J Döcker Discrete Applied Mathematics 292, 45-58, 2021 | 22 | 2021 |
| On a simple hard variant of Not-All-Equal 3-Sat A Darmann, J Döcker Theoretical Computer Science 815, 147-152, 2020 | 20 | 2020 |
| On simplified NP-complete variants of Not-All-Equal 3-SAT and 3-SAT A Darmann, J Döcker arXiv preprint arXiv:1908.04198, 2019 | 11 | 2019 |
| Deciding the existence of a cherry-picking sequence is hard on two trees J Döcker, L Van Iersel, S Kelk, S Linz Discrete Applied Mathematics 260, 131-143, 2019 | 11 | 2019 |
| The monotone satisfiability problem with bounded variable appearances A Darmann, J Döcker, B Dorn International Journal of Foundations of Computer Science 29 (06), 979-993, 2018 | 11 | 2018 |
| On simplified group activity selection A Darmann, J Döcker, B Dorn, J Lang, S Schneckenburger Algorithmic Decision Theory: 5th International Conference, ADT 2017 …, 2017 | 11 | 2017 |
| On planar variants of the monotone satisfiability problem with bounded variable appearances A Darmann, J Döcker, B Dorn arXiv preprint arXiv:1604.05588, 2016 | 9 | 2016 |
| Displaying trees across two phylogenetic networks J Döcker, S Linz, C Semple Theoretical Computer Science 796, 129-146, 2019 | 7 | 2019 |
| Monotone 3-Sat-4 is NP-complete A Darmann, J Döcker arXiv preprint arXiv:1603.07881, 2016 | 6 | 2016 |
| Display sets of normal and tree-child networks J Döcker, S Linz, C Semple The Electronic Journal of Combinatorics 28 (1), P1.8, 2021 | 4 | 2021 |
| Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks J Döcker, S Linz, C Semple Advances in Applied Mathematics 152, 102595, 2024 | 2 | 2024 |
| Simplified group activity selection with group size constraints A Darmann, J Döcker, B Dorn, S Schneckenburger International Journal of Game Theory, 1-44, 2022 | 2 | 2022 |
| Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy J Döcker, B Dorn, S Linz, C Semple Theoretical Computer Science 822, 72-91, 2020 | 2 | 2020 |
| On the existence of funneled orientations for classes of rooted phylogenetic networks J Döcker, S Linz Theoretical Computer Science 1023, 114908, 2025 | 1 | 2025 |
| Monotone 3-Sat-(2, 2) is NP-complete J Döcker arXiv preprint arXiv:1912.08032, 2019 | 1 | 2019 |
| On the existence of a cherry-picking sequence J Döcker, S Linz Theoretical Computer Science 714, 36-50, 2018 | 1 | 2018 |
| Complexity and tractability islands for combinatorial auctions on discrete intervals with gaps J Döcker, B Dorn, U Endriss, D Krüger ECAI 2016, 802-809, 2016 | 1 | 2016 |
| An even simpler hard variant of Not-All-Equal 3-SAT A Darmann, J Döcker, B Dorn arXiv preprint arXiv:2412.03395, 2024 | | 2024 |
| Bounding the softwired parsimony score of a phylogenetic network J Döcker, S Linz, K Wicke Bulletin of Mathematical Biology 86 (10), 121, 2024 | | 2024 |
| Characterising rooted and unrooted tree-child networks J Döcker, S Linz arXiv preprint arXiv:2408.17105, 2024 | | 2024 |
Andreas DarmannUniversität GrazVerified email at uni-graz.at
