Research

  1. Folding polyominoes into (poly) cubes. Aichholzer, O.; Biro, M.; Demaine, E.; Demaine, M.; Eppstein, D.; Fekete, S. P; Hesterberg, A.; Kostitsyna, I.; and Schmidt, C. In International Journal of Computational Geometry & Applications, 2018. To appear.
  2. Planar graphs with many perfect matchings and forests. Biro, M. In Electronic Journal of Combinatorics, 2016. In preparation
  3. Folding polyominoes into (poly) cubes. Aichholzer, O.; Biro, M.; Demaine, E.; Demaine, M.; Eppstein, D.; Fekete, S. P; Hesterberg, A.; Kostitsyna, I.; and Schmidt, C. In Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG), 2015.
  4. Computational complexity of numberless Shakashaka. Adler, A.; Biro, M.; Demaine, E.; Rudoy, M.; and Schmidt, C. In Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG), 2015.
  5. Bounds on the number of hint squares for Shakashaka. Biro, M.; Hamamoto, T.; Schmidt, C.; and Uno, Y. In Proceedings of the 18th Japan Conference on Discrete and Computational Goemetry and Graphs (JCDCG22), 2015.
  6. Inverse-beacon guarding. Biro, M. In 3rd Computational Geometry: Young Researchers Forum (CG: YRF), 2014.
  7. Planar graphs with many perfect matchings and forests. Biro, M. In Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG), 2014.
  8. Counting subgraphs of triangulated prism graphs. Biro, M. In 23rd Annual Fall Workshop on Computational Geometry (FWCG), 2013.
  9. Beacon-based algorithms for geometric routing. Biro, M.; Iwerks, J.; Kostitsyna, I.; and Mitchell, J. S. B. In Algorithms and Data Structures, pages 158--169, 2013. Springer
  10. Combinatorics of beacon-based routing and coverage. Biro, M.; Gao, J.; Iwerks, J.; Kostitsyna, I.; and Mitchell, J. S. B. In Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG), 2013.
  11. Simple rectilinear polygons are perfect under rectangular vision. Arkin, E.; Biro, M.; Filtser, O.; Katz, M. J; Mitchell, J. S. B.; and Schmidt, C. In Proceedings of the 23rd Fall Workshop on Computational Geometry (FWCG), 2013.
  12. Beacon-based routing and guarding. Biro, M. Ph.D. Dissertation, Stony Brook University, 2013.
  13. Beacon-based structures in polygonal domains. Biro, M.; Gao, J.; Iwerks, J.; Kostitsyna, I.; and Mitchell, J. S. B. In 1st Computational Geometry: Young Researchers Forum (CG: YRF), 2012.
  14. Watchman paths in disk grids. Biro, M.; and Iwerks, J. In 22nd Fall Workshop on Computational Geometry (FWCG), 2012.
  15. Approximation algorithms for outlier removal in convex hulls. Biro, M.; Bonanno, J.; Ebrahimi, R.; and Montgomery, L. In Proceedings of the 22nd Fall Workshop on Computational Geometry (FWCG), 2012.
  16. Beacon-based routing and coverage. Biro, M.; Gao, J.; Iwerks, J.; Kostitsyna, I.; and Mitchell, J. S. B. In 21st Fall Workshop on Computational Geometry (FWCG), 2011.