Adam Hesterberg
From MaRDI portal
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 |
|---|---|---|
| Negative instance for the edge patrolling beacon problem (available as arXiv preprint) | 2023-03-31 | Paper |
| Snipperclips: cutting tools into desired polygons using themselves Computational Geometry | 2021-09-17 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Theoretical Computer Science | 2020-09-03 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (available as arXiv preprint) | 2020-08-11 | Paper |
| Path puzzles: discrete tomography with a path constraint is hard Graphs and Combinatorics | 2020-04-03 | Paper |
| Reconfiguring undirected paths (available as arXiv preprint) | 2020-01-16 | Paper |
| Reconfiguring undirected paths | 2020-01-16 | Paper |
| Upward partitioned book embeddings Lecture Notes in Computer Science | 2019-02-20 | Paper |
| Upward partitioned book embeddings Lecture Notes in Computer Science | 2019-02-20 | Paper |
| Conflict-free coloring of graphs SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
| Folding Polyominoes into (Poly)Cubes International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
| Three colors suffice: conflict-free coloring of planar graphs Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Pachinko Computational Geometry | 2018-02-19 | Paper |
| Pachinko Computational Geometry | 2018-02-19 | Paper |
| Mario Kart is hard Lecture Notes in Computer Science | 2017-02-01 | Paper |
| Folding a paper strip to minimize thickness Journal of Discrete Algorithms | 2016-02-18 | Paper |
| Folding a paper strip to minimize thickness WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Research outcomes over time
This page was built for person: Adam Hesterberg
