Institute for Theoretical Information Technology
Publications by Thomas Niessen
2001
2000

T. Niessen, J. Kind, The roundup property of the fractional chromatic number for proper circular arc graphs, Journal of Graph Theory, vol. 33, pp. 256267, 2000.

R. Mathar, T. Niessen, Optimum positioning of base stations for cellular radio networks, Wireless Networks, vol. 6, no. 4, pp. 421428, 2000.
1999

K. Tuschku, R. Mathar, T. Niessen, Interference minimization in wireless communication systems by optimal cell site selection, Proceedings: EPMCC'99, Paris, 1999.

M. Hellebrandt, F. Lambrecht, R. Mathar, T. Niessen, R. Starke, Frequency allocation and linear programming, Proceedings: IEEE VTC, Houston, 1999.
1998

T. Niessen, A characterization of graphs having all (g,f)factors, Journal of Combinatorial Theory, Series B, vol. 72, no. 1, pp. 152156, 1998.

T. Niessen, B. Randerath, Regular factors of simple regular graphs, and factor spectra, Discrete Mathematics, vol. 85, pp. 89103, 1998.

J. Kind, T. Niessen, R. Mathar, Theory of Maximum Packing and related allocation strategies for cellular radio networks, Mathematical Methods of Operations Research, vol. 48, no. 1, pp. 116, 1998.
1997

T. Niessen, A Fantype condition for regular factors, Ars Combin, vol. 46, pp. 277285, 1997.

T. Niessen, Complete closure and regular factors, J. Comb. Math. Comb. Comput., vol. 25, pp. 145160, 1997.

T. Niessen, Optimal channel allocation for several types of cellular radio networks, Discrete Applied Mathematics, vol. 79, pp. 155170, 1997.
1995

T. Niessen, Optimal channel assignment in cellular radio networks with linear structure, ITGFachberichte, vol. 135, pp. 181187, September 1995.

T. Niessen, Neighborhood unions and regular factors, J. Graph Theory, vol. 19, pp. 4564, 1995.
1994

D. Bauer, T. Niessen, E. Schmeichel, Neighborhood unions, degree sums, toughness and 2factors, Congress. Numer., vol. 100, pp. 4757, 1994.

P. Dankelmann, T. Niessen, I. Schiermeyer, On pathtough graphs, SIAM J. Discrete Math., vol. 7, pp. 571584, 1994.

T. Niessen, How to find overfull subgraphs in graphs with large maximum degree, Discrete Appl. Math., vol. 51, pp. 117125, 1994.
1992
1990