Add to ORKGAbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
AbstractLet r(n) denote the number of integral ideals of norm n in a cubic extension K of the ration...
AbstractIn this paper, we introduce a graph transformation analogous to that of Mycielski. Given a g...
Given an integer r > 0, let Gr, = (Vr, E) denote a graph consisting of a simple finite undirected gr...
A simple undirected graph G is called a sum graph if there exists a labelling L of the vertices of G...
The problem to represent very complex systems has been studied by several authors, obtaining ...
Given a graph G = (V,E) and α ∈ R, we write wα(G)=∑xyϵEdG(x)αdG(y)α, and study the function wα(m) = ...
We present a fixed parameter algorithm that constructively solves the k-dominating set problem on ...
A graph G is called a sum graph if there exists a labelling of the vertices of G by distinct positiv...
Partial combinatory algebras occur regularly in the literature as a framework for an abstract formul...
We consider the problem of reporting the pairwise enclosures among a set of $n$ axes-parallel rectan...
AbstractFor a finite connected graph G let ρ(G̃) be the spectral radius of its universal cover. We p...
Let $S$ be a set of $n$ points in $R^d$, and let each point $p$ of $S$ have a positive weight $w(p)$...
For periodic integrands with unit period in each variable, certain error bounds for lattice rules ar...
Let G=(V, A) denote a simple connected directed graph, and let n=|V|, m=|A|, where nt-1≤m≤(n2) A fee...
AbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
AbstractLet r(n) denote the number of integral ideals of norm n in a cubic extension K of the ration...
AbstractIn this paper, we introduce a graph transformation analogous to that of Mycielski. Given a g...
Given an integer r > 0, let Gr, = (Vr, E) denote a graph consisting of a simple finite undirected gr...
A simple undirected graph G is called a sum graph if there exists a labelling L of the vertices of G...
The problem to represent very complex systems has been studied by several authors, obtaining ...
Given a graph G = (V,E) and α ∈ R, we write wα(G)=∑xyϵEdG(x)αdG(y)α, and study the function wα(m) = ...
We present a fixed parameter algorithm that constructively solves the k-dominating set problem on ...
A graph G is called a sum graph if there exists a labelling of the vertices of G by distinct positiv...
Partial combinatory algebras occur regularly in the literature as a framework for an abstract formul...
We consider the problem of reporting the pairwise enclosures among a set of $n$ axes-parallel rectan...
AbstractFor a finite connected graph G let ρ(G̃) be the spectral radius of its universal cover. We p...
Let $S$ be a set of $n$ points in $R^d$, and let each point $p$ of $S$ have a positive weight $w(p)$...
For periodic integrands with unit period in each variable, certain error bounds for lattice rules ar...
Let G=(V, A) denote a simple connected directed graph, and let n=|V|, m=|A|, where nt-1≤m≤(n2) A fee...
AbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
AbstractLet r(n) denote the number of integral ideals of norm n in a cubic extension K of the ration...
AbstractIn this paper, we introduce a graph transformation analogous to that of Mycielski. Given a g...