Thomas Niessen

According to our database, Thomas Niessen authored at least 18 papers between 1990 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Solution Development 2.0 - Provision and Roll-out of Solution Packages with Social Networking.

Johannes Müller, Yannick Bietenholz, Michel Griga, José Martin Gallardo, Thomas Niessen, Peter Stiphout

Proceedings of the Fifth Conference Professional Knowledge Management: Experiences and Visions, 2009

2008

Digging Deep into the Data Mine with DataMiningGrid.

Vlado Stankovski, Martin T. Swain, Valentin Kravtsov, Thomas Niessen, Dennis Wegener, M. Rohm, Jernej Trnkoczy, Michael May, Jürgen Franke, Assaf Schuster, Werner Dubitzky

IEEE Internet Comput., 2008

Grid-enabling data mining applications with DataMiningGrid: An architectural perspective.

Vlado Stankovski, Martin T. Swain, Valentin Kravtsov, Thomas Niessen, Dennis Wegener, Jörg Kindermann, Werner Dubitzky

Future Gener. Comput. Syst., 2008

2006

Service-based Resource Brokering for Grid-Based Data Mining.

Valentin Kravtsov, Thomas Niessen, Vlado Stankovski, Assaf Schuster

Proceedings of the 2006 International Conference on Grid Computing & Applications, 2006

2001

How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II.

Thomas Niessen

Electron. J. Comb., 2001

2000

Optimum positioning of base stations for cellular radio networks.

Rudolf Mathar, Thomas Niessen

Wirel. Networks, 2000

The round-up property of the fractional chromatic number for proper circular arc graphs.

Thomas Niessen, Jaakob Kind

J. Graph Theory, 2000

1999

Polyhedral Sets and Integer Rounding.

Thomas Niessen, Jaakob Kind

Electron. Notes Discret. Math., 1999

1998

Theory of maximum packing and related channel assignment strategies for cellular radio networks.

Jaakob Kind, Thomas Niessen, Rudolf Mathar

Math. Methods Oper. Res., 1998

A Characterization of Graphs Having All (<i>g</i>, <i>f</i>)-Factors.

Thomas Niessen

J. Comb. Theory, Ser. B, 1998

Regular factors of simple regular graphs and factor-spectra.

Thomas Niessen, Bert Randerath

Discret. Math., 1998

1997

Optimal Channel Allocation for Several Types of Cellular Radio Networks.

Thomas Niessen

Discret. Appl. Math., 1997

A Fan-Type Result for Regular Factors.

Thomas Niessen

Ars Comb., 1997

1995

Neighborhood unions and regular factors.

Thomas Niessen

J. Graph Theory, 1995

Minimum degree, independence number and regular factors.

Thomas Niessen

Graphs Comb., 1995

1994

On Path-Tough Graphs.

Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer

SIAM J. Discret. Math., 1994

How to Find overfull Subgraphs in Graphs with Large Maximum Degree.

Thomas Niessen

Discret. Appl. Math., 1994

1990

Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree.

Thomas Niessen, Lutz Volkmann

J. Graph Theory, 1990