The following pages link to Barbara M. Anthony (Q346519):
Displaying 17 items.
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- Complete \(r\)-partite graphs determined by their domination polynomial (Q897257) (← links)
- Directed Zagreb indices (Q2056903) (← links)
- Serving rides of equal importance for time-limited dial-a-ride (Q2117614) (← links)
- Equilibria in Doodle polls under three tie-breaking rules (Q2182310) (← links)
- Inefficiency of equilibria in Doodle polls (Q2327151) (← links)
- Online bottleneck matching (Q2436671) (← links)
- Conditions for the bicolorability of primitive hypergraphs (Q2791961) (← links)
- The Power of Rejection in Online Bottleneck Matching (Q2942414) (← links)
- (Q3089196) (← links)
- Online Bottleneck Matching (Q3167367) (← links)
- A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems (Q3169083) (← links)
- (Q3579458) (← links)
- Infrastructure Leasing Problems (Q5429284) (← links)
- Maximizing the number of rides served for dial-a-ride (Q6591922) (← links)
- Earliest deadline first is a 2-approximation for DARP with time windows (Q6606221) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)