List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Approximate Turing kernelization and lower bounds for domination problems | 2025-09-24 | Paper |
| Most classic problems remain NP-hard on relative neighborhood graphs and their relatives | 2024-05-27 | Paper |
| Disentangling the computational complexity of network untangling Theory of Computing Systems | 2024-02-09 | Paper |
| Computational complexity aspects of point visibility graphs Discrete Applied Mathematics | 2019-02-08 | Paper |
Research outcomes over time
This page was built for person: Pascal Kunz
