The following pages link to Madhav V. Marathe (Q223031):
Displaying 43 items.
- (Q4395332) (← links)
- (Q4411352) (← links)
- (Q4414508) (← links)
- Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry (Q4435326) (← links)
- (Q4451017) (← links)
- (Q4452913) (← links)
- (Q4470517) (← links)
- Formal-Language-Constrained Path Problems (Q4507373) (← links)
- (Q4527187) (← links)
- (Q4527194) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- Calibrating a Stochastic, Agent-Based Model Using Quantile-Based Emulation (Q4611533) (← links)
- The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
- (Q4686061) (← links)
- Simple heuristics for unit disk graphs (Q4698229) (← links)
- (Q4737140) (← links)
- (Q4737207) (← links)
- (Q4764625) (← links)
- (Q4785459) (← links)
- (Q4785582) (← links)
- POINT SET LABELING WITH SPECIFIED POSITIONS (Q4818545) (← links)
- Spanning Trees—Short or Small (Q4881285) (← links)
- Improving Minimum Cost Spanning Trees by Upgrading Nodes (Q4939607) (← links)
- (Q4952637) (← links)
- (Q4952645) (← links)
- Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks (Q4962606) (← links)
- Service-constrained network design problems (Q5054805) (← links)
- Formal language constrained path problems (Q5054859) (← links)
- (Q5115465) (← links)
- I <scp>ndemics</scp> (Q5176913) (← links)
- Many birds with one stone (Q5248513) (← links)
- Point set labeling with specified positions (Q5361529) (← links)
- A memetic algorithm to schedule planned maintenance for the national grid (Q5463391) (← links)
- An experimental study of a simple, distributed edge-coloring algorithm (Q5463446) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479366) (← links)
- (Q5501331) (← links)
- (Q5501366) (← links)
- (Q5501791) (← links)
- Upgrading bottleneck constrained forests (Q5928872) (← links)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
- Models and approximation algorithms for channel assignment in radio networks (Q5952557) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
- Modifying networks to obtain low cost trees (Q6550552) (← links)
