Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range

Attila Hideg, Tamás Lukovszki, Bertalan Forstner. Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range. In Seth Gilbert, Danny Hughes 0001, Bhaskar Krishnamachari, editors, Algorithms for Sensor Systems - 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers. Volume 11410 of Lecture Notes in Computer Science, pages 193-205, Springer, 2018. [doi]

@inproceedings{HidegLF18,
  title = {Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range},
  author = {Attila Hideg and Tamás Lukovszki and Bertalan Forstner},
  year = {2018},
  doi = {10.1007/978-3-030-14094-6_13},
  url = {https://doi.org/10.1007/978-3-030-14094-6_13},
  researchr = {https://researchr.org/publication/HidegLF18},
  cites = {0},
  citedby = {0},
  pages = {193-205},
  booktitle = {Algorithms for Sensor Systems - 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers},
  editor = {Seth Gilbert and Danny Hughes 0001 and Bhaskar Krishnamachari},
  volume = {11410},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-14094-6},
}