- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c26 |      | Zachary Friggstad, Anupam Gupta, Mohit Singh: An Improved Integrality Gap for Asymmetric TSP Paths. IPCO 2013: 181-192 |
| i6 | | Zachary Friggstad, Anupam Gupta, Mohit Singh: An Improved Integrality Gap for Asymmetric TSP Paths. CoRR abs/1302.3145 (2013) |
| i5 | | Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, Mohit Singh: On the Approximation of Submodular Functions. CoRR abs/1304.4948 (2013) |
| i4 | | |
| 2012 | ||
| j7 | | Mohit Singh, I. A. Khan, Sandeep Grover: Development and comparison of quality award: based on existing quality awards. Int. J. Systems Assurance Engineering and Management 3(3): 209-220 (2012) |
| c25 | | Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh: Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) 2012: 145-156 |
| c24 | | Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh: A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem. ICALP (1) 2012: 606-616 |
| c23 | | Mahendra Sakare, Mohit Singh, Shalabh Gupta: A 4 × 20 Gb/s 29-1 PRBS Generator for Testing a High-Speed DAC in 90nm CMOS Technology. VDAT 2012: 252-257 |
| c22 | | Mohit Singh, Shalabh Gupta: Buffer Design and Eye-Diagram Based Characterization of a 20 GS/s CMOS DAC. VLSI Design 2012: 96-100 |
| i3 | | Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh: A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem. CoRR abs/1205.1262 (2012) |
| i2 | | Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh: Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. CoRR abs/1205.1477 (2012) |
| 2011 | ||
| j6 | | Mohit Singh, I. A. Khan, Sandeep Grover: Selection of manufacturing process using graph theoretic approach. Int. J. Systems Assurance Engineering and Management 2(4): 301-311 (2011) |
| c21 | | Mohit Singh, Mahendra Sakare, Shalabh Gupta: Testing of high-speed DACs using PRBS generation with "Alternate-Bit-Tapping". DATE 2011: 377-382 |
| c20 | | Joseph Naor, Debmalya Panigrahi, Mohit Singh: Online Node-Weighted Steiner Tree and Related Problems. FOCS 2011: 210-219 |
| c19 | | Shayan Oveis Gharan, Amin Saberi, Mohit Singh: A Randomized Rounding Approach to the Traveling Salesman Problem. FOCS 2011: 550-559 |
| c18 | | Mohit Singh, I. A. Khan, Sandeep Grover, S. C. Gupta: Assessing quality of manufacturing organizations - a Graph Theoretic Approach. IEEM 2011: 1740-1744 |
| 2010 | ||
| j5 | | Viswanath Nagarajan, R. Ravi, Mohit Singh: Simpler analysis of LP extreme points for traveling salesman and survivable network design problems. Oper. Res. Lett. 38(3): 156-160 (2010) |
| c17 | | Mohit Singh, Kunal Talwar: Improving Integrality Gaps via Chvátal-Gomory Rounding. APPROX-RANDOM 2010: 366-379 |
| c16 | | Joshua Robinson, Mohit Singh, Ram Swaminathan, Edward W. Knightly: Deploying Mesh Nodes under Non-Uniform Propagation. INFOCOM 2010: 2142-2150 |
| c15 | | Niv Buchbinder, Kamal Jain, Mohit Singh: Secretary Problems via Linear Programming. IPCO 2010: 163-176 |
| c14 | | Niv Buchbinder, Kamal Jain, Mohit Singh: Incentives in Online Auctions via Linear Programming. WINE 2010: 106-117 |
| 2009 | ||
| j4 | | Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh: Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39(3): 1062-1087 (2009) |
| j3 | | Niv Buchbinder, Kamal Jain, Mohit Singh: Secretary problems and incentives via linear programming. SIGecom Exchanges 8(2): 6 (2009) |
| c13 | | Fabrizio Grandoni, R. Ravi, Mohit Singh: Iterative Rounding for Multi-Objective Optimization Problems. ESA 2009: 95-106 |
| i1 | | Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh: A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem. CoRR abs/0909.0941 (2009) |
| 2008 | ||
| c12 | | |
| c11 | | Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh: Set Covering with our Eyes Closed. FOCS 2008: 347-356 |
| c10 | | Tamás Király, Lap Chi Lau, Mohit Singh: Degree Bounded Matroids and Submodular Flows. IPCO 2008: 259-272 |
| c9 | | Lap Chi Lau, Mohit Singh: Additive approximation for bounded degree survivable network design. STOC 2008: 759-768 |
| 2007 | ||
| j2 | | Mohit Singh, Amitabha Tripathi: On an extremal problem related to a theorem of Whitney. Discrete Applied Mathematics 155(4): 579-583 (2007) |
| c8 | | Uriel Feige, Mohit Singh: Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. APPROX-RANDOM 2007: 104-118 |
| c7 | | Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh: Survivable network design with degree or order constraints. STOC 2007: 651-660 |
| c6 | | Mohit Singh, Lap Chi Lau: Approximating minimum bounded degree spanning trees to within one of optimal. STOC 2007: 661-670 |
| 2006 | ||
| c5 | | R. Ravi, Mohit Singh: Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs. ICALP (1) 2006: 169-180 |
| c4 | | Daniel Golovin, Viswanath Nagarajan, Mohit Singh: Approximating the k-multicut problem. SODA 2006: 621-630 |
| 2005 | ||
| c3 | | Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh: How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. FOCS 2005: 367-378 |
| c2 | | Kedar Dhamdhere, R. Ravi, Mohit Singh: On Two-Stage Stochastic Minimum Spanning Trees. IPCO 2005: 321-334 |
| 2004 | ||
| c1 | | Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh: On the Crossing Spanning Tree Problem. APPROX-RANDOM 2004: 51-60 |
| 2003 | ||
| j1 | | Mohit Singh, Amitabha Tripathi: Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree. Electronic Notes in Discrete Mathematics 15: 196-197 (2003) |
Colors in the list of coauthors
Last update Wed May 22 13:19:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page