Benjamin Armbruster

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

Forward reachable sets: Analytically derived properties of connected components for dynamic networks.

Benjamin Armbruster, Li Wang, Martina Morris

Netw. Sci., 2017

2015

Decision Making Under Uncertainty When Preference Information Is Incomplete.

Benjamin Armbruster, Erick Delage

Manag. Sci., 2015

A Bottleneck Matching Problem with Edge-Crossing Constraints.

John Gunnar Carlsson, Benjamin Armbruster, Saladi Rahul, Haritha Bellam

Int. J. Comput. Geom. Appl., 2015

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

Ekkehard Beck, Benjamin Armbruster

CoRR, 2015

Bounds for the expected value of one-step processes.

Benjamin Armbruster, Ádám Besenyei, Péter L. Simon

CoRR, 2015

2011

Dynamic Network Models

Benjamin Armbruster, John Gunnar Carlsson

CoRR, 2011

2010

Dynamic spectrum management with the competitive market model.

Yao Xie, Benjamin Armbruster, Yinyu Ye

IEEE Trans. Signal Process., 2010

Finding equitable convex partitions of points in a polygon efficiently.

John Gunnar Carlsson, Benjamin Armbruster, Yinyu Ye

ACM Trans. Algorithms, 2010

2007

A packet filter placement problem with application to defense against spoofed denial of service attacks.

Benjamin Armbruster, J. Cole Smith, Kihong Park

Eur. J. Oper. Res., 2007