7 citations · 7 across the 5 of their papers we have counts for
8 papers
The Iterated Local Model for Social Networks
Anthony Bonato, Huda Chuangpishit, Sean English +2
On-line social networks, such as in Facebook and Twitter, are often studied from the perspective of friendship ties between agents in the network. Adversarial ties, however, also p…
Evacuating Equilateral Triangles and Squares in the Face-to-Face Model
Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan +1
Consider robots initially located at a point inside a region . Each robot can move anywhere in independently of other robots with maximum speed one. The goal of the robo…
Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model
Huda Chuangpishit, Konstantinos Georgiou, Preeti Sharma
The problem of evacuating two robots from the disk in the face-to-face model was first introduced in [Czyzowicz et al., DISC'14], and extensively studied (along with many variation…
Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
Huda Chuangpishit, Jurek Czyzowicz, Leszek Gasieniec +3
Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection.…
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
Huda Chuangpishit, Jurek Czyzowicz, Evangelos Kranakis +1
A set of mobile robots is placed at points of an infinite line. The robots are equipped with GPS devices and they may communicate their positions on the line to a central authority…
Conditions on square geometric graphs
Huda Chuangpishit, Jeannette Janssen
For any metric on , an ()-geometric graph is a graph whose vertices are points in , and two vertices are adjacent if and only if the…
Uniform linear embeddings of graphons
Huda Chuangpishit, Mahya Ghandehari, Jeannette Janssen
Let be a symmetric function, and consider the random process , where vertices are chosen from uniformly at random, and governs the…
Linear embeddings of graphs and graph limits
Huda Chuangpishit, Mahya Ghandehari, Matt Hurshman +2
Consider a random graph process where vertices are chosen from the interval , and edges are chosen independently at random, but so that, for a given vertex , the probabil…