Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Manuel Streicher"'
Autor:
Neele Leithäuser, Dennis Adelhütte, Kristin Braun, Christina Büsing, Martin Comis, Timo Gersing, Sebastian Johann, Arie M. C. A. Koster, Sven O. Krumke, Frauke Liers, Eva Schmidt, Johanna Schneider, Manuel Streicher, Sebastian Tschuppik, Sophia Wrede
Publikováno v:
BMC Medical Informatics and Decision Making, Vol 22, Iss 1, Pp 1-20 (2022)
Abstract Background The healthcare sector poses many strategic, tactic and operational planning questions. Due to the historically grown structures, planning is often locally confined and much optimization potential is foregone. Methods We implemente
Externí odkaz:
https://doaj.org/article/6293215406964ab58a0ad0d2bf7b23bb
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 67-87 (2022)
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover. Using this fact
Externí odkaz:
https://doaj.org/article/9632b330d1694b1bb975043e27ad8235
Autor:
Neele Leithäuser, Johanna Schneider, Sebastian Johann, Sven O. Krumke, Eva Schmidt, Manuel Streicher, Stefan Scholz
Publikováno v:
BMC Health Services Research, Vol 21, Iss 1, Pp 1-18 (2021)
Abstract Background Vaccines are an important tool to limit the health and economic damage of the Covid-19 pandemic. Several vaccine candidates already provided promising effectiveness data, but it is crucial for an effective vaccination campaign tha
Externí odkaz:
https://doaj.org/article/d3f7dd2b5c0b40e88097fca5fda08478
Autor:
Irene Heinrich, Manuel Streicher
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 7, Iss 2, Pp 411-428 (2019)
Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two edge disjoint
Externí odkaz:
https://doaj.org/article/a1f261d1b2d9485d9fb53e82f7bec20a
Publikováno v:
European Journal of Operational Research. 295:34-50
Mobile medical units (MMUs) are customized vehicles fitted with medical equipment that are used to provide primary care in rural environments. As MMUs can be easily relocated, they enable a demand-oriented, flexible, and local provision of health ser
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b78bc31edf2f96be17e282c45c39a356
https://doi.org/10.1016/j.ejor.2021.02.037
https://doi.org/10.1016/j.ejor.2021.02.037
In this article we investigate the structure of uniformly $k$-connected and uniformly $k$-edge-connected graphs. Whereas both types have previously been studied independent of each other, we analyze relations between these two classes. We prove that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::802eaf6d90c722dcfee6f00a034c1e14
http://arxiv.org/abs/2103.03767
http://arxiv.org/abs/2103.03767
Autor:
Eva Schmidt, Johanna Schneider, Neele Leithäuser, Stefan Scholz, Sven O. Krumke, Manuel Streicher, Sebastian S. Johann
Publikováno v:
BMC Health Services Research, Vol 21, Iss 1, Pp 1-18 (2021)
BMC Health Services Research
BMC Health Services Research
Background Vaccines are an important tool to limit the health and economic damage of the Covid-19 pandemic. Several vaccine candidates already provided promising effectiveness data, but it is crucial for an effective vaccination campaign that people
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a821accb2a83c6501b8d7ee9efdc833
https://doi.org/10.21203/rs.3.rs-110285/v1
https://doi.org/10.21203/rs.3.rs-110285/v1
The Min-$q$-Multiset Multicover problem presented in this paper is a special version of the Multiset Multicover problem. For a fixed positive integer $q$, we are given a finite ground set $J$, an integral demand for each element in $J$ and a collecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::996f01635122f7ce83e7ddaff380a398
http://arxiv.org/abs/1812.04622
http://arxiv.org/abs/1812.04622
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
Graph-Theoretic Concepts in Computer Science-46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers
Lecture Notes in Computer Science-Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
Graph-Theoretic Concepts in Computer Science-46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers
If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a canonical decomposition into 2.5-connected components. These component
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8803d2a4929f64401e4f0df697b5c45