Year |
Citation |
Score |
2020 |
Lähnemann D, Köster J, Szczurek E, McCarthy DJ, Hicks SC, Robinson MD, Vallejos CA, Campbell KR, Beerenwinkel N, Mahfouz A, Pinello L, Skums P, Stamatakis A, Attolini CS, Aparicio S, ... ... Mandoiu II, et al. Eleven grand challenges in single-cell data science. Genome Biology. 21: 31. PMID 32033589 DOI: 10.1186/S13059-020-1926-6 |
0.315 |
|
2013 |
Skums P, Mancuso N, Artyomenko A, Tork B, Mandoiu I, Khudyakov Y, Zelikovsky A. Reconstruction of viral population structure from next-generation sequencing data using multicommodity flows. Bmc Bioinformatics. 14: S2. PMID 23902469 DOI: 10.1186/1471-2105-14-S9-S2 |
0.317 |
|
2009 |
Jun J, Mandoiu II, Nelson CE. Identification of mammalian orthologs using local synteny. Bmc Genomics. 10: 630. PMID 20030836 DOI: 10.1186/1471-2164-10-630 |
0.3 |
|
2008 |
Gusev A, Măndoiu II, Paşaniuc B. Highly scalable genotype phasing by entropy minimization. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 5: 252-61. PMID 18451434 DOI: 10.1109/Tcbb.2007.70223 |
0.306 |
|
2007 |
Balla S, Rajasekaran S, Mandoiu II. Efficient algorithms for degenerate primer search International Journal of Foundations of Computer Science. 18: 899-910. DOI: 10.1142/S0129054107005042 |
0.383 |
|
2007 |
Kahng AB, Mǎndoiu II, Xu X, Zelikovsky AZ. Enhanced design flow and optimizations for multiproject wafers Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 26: 301-310. DOI: 10.1109/Tcad.2006.883922 |
0.301 |
|
2006 |
Althaus E, Cǎlinescu G, Mǎndoiu II, Prasad S, Tchervenski N, Zelikovsky A. Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks Wireless Networks. 12: 287-299. DOI: 10.1007/S11276-005-5275-X |
0.349 |
|
2006 |
Hajiaghayi MT, Jain K, Lau LC, Mǎndoiu II, Russell A, Vazirani VV. Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3992: 758-766. DOI: 10.1007/11758525_102 |
0.556 |
|
2005 |
Dasgupta B, Konwar KM, Mandoiu II, Shvartsman AA. Highly scalable algorithms for robust string barcoding. International Journal of Bioinformatics Research and Applications. 1: 145-61. PMID 18048126 DOI: 10.1504/Ijbra.2005.007574 |
0.346 |
|
2005 |
Karpinski M, Mandoiu II, Olshevsky A, Zelikovsky A. Improved approximation algorithms for the quality of service multicast tree problem Algorithmica (New York). 42: 109-120. DOI: 10.1007/S00453-004-1133-Y |
0.348 |
|
2004 |
Kahng AB, Liu B, Mǎndoiu II. Nontree Routing for Reliability and Yield Improvement Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 23: 148-156. DOI: 10.1109/Tcad.2003.819426 |
0.348 |
|
2003 |
Albrecht C, Kahng AB, Liu B, Mǎndoiu II, Zelikovsky AZ. On the skew-bounded minimum-buffer routing tree problem Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 22: 937-945. DOI: 10.1109/Tcad.2003.814238 |
0.359 |
|
2003 |
Alpert CJ, Kahng AB, Liu B, Mǎndoiu II, Zelikovsky AZ. Minimum buffered routing with bounded capacitive load for slew rate and reliability control Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 22: 241-253. DOI: 10.1109/Tcad.2002.807888 |
0.328 |
|
2002 |
Dragan FF, Kahng AB, Mǎndoiu II, Muddu S, Zelikovsky A. Provably good global buffering by generalized multiterminal multicommodity flow approximation Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 21: 263-274. DOI: 10.1109/43.986421 |
0.379 |
|
2002 |
Jain K, Mǎndoiu I, Vazirani VV, Williamson DP. A primal-dual schema based approximation algorithm for the element connectivity problem Journal of Algorithms. 45: 1-15. DOI: 10.1016/S0196-6774(02)00222-5 |
0.636 |
|
2001 |
Zelikovsky AZ, Mandoiu II. Practical approximation algorithms for zero- And bounded-skew trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 407-416. DOI: 10.1137/S0895480100378367 |
0.363 |
|
2000 |
Mandoiu I, Vazirani V, Ganley J. A new heuristic for rectilinear Steiner trees Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 19: 1129-1139. DOI: 10.1109/43.875292 |
0.507 |
|
1998 |
Jain K, Mandoiu I, Vazirani VV. The «art of trellis decoding» is computationally hard-for large fields Ieee International Symposium On Information Theory - Proceedings. 13. DOI: 10.1109/ISIT.1998.708591 |
0.531 |
|
1998 |
Jain K, Mǎndoiu I, Vazirani VV. The art of trellis decoding is computationally hard - For large fields Ieee Transactions On Information Theory. 44: 1211-1214. DOI: 10.1109/18.669287 |
0.552 |
|
1993 |
Mandoiu I. On a theorem of gács International Journal of Computer Mathematics. 48: 157-619. DOI: 10.1080/00207169308804199 |
0.301 |
|
Show low-probability matches. |