Preface

Uso dell’osilodrostat: dagli studi LINC alla real world nelle sindromi di Cushing da ACTH ectopico

Complexity of chess domination problems

We study different domination problems of attacking and non-attacking rooksand queens on polyominoes and polycubes of all dimensions. Our main resultproves that maximum independent domination is NP-complete for non-attackingqueens and for non-attacking rooks on polycubes of dimension three and higher.We also analyze these problems for polyominoes and convex polyominoes,conjecture the complexity classes, and provide a computer tool forinvestigation. We have also computed new values for classical queen dominationproblems on chessboards (square polyominoes). For our computations, we havetranslated the problem into an integer linear programming instance. Finally,using this computational implementation and the game engine Godot, we havedeveloped a video game of minimum domination of queens and rooks on randomlygenerated polyominoes.

‘Underestimation of Fall Risks by Older Adults: The Need for Professional Evaluation to Identify Home Hazards’

"Caring for Oneself Program": Protocol for a Randomized Controlled Trial of an Online Positive Psychoeducational Intervention for Informal Caregivers of Older Adults

Organic matter evolution and microbial activity in a vineyard soil after four years of inter-row cover crop management

Comparison of cerebrospinal fluid biomarkers in patients with severe COVID-19 neurological outcomes and Alzheimer’s disease

MHC class I trafficking signal improves induction of cytotoxic T lymphocyte using artificial antigen presenting cells

Dapagliflozin ameliorates Lafora disease phenotype in a zebrafish model

P297: The Omission of Axillary Dissection without Regional Node Irradiation in Breast Cancer Patients with a Single Sentinel Node Macrometastasis Following Mastectomy