Results 151 to 160 of about 308,302 (304)
Crossing limit cycles for a class of piecewise linear differential centers separated by a conic
In previous years the study of the version of Hilbert's 16th problem for piecewise linear differential systems in the plane has increased. There are many papers studying the maximum number of crossing limit cycles when the differential system is ...
Johana Jimenez +2 more
doaj
Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining
IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis +3 more
wiley +1 more source
Computing the Rectilinear Crossing Number of K [PDF]
Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all straight line edges. The problem of drawing an n-vertex complete graph such that its rectilinear crossing number is minimum is known to be an NP-Hard ...
Revoori, Soundarya
core +1 more source
An Algorithm for Estimating the Crossing Number of Dense Graphs, and Continuous Analogs of the Crossing and Rectilinear Crossing Numbers [PDF]
We present a deterministic n 2 + o ( 1 ) -time algorithm that approximates the crossing number of any graph G of order n up to an additive error of o ( n 4 ) . We also provide a randomized polynomial-time algorithm that constructs a drawing of G with cr (
Solé-Pi, Oriol
core +1 more source
Many patients with urothelial cancer do not benefit from treatment with pembrolizumab, while at risk of severe side effects. Changes in the levels of circulating tumor DNA early during treatment, measured by a simple and affordable assay that can be easily implemented in the clinic, can be used as a prognostic tool to identify these patients.
Youssra Salhi +14 more
wiley +1 more source
Bounding the Crossing Number of a Graph in terms of the Crossing Number of a Minor with Small Maximum Degree [PDF]
We show that if G has a minor M with maximum degree at most 4, then the crossing number of G in a surface is at least one fourth the crossing number of M in .
Enrique Garcia-Moreno, Gelasio Salazar
core
The Zero Divisor Graph of the Ring Zqp.
In this paper we construct a star zero divisor graph from the zero divisor graph of the ring Zqp. The star zero divisor graph is obtained by removing some vertices from the zero divisor graph Γ(Zqp), in different ways , but the best way to get star zero ...
Nazar H. Shuker, Payman A. Rashed
doaj
In this paper, we give examples that improve the lower bound on the maximum number of halving lines for sets in the plane with 35, 59, 95, and 97 points and, as a consequence, we improve the current best upper bound of the rectilinear crossing number for
Javier Rodrigo +3 more
doaj +1 more source
The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source
The Graph Crossing Number and its Variants: A Survey [PDF]
The crossing number is a popular tool in graph drawing and visualization, but there is not really just one crossing number; there is a large family of crossing number notions of which the crossing number is the best known.
Marcus Schaefer
core

