Thomas Niessen

Available identifiers

Publication	Date of Publication	Type
Toughness, minimum degree, and spanning cubic subgraphs	2004-03-15	Paper
Optimum positioning of base stations for cellular radio networks	2003-02-19	Paper
Polyhedral sets and integer rounding	2001-09-23	Paper
How to find overfull subgraphs in graphs with large maximum degree. II	2001-02-08	Paper
Regular factors of simple regular graphs and factor-spectra	2000-11-02	Paper
The round-up property of the fractional chromatic number for proper circular arc graphs	2000-09-15	Paper
Theory of maximum packing and related channel assignment strategies for cellular radio networks	2000-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4940059	2000-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q4211750	1999-02-01	Paper
Optimal channel allocation for several types of cellular radio networks	1998-10-12	Paper
A characterization of graphs having all \((g,f)\)-factors	1997-09-15	Paper
https://portal.mardi4nfdi.de/entity/Q4863407	1996-02-06	Paper
Minimum degree, independence number and regular factors	1996-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4851767	1995-10-12	Paper
Neighborhood unions and regular factors	1995-02-01	Paper
On Path-Tough Graphs	1994-12-20	Paper
How to find overfull subgraphs in graphs with large maximum degree	1994-09-20	Paper
https://portal.mardi4nfdi.de/entity/Q4033004	1993-05-18	Paper
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree	1990-01-01	Paper

This page was built for person: Thomas Niessen