2 papers
cs.DS2025
On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs
Aida Aminian, Shahin Kamali, Seyed-Mohammad Seyed-Javadi +1
In the Telephone Broadcasting problem, the goal is to disseminate a message from a given source vertex of an input graph to all other vertices in the minimum number of rounds, wher…
cs.DS2023
Space-Efficient Data Structures for Polyominoes and Bar Graphs
Magnus Berg, Shahin Kamali, Katherine Ling +1
We provide a compact data structure for representing polyominoes that supports neighborhood and visibility queries. Neighborhood queries concern reporting adjacent cells to a given…