Year |
Citation |
Score |
2015 |
Bandyapadhyay S, Bhowmick S, Varadarajan K. On the approximability of orthogonal order preserving layout adjustment Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9214: 54-65. DOI: 10.1007/978-3-319-21840-3_5 |
0.302 |
|
2015 |
Bandyapadhyay S, Bhowmick S, Varadarajan K. Approximation schemes for partitioning: Convex decomposition and surface approximation Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2015: 1457-1470. |
0.471 |
|
2014 |
Gibson M, Varadarajan K, Wu X. Computing regions decomposable into m stars Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 480-491. DOI: 10.1007/978-3-662-44777-2_40 |
0.38 |
|
2013 |
Bhowmick S, Varadarajan K, Xue SK. A constant-factor approximation for multi-covering with disks Proceedings of the Annual Symposium On Computational Geometry. 243-248. |
0.337 |
|
2012 |
Varadarajan K, Xiao X. On the sensitivity of shape fitting problems Leibniz International Proceedings in Informatics, Lipics. 18: 486-497. DOI: 10.4230/LIPIcs.FSTTCS.2012.486 |
0.314 |
|
2012 |
Gibson M, Kanade G, Krohn E, Pirwani IA, Varadarajan K. On clustering to minimize the sum of radii Siam Journal On Computing. 41: 47-60. DOI: 10.1137/100798144 |
0.446 |
|
2012 |
Mahajan M, Nimbhorkar P, Varadarajan K. The planar k-means problem is NP-hard Theoretical Computer Science. 442: 13-21. DOI: 10.1016/J.Tcs.2010.05.034 |
0.445 |
|
2011 |
Pemmaraju SV, Raman R, Varadarajan K. Max-coloring and online coloring with bandwidths on interval graphs Acm Transactions On Algorithms. 7. DOI: 10.1145/1978782.1978790 |
0.477 |
|
2011 |
Gibson M, Varadarajan K. Optimally Decomposing Coverings with Translates of a Convex Polygon Discrete and Computational Geometry. 46: 313-333. DOI: 10.1007/S00454-011-9353-9 |
0.421 |
|
2011 |
Gibson M, Kanade G, Varadarajan K. On isolating points using disks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6942: 61-69. DOI: 10.1007/978-3-642-23719-5_6 |
0.449 |
|
2011 |
Varadarajan KM. Efficient serial floating-point constant divider structure of the form 2P±1 Peccs 2011 - Proceedings of the 1st International Conference On Pervasive and Embedded Computing and Communication Systems. 485-490. |
0.303 |
|
2010 |
Varadarajan K. Weighted geometric set cover via quasi-uniform sampling Proceedings of the Annual Acm Symposium On Theory of Computing. 641-647. DOI: 10.1145/1806689.1806777 |
0.33 |
|
2009 |
Gibson M, Varadarajan K. Decomposing coverings and the planar sensor cover problem Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 159-168. DOI: 10.1109/FOCS.2009.54 |
0.337 |
|
2008 |
Codenotti B, McCune B, Pemmaraju S, Raman R, Varadarajan K. An experimental study of different approaches to solve the market equilibrium problem Journal of Experimental Algorithmics. 12. DOI: 10.1145/1227161.1402295 |
0.528 |
|
2008 |
Codenotti B, Saberi A, Varadarajan K, Ye Y. The complexity of equilibria: Hardness results for economies via a correspondence with games Theoretical Computer Science. 408: 188-198. DOI: 10.1016/J.Tcs.2008.08.007 |
0.501 |
|
2007 |
Deshpande A, Varadarajan K. Sampling-based dimension reduction for subspace approximation Proceedings of the Annual Acm Symposium On Theory of Computing. 641-650. DOI: 10.1145/1250790.1250884 |
0.425 |
|
2007 |
Varadarajan K, Venkatesh S, Ye Y, Zhang J. Approximating the Radii of Point Sets Siam Journal On Computing. 36: 1764-1776. DOI: 10.1137/050627472 |
0.517 |
|
2007 |
Codenotti B, Varadarajan K. Computation of market equilibria by convex programming Algorithmic Game Theory. 135-158. DOI: 10.1017/CBO9780511800481.008 |
0.429 |
|
2007 |
Shyamalkumar ND, Varadarajan K. Efficient subspace approximation algorithms Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 532-540. DOI: 10.1007/s00454-011-9384-2 |
0.334 |
|
2007 |
Clarkson KL, Varadarajan K. Improved pproximation algorithms for geometric set cover Discrete and Computational Geometry. 37: 43-58. DOI: 10.1007/s00454-006-1273-8 |
0.329 |
|
2006 |
Codenotti B, Rademacher L, Varadarajan K. Computing equilibrium prices in exchange economics with tax distortions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4051: 584-595. DOI: 10.1007/11786986_51 |
0.473 |
|
2005 |
Codenotti B, McCune B, Varadarajan K. Market equilibrium via the excess demand function Proceedings of the Annual Acm Symposium On Theory of Computing. 74-83. DOI: 10.1145/1060590.1060601 |
0.483 |
|
2005 |
Clarkson KL, Varadarajan K. Improved approximation algorithms for geometric set cover Proceedings of the Annual Symposium On Computational Geometry. 135-141. DOI: 10.1007/S00454-006-1273-8 |
0.439 |
|
2005 |
Edwards M, Varadarajan K. No coreset, no cry: II Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3821: 107-115. DOI: 10.1007/11590156_8 |
0.439 |
|
2005 |
Codenotti B, Pemmaraju S, Varadarajan K. On the polynomial time computation of equilibria for certain exchange economies Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 72-81. |
0.532 |
|
2004 |
Codenotti B, Pemmaraju S, Varadarajan K. The computation of market equilibria Acm Sigact News. 35: 23-37. DOI: 10.1145/1054916.1054927 |
0.454 |
|
2004 |
Pemmaraju SV, Raman R, Varadarajan K. Buffer Minimization using Max-Coloring Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 555-564. |
0.335 |
|
2004 |
Codenotti B, Varadarajan K. Efficient computation of equilibrium prices for markets with Leontief utilities Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3142: 371-382. |
0.517 |
|
2003 |
Har-Peled S, Varadarajan K. High-dimensional shape fitting in linear time Proceedings of the Annual Symposium On Computational Geometry. 39-47. DOI: 10.1007/S00454-004-1118-2 |
0.376 |
|
2003 |
Aronov B, Van Kreveld M, Van Oostrum R, Varadarajan K. Facility Location on a Polyhedral Surface Discrete and Computational Geometry. 30: 357-372. DOI: 10.1007/S00454-003-2769-0 |
0.354 |
|
2001 |
Har-Peled S, Varadarajan KR. Approximate shape fitting via linearization Annual Symposium On Foundations of Computer Science - Proceedings. 66-73. |
0.506 |
|
2001 |
Goel A, Indyk P, Varadarajan K. Reductions among high dimensional proximity problems Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 769-778. |
0.376 |
|
2000 |
Varadarajan KR, Agarwal PK. Approximating shortest paths on a nonconvex polyhedron Siam Journal On Computing. 30: 1321-1340. |
0.309 |
|
2000 |
Agarwal PK, Varadarajan KR. Efficient algorithms for approximating polygonal chains Discrete and Computational Geometry. 23: 273-291. |
0.401 |
|
2000 |
Mahajan M, Varadarajan KR. New NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 351-357. |
0.382 |
|
1997 |
Varadarajan KR, Agarwal PK. Linear approximation of simple objects Information Processing Letters. 62: 89-94. |
0.365 |
|
Show low-probability matches. |