( en | de | ru )

 

Disambiguation of "Niessen, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
On Path-Tough Graphs.

, , and . SIAM J. Discret. Math., 7 (4): 571-584 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Niessen

Thomas Niessen

Thomas Niessen

Thomas Niessen

Thomas Niessen

 

Other publications of authors with the same name

A Fan-Type Result for Regular Factors.. Ars Comb., (1997)How to Find overfull Subgraphs in Graphs with Large Maximum Degree.. Discret. Appl. Math., 51 (1-2): 117-125 (1994)Interference minimization in wireless communication systems by optimal cell site selection, , and . 3rd European Personal Mobile Communication Conference (EPMCC'99), page 208-213. Paris, France, (March 1999)Regular factors of simple regular graphs and factor-spectra., and . Discret. Math., 185 (1-3): 89-103 (1998)The round-up property of the fractional chromatic number for proper circular arc graphs., and . J. Graph Theory, 33 (4): 256-267 (2000)Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree., and . J. Graph Theory, 14 (2): 225-246 (1990)How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II.. Electron. J. Comb., (2001)Solution Development 2.0 - Provision and Roll-out of Solution Packages with Social Networking., , , , , and . Wissensmanagement, volume P-145 of LNI, page 87-96. GI, (2009)Interference minimization in wireless communication systems by optimal cell site selection, , and . First Annual Report of the Center of Network Optimization, Würzburg, Germany, (1998)Theory of maximum packing and related channel assignment strategies for cellular radio networks., , and . Math. Methods Oper. Res., 48 (1): 1-16 (1998)