| Year |
Citation |
Score |
| 2023 |
Garg S, Shiragur K, Gordon DM, Charikar M. Distributed algorithms from arboreal ants for the shortest path problem. Proceedings of the National Academy of Sciences of the United States of America. 120: e2207959120. PMID 36716366 DOI: 10.1073/pnas.2207959120 |
0.316 |
|
| 2016 |
Awasthi P, Charikar M, Krishnaswamy R, Sinop AK. Spectral embedding of k-cliques, graph partitioning and k-Means Itcs 2016 - Proceedings of the 2016 Acm Conference On Innovations in Theoretical Computer Science. 301-310. DOI: 10.1145/2840728.2840751 |
0.413 |
|
| 2015 |
Zhu Q, Wong AK, Krishnan A, Aure MR, Tadych A, Zhang R, Corney DC, Greene CS, Bongo LA, Kristensen VN, Charikar M, Li K, Troyanskaya OG. Targeted exploration and analysis of large cross-platform human transcriptomic compendia. Nature Methods. 12: 211-4, 3 p following. PMID 25581801 DOI: 10.1038/Nmeth.3249 |
0.318 |
|
| 2015 |
Awasthi P, Charikar M, Krishnaswamy R, Sinop AK. The Hardness of Approximation of Euclidean κ-Means Leibniz International Proceedings in Informatics, Lipics. 34: 754-767. DOI: 10.4230/LIPIcs.SOCG.2015.754 |
0.403 |
|
| 2015 |
Awasthi P, Bandeira AS, Charikar M, Krishnaswamy R, Villar S, Ward R. Relax, no need to round: Integrality of clustering formulations Itcs 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. 191-200. DOI: 10.1145/2688073.2688116 |
0.348 |
|
| 2014 |
Bandeira AS, Charikar M, Singer A, Zhu A. Multireference alignment using semidefinite programming Itcs 2014 - Proceedings of the 2014 Conference On Innovations in Theoretical Computer Science. 459-470. DOI: 10.1145/2554797.2554839 |
0.353 |
|
| 2014 |
Charikar M, Henzinger M, Nguyên HL. Online bipartite matching with decomposable weights Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 260-271. DOI: 10.1007/978-3-662-44777-2_22 |
0.306 |
|
| 2014 |
Bansal N, Charikar M, Krishnaswamy R, Li S. Better algorithms and hardness for broadcast scheduling via a discrepancy approach Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 55-71. |
0.434 |
|
| 2012 |
Charikar M, Li S. A dependent LP-rounding approach for the k-median problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 194-205. DOI: 10.1007/978-3-642-31594-7_17 |
0.446 |
|
| 2012 |
Bhaskara A, Charikar M, Manokaran R, Vijayaraghavan A. On quadratic programming with a ratio objective Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 109-120. DOI: 10.1007/978-3-642-31594-7_10 |
0.474 |
|
| 2012 |
Bhaskara A, Charikar M, Guruswami V, Vijayaraghavan A, Zhou Y. Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 388-405. |
0.358 |
|
| 2011 |
Ailon N, Charikar M. Fitting tree metrics: Hierarchical clustering and phylogeny Siam Journal On Computing. 40: 1275-1291. DOI: 10.1137/100806886 |
0.53 |
|
| 2011 |
Guruswami V, H̊Astad J, Manokaran R, Raghavendra P, Charikar M. Beating the random ordering is hard: Every ordering csp is approximation resistant Siam Journal On Computing. 40: 878-914. DOI: 10.1137/090756144 |
0.441 |
|
| 2011 |
Charikar M, Hajiaghayi M, Karloff H. Improved approximation algorithms for label cover problems Algorithmica (New York). 61: 190-206. DOI: 10.1007/s00453-010-9464-3 |
0.482 |
|
| 2011 |
Charikar M, Newman A, Nikolov A. Tight hardness results for minimizing discrepancy Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1607-1614. |
0.301 |
|
| 2010 |
Charikar M, Makarychev K, Makarychev Y. Local global tradeoffs in metric embeddings Siam Journal On Computing. 39: 2487-2512. DOI: 10.1137/070712080 |
0.379 |
|
| 2010 |
Charikar M, Leighton T, Li S, Moitray A. Vertex sparsifiers and abstract rounding algorithms Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 265-274. DOI: 10.1109/FOCS.2010.32 |
0.389 |
|
| 2010 |
Charikar M, Hajiaghayi MT, Karloff H, Rao S. ℓ 2 2 spreading metrics for vertex ordering problems Algorithmica (New York). 56: 577-604. DOI: 10.1007/S00453-008-9191-1 |
0.466 |
|
| 2010 |
Charikar M. Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms: Preface Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. xiii-xiv. |
0.339 |
|
| 2009 |
Charikar M, Makarychev K, Makarychev Y. Near-optimal algorithms for maximum constraint satisfaction problems Acm Transactions On Algorithms. 5. DOI: 10.1145/1541885.1541893 |
0.514 |
|
| 2009 |
Bateni M, Charikar M, Guruswami V. Maxmin allocation via degree lower-bounded arborescences Proceedings of the Annual Acm Symposium On Theory of Computing. 543-552. DOI: 10.1145/1536414.1536488 |
0.41 |
|
| 2009 |
Charikar M, Guruswami V, Manokaran R. Every permutation CSP of arity 3 is approximation resistant Proceedings of the Annual Ieee Conference On Computational Complexity. 62-73. DOI: 10.1109/CCC.2009.29 |
0.378 |
|
| 2008 |
Ailon N, Charikar M, Newman A. Aggregating inconsistent information: Ranking and clustering Journal of the Acm. 55. DOI: 10.1145/1411509.1411513 |
0.547 |
|
| 2007 |
Agarwal A, Alon N, Charikar MS. Improved approximation for directed cut problems Proceedings of the Annual Acm Symposium On Theory of Computing. 671-680. DOI: 10.1145/1250790.1250888 |
0.427 |
|
| 2007 |
Charikar M, Makarychev K, Makarychev Y. On the advantage over random for maximum acyclic subgraph Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 625-633. DOI: 10.1109/FOCS.2007.4389531 |
0.46 |
|
| 2006 |
Charikar M, Goemans MX, Karloff H. On the integrality ratio for the asymmetric traveling salesman problem Mathematics of Operations Research. 31: 245-252. DOI: 10.1287/Moor.1060.0191 |
0.37 |
|
| 2006 |
Charikar M, Makarychev K, Makarychev Y. Near-optimal algorithms for unique games Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 205-214. |
0.424 |
|
| 2005 |
Bo B, Charikar M. On the impossibility of dimension reduction in ℓ 1 Journal of the Acm. 52: 766-788. DOI: 10.1145/1089023.1089026 |
0.374 |
|
| 2005 |
Agarwal A, Makarychev K, Charikar M, Makarychev Y. O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and Directed Cut problems Proceedings of the Annual Acm Symposium On Theory of Computing. 573-581. DOI: 10.1145/1060590.1060675 |
0.403 |
|
| 2005 |
Charikar M, Karagiozova A. On non-uniform multicommodity buy-at-bulk network design Proceedings of the Annual Acm Symposium On Theory of Computing. 176-182. DOI: 10.1145/1060590.1060617 |
0.411 |
|
| 2005 |
Charikar M, Guha S. Improved combinatorial algorithms for facility location problems Siam Journal On Computing. 34: 803-824. DOI: 10.1137/S0097539701398594 |
0.516 |
|
| 2005 |
Charikar M, Lehman E, Liu D, Panigrahy R, Prabhakaran M, Sahai A, Shelat A. The smallest grammar problem Ieee Transactions On Information Theory. 51: 2554-2576. DOI: 10.1109/Tit.2005.850116 |
0.688 |
|
| 2005 |
Charikar M, Chekuri C, Pál M. Sampling bounds for stochastic optimization Lecture Notes in Computer Science. 3624: 257-269. |
0.576 |
|
| 2005 |
Bansal N, Charikar M, Khanna S, Naor J. Approximating the average response time in broadcast scheduling Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 215-221. |
0.394 |
|
| 2004 |
Charikar M, Kleinberg J, Kumar R, Rajagopalan S, Sahai A, Tomkins A. Minimizing wirelength in zero and bounded skew clock trees Siam Journal On Discrete Mathematics. 17: 582-595. DOI: 10.1137/S0895480199352622 |
0.486 |
|
| 2004 |
Charikar M, Chekuri C, Feder T, Motwani R. Incremental clustering and dynamic information retrieval Siam Journal On Computing. 33: 1417-1440. DOI: 10.1137/S0097539702418498 |
0.677 |
|
| 2004 |
Charikar M, Naor JS, Schieber B. Resource optimization in QoS multicast routing of real-time multimedia Ieee/Acm Transactions On Networking. 12: 340-348. DOI: 10.1109/Tnet.2004.826288 |
0.387 |
|
| 2004 |
Charikar M, Chen K, Farach-Colton M. Finding frequent items in data streams Theoretical Computer Science. 312: 3-15. DOI: 10.1016/S0304-3975(03)00400-6 |
0.36 |
|
| 2004 |
Charikar M, Panigrahy R. Clustering to minimize the sum of cluster diameters Journal of Computer and System Sciences. 68: 417-441. DOI: 10.1016/J.Jcss.2003.07.0014 |
0.634 |
|
| 2004 |
Charikar M, Wirth A. Maximizing quadratic programs: Extending Grothendieck's inequality Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 54-60. |
0.393 |
|
| 2003 |
Broder AZ, Charikar M, Mitzenmacher M. A derandomization using min-wise independent permutations Journal of Discrete Algorithms. 1: 11-20. DOI: 10.1016/S1570-8667(03)00003-0 |
0.443 |
|
| 2003 |
Charikar M, Guha S, Tardos E, Shmoys DB. A constant-factor approximation algorithm for the k-median problem Journal of Computer and System Sciences. 65: 129-149. DOI: 10.1006/jcss.2002.1882 |
0.484 |
|
| 2003 |
Charikar M, O'Callaghan L, Panigrahy R. Better streaming algorithms for clustering problems Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 30-39. |
0.706 |
|
| 2002 |
Charikar M, Khuller S, Raghavachari B. Algorithms for capacitated vehicle routing Siam Journal On Computing. 31: 665-682. DOI: 10.1137/S0097539701392056 |
0.464 |
|
| 2002 |
Charikar M, Lehman E, Liu D, Panigrahy R, Prabhakaran M, Rasala A, Sahai A, Shelat A. Approximating the smallest grammar: Kolmogorov complexity in natural models Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 792-801. |
0.482 |
|
| 2002 |
Charikar M, Indyk P, Panigrahy R. New algorithms for subset query, partial match, orthogonal range searching, and related problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2380: 451-462. |
0.708 |
|
| 2002 |
Charikar MS. Similarity estimation techniques from rounding algorithms Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 380-388. |
0.306 |
|
| 2002 |
Charikar M, Sahai A. Dimension reduction in the ℓ1 norm Annual Symposium On Foundations of Computer Science - Proceedings. 551-560. |
0.31 |
|
| 2001 |
Bartal Y, Charikar M, Indyk P. On page migration and other relaxed task systems Theoretical Computer Science. 268: 43-66. DOI: 10.1016/S0304-3975(00)00259-0 |
0.635 |
|
| 2001 |
Albers S, Charikar M, Mitzenmacher M. Delayed information and action in on-line algorithms Information and Computation. 170: 135-152. DOI: 10.1006/Inco.2001.3057 |
0.393 |
|
| 2001 |
Bartal Y, Charikar M, Raz D. Approximating min-sum k-clustering in metric spaces Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 11-20. |
0.458 |
|
| 2001 |
Charikar M, Khuller S, Mount DM, Narasimhan G. Algorithms for facility location problems with outliers Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 642-651. |
0.389 |
|
| 2000 |
Charikar M. Greedy approximation algorithms for finding dense components in a graph Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1913: 84-95. DOI: 10.1007/3-540-44436-X_10 |
0.433 |
|
| 2000 |
Berman P, Charikar M, Karpinski M. On-Line Load Balancing for Related Machines Journal of Algorithms. 35: 108-121. DOI: 10.1006/Jagm.1999.1070 |
0.461 |
|
| 2000 |
Charikar M, Guruswami V, Kumar R, Rajagopalan S, Sahai A. Combinatorial feature selection problems Annual Symposium On Foundations of Computer Science - Proceedings. 631-640. |
0.36 |
|
| 1999 |
Charikar M, Chekuri C, Cheung T, Dai Z, Goel A, Guha S, Li M. Approximation Algorithms for Directed Steiner Problems Journal of Algorithms. 33: 73-91. DOI: 10.1006/Jagm.1999.1042 |
0.693 |
|
| 1999 |
Charikar M, Chekuri C, Cheung TY, Dai Z, Goel A, Guha S, Li M. Approximation Algorithms for Directed Steiner Problems Journal of Algorithms. 33: 73-91. |
0.676 |
|
| 1999 |
Charikar M, Guha S, Tardos E, Shmoys DB. Constant-factor approximation algorithm for the k-median problem Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 1-10. |
0.504 |
|
| 1999 |
Charikar M, Guha S. Improved combinatorial algorithms for the facility location and k-median problems Annual Symposium On Foundations of Computer Science - Proceedings. 378-388. |
0.446 |
|
| 1998 |
Charikar M, Chekuri C, Goel A, Guha S, Plotkin S. Approximating a finite metric by a small number of tree metrics Annual Symposium On Foundations of Computer Science - Proceedings. 379-388. |
0.647 |
|
| 1997 |
Charikar M, Motwani R, Raghavan P, Silverstein C. Constrained TSP and low-power computing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1272: 104-115. |
0.685 |
|
| Show low-probability matches. |