Results 71 to 80 of about 4,122,423 (255)

Cover letter from the Kansas Induced Seismicity State Task Force to Governor Sam Brownback regarding the release of the State Action Plan for Induced Seismicity [2014]

open access: yes, 2014
September 25, 2014 From: Rex Buchanan, Interim Director, Kansas Geological Survey; Mike Tate, Chief, Bureau of Water, Dept. of Health and Environment; Ryan Hoffman, Director, Conservation Division, Corporation Commission; State Task Force on Induced ...
Kansas Induced Seismicity State Task Force.
core  

Structural Parameterizations for Induced and Acyclic Matching

open access: yes
Extended abstract appeared in WG 2025.
Michael Lampis, Manolis Vasilakis
openaire   +2 more sources

Induced Matchings in Subcubic Planar Graphs

open access: yesSIAM Journal on Discrete Mathematics, 2010
We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.
Ross J. Kang   +2 more
openaire   +7 more sources

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska   +13 more
wiley   +1 more source

Procedurally Fair and Stable Matching [PDF]

open access: yes
We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable mechanisms: employment by lotto (Aldershof et al., 1999) and the random order mechanism (Roth and Vande Vate, 1990, Ma, 1996).
Bettina Klaus, Flip Klijn
core  

Approximation hardness of dominating set problems in bounded degree graphs [PDF]

open access: yes, 2008
We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka   +4 more
core   +1 more source

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

open access: yesMolecular Oncology, EarlyView.
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura   +19 more
wiley   +1 more source

Monotonicity and Nash implementation in matching markets with contracts [PDF]

open access: yes, 2005
Haake C-J, Klaus B. Monotonicity and Nash implementation in matching markets with contracts. Working Papers. Institute of Mathematical Economics. Vol 372.
Klaus, B.E.   +3 more
core   +4 more sources

Induced Matchings in Graphs of Bounded Maximum Degree [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2016
For a graph $G$, let $ν_s(G)$ be the induced matching number of $G$. We prove that $ν_s(G) \geq \frac{n(G)}{(\lceil\fracΔ{2}\rceil+1) (\lfloor\fracΔ{2}\rfloor+1)}$ for every graph of sufficiently large maximum degree $Δ$ and without isolated vertices. This bound is sharp.
openaire   +4 more sources

Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining

open access: yesMolecular Oncology, EarlyView.
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

Home - About - Disclaimer - Privacy