Zobrazeno 1 - 10
of 173
pro vyhledávání: '"J. A. Duijvestijn"'
Publikováno v:
Mathematics of Computation, 1970 Oct 01. 24(112), 995-997.
Externí odkaz:
https://www.jstor.org/stable/2004648
Autor:
Goldberg, Michael
Publikováno v:
Mathematics of Computation, 1961 Jul 01. 15(75), 315-315.
Externí odkaz:
https://www.jstor.org/stable/2002933
Autor:
Morales-Brown, Louise Anne1 (AUTHOR) l.morales-brown@lancaster.ac.uk, Perez Algorta, Guillermo1 (AUTHOR), Salifu, Yakubu1 (AUTHOR), Cui, Huantian1 (AUTHOR) cuihuantian@ynucm.edu.cn
Publikováno v:
Journal of Diabetes Research. 11/14/2024, Vol. 2024, p1-17. 17p.
Autor:
M. M. F. Fickers, Hendri H. Pas, J. A. M. J. v.d. Kley, D. C. Flikweert, J. A. Duijvestijn, P. H. M. H. Theunissen, W. N. K. A. van Mook
Publikováno v:
Annals of Oncology. 12:115-118
Summary The case history of a 61-year-old male patient is described, who presented with severe stomatitis, conjunctivitis and leukocytosis The diagnosis chronic lymphocytic leukemia (CLL) stage A (0) was made, for which no treatment was necessary Pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1b03e7478f69b469bde77654eb2bb7d
https://doi.org/10.1023/a:1008324929876
https://doi.org/10.1023/a:1008324929876
Autor:
A. J. W. Duijvestijn
Publikováno v:
Mathematics of Computation. 65:1289-1293
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 26 edges. Results have been checked with the the number of rooted c-nets of R.C. Mullin and P.J. Schellenberg and Liu Yanpei.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fdf2d1f484a64bf506b5162329b25d1
https://doi.org/10.1090/s0025-5718-96-00749-1
https://doi.org/10.1090/s0025-5718-96-00749-1
Autor:
B. Helthuis, A. J. W. Duijvestijn
Publikováno v:
Mathematics of Computation. 54:749-753
A table of 4and 5-hedra of orders up to and including 22 is given. In 1981 we reported on the number of polyhedral graphs [5]. That work was a byproduct of the search for the lowest-order squared square, which was found in March 1978 [3]. The squarin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76b7f7255c5464a5213576594aa90e71
https://doi.org/10.1090/s0025-5718-1990-1011441-8
https://doi.org/10.1090/s0025-5718-1990-1011441-8
Publikováno v:
Nederlands tijdschrift voor geneeskunde. 148(25)
Coping with grief following perinatal death is a natural process that every individual experiences in his own personal and unique way. Parents go through varying emotions in the months following the death of their baby. Empathic support and understan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::c0c8f0a09bccb82911e5c463b7438082
https://pubmed.ncbi.nlm.nih.gov/15301384
https://pubmed.ncbi.nlm.nih.gov/15301384
Autor:
Bucci, Tommaso1,2 (AUTHOR) knabrdalik@sum.edu.pl, Nabrdalik, Katarzyna1,3 (AUTHOR) s.shantsila@liverpool.ac.uk, Shantsila, Alena1 (AUTHOR) giuliofrancesco.romiti@uniroma1.it, Romiti, Giulio Francesco1,4 (AUTHOR), Teo, Wee-Siong5 (AUTHOR) wswkiliteo@gmail.com, Park, Hyung-Wook6 (AUTHOR) mdhwp@chonnam.ac.kr, Shimizu, Wataru7 (AUTHOR) wshimizu@nms.ac.jp, Tse, Hung-Fat8 (AUTHOR) hftse@hku.hk, Proietti, Marco9,10 (AUTHOR) marco.proietti@unimi.it, Chao, Tze-Fan11,12 (AUTHOR) eyckeyck@gmail.com, Lip, Gregory Y. H.1,13 (AUTHOR) eyckeyck@gmail.com
Publikováno v:
Journal of Clinical Medicine. Mar2024, Vol. 13 Issue 5, p1274. 15p.
Autor:
A. J. W. Duijvestijn
Publikováno v:
Mathematics of Computation. 62:325
In this note tables of all simple perfect squared squares and simple 2x1 perfect squared rectangles of order 25 are presented.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a12e612ce30dfd18ecbb758eea5ab6e1
https://doi.org/10.2307/2153412
https://doi.org/10.2307/2153412
Autor:
Fan, Zhan‐Hong, Xu, Jie, Ge, Meng‐Wei, Huang, Jie‐Wei, Ni, Hai‐Tao, Shen, Wang‐Qin, Chen, Hong‐Lin
Publikováno v:
Journal of Advanced Nursing (John Wiley & Sons, Inc.); Oct2024, Vol. 80 Issue 10, p4050-4073, 24p