Thomas Niessen

18 papers Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2009 — conf
Solution Development 2.0 - Provision and Roll-out of Solution Packages with Social Networking.
Wissensmanagement
Johannes Müller, Yannick Bietenholz, Michel Griga, José Martin Gallardo, Thomas Niessen, Peter Stiphout
2008 J jnl
Digging Deep into the Data Mine with DataMiningGrid.
IEEE Internet Comput.
Vlado Stankovski, Martin T. Swain, Valentin Kravtsov, Thomas Niessen, Dennis Wegener, M. Rohm, Jernej Trnkoczy, Michael May, Jürgen Franke, Assaf Schuster, Werner Dubitzky
2008 J jnl
Grid-enabling data mining applications with DataMiningGrid: An architectural perspective.
Future Gener. Comput. Syst.
Vlado Stankovski, Martin T. Swain, Valentin Kravtsov, Thomas Niessen, Dennis Wegener, Jörg Kindermann, Werner Dubitzky
2006 — conf
Service-based Resource Brokering for Grid-Based Data Mining.
GCA
Valentin Kravtsov, Thomas Niessen, Vlado Stankovski, Assaf Schuster
2001 J jnl
How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II.
Electron. J. Comb.
Thomas Niessen
2000 J jnl
Optimum positioning of base stations for cellular radio networks.
Wirel. Networks
Rudolf Mathar, Thomas Niessen
2000 J jnl
The round-up property of the fractional chromatic number for proper circular arc graphs.
J. Graph Theory
Thomas Niessen, Jaakob Kind
1999 J jnl
Polyhedral Sets and Integer Rounding.
Electron. Notes Discret. Math.
Thomas Niessen, Jaakob Kind
1998 J jnl
A Characterization of Graphs Having All (
J. Comb. Theory B
Thomas Niessen
1998 J jnl
Regular factors of simple regular graphs and factor-spectra.
Discret. Math.
Thomas Niessen, Bert Randerath
1998 J jnl
Theory of maximum packing and related channel assignment strategies for cellular radio networks.
Math. Methods Oper. Res.
Jaakob Kind, Thomas Niessen, Rudolf Mathar
1997 J jnl
A Fan-Type Result for Regular Factors.
Ars Comb.
Thomas Niessen
1997 J jnl
Optimal Channel Allocation for Several Types of Cellular Radio Networks.
Discret. Appl. Math.
Thomas Niessen
1995 J jnl
Minimum degree, independence number and regular factors.
Graphs Comb.
Thomas Niessen
1995 J jnl
Neighborhood unions and regular factors.
J. Graph Theory
Thomas Niessen
1994 J jnl
How to Find overfull Subgraphs in Graphs with Large Maximum Degree.
Discret. Appl. Math.
Thomas Niessen
1994 J jnl
On Path-Tough Graphs.
SIAM J. Discret. Math.
Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer
1990 J jnl
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree.
J. Graph Theory
Thomas Niessen, Lutz Volkmann