Demo Data from EDBT 2026 / reviewers in the wild / expert
Stamatis Stefanakos
dblp:52/5358
· DBLP profile ↗
9ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6Computer networks · 3 · 3 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Routing and switching · 77% Network management and operations · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching › fault-tolerant routing
reliable routing |
0.1 | 1 | 2008 | Reliable routings in networks with generalized link failure events · IEEE/ACM Trans. Netw. 2008 |
Network management and operations › network robustness
fault tolerance |
0.0 | 1 | 2008 | Reliable routings in networks with generalized link failure events · IEEE/ACM Trans. Netw. 2008 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Routing to reduce the cost of wavelength conversion
Thomas Erlebach, Stamatis Stefanakos |
Discret. Appl. Math. | 2 |
| 2008 | Reliable routings in networks with generalized link failure events
Stamatis Stefanakos |
IEEE/ACM Trans. Netw. | 1 |
| 2006 | Reliable Routings in Networks with Generalized Link Failure Events
Stamatis Stefanakos |
Networking | 1 |
| 2005 | Wavelength Conversion in All-Optical Networks with Shortest-Path Routing
Thomas Erlebach, Stamatis Stefanakos |
Algorithmica | 2 |
| 2004 | Routing in all-optical ring networks revisitedabstractA common approach for establishing connection requests in an optical ring network that uses wavelength-division multiplexing is to first find a routing of the requests that minimizes the congestion and then deal with the wavelength allocation. The congestion of a routing, however, does not reflect its wavelength requirements. Indeed, we observe that for certain instances such an approach can result in considerable waste of network resources. To overcome this, we propose a new routing objective, namely to minimize the maximum clique of the routing, i.e., the maximum number of connections that pairwise share a common fiber. We present optimal algorithms and heuristics for finding minimum clique routings and perform experiments to evaluate their performance. Stamatis Stefanakos, Thomas Erlebach |
ISCC | 1 |
| 2003 | Wavelength Conversion in Shortest-Path All-Optical Networks
Thomas Erlebach, Stamatis Stefanakos |
ISAAC | 2 |
| 2003 | On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
Thomas Erlebach, Stamatis Stefanakos |
STACS | 2 |
| 2003 | Resource Allocation Problems in Multifiber WDM Tree Networks
Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos |
WG | 4 |
| 2003 | Call control with k rejections
R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos |
J. Comput. Syst. Sci. | 4 |