Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Chandoo A"'
Publikováno v:
Cancer Management and Research, Vol Volume 11, Pp 9793-9800 (2019)
Yingpeng Huang,1,2,* Yunshi Huang,3,* Mingdong Lu,2,* Weijian Sun,2 Xiangwei Sun,2 Xiaodong Chen,2 Liyi Li,1 Arvine Chandoo,2 Leping Li1 1Department of General Surgery, Shandong Provincial Hospital Affiliated to Shandong University, Jinan, Shandong,
Externí odkaz:
https://doaj.org/article/97e910c1fa6b48b6a15548584ff3938c
Autor:
Zhang T, Han Z, Chandoo A, Huang X, Sun X, Ye L, Hu C, Xue X, Huang Y, Shen X, Chang W, Lin X
Publikováno v:
Cancer Management and Research, Vol Volume 11, Pp 25-36 (2018)
Teming Zhang,1,* Zheng Han,1,* Arvine Chandoo,1,* Xincheng Huang,1 Xiangwei Sun,1 Lele Ye,2 Changyuan Hu,3 Xiangyang Xue,2 Yingpeng Huang,1 Xian Shen,1 Wenjun Chang,4 Xiaoming Lin5 1Department of General Surgery, Second Affiliated Hospital, Wenzhou M
Externí odkaz:
https://doaj.org/article/b12f5028b5db498ab3429544a606713a
Publikováno v:
Cancer Management and Research, Vol Volume 10, Pp 3513-3520 (2018)
Weiping Ji,1–3,* Arvine Chandoo,1,* Xiaoling Guo,1 Tao You,1 Zhuo Shao,2 Kailian Zheng,2 Juan Wang,4 Jianwei Bi,2 Fang Gao Smith,3 Olga N Tucker,5 Xian Shen1 1Department of General Surgery, The Second Affiliated Hospital and Yuying Children’s Hos
Externí odkaz:
https://doaj.org/article/ca085dc400364312a09e3eac6bee4f2e
Autor:
Chandoo, Maurice
We show how to systematically implement an algorithm in any imperative or functional programming language. The method is based on the premise that it is easy to write down how an algorithm proceeds on a concrete input. This information---which we cal
Externí odkaz:
http://arxiv.org/abs/1808.08989
Autor:
Chandoo, Maurice
Flum and Grohe define a parameter (parameterization) as a function $\kappa$ which maps words over a given alphabet to natural numbers. They require such functions to be polynomial-time computable. We show how this technical restriction can be lifted
Externí odkaz:
http://arxiv.org/abs/1804.11089
Autor:
Chandoo, Maurice
In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of its verte
Externí odkaz:
http://arxiv.org/abs/1802.02819
Autor:
Chandoo, Maurice
We show that computing canonical representations for circular-arc (CA) graphs reduces to computing certain subsets of vertices called flip sets. For a broad class of CA graphs, which we call uniform, it suffices to compute a CA representation to find
Externí odkaz:
http://arxiv.org/abs/1702.05763
Autor:
Chandoo, Maurice
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined in terms
Externí odkaz:
http://arxiv.org/abs/1603.01977
Autor:
Chandoo, Maurice
We compute a canonical circular-arc representation for a given circular-arc (CA) graph which implies solving the isomorphism and recognition problem for this class. To accomplish this we split the class of CA graphs into uniform and non-uniform ones
Externí odkaz:
http://arxiv.org/abs/1507.03348