Zobrazeno 1 - 10
of 384
pro vyhledávání: '"Felix Mann"'
Autor:
MacDonald, Alexander
Publikováno v:
BMJ: British Medical Journal, 2014 Oct . 349
Externí odkaz:
https://www.jstor.org/stable/26518487
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Alexander Macdonald
Publikováno v:
Acupuncture in medicine : journal of the British Medical Acupuncture Society. 32(6)
Dr Felix Mann, born in 1931, was an inspiration to doctors who wanted to find out more about acupuncture. He himself had gone from Malvern College to Christ's College Cambridge, to Westminster Hospital and on to Ottawa, to return to Europe via Strasb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7822d3e8e3e87b32b63f1d23ee4c98d2
https://pubmed.ncbi.nlm.nih.gov/25432960
https://pubmed.ncbi.nlm.nih.gov/25432960
Autor:
A. MacDonald
Publikováno v:
BMJ. 349:g6322-g6322
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebf0da28fb5f9b69a6c7e3c844120ef1
https://doi.org/10.1136/bmj.g6322
https://doi.org/10.1136/bmj.g6322
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
19th CIRP Conference on Modeling of Machining Operations Hrsg.: Schulze, Volker; Biermann, Dirk, 117, 110–115
In the process combination of Hammering Turning, the workpiece surface is microtextured during machining by means of a multi-axis superimposed oscillation of the cutting tool. These microtextures are formed by plastic deformation of the surface layer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0bccdc16bb645185c27ac7ab4b7ae08
Publikováno v:
Discrete Applied Mathematics. 305:205-210
In this note, we consider the following problem: given a connected graph G , can we reduce the domination number of G by using only one edge contraction? We show that the problem is polynomial-time solvable on ( P 3 + k P 2 ) -free graphs for any k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2818138fd7979359fac24161682446e2
https://doi.org/10.1016/j.dam.2021.09.009
https://doi.org/10.1016/j.dam.2021.09.009
Publikováno v:
Theoretical Computer Science. 877:18-35
In this paper, we study the problem of deciding whether the total domination number of a given graph G can be reduced using exactly one edge contraction (called 1 -Edge Contraction( γ t ) ). We focus on several graph classes and determine the comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43b4365c103c5a02487f34cb5df859c3
https://doi.org/10.1016/j.tcs.2021.03.028
https://doi.org/10.1016/j.tcs.2021.03.028
Publikováno v:
Proceedings of the Annual Hawaii International Conference on System Sciences.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbff76ae152cd78b890c0b7b0c751183
https://doi.org/10.24251/hicss.2022.809
https://doi.org/10.24251/hicss.2022.809
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number
Autor:
Felix Mann, Felicia Lucke
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031066771
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05b0b39f16a1b8904a1cddc87d4547c1
https://doi.org/10.1007/978-3-031-06678-8_30
https://doi.org/10.1007/978-3-031-06678-8_30