Travelled to:1 × Japan
1 × Spain
1 × USA
1 × United Kingdom
2 × Italy
Collaborated with:M.Hoffmann F.Kammer M.Chiesa G.D.Battista M.Patrignani S.Chakraborty S.Künzli L.Thiele U.Adamy C.Ambühl R.S.Anand C.Kaklamanis P.Persiano K.Jansen G.Baier A.Hall E.Köhler H.Schilling M.Skutella
Talks about:bgp (2) wavelength (1) constrain (1) bipartit (1) traffic (1) schedul (1) control (1) complex (1) tempor (1) system (1)
Person: Thomas Erlebach
DBLP: Erlebach:Thomas
Contributed to:
201520122006
200220021997Wrote 6 papers:
- ICALP-v1-2015-Erlebach0K #graph #on the
- On Temporal Graph Exploration (TE, MH, FK), pp. 444–455.
- ICALP-v2-2012-ChiesaBEP #complexity
- Computational Complexity of Traffic Hijacking under BGP and S-BGP (MC, GDB, TE, MP), pp. 476–487.
- ICALP-v1-2006-BaierEHKSS #bound
- Length-Bounded Cuts and Flows (GB, TE, AH, EK, HS, MS), pp. 679–690.
- DAC-2002-ChakrabortyEKT #embedded #realtime #scheduling
- Schedulability of event-driven code blocks in real-time embedded systems (SC, TE, SK, LT), pp. 616–621.
- ICALP-2002-AdamyAAE
- Call Control in Rings (UA, CA, RSA, TE), pp. 788–799.
- ICALP-1997-KaklamanisPEJ
- Constrained Bipartite Edge Coloring with Applications to Wavelength Routing (CK, PP, TE, KJ), pp. 493–504.