Výsledky vyhledávání - "Kristin Knorr"

Akademický článek

Polypharmacy and medication related falls risk in orthogeriatric femoral fracture patients

Autor: Van Tran, Emily Koong, Kristin Knorr

Publikováno v: British Journal of Pharmacy, Vol 7, Iss 1 (2022)

Aim: To report polypharmacy rates and identify specific medications that increase falls risk in orthogeriatric femoral fracture patients. Method: A retrospective sub-analysis, using the electronic medical records of patients admitted with a minimal t

Externí odkaz: https://doaj.org/article/5a46db9b11aa4785ae253beedd8fb946

Zobrazit plný text záznamu

Simplifying Non-Simple Fan-Planar Drawings

Autor: Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder

Publikováno v: Lecture Notes in Computer Science, 12868
Graph Drawing and Network Visualization
Lecture Notes in Computer Science ISBN: 9783030929305

A drawing of a graph is fan-planar if the edges intersecting a common edge $a$ share a vertex $A$ on the same side of $a$. More precisely, orienting $e$ arbitrarily and the other edges towards $A$ results in a consistent orientation of the crossings.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c915e932179bbc1a9e9ae264d40bb67c
https://doi.org/10.7155/jgaa.00618

Zobrazit plný text záznamu

On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens

Autor: Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kynčl, Irene Parada

Publikováno v: Journal of Graph Algorithms and Applications, 26 (3)

A star-simple drawing of a graph is a drawing in which adjacent edges do not cross. In contrast, there is no restriction on the number of crossings between two independent edges. We forbid empty lenses, i.e., every lens is required to enclose a verte

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0036534010b970f2521c116694d7e06
https://doi.org/10.7155/jgaa.00600

Zobrazit plný text záznamu

Flipping Plane Spanning Paths

Autor: Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber

Publikováno v: WALCOM: Algorithms and Computation ISBN: 9783031270505

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5b7fa4c205e94b408a109bd19e546c40
https://doi.org/10.1007/978-3-031-27051-2_5

Zobrazit plný text záznamu

Compatible Spanning Trees in Simple Drawings of Kn

Autor: Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Nicolas El Maalouly, Johannes Obenaus, Rosna Paul, Meghana M. Reddy, Birgit Vogtenhuber, Alexandra Weinberger

Publikováno v: Lecture Notes in Computer Science, 13764
Graph Drawing and Network Visualization
Lecture Notes in Computer Science ISBN: 9783031222023

For a simple drawing D of the complete graph Kn, two (plane) subdrawings are compatible if their union is plane. Let TD be the set of all plane spanning trees on D and F(TD) be the compatibility graph that has a vertex for each element in TD and two

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::adbb4bd786a09a72ec4e8d8404cb3018
https://hdl.handle.net/20.500.11850/593031

Zobrazit plný text záznamu