Search

In order to translate scientific results from bench to bedside and further into an evidence-based and efficient health system, intensive collaboration is needed between experts from medicine, biology, informatics, engineering, public health, as well as social and economic sciences. Research challenges can be attributed to four areas: bioinformatics and systems biology, biomedical engineering and informatics, health informatics and individual healthcare, and public health informatics. In order to bridge existing gaps between different disciplines and cultures, we suggest focusing on interdisciplinary education, taking an integrative approach and starting interdisciplinary practice at early stages of education.

The Bulletin of Zoological Nomenclature, Volume 24, Issue 3, pp. 192

Bulletin of the Raffles Museum, Singapore, Issue 14, pp. 5-46

The Bulletin of Zoological Nomenclature, Volume 20, Issue 2, pp. 104

The Bulletin of Zoological Nomenclature, Volume 12, Issue 5, pp. 141-142

The Bulletin of Zoological Nomenclature, Volume 10, Issue 10-11, pp. 315-322

The Bulletin of Zoological Nomenclature, Volume 22, Issue 1, pp. 63-65

The Bulletin of Zoological Nomenclature, Volume 21, Issue 3, pp. 189-190

The Bulletin of Zoological Nomenclature, Volume 24, Issue 2, pp. 66

The Bulletin of Zoological Nomenclature, Volume 21, Issue 2, pp. 133-136

The Bulletin of Zoological Nomenclature, Volume 6, Issue 8, pp. 244

The Bulletin of Zoological Nomenclature, Volume 15, Issue 9-10, pp. 270-271

The Bulletin of Zoological Nomenclature, Volume 18, Issue 3, pp. 209-210

The Bulletin of Zoological Nomenclature, Volume 13, Issue 6, pp. 177-182

The Bulletin of Zoological Nomenclature, Volume 8, Issue 1-3, pp. 76-77

The Bulletin of Zoological Nomenclature, Volume 18, Issue 5, pp. 297-303

The Bulletin of Zoological Nomenclature, Volume 19, Issue 1, pp. 23-26

The Bulletin of Zoological Nomenclature, Volume 24, Issue 5, pp. 275

The Bulletin of Zoological Nomenclature, Volume 20, Issue 1, pp. 16-17

The Bulletin of Zoological Nomenclature, Volume 19, Issue 6, pp. 358-362

The Bulletin of Zoological Nomenclature, Volume 25, Issue 1, pp. 52-54

The Bulletin of Zoological Nomenclature, Volume 6, Issue 7, pp. 210

The Bulletin of Zoological Nomenclature, Volume 9, Issue 6, pp. 161-162

The Bulletin of Zoological Nomenclature, Volume 6, Issue 8, pp. 255

The Bulletin of Zoological Nomenclature, Volume 17, Issue 3-5, pp. 68

The Bulletin of Zoological Nomenclature, Volume 10, Issue 10-11, pp. 334

We present an algorithm to support the dynamic embedding in the plane of a dynamic graph. An edge can be inserted across a face between two vertices on the face boundary (we call such a vertex pair linkable), and edges can be deleted. The planar embedding can also be changed locally by flipping components that are connected to the rest of the graph by at most two vertices. Given vertices $u,v$, linkable$(u,v)$ decides whether $u$ and $v$ are linkable in the current embedding, and if so, returns a list of suggestions for the placement of $(u,v)$ in the embedding. For non-linkable vertices $u,v$, we define a new query, one-flip-linkable$(u,v)$ providing a suggestion for a flip that will make them linkable if one exists. We support all updates and queries in O(log$^2 n$) time. Our time bounds match those of Italiano et al. for a static (flipless) embedding of a dynamic graph. Our new algorithm is simpler, exploiting that the complement of a spanning tree of a connected plane graph is a spanning tree of the dual graph. The primal and dual trees are interpreted as having the same Euler tour, and a main idea of the new algorithm is an elegant interaction between top trees over the two trees via their common Euler tour., Comment: Announced at STACS'15

For a given graph G and integer k, the Coloring problem is that of testing whether G has a k-coloring, that is, whether there exists a vertex mapping $$c: V\rightarrow \{1,2,\ldots \}$$ such that $$cu\ne cv$$ for every edgei¾?$$uv\in E$$. We survey known results on the computational complexity of Coloring for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of on-line coloring.

A colouring of a graph is ecological if every pair of vertices that have the same set of colours in their neighbourhood are coloured alike. We consider the following problem: if a graph G and an ecological colouring c of G are given, can further vertices added to G, one at a time, be coloured using colours from some finite set C so that at each stage the current graph is ecologically coloured? If the answer is yes, then we say that the pair (G,c) is ecologically online extendible. By generalizing the well-known First-Fit algorithm, we are able to characterize when (G,c) is ecologically online extendible. For the case where c is a colouring of G in which each vertex is coloured distinctly, we give a simple characterization of when (G,c) is ecologically online extendible using only the colours of c, and we also show that (G,c) is always online extendible if we permit ourselves to use one extra colour. We also study (off-line) ecological H-colourings where the colouring must satisfy further restrictions imposed by some fixed pattern graph H. We characterize the computational complexity of this problem. This solves an open question posed by Crescenzi et al.