This atlas covers all aspects of retina, retinal pigment epithelium, and choroidal tumors, as well as other simulating lesions of intraocular tumors and paraneoplastic syndromes. Each chapter features numerous high-quality pictures based on multimodal imaging, including color fundus photography, fundus autofluorescence, optical coherence tomography, ultrasonography, ultra-widefield imaging, and fundus angiography.
Designed to assist in the diagnosis and treatment of posterior segment intraocular tumors and simulating lesions, this book is intended for ocular oncologists, retina specialists, general ophthalmologists, residents and retina fellows.

This first of two fully updated volumes provides an in-depth account of breast disease characteristics, imaging and diagnosis. Covering from breast anatomy and tumor biology to benign and malignant lesions this is an indispensable companion for breast specialists, medical oncologists, radiologists and pathologists. The new edition contains chapters covering nuclear medicine and a chapter explaining biostatistical and epidemiological terms and has been updated to reflect the latest changes in biomarkers and cancer staging. The book explores topics such as epidemiology, risk factors, pathological evaluation of tumors and biopsy techniques.

The central theme of the present book is zigzags and central-circuits of three- or four-regular plane graphs, which allow a double covering or covering of the edgeset to be obtained. The book presents zigzag and central circuit structures of geometric fullerenes and several other classes of graph of interest in the fields of chemistry and mathematics. It also discusses the symmetries, parameterization and the Goldberg–Coxeter construction for those graphs.

Magic labelings Magic squares are among the more popular mathematical recreations. Their origins are lost in antiquity; over the years, a number of generalizations have been proposed. In the early 1960s, Sedlacek asked whether "magic" ideas could be applied to graphs. Shortly afterward, Kotzig and Rosa formulated the study of graph label­ ings, or valuations as they were first called. A labeling is a mapping whose domain is some set of graph elements - the set of vertices, for example, or the set of all vertices and edges - whose range was a set of positive integers. Various restrictions can be placed on the mapping. The case that we shall find most interesting is where the domain is the set of all vertices and edges of the graph, and the range consists of positive integers from 1 up to the number of vertices and edges. No repetitions are allowed. In particular, one can ask whether the set of labels associated with any edge - the label on the edge itself, and those on its endpoints - always add up to the same sum. Kotzig and Rosa called such a labeling, and the graph possessing it, magic. To avoid confusion with the ideas of Sedlacek and the many possible variations, we would call it an edge-magic total labeling.