Search Results - "Hell, P."

Losses of mammals (Mammalia) and birds (Aves) on roads in the Slovak part of the Danube Basin by Hell, P., Plavý, R., Slamečka, J., Gašparík, J.

“…Mortality of mammals and birds due to traffic accidents was monitored in the Slovak part of the Danube Basin from September 2000 to December 2002. Monitored…”
Get full text

miR-28-5p Promotes Chromosomal Instability in VHL-Associated Cancers by Inhibiting Mad2 Translation by HELL, Michael P, THOMA, Claudio R, FANKHAUSER, Niklaus, CHRISTINAT, Yann, WEBER, Thomas C, KREK, Wilhelm

“…Chromosomal instability enables tumor development, enabled in part by aberrant expression of the mitotic checkpoint protein Mad2. Here we identify a novel…”
Get full text

Tumor Suppressor VHL Functions in the Control of Mitotic Fidelity by HELL, Michael P, DUDA, Maria, WEBER, Thomas C, MOCH, Holger, KREK, Wilhelm

“…The von Hippel-Lindau (VHL) tumor suppressor protein pVHL is commonly mutated in clear cell renal cell carcinoma (ccRCC) and has been implicated in the control…”
Get full text

Influence supplementary feeding on bark browsing by red deer (Cervus elaphus) under experimental conditions by Rajský, M., Vodňanský, M., Hell, P., Slamečka, J., Kropil, R., Rajský, D.

“…The effect of various supplementary feeds on bark browsing was studied in red deer under controlled conditions. Fifteen female red deer were randomly assigned…”
Get full text

Duality and Polynomial Testing of Tree Homomorphisms by Hell, P., Nesetril, J., Zhu, X.

“…Let H be a fixed digraph. We consider the H-colouring problem, i.e., the problem of deciding which digraphs G admit a homomorphism to H. We are interested in a…”
Get full text

Packing r-Cliques in Weighted Chordal Graphs by Hell, P., Klein, S., Nogueira, L. T., Protti, F.

“…In 1, we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each…”
Get full text

Antidirected hamiltonian paths between specified vertices of a tournament by HELL, P, ROSENFELD, M

Get full text

Broadcasting in generalized chordal rings by Comellas, F., Hell, P.

“…Broadcasting is an information dissemination process in which a message originating at one node of a communication network (modeled as an undirected graph) is…”
Get full text

Complexity of tree homomorphisms by Hell, P., Nešetřil, J., Zhu, X.

“…For a fixed oriented tree T, we consider the complexity of deciding whether or not a given digraph G is homomorphic to T. It was shown by Gutjahr, Woeginger…”
Get full text

On nice graphs by Hell, P., Kostochka, A.V., Raspaud, A., Sopena, E.

“…A digraph G is k-nice for some positive integer k if for every two (not necessarily distinct) vertices x and y in G and every pattern of length k, given as a…”
Get full text

Constructions of large planar networks with given degree and diameter by Fellows, M., Hell, P., Seyffarth, K.

“…There is considerable interest in constructing large networks with given diameter and maximum degree. In certain applications, there is a natural restriction…”
Get full text

Large planar graphs with given diameter and maximum degree by Fellows, M., Hell, P., Seyffarth, K.

“…We consider the problem of determining the maximum number of vertices in a planar graph with given maximum degree Δ and diameter k. This number has previously…”
Get full text

Independent packings in structured graphs by CAMERON, Kathie, HELL, Pavol

“…Packing a maximum number of disjoint triangles into a given graph G is NP-hard, even for most classes of structured graphs. In contrast, we show that packing a…”
Get full text

Interval bigraphs and circular arc graphs by Hell, Pavol, Huang, Jing

“…We prove that the complements of interval bigraphs are precisely those circular arc graphs of clique covering number two, which admit a representation without…”
Get full text

On multiplicative graphs and the product conjecture by HAGGKVIST, R, HELL, P, MILLER, D. J, NEUMANN LARA, V

Get full text

Bi-arc graphs and the complexity of list homomorphisms by Feder, Tomas, Hell, Pavol, Huang, Jing

“…Given graphs G, H, and lists L(v) ⊆ V(H), v ε V(G), a list homomorphism of G to H with respect to the lists L is a mapping f : V(G) → V(H) such that uv ε E(G)…”
Get full text

List Homomorphisms to Reflexive Graphs by Feder, Tomas, Hell, Pavol

“…LetHbe a fixed graph. We introduce the following list homomorphism problem: Given an input graphGand for each vertexvofGa “list”L(v)⊆V(H), decide whether or…”
Get full text

List matrix partitions of chordal graphs by Feder, Tomás, Hell, Pavol, Klein, Sulamita, Nogueira, Loana Tito, Protti, Fábio

“…It is well known that a clique with k + 1 vertices is the only minimal obstruction to k -colourability of chordal graphs. A similar result is known for the…”
Get full text

Spanning spiders and light-splitting switches by Gargano, Luisa, Hammar, Mikael, Hell, Pavol, Stacho, Ladislav, Vaccaro, Ugo

“…Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning…”
Get full text

Partitioning chordal graphs into independent sets and cliques by Hell, Pavol, Klein, Sulamita, Nogueira, Loana Tito, Protti, Fábio

“…We consider the following generalization of split graphs: A graph is said to be a ( k,ℓ)-graph if its vertex set can be partitioned into k independent sets and…”
Get full text