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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

107 related articles for article (PubMed ID: 37362859)

  • 1. Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.
    Misra P; Saurabh S; Sharma R; Zehavi M
    Algorithmica; 2023; 85(7):2065-2086. PubMed ID: 37362859
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Digraph Energy of Directed Polygons.
    Deng B; Yang N; Liang W; Lu X
    Comb Chem High Throughput Screen; 2022; 25(3):496-499. PubMed ID: 33176639
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Solving Problems on Graphs of High Rank-Width.
    Eiben E; Ganian R; Szeider S
    Algorithmica; 2018; 80(2):742-771. PubMed ID: 31997848
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Complexity of Secure Sets.
    Bliem B; Woltran S
    Algorithmica; 2018; 80(10):2909-2940. PubMed ID: 29937611
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Sombor index of directed graphs.
    Cruz R; Monsalve J; Rada J
    Heliyon; 2022 Mar; 8(3):e09035. PubMed ID: 35265766
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Improved bounds for minimal feedback vertex sets in tournaments.
    Mnich M; Teutrine E
    J Graph Theory; 2018 Jul; 88(3):482-506. PubMed ID: 29861538
    [TBL] [Abstract][Full Text] [Related]  

  • 7. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
    Ganian R; Ordyniak S
    Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803
    [TBL] [Abstract][Full Text] [Related]  

  • 8. 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]  

  • 9. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
    Baste J; Paul C; Sau I; Scornavacca C
    Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan.
    Nederlof J; Swennenhuis CMF
    Algorithmica; 2022; 84(8):2309-2334. PubMed ID: 35880200
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Novel applications of intuitionistic fuzzy digraphs in decision support systems.
    Akram M; Ashraf A; Sarwar M
    ScientificWorldJournal; 2014; 2014():904606. PubMed ID: 25045752
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.
    Keijsper J; Oosterwijk T
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):234-47. PubMed ID: 26357092
    [TBL] [Abstract][Full Text] [Related]  

  • 14. 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]  

  • 15. On the spectral radius and energy of signless Laplacian matrix of digraphs.
    Ganie HA; Shang Y
    Heliyon; 2022 Mar; 8(3):e09186. PubMed ID: 35368532
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Faster algorithms for counting subgraphs in sparse graphs.
    Bressan M
    Algorithmica; 2021; 83(8):2578-2605. PubMed ID: 34720296
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Exploiting bounded signal flow for graph orientation based on cause-effect pairs.
    Dorn B; Hüffner F; Krüger D; Niedermeier R; Uhlmann J
    Algorithms Mol Biol; 2011 Aug; 6():21. PubMed ID: 21867496
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Join-Graph Propagation Algorithms.
    Mateescu R; Kask K; Gogate V; Dechter R
    J Artif Intell Res; 2010 Jan; 37():279-328. PubMed ID: 20740057
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Getting new algorithmic results by extending distance-hereditary graphs via split composition.
    Cicerone S; Di Stefano G
    PeerJ Comput Sci; 2021; 7():e627. PubMed ID: 34307866
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On the shortest path problem of uncertain random digraphs.
    Li H; Zhang K
    Soft comput; 2022; 26(18):9069-9081. PubMed ID: 35909949
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.