Benjamin Armbruster

According to our database1, Benjamin Armbruster authored at least 9 papers between 2007 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Forward reachable sets: Analytically derived properties of connected components for dynamic networks.
Netw. Sci., 2017

2015
Decision Making Under Uncertainty When Preference Information Is Incomplete.
Manag. Sci., 2015

A Bottleneck Matching Problem with Edge-Crossing Constraints.
Int. J. Comput. Geom. Appl., 2015

Elementary proof of convergence to the mean-field model for the SIR process.
CoRR, 2015

Bounds for the expected value of one-step processes.
CoRR, 2015

2011
Dynamic Network Models
CoRR, 2011

2010
Dynamic spectrum management with the competitive market model.
IEEE Trans. Signal Process., 2010

Finding equitable convex partitions of points in a polygon efficiently.
ACM Trans. Algorithms, 2010

2007
A packet filter placement problem with application to defense against spoofed denial of service attacks.
Eur. J. Oper. Res., 2007


  Loading...