Thomas Niessen

2009
13		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: 87-96
2008
12	EE	Vlado Stankovski, Martin Swain, Valentin Kravtsov, Thomas Niessen, Dennis Wegener, Jörg Kindermann, Werner Dubitzky: Grid-enabling data mining applications with DataMiningGrid: An architectural perspective. Future Generation Comp. Syst. 24(4): 259-279 (2008)
11	EE	Vlado Stankovski, Martin 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 Computing 12(6): 69-76 (2008)
2006
10		Valentin Kravtsov, Thomas Niessen, Vlado Stankovski, Assaf Schuster: Service-based Resource Brokering for Grid-Based Data Mining. GCA 2006: 163-169
2001
9	EE	Thomas Niessen: How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II. Electr. J. Comb. 8(1): (2001)
2000
8		Rudolf Mathar, Thomas Niessen: Optimum positioning of base stations for cellular radio networks. Wireless Networks 6(6): 421-428 (2000)
1999
7	EE	Thomas Niessen, Jaakob Kind: Polyhedral Sets and Integer Rounding. Electronic Notes in Discrete Mathematics 3: 142-145 (1999)
1998
6	EE	Thomas Niessen, Bert Randerath: Regular factors of simple regular graphs and factor-spectra. Discrete Mathematics 185(1-3): 89-103 (1998)
5	EE	Thomas Niessen: A Characterization of Graphs Having All (g, f)-Factors. J. Comb. Theory, Ser. B 72(1): 152-156 (1998)
1997
4		Thomas Niessen: A Fan-Type Result for Regular Factors. Ars Comb. 46: (1997)
3	EE	Thomas Niessen: Optimal Channel Allocation for Several Types of Cellular Radio Networks. Discrete Applied Mathematics 79(1-3): 155-170 (1997)
1994
2	EE	Thomas Niessen: How to Find overfull Subgraphs in Graphs with Large Maximum Degree. Discrete Applied Mathematics 51(1-2): 117-125 (1994)
1	EE	Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer: On Path-Tough Graphs. SIAM J. Discrete Math. 7(4): 571-584 (1994)

Coauthor Index

1	Yannick Bietenholz	[13]
2	Peter Dankelmann	[1]
3	Werner Dubitzky	[11] [12]
4	Jürgen Franke	[11]
5	José Martin Gallardo	[13]
6	Michel Griga	[13]
7	Jaakob Kind	[7]
8	Jörg Kindermann	[12]
9	Valentin Kravtsov	[10] [11] [12]
10	Rudolf Mathar	[8]
11	Michael May	[11]
12	Johannes Müller	[13]
13	Bert Randerath	[6]
14	M. Rohm	[11]
15	Ingo Schiermeyer	[1]
16	Assaf Schuster	[10] [11]
17	Vlado Stankovski	[10] [11] [12]
18	Peter Stiphout	[13]
19	Martin Swain	[11] [12]
20	Jernej Trnkoczy	[11]
21	Dennis Wegener	[11] [12]

Colors in the list of coauthors