Homology Flows, Cohomology Cuts ∗ (2009)
Erin W. Chambers, Jeff Erickson, Amir Nayyeri, John Dryden, All For Love, Erin Chambers, ...
We describe the first algorithms to compute maximum flows in surface-embedded graphs in nearlinear time. Specifically, given an undirected graph embedded on an orientable surface of genus g, with two...
Erin Chambers, Jeff Erickson, Amir Nayyeri, Erin Chambers, Jeff Erickson, Amir Nayyeri
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in nearlinear time. Given an undirected graph embedded on an orientable surface of genus g, with two specified...
Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks (2007)
Shokri, Reza, Nayyeri, Amir, Yazdani, Nasser, Papadimitratos, Panos
The privacy of users of mobile devices has been at stake, with emerging systems based on the mobile ad hoc networking technology raising additional concerns. The establishment of a connection between...
Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks (2007)
Reza Shokri, Amir Nayyeri, Nasser Yazdani, Panagiotis Papadimitratos
The privacy of users of mobile devices has been at stake, with emerging systems based on the mobile ad hoc networking technology raising additional concerns. The establishment of a connection between...
GAAM: an energy conservation method using code migration for ad hoc sensor networks (2005)
Nayyeri, Amir, Shokri, Reza, Yazdani, Nasser
Ad hoc sensor networks are used in different hostile environments, like forests, battle fields, etc. The nature of these surroundings makes power recharging of the network devices very difficult or...