|
Search the dblp DataBase
Stamatis Stefanakos:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Dimitris Fotakis, Spiridon D. Likothanassis, Stamatis Stefanakos
An Evolutionary Annealing Approach to Graph Coloring. [Citation Graph (0, 0)][DBLP] EvoWorkshops, 2001, pp:120-129 [Conf]
- Thomas Erlebach, Stamatis Stefanakos
Wavelength Conversion in Shortest-Path All-Optical Networks. [Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:595-604 [Conf]
- Stamatis Stefanakos, Thomas Erlebach
Routing in all-optical ring networks revisited. [Citation Graph (0, 0)][DBLP] ISCC, 2004, pp:288-293 [Conf]
- Stamatis Stefanakos
Reliable Routings in Networks with Generalized Link Failure Events. [Citation Graph (0, 0)][DBLP] Networking, 2006, pp:221-232 [Conf]
- Thomas Erlebach, Stamatis Stefanakos
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements. [Citation Graph (0, 0)][DBLP] STACS, 2003, pp:133-144 [Conf]
- R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
Call Control with k Rejections. [Citation Graph (0, 0)][DBLP] SWAT, 2002, pp:308-317 [Conf]
- Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos
Resource Allocation Problems in Multifiber WDM Tree Networks. [Citation Graph (0, 0)][DBLP] WG, 2003, pp:218-229 [Conf]
- Thomas Erlebach, Stamatis Stefanakos
Wavelength Conversion in All-Optical Networks with Shortest-Path Routing. [Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:1-2, pp:43-61 [Journal]
- R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
Call control with k rejections. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:4, pp:707-722 [Journal]
Using Social Ties to Predict Missing Customer Information. [Citation Graph (, )][DBLP]
An optimization framework for joint sensor deployment, link scheduling and routing in underwater sensor networks. [Citation Graph (, )][DBLP]
Routing to reduce the cost of wavelength conversion. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|