default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohit Singh
Person information
- affiliation: Georgia Institute of Technology, GA, USA
Other persons with a similar name
- Mohit Singh Choudhary
- Mohit B. Singh
- Mohit Kumar Singh
- Mohit Tomar
![[0009-0009-1176-005X]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0009-0009-1176-005X")
(aka: Mohit Singh Tomar)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j40]Adam Brown, Aditi Laddha, Mohit Singh:
Fast algorithms for maximizing the minimum eigenvalue in fixed dimension. Oper. Res. Lett. 57: 107186 (2024)- [c65]Mohit Singh, Mihir Dharmadhikari, Kostas Alexis:
An Online Self-calibrating Refractive Camera Model with Application to Underwater Odometry. ICRA 2024: 10005-10011 - [c64]Adam Brown, Aditi Laddha, Madhusudhan Reddy Pittu, Mohit Singh:
Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs. SODA 2024: 1307-1327 - [i41]Adam Brown, Aditi Laddha, Madhusudhan Reddy Pittu, Mohit Singh:
Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs. CoRR abs/2401.02918 (2024) - [i40]Adam Brown, Aditi Laddha, Mohit Singh:
Maximizing the Minimum Eigenvalue in Constant Dimension. CoRR abs/2401.14317 (2024) - [i39]Mohit Singh, Kostas Alexis:
Online Refractive Camera Model Calibration in Visual Inertial Odometry. CoRR abs/2409.12074 (2024) - 2023
- [j39]Arden Baxter, Pinar Keskinocak, Mohit Singh:
Heterogeneous Multi-resource Planning and Allocation Under Stochastic Demand. INFORMS J. Comput. 35(5): 929-951 (2023) - [j38]Santanu S. Dey, Mohit Singh, David P. Williamson:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021. Math. Program. 197(2): 449-450 (2023) - [c63]Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh:
An Improved Approximation Algorithm for the Max-3-Section Problem. ESA 2023: 69:1-69:17 - [c62]Chaitanya Kapoor, Aadith Warrier, Mohit Singh, Pratik Narang, Harish Puppala, Srinivas Rallapalli, Ajit Pratap Singh:
Attention-enabled Deep Neural Network for Enhancing UAV-Captured Pavement Imagery in Poor Visibility. MIPR 2023: 1-4 - [c61]Chaitanya Kapoor, Aadith Warrier, Mohit Singh, Pratik Narang, Harish Puppala, Srinivas Rallapalli, Ajit Pratap Singh:
Fast and Lightweight UAV-based Road Image Enhancement Under Multiple Low-Visibility Conditions. PerCom Workshops 2023: 154-159 - [c60]Swati Gupta, Jai Moondra, Mohit Singh:
Which Lp norm is the fairest? Approximations for fair facility location across all "p". EC 2023: 817 - [i38]Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh:
An Improved Approximation Algorithm for the Max-3-Section Problem. CoRR abs/2308.03516 (2023) - [i37]Aditya Pillai, Mohit Singh:
Linear Programming based Reductions for Multiple Visit TSP and Vehicle Routing Problems. CoRR abs/2308.11742 (2023) - [i36]Mohit Singh, Mihir Dharmadhikari, Kostas Alexis:
An Online Self-calibrating Refractive Camera Model with Application to Underwater Odometry. CoRR abs/2310.16658 (2023) - [i35]Swati Gupta, Jai Moondra, Mohit Singh:
Balancing Notions of Equity: Approximation Algorithms for Fair Portfolio of Solutions in Combinatorial Optimization. CoRR abs/2311.03230 (2023) - 2022
- [j37]Mohit Singh, Vijay Laxmi, Parvez Faruki:
Dense spatially-weighted attentive residual-haze network for image dehazing. Appl. Intell. 52(12): 13855-13869 (2022) - [j36]Mohit Singh, Vijay Laxmi, Parvez Faruki:
Visibility enhancement and dehazing: Research contribution challenges and direction. Comput. Sci. Rev. 44: 100473 (2022) - [j35]Arden Baxter, Pinar Keskinocak, Mohit Singh:
Heterogeneous Multi-resource Allocation with Subset Demand Requests. INFORMS J. Comput. 34(5): 2389-2399 (2022) - [j34]Sebastian Perez-Salazar, Ishai Menache, Mohit Singh, Alejandro Toriello:
Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency. Oper. Res. 70(4): 2517-2537 (2022) - [j33]Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat:
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design. Math. Oper. Res. 47(2): 847-877 (2022) - [j32]Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello:
Adaptive Bin Packing with Overflow. Math. Oper. Res. 47(4): 3317-3356 (2022) - [j31]Aditi Laddha, Mohit Singh, Santosh S. Vempala:
Socially fair network design via iterative rounding. Oper. Res. Lett. 50(5): 536-540 (2022) - [j30]Andy Drucker, Ravi Kumar, Amit Sahai, Mohit Singh:
Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017). SIAM J. Comput. 51(2): 17- (2022) - [j29]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. ACM Trans. Algorithms 18(4): 33:1-33:50 (2022) - [c59]Vinayak S. Prabhu, Mohit Singh, Indrajit Ray, Indrakshi Ray, Sudipto Ghosh:
Detecting Secure Memory Deallocation Violations with CBMC. CPSS@AsiaCCS 2022: 27-38 - [c58]Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali:
Determinant Maximization via Matroid Intersection Algorithms. FOCS 2022: 255-266 - [i34]Mehrdad Ghadiri, Mohit Singh, Santosh S. Vempala:
Constant-Factor Approximation Algorithms for Socially Fair k-Clustering. CoRR abs/2206.11210 (2022) - [i33]Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali:
Determinant Maximization via Matroid Intersection Algorithms. CoRR abs/2207.04318 (2022) - [i32]Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello:
The IID Prophet Inequality with Limited Flexibility. CoRR abs/2210.05634 (2022) - [i31]Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh:
Efficient Determinant Maximization for All Matroids. CoRR abs/2211.10507 (2022) - [i30]Swati Gupta, Jai Moondra, Mohit Singh:
Socially Fair and Hierarchical Facility Location Problems. CoRR abs/2211.14873 (2022) - 2021
- [j28]Alfredo Torrico, Mohit Singh, Sebastian Pokutta, Nika Haghtalab, Joseph (Seffi) Naor, Nima Anari:
Structured Robust Submodular Maximization: Offline and Online Algorithms. INFORMS J. Comput. 33(4): 1590-1607 (2021) - [j27]Mohit Singh, Alina Y. Morkina, Elena A. Korznikova, Volodymyr I. Dubinko, Dmitry A. Terentiev, Daxing Xiong, Oleg B. Naimark, Vakhid A. Gani, Sergey V. Dmitriev:
Effect of Discrete Breathers on the Specific Heat of a Nonlinear Chain. J. Nonlinear Sci. 31(1): 12 (2021) - [j26]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. ACM Trans. Economics and Comput. 9(2): 11:1-11:22 (2021) - [c57]Ravi Abhishek Shankar, Mohit Singh, Byunghoo Jung:
Amplitude Recovery of Saturated Sinusoidal Signals. IEEE SENSORS 2021: 1-4 - [c56]Sahand Sabet, Mohit Singh, Mohammad Poursina, Parviz E. Nikravesh:
A Highly Maneuverable Hybrid Energy-Efficient Rolling/Flying System. IROS 2021: 2485-2490 - [e1]Mohit Singh, David P. Williamson:
Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings. Lecture Notes in Computer Science 12707, Springer 2021, ISBN 978-3-030-73878-5 [contents] - [i29]Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello:
Robust Online Selection with Uncertain Offer Acceptance. CoRR abs/2112.00842 (2021) - 2020
- [j25]Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha R. Thomas:
Simple Graph Density Inequalities with No Sum of Squares Proofs. Comb. 40(4): 455-471 (2020) - [j24]Mohit Singh, Weijun Xie:
Approximation Algorithms for D-optimal Design. Math. Oper. Res. 45(4): 1512-1534 (2020) - [c55]Vivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat:
Maximizing Determinants under Matroid Constraints. FOCS 2020: 565-576 - [c54]Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. ICML 2020: 7772-7782 - [c53]Mohit Singh, Ravi Abhishek Shankar, Byunghoo Jung:
Magnetic Position Tracking using Inductor Coils and IMU. IEEE SENSORS 2020: 1-4 - [c52]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. SODA 2020: 854-873 - [c51]Mohit Singh, Mahesh Raveendranatha Panicker, K. V. Rajagopal:
Towards Bone Aware Image Enhancement in Musculoskeletal Ultrasound Imaging. TENCON 2020: 795-799 - [i28]Alfredo Torrico, Mohit Singh, Sebastian Pokutta:
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. CoRR abs/2002.04063 (2020) - [i27]Vivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat:
Maximizing Determinants under Matroid Constraints. CoRR abs/2004.07886 (2020) - [i26]Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello:
Online Adaptive Bin Packing with Overflow. CoRR abs/2007.11532 (2020) - [i25]Mohit Singh, Alexander Shapiro, Rui Zhang:
Rank one tensor completion problem. CoRR abs/2009.10533 (2020)
2010 – 2019
- 2019
- [j23]Mohit Singh:
Integrality gap of the vertex cover linear programming relaxation. Oper. Res. Lett. 47(4): 288-290 (2019) - [c50]Nima Anari, Nika Haghtalab, Seffi Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Structured Robust Submodular Maximization: Offline and Online Algorithms. AISTATS 2019: 3128-3137 - [c49]Vivek Madan, Mohit Singh, Uthaipon Tantipongpipat, Weijun Xie:
Combinatorial Algorithms for Optimal Design. COLT 2019: 2210-2258 - [c48]Roy Schwartz, Mohit Singh, Sina Yazdanbod:
Online and Offline Algorithms for Circuit Switch Scheduling. FSTTCS 2019: 27:1-27:14 - [c47]Uthaipon Tantipongpipat, Samira Samadi, Mohit Singh, Jamie Morgenstern, Santosh S. Vempala:
Multi-Criteria Dimensionality Reduction with Applications to Fairness. NeurIPS 2019: 15135-15145 - [c46]Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat:
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design. SODA 2019: 1369-1386 - [c45]Liang Liu, Jun (Jim) Xu, Mohit Singh:
LESS: A Matrix Split and Balance Algorithm for Parallel Circuit (Optical) or Hybrid Data Center Switching and More. UCC 2019: 187-197 - [i24]Jamie Morgenstern, Samira Samadi, Mohit Singh, Uthaipon Tao Tantipongpipat, Santosh S. Vempala:
Fair Dimensionality Reduction and Iterative Rounding for SDPs. CoRR abs/1902.11281 (2019) - [i23]Roy Schwartz, Mohit Singh, Sina Yazdanbod:
Online and Offline Greedy Algorithms for Routing with Switching Costs. CoRR abs/1905.02800 (2019) - [i22]Mohit Singh:
Integrality Gap of the Vertex Cover Linear Programming Relaxation. CoRR abs/1907.11209 (2019) - 2018
- [j22]Annie Raymond, James Saunderson, Mohit Singh, Rekha R. Thomas:
Symmetric sums of squares over k-subset hypercubes. Math. Program. 167(2): 315-354 (2018) - [j21]Mohit Singh, Rico Zenklusen:
k-Trails: recognition, complexity, and approximations. Math. Program. 172(1-2): 169-189 (2018) - [j20]Ronen Eldan, Mohit Singh:
Efficient algorithms for discrepancy minimization in convex sets. Random Struct. Algorithms 53(2): 289-307 (2018) - [j19]Mohit Singh, László A. Végh:
Approximating Minimum Cost Connectivity Orientation and Augmentation. SIAM J. Comput. 47(1): 270-293 (2018) - [c44]Samira Samadi, Uthaipon Tao Tantipongpipat, Jamie Morgenstern, Mohit Singh, Santosh S. Vempala:
The Price of Fair PCA: One Extra dimension. NeurIPS 2018: 10999-11010 - [c43]Mohit Singh, Weijun Xie:
Approximate Positive Correlated Distributions and Approximation Algorithms for D-optimal Design. SODA 2018: 2240-2255 - [c42]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. WINE 2018: 80-95 - [i21]Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat:
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design. CoRR abs/1802.08318 (2018) - [i20]Mohit Singh, Weijun Xie:
Approximate Positively Correlated Distributions and Approximation Algorithms for D-optimal Design. CoRR abs/1802.08372 (2018) - [i19]Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Efficient algorithms for robust submodular maximization under matroid constraints. CoRR abs/1807.09405 (2018) - [i18]Ishai Menache, Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello:
Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency. CoRR abs/1809.02688 (2018) - [i17]Samira Samadi, Uthaipon Tao Tantipongpipat, Jamie Morgenstern, Mohit Singh, Santosh S. Vempala:
The Price of Fair PCA: One Extra Dimension. CoRR abs/1811.00103 (2018) - [i16]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. CoRR abs/1812.07769 (2018) - 2017
- [j18]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. SIAM J. Comput. 46(1): 272-306 (2017) - [c41]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
Nash Social Welfare, Matrix Permanent, and Stable Polynomials. ITCS 2017: 36:1-36:12 - [c40]Yuval Peres, Mohit Singh, Nisheeth K. Vishnoi:
Random Walks in Polytopes and Negative Dependence. ITCS 2017: 50:1-50:10 - [c39]Janardhan Kulkarni, Euiwoong Lee, Mohit Singh:
Minimum Birkhoff-von Neumann Decomposition. IPCO 2017: 343-354 - [c38]Mohit Singh, Byunghoo Jung:
High-definition wireless personal area tracking using AC magnetic field for virtual reality. VR 2017: 209-210 - [i15]Nima Anari, Nika Haghtalab, Joseph Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Robust Submodular Maximization: Offline and Online Algorithms. CoRR abs/1710.04740 (2017) - 2016
- [j17]Zachary Friggstad, Anupam Gupta, Mohit Singh:
An Improved Integrality Gap for Asymmetric TSP Paths. Math. Oper. Res. 41(3): 745-757 (2016) - [c37]Mohit Singh, Byunghoo Jung:
Live demonstration: High-definition wireless personal area tracking using AC magnetic field. IEEE SENSORS 2016: 1 - [c36]Mohit Singh, Rico Zenklusen:
k-Trails: Recognition, Complexity, and Approximations. IPCO 2016: 114-125 - [c35]Aleksandar Nikolov, Mohit Singh:
Maximizing determinants under partition constraints. STOC 2016: 192-201 - [i14]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
Nash Social Welfare, Matrix Permanent, and Stable Polynomials. CoRR abs/1609.07056 (2016) - [i13]Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. CoRR abs/1611.07745 (2016) - 2015
- [j16]Mohit Singh, Lap Chi Lau:
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal. J. ACM 62(1): 1:1-1:19 (2015) - [j15]Vivek R. Narasayya, Ishai Menache, Mohit Singh, Feng Li, Manoj Syamala, Surajit Chaudhuri:
Sharing Buffer Pool Memory in Multi-Tenant Relational Database-as-a-Service. Proc. VLDB Endow. 8(7): 726-737 (2015) - [c34]Arindam Khan, Mohit Singh:
On Weighted Bipartite Edge Coloring. FSTTCS 2015: 136-150 - [c33]Ishai Menache, Mohit Singh:
Online Caching with Convex Costs: Extended Abstract. SPAA 2015: 46-54 - [i12]Sébastien Bubeck, Yin Tat Lee, Mohit Singh:
A geometric alternative to Nesterov's accelerated gradient descent. CoRR abs/1506.08187 (2015) - [i11]Annie Raymond, Mohit Singh, Rekha R. Thomas:
Symmetry in Turán Sums of Squares Polynomials from Flag Algebras. CoRR abs/1507.03059 (2015) - [i10]Mohit Singh, Rico Zenklusen:
k-Trails: Recognition, Complexity, and Approximations. CoRR abs/1512.01781 (2015) - 2014
- [j14]Mohit Singh, Shalabh Gupta:
Multi-Level Pseudo Random Sequence Generation for Coherent Optical Transmission Systems. IEEE Commun. Lett. 18(10): 1723-1726 (2014) - [j13]Marcelo Godoy Simões, Eduard Muljadi, Mohit Singh, Vahan Gevorgian:
Measurement-based performance analysis of wind energy systems. IEEE Instrum. Meas. Mag. 17(2): 15-20 (2014) - [j12]Niv Buchbinder, Kamal Jain, Mohit Singh:
Secretary Problems via Linear Programming. Math. Oper. Res. 39(1): 190-206 (2014) - [j11]Fabrizio Grandoni, R. Ravi, Mohit Singh, Rico Zenklusen:
New approaches to multi-objective optimization. Math. Program. 146(1-2): 525-554 (2014) - [c32]Nicholas J. A. Harvey, Roy Schwartz, Mohit Singh:
Discrepancy Without Partial Colorings. APPROX-RANDOM 2014: 258-273 - [c31]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. FOCS 2014: 256-265 - [c30]Uriel Feige, R. Ravi, Mohit Singh:
Short Tours through Large Linear Forests. IPCO 2014: 273-284 - [c29]Mohit Singh, László A. Végh:
Approximating Minimum Cost Connectivity Orientation and Augmentation. SODA 2014: 1687-1701 - [c28]Mohit Singh, Nisheeth K. Vishnoi:
Entropy, optimization and counting. STOC 2014: 50-59 - [p1]Mohit Singh, Kunal Talwar:
Approximation Algorithms. Tractability 2014: 231-259 - [i9]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. CoRR abs/1407.3263 (2014) - [i8]Ronen Eldan, Mohit Singh:
Efficient Algorithms for Discrepancy Minimization in Convex Sets. CoRR abs/1409.2913 (2014) - 2013
- [j10]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh:
Set Covering with Our Eyes Closed. SIAM J. Comput. 42(3): 808-830 (2013) - [j9]Lap Chi Lau, Mohit Singh:
Additive Approximation for Bounded Degree Survivable Network Design. SIAM J. Comput. 42(6): 2217-2242 (2013) - [c27]Zachary Friggstad, Anupam Gupta, Mohit Singh:
An Improved Integrality Gap for Asymmetric TSP Paths. IPCO 2013: 181-192 - [i7]Zachary Friggstad, Anupam Gupta, Mohit Singh:
An Improved Integrality Gap for Asymmetric TSP Paths. CoRR abs/1302.3145 (2013) - [i6]Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, Mohit Singh:
On the Approximation of Submodular Functions. CoRR abs/1304.4948 (2013) - [i5]Mohit Singh, Nisheeth K. Vishnoi:
Entropy, Optimization and Counting. CoRR abs/1304.8108 (2013) - [i4]Mohit Singh, László A. Végh:
Approximating Minimum Cost Connectivity Orientation and Augmentation. CoRR abs/1307.4164 (2013) - 2012
- [j8]Tamás Király, Lap Chi Lau, Mohit Singh:
Degree bounded matroids and submodular flows. Comb. 32(6): 703-720 (2012) - [j7]Mohit Singh, Irshad Ahmad Khan, Sandeep Grover:
Development and comparison of quality award: based on existing quality awards. Int. J. Syst. Assur. Eng. Manag. 3(3): 209-220 (2012) - [c26]Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh:
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) 2012: 145-156 - [c25]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 - [c24]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 - [c23]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, Irshad Ahmad Khan, Sandeep Grover:
Selection of manufacturing process using graph theoretic approach. Int. J. Syst. Assur. Eng. Manag. 2(4): 301-311 (2011) - [c22]Mohit Singh, Mahendra Sakare, Shalabh Gupta:
Testing of high-speed DACs using PRBS generation with "Alternate-Bit-Tapping". DATE 2011: 377-382 - [c21]Joseph Naor, Debmalya Panigrahi, Mohit Singh:
Online Node-Weighted Steiner Tree and Related Problems. FOCS 2011: 210-219 - [c20]Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
A Randomized Rounding Approach to the Traveling Salesman Problem. FOCS 2011: 550-559 - [c19]Mohit Singh, Irshad Ahmad 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) - [c18]Mohit Singh, Kunal Talwar:
Improving Integrality Gaps via Chvátal-Gomory Rounding. APPROX-RANDOM 2010: 366-379 - [c17]Joshua Robinson, Mohit Singh, Ram Swaminathan, Edward W. Knightly:
Deploying Mesh Nodes under Non-Uniform Propagation. INFOCOM 2010: 2142-2150 - [c16]Niv Buchbinder, Kamal Jain, Mohit Singh:
Secretary Problems via Linear Programming. IPCO 2010: 163-176 - [c15]Niv Buchbinder, Kamal Jain, Mohit Singh:
Incentives in Online Auctions via Linear Programming. WINE 2010: 106-117
2000 – 2009
- 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 Exch. 8(2): 6 (2009) - [c14]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
- [c13]Uriel Feige, Mohit Singh:
Edge Coloring and Decompositions of Weighted Graphs. ESA 2008: 405-416 - [c12]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh:
Set Covering with our Eyes Closed. FOCS 2008: 347-356 - [c11]Tamás Király, Lap Chi Lau, Mohit Singh:
Degree Bounded Matroids and Submodular Flows. IPCO 2008: 259-272 - [c10]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. Discret. Appl. Math. 155(4): 579-583 (2007) - [c9]Uriel Feige, Mohit Singh:
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. APPROX-RANDOM 2007: 104-118 - [c8]Mohit Singh, Surya Santoso, Christopher J. Melhorn, Mark F. McGranaghan:
Closed-Loop Solution of Transient Recovery Voltage for Interrupted Induction Motor Starting. IAS 2007: 1217-1223 - [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. Electron. Notes Discret. Math. 15: 196-197 (2003)
Coauthor Index
Uthaipon Tao Tantipongpipat
aka: Uthaipon Tantipongpipat
aka: Uthaipon Tantipongpipat
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
