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 *

111 related articles for article (PubMed ID: 38192902)

  • 1. Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs.
    Aichholzer O; García A; Tejel J; Vogtenhuber B; Weinberger A
    Discrete Comput Geom; 2024; 71(1):40-66. PubMed ID: 38192902
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Inserting One Edge into a Simple Drawing is Hard.
    Arroyo A; Klute F; Parada I; Vogtenhuber B; Seidel R; Wiedera T
    Discrete Comput Geom; 2023; 69(3):745-770. PubMed ID: 36883118
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Pointed drawings of planar graphs.
    Aichholzer O; Rote G; Schulz A; Vogtenhuber B
    Comput Geom; 2012 Nov; 45(9):482-494. PubMed ID: 23471372
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Splitting Vertices in 2-Layer Graph Drawings.
    Ahmed R; Angelini P; Bekos MA; Battista GD; Kaufmann M; Kindermann P; Kobourov S; Nollenburg M; Symvonis A; Villedieu A; Wallinger M
    IEEE Comput Graph Appl; 2023; 43(3):24-35. PubMed ID: 37023163
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A radial adaptation of the Sugiyama framework for visualizing hierarchical information.
    Bachmaier C
    IEEE Trans Vis Comput Graph; 2007; 13(3):583-94. PubMed ID: 17356223
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Connectivity of Triangulation Flip Graphs in the Plane.
    Wagner U; Welzl E
    Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128
    [TBL] [Abstract][Full Text] [Related]  

  • 7. An improved neural network model for the two-page crossing number problem.
    He H; Sýkora O; Mäkinen E
    IEEE Trans Neural Netw; 2006 Nov; 17(6):1642-6. PubMed ID: 17131678
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Characterization of 2-Path Product Signed Graphs with Its Properties.
    Sinha D; Sharma D
    Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Minimizing the Number of Edges via Edge Concentration in Dense Layered Graphs.
    Onoue Y; Kukimoto N; Sakamoto N; Koyamada K
    IEEE Trans Vis Comput Graph; 2016 Jun; 22(6):1652-1661. PubMed ID: 26955033
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A Sharp Threshold Phenomenon in String Graphs.
    Tomon I
    Discrete Comput Geom; 2022; 67(1):338-359. PubMed ID: 35023884
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Graph Drawing Aesthetics-Created by Users, Not Algorithms.
    Purchase HC; Pilcher C; Plimmer B
    IEEE Trans Vis Comput Graph; 2012 Jan; 18(1):81-92. PubMed ID: 21173454
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On Hamiltonian Decomposition Problem of 3-Arc Graphs.
    Xu G; Sun Q; Liang Z
    Comput Intell Neurosci; 2022; 2022():5837405. PubMed ID: 35528366
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.
    Shabbir A; Nadeem MF; Ovais A; Ashraf F; Nasir S
    Comb Chem High Throughput Screen; 2022; 25(3):500-509. PubMed ID: 33297913
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO
    Day MC; Hawthorne FC
    Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Vertex-connectivity in periodic graphs and underlying nets of crystal structures.
    Eon JG
    Acta Crystallogr A Found Adv; 2016 May; 72(Pt 3):376-84. PubMed ID: 27126114
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On the Decomposition of Vertex-Transitive Graphs into Multicycles.
    Leighton FT
    J Res Natl Bur Stand (1977); 1983; 88(6):403-410. PubMed ID: 34566113
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.