T. Niessen

Publications38
h-index12
Citations637
Highly Influential Citations30
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • I. Foster
  • 805 Publications, 81,392 Citations
  • A. Hilton
  • 169 Publications, 2,087 Citations
  • A. Chetwynd
  • 105 Publications, 2,778 Citations
  • W. Dubitzky
  • 171 Publications, 2,926 Citations
  • Publications
  • Influence
Optimum positioning of base stations for cellular radio networks
TLDR
Finding optimum base station locations for a cellular radio network is considered as a mathematical optimization problem. Expand
  • 222
  • 8
Grid-enabling data mining applications with DataMiningGrid: An architectural perspective
TLDR
The DataMiningGrid system has been designed to meet the requirements of modern and distributed data mining scenarios. Expand
  • 94
  • 7
  • PDF
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
TLDR
A graph is called Class 1 if the chromatic index equals the maximum degree. Expand
  • 30
  • 3
Regular factors of simple regular graphs and factor-spectra
TLDR
We determine all values of k for which every simple r -regular graph of order n and with edge-connectivity λ has a k -factor for which there exists a maximal set of m edge-disjoint k -factors. Expand
  • 15
  • 3
Digging Deep into the Data Mine with DataMiningGrid
TLDR
We developed the DataMiningGrid system, a grid computing framework for data mining applications that integrates a diverse set of programs and application scenarios within a single framework. Expand
  • 33
  • 2
  • PDF
The round-up property of the fractional chromatic number for proper circular arc graphs
Let G = (V, E) be a graph and let k be a nonnegative integer. A vector c e ℤ V+ is called k-colorable iff there exists a coloring of G with k colors that assigns exactly c(v) colors to vertex v e V.… Expand
  • 17
  • 2
A Characterization of Graphs Having All (g, f)-Factors
  • T. Niessen
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1998
TLDR
We derive from Tutte'sf-factor theorem a similar characterization for the property of having all (g, f)-factors. Expand
  • 31
  • 1
On Path-Tough Graphs
TLDR
A graph G is called path-tough, if, for each nonempty set S of vertices, the graph G-S can be covered by at most |S| vertex disjoint paths. Expand
  • 12
  • 1
Effects of aversive odour presentation on inhibitory control in the Stroop colour-word interference task
BackgroundDue to the unique neural projections of the olfactory system, odours have the ability to directly influence affective processes. Furthermore, it has been shown that emotional states can… Expand
  • 16
  • 1
  • PDF
Service-based Resource Brokering for Grid-Based Data Mining
TLDR
The shift towards intrinsically distributed complex problem solving environments is prompting a need for new systems, which utilize the virtually unlimited data and computational resources of the Grid and at the same time hide all the related complexity from the user. Expand
  • 10
  • 1
  • PDF