Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Bagchi, Amitabha - Department of Computer Science and Engineering, Indian Institute of Technology, Delhi
SellerFocused Algorithms for Online Auctioning Amitabha Bagchi 1 , Amitabh Chaudhary 1 , Rahul Garg 2 , Michael T. Goodrich 1 , and
A Simple Combinatorial Proof of Duality of Multiroute Flows and Cuts
Approximate Maximum Weight Branchings Amitabha Bagchi
Approximate Maximum Weight Branchings Amitabha Bagchi # Ankur Bhargava + Torsten Suel #
Short Length Menger's Theorem and Reliable Optical Amitabha Bagchi and Amitabh
Deterministic Sampling and Range Counting in Geometric Data Amitabha Bagchi # Amitabh Chaudhary + David Eppstein # Michael T. Goodrich #
Algorithms for Fault-Tolerant Routing in Circuit Switched Networks
Constructing Disjoint Paths for Secure Communication
Hierarchical neighbor graphs: A fully distributed topology for data collection in wireless sensor
Algorithms for FaultTolerant Routing in Circuit Switched Networks
Deterministic Sampling and Range Counting in Geometric Data Amitabha Bagchi
Biased Skip Lists # Amitabha Bagchi + Adam L. Buchsbaum # Michael T. Goodrich
Constructing Disjoint Paths for Secure Communication
The Effect of Faults on Network Expansion Amitabha Bagchi
Seller-Focused Algorithms for Online Auctioning Amitabha Bagchi
Short Length Menger's Theorem and Reliable Optical Amitabha Bagchi
Efficient Strategies for Topics in Internet Algorithmics Amitabha Bagchi
E#cient Strategies for Topics in Internet Algorithmics Amitabha Bagchi
The Effect of Faults on Network Expansion Amitabha Bagchi # Ankur Bhargava + Amitabh Chaudhary # David Eppstein
Short Length Menger's Theorem and Reliable Optical Amitabha Bagchi
Biased Skip Lists Amitabha Bagchi
