Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Deeparnab
    Last name: Chakrabarty
    DBLP: 80/5358
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 18 of 18  
    Select a publication
    Show Title Venue Rating Date
    Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy.
    Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.
    Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings 2009 (0) 2009
    Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna.
    On Allocating Goods to Maximize Fairness
    CoRR 2009, Volume 0 (0) 2009
    Deeparnab Chakrabarty, Jochen Könemann, David Pritchard.
    Hypergraphic LP Relaxations for Steiner Trees
    CoRR 2009, Volume 0 (0) 2009
    Deeparnab Chakrabarty, Chinmay Karande, Ashish Sangwan.
    The Effect of Malice on the Social Optimum in Linear Load Balancing Games
    CoRR 2009, Volume 0 (0) 2009
    Deeparnab Chakrabarty, Nikhil R. Devanur.
    On competitiveness in uniform utility allocation markets.
    Oper. Res. Lett. 2009, Volume 37 (0) 2009
    Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton.
    Algorithms for Message Ferrying on Mobile ad hoc Networks.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India 2009 (0) 2009
    Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna.
    On Allocating Goods to Maximize Fairness.
    50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA 2009 (0) 2009
    Deeparnab Chakrabarty, Gagan Goel.
    On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP.
    49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA 2008 (0) 2008
    Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani.
    New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem.
    Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings 2008 (0) 2008
    Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu.
    Efficiency, Fairness and Competitiveness in Nash Bargaining Games.
    Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings 2008 (0) 2008
    Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose.
    Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems.
    Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings 2008 (0) 2008
    Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose.
    Budget constrained bidding in keyword auctions and online knapsack problems.
    Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008 2008 (0) 2008
    Deeparnab Chakrabarty, Nikhil R. Devanur.
    On Competitiveness in Uniform Utility Allocation Markets.
    Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings 2007 (0) 2007
    Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas Gollapudi.
    Public Advertisement Broker Markets.
    Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings 2007 (0) 2007
    Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani.
    Design Is as Easy as Optimization.
    Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I 2006 (0) 2006
    Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani.
    New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets.
    Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings 2006 (0) 2006
    Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani.
    Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity.
    Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null (0) 2006
    Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan.
    Fairness and optimality in congestion games.
    Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), Vancouver, BC, Canada, June 5-8, 2005 2005 (0) 2005

    Your query returned 18 matches in the database.