| 2008 |
|---|
| 10 | 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) |
| 2006 |
|---|
| 9 | | Valentin Kravtsov,
Thomas Niessen,
Vlado Stankovski,
Assaf Schuster:
Service-based Resource Brokering for Grid-Based Data Mining.
GCA 2006: 163-169 |
| 2001 |
|---|
| 8 | EE | Thomas Niessen:
How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 7 | | Rudolf Mathar,
Thomas Niessen:
Optimum positioning of base stations for cellular radio networks.
Wireless Networks 6(6): 421-428 (2000) |
| 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) |
