These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
4. Fair colorful Jia X; Sheth K; Svensson O Math Program; 2022; 192(1-2):339-360. PubMed ID: 35300155 [TBL] [Abstract][Full Text] [Related]
5. Local convex hulls for a special class of integer multicommodity flow problems. Lin Z; Kwan RSK Comput Optim Appl; 2016; 64(3):881-919. PubMed ID: 32355412 [TBL] [Abstract][Full Text] [Related]
6. New Tools and Connections for Exponential-Time Approximation. Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549 [TBL] [Abstract][Full Text] [Related]
7. Covering Convex Bodies and the Closest Vector Problem. Naszódi M; Venzin M Discrete Comput Geom; 2022; 67(4):1191-1210. PubMed ID: 35572812 [TBL] [Abstract][Full Text] [Related]
8. The k partition-distance problem. Chen YH J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708 [TBL] [Abstract][Full Text] [Related]
9. Autonomous Toy Drone via Coresets for Pose Estimation. Nasser S; Jubran I; Feldman D Sensors (Basel); 2020 May; 20(11):. PubMed ID: 32471199 [TBL] [Abstract][Full Text] [Related]
10. Convex hull analysis of evolutionary and phylogenetic relationships between biological groups. Tian K; Zhao X; Yau SS J Theor Biol; 2018 Nov; 456():34-40. PubMed ID: 30059661 [TBL] [Abstract][Full Text] [Related]
11. On Perturbation Resilience of Non-uniform Bandyapadhyay S Algorithmica; 2022; 84(1):13-36. PubMed ID: 35125578 [TBL] [Abstract][Full Text] [Related]
12. Convex hulls in hamming space enable efficient search for similarity and clustering of genomic sequences. Campo DS; Khudyakov Y BMC Bioinformatics; 2020 Dec; 21(Suppl 18):482. PubMed ID: 33375937 [TBL] [Abstract][Full Text] [Related]
14. Randomized approximate nearest neighbors algorithm. Jones PW; Osipov A; Rokhlin V Proc Natl Acad Sci U S A; 2011 Sep; 108(38):15679-86. PubMed ID: 21885738 [TBL] [Abstract][Full Text] [Related]
15. CudaChain: an alternative algorithm for finding 2D convex hulls on the GPU. Mei G Springerplus; 2016; 5(1):696. PubMed ID: 27350927 [TBL] [Abstract][Full Text] [Related]
16. New algorithms for maximum disjoint paths based on tree-likeness. Fleszar K; Mnich M; Spoerhase J Math Program; 2018; 171(1):433-461. PubMed ID: 30956356 [TBL] [Abstract][Full Text] [Related]
17. Diverse collections in matroids and graphs. Fomin FV; Golovach PA; Panolan F; Philip G; Saurabh S Math Program; 2024; 204(1-2):415-447. PubMed ID: 38371324 [TBL] [Abstract][Full Text] [Related]
18. A technique for obtaining true approximations for Anegg G; Angelidakis H; Kurpisz A; Zenklusen R Math Program; 2022; 192(1-2):3-27. PubMed ID: 35300156 [TBL] [Abstract][Full Text] [Related]
19. Matroid bases with cardinality constraints on the intersection. Lendl S; Peis B; Timmermans V Math Program; 2022; 194(1-2):661-684. PubMed ID: 35782487 [TBL] [Abstract][Full Text] [Related]
20. Counting Real Roots in Polynomial-Time via Diophantine Approximation. Rojas JM Found Comut Math; 2022 Nov; ():1-43. PubMed ID: 36465263 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]