Usefulness of a suction ball coagulation probe for hemostasis in complete VATS lobectomy for patients with non-small cell lung cancer
- 期刊名称Surgery Today
- 作者Deguchi, Hiroyuki; Tomoyasu, Makoto; Shigeeda, Wataru; Kaneko, Yuka; Kanno, Hironaga; Maeda, Eri; Saito, Hajime
- 印刷ISSN0941-1291
- 电子ISSN1436-2813
- 文件大小489.56KB
- 发表时间2019-1-25
- DOI10.1007/s00595-019-1769-5
A New Characterization of(P_k)-Free GraphsCamby, Eglantine; Schaudt, Oliver · Algorithmica · 2016
The price of connectivity for dominating set: Upper bounds and complexityCamby, Eglantine; Schaudt, Oliver · Discrete Applied Mathematics · 2014
A note on an induced subgraph characterization of domination perfect graphsCamby, Eglantine; Plein, Fränk · Discrete Applied Mathematics · 2017
An algorithm for cost optimization of PMU and communication infrastructure in WAMSCruz, Marco A.R.S.; Rocha, Helder R.O.; Paiva, Marcia H.M.; Segatto, Marcelo E.V.; Camby, Eglantine; Caporossi, Gilles · International Journal of Electrical Power & Energy Systems · 2019
A sharp lower bound on the number of non-equivalent colorings of graphs of order <mml:math altimg="si8.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>n</mml:mi></mml:math> and maximum degree <mml:math altimg="si11.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>3</mml:mn></mml:math>Absil, Romain; Camby, Eglantine; Hertz, Alain; Mélot, Hadrien · Discrete Applied Mathematics · 2016
From the managing editorJin Akiyama · Graphs and Combinatorics · 1993
On the vertex packing problemC. De Simone · Graphs and Combinatorics · 1993
Sperner capacitiesL. Gargano; J. Körner; U. Vaccaro · Graphs and Combinatorics · 1993
The excess of complex Hadamard matricesH. Kharaghani; Jennifer Seberry · Graphs and Combinatorics · 1993
Gadget classificationMartin Loebl · Graphs and Combinatorics · 1993
Triple placement of graphsMariusz Woźniak; A. Paweł Wojda · Graphs and Combinatorics · 1993
Symmetric Association Schemes of Class 2Hiroshi Iwane · Graphs and Combinatorics · 1993
Searching for counterfeit coinsMartin Aigner; Anping Li · Graphs and Combinatorics · 1997