Zobrazeno 1 - 10
of 2 395
pro vyhledávání: '"Nover, A."'
Autor:
Matthieu Lalevee, Mo Saffarini, Floris van Rooij, Luca Nover, Alexis Nogier, Philippe Beaudet
Publikováno v:
EFORT Open Reviews, Vol 9, Iss 10, Pp 933-940 (2024)
Purpose: Recurrence of hallux valgus (HV) following corrective surgery is a frequent concern. A recent systematic review estimated recurrence of HV in only 4.9%, which may be an underestimation, as most included studies had short- to mid-term follow-
Externí odkaz:
https://doaj.org/article/a4a903eb246e45b8a35b0a6e3290a1bd
Autor:
Naser Musli, Patrick Baumgartner, Marc Meier, Sira Thiel, Silvana K. Rampini, Edouard Battegay, Malcolm Kohler, van Rooij Floris, Thomas Kuratle, Luca Nover, Mo Saffarini, Carolin Steinack, Shekhar Saxena, Thomas Gaisl
Publikováno v:
Swiss Medical Weekly, Vol 154, Iss 7 (2024)
AIM OF THE STUDY: The purpose of the present study was to evaluate demographic characteristics of inmates in the Canton of Zurich (exposure), and investigate the changes in diseases and drug use between 2015 and 2020 (outcome). METHODS: The study p
Externí odkaz:
https://doaj.org/article/e4a22587cb3f45e8a7796334d00ba4ec
Autor:
Müller, Jacobus H., Hibbon, Aude, Nover, Luca, Saffarini, Mo, Gallinet, David, Hubert, Laurent, Guery, Jacques, Garret, Jérôme, Nérot, Cécile, Godenèche, Arnaud
Publikováno v:
In Orthopaedics & Traumatology: Surgery & Research September 2024 110(5)
Autor:
Bokal, Drago, Chimani, Markus, Nover, Alexander, Schierbaum, Jöran, Stolzmann, Tobias, Wagner, Mirko H., Wiedera, Tilo
A $c$-crossing-critical graph is one that has crossing number at least $c$ but each of its proper subgraphs has crossing number less than $c$. Recently, a set of explicit construction rules was identified by Bokal, Oporowski, Richter, and Salazar to
Externí odkaz:
http://arxiv.org/abs/2112.04854
Given a graph $G=(V,E)$ and a set $S \subseteq \binom{V}{2}$ of terminal pairs, the minimum multicut problem asks for a minimum edge set $\delta \subseteq E$ such that there is no $s$-$t$-path in $G -\delta$ for any $\{s,t\}\in S$. For $|S|=1$ this i
Externí odkaz:
http://arxiv.org/abs/2112.01095
Autor:
van Rooij, Floris, Nover, Luca, Dejour, Edouard, Saffarini, Mo, Garret, Jerome, Cuinet, Thomas, Guillard, Vincent, Montalvan, Bernard
Publikováno v:
In JSES International May 2024 8(3):551-569
Autor:
van Rooij, Floris, Hibon, Aude, Nover, Luca, Saffarini, Mo, Nové-Josserand, Laurent, Nerot, Cecile, Colotte, Philippe, Guery, Jacques, Godenèche, Arnaud
Publikováno v:
In Journal of Shoulder and Elbow Surgery April 2024 33(4):850-862
Given a graph $G=(V,E)$, the maximum bond problem searches for a maximum cut $\delta(S) \subseteq E$ with $S \subseteq V$ such that $G[S]$ and $G[V\setminus S]$ are connected. This problem is closely related to the well-known maximum cut problem and
Externí odkaz:
http://arxiv.org/abs/2012.06288
Autor:
van Rooij, Floris, Saffarini, Mo, Nover, Luca, Garret, Jerome, Cuinet, Thomas, Ducharne, Louis, Godenèche, Arnaud
Publikováno v:
In Journal of Shoulder and Elbow Surgery February 2024 33(2):328-334
Autor:
Martinus Sinurat, Nover Iradat1 noversinurat03@gmail.com, Kirana, Kusuma Chandra1 kusumack@ustjogja.ac.id, Subiyanto, E. Didik1 didiks@ustjogja.ac.id
Publikováno v:
Eduvest: Journal Of Universal Studies. Apr2024, Vol. 4 Issue 4, p1978-1987. 10p.