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 |
|---|---|---|
| \(m\)-watchmen's routes in minbar and generalized minbar polygons Computational Geometry | 2026-01-22 | Paper |
| Guarding polyominoes under k-hop visibility Algorithmica | 2025-03-28 | Paper |
| Guarding polyominoes under \(k\)-hop visibility | 2024-05-31 | Paper |
| \(k\)-Transmitter watchman routes WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
| Rectangular spiral galaxies are still hard Computational Geometry | 2023-01-09 | Paper |
| Folding polyominoes with holes into a cube Computational Geometry | 2021-01-07 | Paper |
| Altitude terrain guarding and guarding uni-monotone polygons Computational Geometry | 2019-10-25 | Paper |
| Exact Solutions and Bounds for General Art Gallery Problems 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
| Folding Polyominoes into (Poly)Cubes International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
| Combinatorics and complexity of guarding polygons with edge and point 2-transmitters Computational Geometry | 2018-02-19 | Paper |
| Distributed vision with smart pixels Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Algorithms for art gallery illumination Journal of Global Optimization | 2017-05-22 | Paper |
| Facets for art gallery problems Algorithmica | 2015-10-19 | Paper |
| Exact solutions and bounds for general art gallery problems ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
| Facets for art gallery problems Lecture Notes in Computer Science | 2013-06-11 | Paper |
| Online exploration and triangulation in orthogonal polygonal regions WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
| A Novel Efficient Approach for Solving the Art Gallery Problem WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
| Minimum covering with travel cost Journal of Combinatorial Optimization | 2012-10-01 | Paper |
| Exploring and triangulating a region by a swarm of robots Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
| Minimum covering with travel cost Algorithms and Computation | 2009-12-17 | Paper |
| Polygon exploration with time-discrete vision Computational Geometry | 2009-11-16 | Paper |
Research outcomes over time
This page was built for person: Christiane Schmidt
