Thomas Niessen

Publication Activity (10 Years)

Years Active: 1990-2009
Publications (10 Years): 0

Publications

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