default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Niessen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[c2]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
- [j16]Vlado Stankovski
, Martin T. Swain, Valentin Kravtsov, Thomas Niessen, Dennis Wegener, Jörg Kindermann, Werner Dubitzky:
Grid-enabling data mining applications with DataMiningGrid: An architectural perspective. Future Gener. Comput. Syst. 24(4): 259-279 (2008) - [j15]Vlado Stankovski, Martin T. 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 Comput. 12(6): 69-76 (2008) - 2006
- [c1]Valentin Kravtsov, Thomas Niessen, Vlado Stankovski, Assaf Schuster:
Service-based Resource Brokering for Grid-Based Data Mining. GCA 2006: 163-169 - 2001
- [j14]Thomas Niessen:
How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II. Electron. J. Comb. 8(1) (2001) - 2000
- [j13]Thomas Niessen, Jaakob Kind:
The round-up property of the fractional chromatic number for proper circular arc graphs. J. Graph Theory 33(4): 256-267 (2000) - [j12]Rudolf Mathar, Thomas Niessen:
Optimum positioning of base stations for cellular radio networks. Wirel. Networks 6(6): 421-428 (2000)
1990 – 1999
- 1999
- [j11]Thomas Niessen, Jaakob Kind:
Polyhedral Sets and Integer Rounding. Electron. Notes Discret. Math. 3: 142-145 (1999) - 1998
- [j10]Thomas Niessen, Bert Randerath:
Regular factors of simple regular graphs and factor-spectra. Discret. Math. 185(1-3): 89-103 (1998) - [j9]Thomas Niessen:
A Characterization of Graphs Having All (g, f)-Factors. J. Comb. Theory B 72(1): 152-156 (1998) - [j8]Jaakob Kind, Thomas Niessen, Rudolf Mathar:
Theory of maximum packing and related channel assignment strategies for cellular radio networks. Math. Methods Oper. Res. 48(1): 1-16 (1998) - 1997
- [j7]Thomas Niessen:
A Fan-Type Result for Regular Factors. Ars Comb. 46 (1997) - [j6]Thomas Niessen:
Optimal Channel Allocation for Several Types of Cellular Radio Networks. Discret. Appl. Math. 79(1-3): 155-170 (1997) - 1995
- [j5]Thomas Niessen:
Minimum degree, independence number and regular factors. Graphs Comb. 11(4): 367-378 (1995) - [j4]Thomas Niessen:
Neighborhood unions and regular factors. J. Graph Theory 19(1): 45-64 (1995) - 1994
- [j3]Thomas Niessen:
How to Find overfull Subgraphs in Graphs with Large Maximum Degree. Discret. Appl. Math. 51(1-2): 117-125 (1994) - [j2]Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer:
On Path-Tough Graphs. SIAM J. Discret. Math. 7(4): 571-584 (1994) - 1990
- [j1]Thomas Niessen, Lutz Volkmann:
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree. J. Graph Theory 14(2): 225-246 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
