Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Sofia Kovaleva"'
Publikováno v:
Respiratory function technologists/scient..
Currently, bronchial challenge tests (BCT) are widely used to diagnose bronchial hyperreactivity to various stimuli. The study aimed to evaluate the impulse oscillometry (IO) potencial effectiveness in the dyagnosis of bronchial obstruction using ace
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a22fe6f3db6d6d9b96f96831dbcbeaa
https://doi.org/10.1183/13993003.congress-2020.3195
https://doi.org/10.1183/13993003.congress-2020.3195
Autor:
Elena Kokorina, Sofia Kovaleva, Larisa Kiryukhina, Evgeny Sokolovich, Pyotr Yablonskii, Armen Avetisyan, Natalia Nefedova, Nina Denisova
Publikováno v:
Thoracic surgery.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a19151a896df814a152f22a28307fd7
https://doi.org/10.1183/13993003.congress-2020.1710
https://doi.org/10.1183/13993003.congress-2020.1710
Autor:
Gennady Kudriashov, Armen Avetisyan, Larisa Kiryukhina, Eugene Sokolovich, Nataliia Nefedova, Sofia Kovaleva, Elena Savchenko, Piotr Yablonskii, Ilya Serezvin, Nina Denisova
Publikováno v:
Thoracic surgery.
PE may be the last chance for treatment and surviving in the MDR/EDR TB patients. Patient selection is very important to prevent the postoperative mortality. Aim: We examined whether the clinical practice features correlated with postoperative morbid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba268ca1ddf6947385bdca6ae1caee82
https://doi.org/10.1183/13993003.congress-2019.pa2220
https://doi.org/10.1183/13993003.congress-2019.pa2220
Autor:
Frits C. R. Spieksma, Sofia Kovaleva
Publikováno v:
SIAM Journal on Discrete Mathematics. 20:748-768
In the weighted rectangle stabbing problem we are given a grid in $\mathbb{R}^2$ consisting of columns and rows each having a positive integral weight, and a set of closed axis-parallel rectangles each having a positive integral demand. The rectangle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a587c5285708047696ae30abdd403c51
https://doi.org/10.1137/s089548010444273x
https://doi.org/10.1137/s089548010444273x
Autor:
Frits Spieksma, Sofia Kovaleva
Publikováno v:
Chapman & Hall/CRC Computer & Information Science Series ISBN: 9781584885504
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3343bc3b303648468f602da8a53d4526
https://doi.org/10.1201/9781420010749.ch37
https://doi.org/10.1201/9781420010749.ch37
Autor:
Frits C. R. Spieksma, Sofia Kovaleva
Publikováno v:
Algorithms – ESA 2004 ISBN: 9783540230250
ESA
ESA
The weighted rectangle multi-stabbing problem (WRMS) can be described as follows: given is a grid in \(\mathop{I\!\!R}^2\)consisting of columns and rows each having a positive integral weight, and a set of closed axis-parallel rectangles each having
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9a0f9a31acfe8f77a8ffc2a8ffa7792
https://doi.org/10.1007/978-3-540-30140-0_39
https://doi.org/10.1007/978-3-540-30140-0_39
Autor:
Sofia Kovaleva
Publikováno v:
Computational Modeling and Problem Solving in the Networked World ISBN: 9781461353669
We consider the following problem: given a set of weighted axis-parallel unit-height closed rectangles on the plane find a maximum weight subset in which no two rectangles intersect. This problem is equivalent to the maximum weight independent set pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d71e272e66997d709845eebf4b9bd923
https://doi.org/10.1007/978-1-4615-1043-7_9
https://doi.org/10.1007/978-1-4615-1043-7_9
Autor:
Frits C. R. Spieksma, Sofia Kovaleva
Publikováno v:
Rairo-Operations research, 36(1), 53-71. EDP Sciences
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f3b3dd8a6100b920d6f5812a1be2116
https://cris.maastrichtuniversity.nl/en/publications/5cb1fbc2-75d8-4bcc-92dd-2cf130589f68
https://cris.maastrichtuniversity.nl/en/publications/5cb1fbc2-75d8-4bcc-92dd-2cf130589f68
Autor:
Sofia Kovaleva, Frits C. R. Spieksma
Publikováno v:
Algorithms and Computation ISBN: 9783540429852
ISAAC
ISAAC
We consider a special set covering problem. This problem is a generalization of finding a minimum clique cover in an interval graph. When formulated as an integer program, the 0-1 constraint matrix of this integer program can be partitioned into an i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::111cb7b003c5385da6036f413413ae44
https://doi.org/10.1007/3-540-45678-3_42
https://doi.org/10.1007/3-540-45678-3_42