dblp.uni-trier.dewww.uni-trier.de

Thomas Erlebach Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
99EEThomas Erlebach, Ambreen Shahnaz: Approximating node-weighted multicast trees in wireless ad-hoc networks. IWCMC 2009: 639-643
98EEThomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano: Directed Tree Networks. Encyclopedia of Optimization 2009: 716-725
97EELeah Epstein, Thomas Erlebach, Asaf Levin: Variable Sized Online Interval Coloring with Bandwidth. Algorithmica 53(3): 385-401 (2009)
96EEYossi Azar, Thomas Erlebach: Foreword. Algorithmica 53(4): 455-456 (2009)
95EEThomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, Danica Vukadinovic: Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. Operations Research 57(4): 1006-1025 (2009)
2008
94 Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers WG 2008
93EEThomas Erlebach, Erik Jan van Leeuwen: Domination in Geometric Intersection Graphs. LATIN 2008: 747-758
92EEDavide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer: Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103
91EEThomas Erlebach, Erik Jan van Leeuwen: Approximating geometric coverage problems. SODA 2008: 1267-1276
90EEJessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller: Broadcast scheduling: algorithms and complexity. SODA 2008: 473-482
89EEThomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff: Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276
88EEMichael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288
87EEThomas Erlebach: Mehrheitsbestimmung - Wer wird Klassensprecher?. Taschenbuch der Algorithmen 2008: 245-254
86EEThomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff: Trimming of Graphs, with Application to Point Labeling CoRR abs/0802.2854: (2008)
85EEThomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty CoRR abs/0802.2855: (2008)
84EEThomas Erlebach, Stamatis Stefanakos: Routing to reduce the cost of wavelength conversion. Discrete Applied Mathematics 156(15): 2911-2923 (2008)
83EEThomas Erlebach, Giuseppe Persiano: WAOA 2005 Special Issue of TOCS. Theory Comput. Syst. 43(1): 1-2 (2008)
2007
82EELeah Epstein, Thomas Erlebach, Asaf Levin: Online Capacitated Interval Coloring. ESCAPE 2007: 243-254
81EEThomas Erlebach, Alexander Hall, Matús Mihalák: Approximate Discovery of Random Graphs. SAGA 2007: 82-92
80EEUdo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach: Call Control in Rings. Algorithmica 47(3): 217-238 (2007)
79EEThomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007)
78EEGiuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank: Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15(2): 267-280 (2007)
77 Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic: Cuts and Disjoint Paths in the Valley-Free Model. Internet Mathematics 3(3): (2007)
2006
76 Thomas Erlebach, Giuseppe Persiano: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers Springer 2006
75 Yossi Azar, Thomas Erlebach: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings Springer 2006
74 Thomas Erlebach: Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers Springer 2006
73 Thomas Erlebach, Christos Kaklamanis: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers Springer 2006
72EEChristoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM 2006: 3-14
71EEThomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák: Network Discovery and Verification with Distance Queries. CIAC 2006: 69-80
70 R. Sai Anand, Thomas Erlebach: Call control on lines. COMSWARE 2006
69EEGeorg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella: Length-Bounded Cuts and Flows. ICALP (1) 2006: 679-690
68EEThomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic: Robustness of the Internet at the Topology and Routing Level. Research Results of the DICS Program 2006: 260-274
67EELeah Epstein, Thomas Erlebach, Asaf Levin: Variable Sized Online Interval Coloring with Bandwidth. SWAT 2006: 29-40
66EEThomas Erlebach, Danica Vukadinovic: Path problems in generalized stars, complete graphs, and brick wall graphs. Discrete Applied Mathematics 154(4): 673-683 (2006)
65EEZuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram: Network Discovery and Verification. IEEE Journal on Selected Areas in Communications 24(12): 2168-2181 (2006)
2005
64 Ulrik Brandes, Thomas Erlebach: Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004] Springer 2005
63EEZuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram: Network Discovery and Verification. Algorithms for Optimization with Incomplete Information 2005
62EEZuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram: Network Discovery and Verification. WG 2005: 127-138
61EEThomas Erlebach, Stamatis Stefanakos: Wavelength Conversion in All-Optical Networks with Shortest-Path Routing. Algorithmica 43(1-2): 43-61 (2005)
60EEThomas Erlebach, Klaus Jansen: Conversion of coloring algorithms into maximum weight independent set algorithms. Discrete Applied Mathematics 148(1): 107-125 (2005)
59EEThomas Erlebach, Klaus Jansen, Eike Seidel: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput. 34(6): 1302-1323 (2005)
2004
58EEThomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic: Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. CAAN 2004: 49-62
57 Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer: Scheduling with Release Times and Deadlines on a Minimum Number of Machines. IFIP TCS 2004: 209-222
56EEThomas Erlebach, Maurice Rüegg: Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing. INFOCOM 2004
55EEStamatis Stefanakos, Thomas Erlebach: Routing in all-optical ring networks revisited. ISCC 2004: 288-293
54EEUlrik Brandes, Thomas Erlebach: Introduction. Network Analysis 2004: 1-6
53EEUlrik Brandes, Thomas Erlebach: Fundamentals. Network Analysis 2004: 7-15
52EEThomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281
51EEUdo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl: Off-line Admission Control for Advance Reservations in Star Networks. WAOA 2004: 211-224
50EEThomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer: Joint Base Station Scheduling. WAOA 2004: 225-238
49EEMark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl: Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics 137(1): 27-46 (2004)
48EEThomas Erlebach, Alexander Hall: NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. J. Scheduling 7(3): 223-241 (2004)
47EEHiroyuki Miyazawa, Thomas Erlebach: An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. J. Scheduling 7(4): 293-311 (2004)
2003
46EEThomas Erlebach, Stamatis Stefanakos: Wavelength Conversion in Shortest-Path All-Optical Networks. ISAAC 2003: 595-604
45EEThomas Erlebach, Stamatis Stefanakos: On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements. STACS 2003: 133-144
44EER. Sai Anand, Thomas Erlebach: Routing and Call Control Algorithms for Ring Networks. WADS 2003: 186-197
43EEUdo Adamy, Thomas Erlebach: Online Coloring of Intervals with Bandwidth. WAOA 2003: 1-12
42EEThomas Erlebach, Vanessa Kääb, Rolf H. Möhring: Scheduling AND/OR-Networks on Identical Parallel Machines. WAOA 2003: 123-136
41EEPaz Carmi, Thomas Erlebach, Yoshio Okamoto: Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155
40EEThomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos: Resource Allocation Problems in Multifiber WDM Tree Networks. WG 2003: 218-229
39EEThomas Erlebach, Frits C. R. Spieksma: Interval selection: Applications, algorithms, and lower bounds. J. Algorithms 46(1): 27-53 (2003)
38EER. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos: Call control with k rejections. J. Comput. Syst. Sci. 67(4): 707-722 (2003)
2002
37EESamarjit Chakraborty, Thomas Erlebach, Simon Künzli, Lothar Thiele: Schedulability of event-driven code blocks in real-time embedded systems. DAC 2002: 616-621
36EEUdo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach: Call Control in Rings. ICALP 2002: 788-799
35 Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl: Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS 2002: 143-156
34EEDanica Vukadinovic, Polly Huang, Thomas Erlebach: On the Spectrum and Structure of Internet Topology Graphs. IICS 2002: 83-95
33EER. Sai Anand, Thomas Erlebach: On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. LATIN 2002: 584-597
32EEThomas Erlebach, Alexander Hall: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. SODA 2002: 194-202
31EER. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos: Call Control with k Rejections. SWAT 2002: 308-317
30EEThomas Erlebach, Klaus Jansen: Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. ACM Journal of Experimental Algorithmics 7: 6 (2002)
29EEThomas Erlebach, Torben Hagerup: Routing Flow Through a Strongly Connected Graph. Algorithmica 32(3): 467-473 (2002)
28 Thomas Erlebach, Jirí Fiala: On-line coloring of geometric intersection graphs. Comput. Geom. 23(2): 243-255 (2002)
27EEDanica Vukadinovic, Thomas Erlebach, Polly Huang, Maurice Rüegg, Roman Schilter: Real and generated internet AS topologies: structure, spectrum, robustness. Computer Communication Review 32(3): 13 (2002)
2001
26EEThomas Erlebach, Danica Vukadinovic: New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. FCT 2001: 483-494
25EEThomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer: On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402
24EEThomas Erlebach: Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. MFCS 2001: 351-362
23EEThomas Erlebach, Klaus Jansen, Eike Seidel: Polynomial-time approximation schemes for geometric graphs. SODA 2001: 671-679
22EEThomas Erlebach, Hans Kellerer, Ulrich Pferschy: Approximating Multi-objective Knapsack Problems. WADS 2001: 210-221
21EESamarjit Chakraborty, Thomas Erlebach, Lothar Thiele: On the Complexity of Scheduling Conditional Real-Time Code. WADS 2001: 38-49
20EEThomas Erlebach, Klaus Jansen: The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. SIAM J. Discrete Math. 14(3): 326-355 (2001)
19EEThomas Erlebach, Klaus Jansen: The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255(1-2): 33-50 (2001)
18EEThomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theor. Comput. Sci. 261(1): 119-156 (2001)
2000
17EEThomas Erlebach, Klaus Jansen: Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. Algorithm Engineering 2000: 195-206
16 Thomas Erlebach, Klaus Jansen: Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. ICALP Satellite Workshops 2000: 135-146
15EEThomas Erlebach, Frits C. R. Spieksma: Simple Algorithms for a Weighted Interval Selection Problem. ISAAC 2000: 228-240
14EEStefan Bischof, Ralf Ebner, Thomas Erlebach: Parallel Load Balancing for Problems with Good Bisectors. J. Parallel Distrib. Comput. 60(9): 1047-1073 (2000)
1999
13 Ralf Ebner, Thomas Erlebach, Claudia Gold, Clemens Harlfinger, Roland Wismüller: A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing. ARCS Workshops 1999: 155-162
12EEStefan Bischof, Ralf Ebner, Thomas Erlebach: Parallel Load Balancing for Problems with Good Bisectors. IPPS/SPDP 1999: 531-538
11EEThomas Erlebach, Klaus Jansen: Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. ACM Journal of Experimental Algorithmics 4: 4 (1999)
10EEThomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano: Optimal Wavelength Routing on Directed Fiber Trees. Theor. Comput. Sci. 221(1-2): 119-137 (1999)
1998
9 Thomas Erlebach, Klaus Jansen: Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. Algorithm Engineering 1998: 13-24
8EEStefan Bischof, Ralf Ebner, Thomas Erlebach: Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations. Euro-Par 1998: 383-389
7EEThomas Erlebach, Klaus Jansen: Maximizing the Number of Connections in Optical Tree Networks. ISAAC 1998: 179-188
1997
6 Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann: Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. ALT 1997: 260-276
5EEThomas Erlebach, Klaus Jansen: Call Scheduling in Trees, Rings and Meshes. HICSS (1) 1997: 221-
4EEChristos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen: Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. ICALP 1997: 493-504
3EEThomas Erlebach, Klaus Jansen: Off-Line and On-Line Call-Scheduling in Stars and Trees. WG 1997: 199-213
2 Thomas Erlebach, Klaus Jansen: An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks Universität Trier, Mathematik/Informatik, Forschungsbericht 97-03: (1997)
1996
1 Thomas Erlebach, Klaus Jansen: Scheduling of Virtual Connections in Fast Networks Universität Trier, Mathematik/Informatik, Forschungsbericht 96-19: (1996)

Coauthor Index

1Udo Adamy [36] [43] [51] [80]
2Christoph Ambühl [36] [72] [80]
3R. Sai Anand [31] [33] [36] [38] [44] [70] [80]
4Yossi Azar [75] [96]
5Georg Baier [69]
6Giuseppe Di Battista [78]
7Zuzana Beerliova [62] [63] [65]
8Davide Bilò [92]
9Stefan Bischof [8] [12] [14]
10Ulrik Brandes [53] [54] [64]
11Hajo Broersma (H. J. Broersma) [94]
12Paz Carmi [41]
13Samarjit Chakraborty [21] [37]
14Jessica Chang [90]
15Mark Cieliebak [35] [49] [57]
16Felix Eberhard [62] [63] [65]
17Ralf Ebner [8] [12] [13] [14]
18Leah Epstein [67] [82] [97]
19Jirí Fiala [28]
20Tom Friedetzky [94]
21Renars Gailis [90]
22Martin Gantenbein [25]
23Claudia Gold [13]
24Torben Hagerup [29] [86] [89]
25Alexander Hall [31] [32] [38] [48] [58] [62] [63] [65] [68] [69] [71] [77] [78] [81]
26Clemens Harlfinger [13]
27Fabian Hennecke [57]
28Michael Hoffmann [62] [63] [65] [71] [85] [88]
29Polly Huang [27] [34]
30Daniel Hürlimann [25]
31Riko Jacob [50] [52] [79]
32Klaus Jansen [1] [2] [3] [4] [5] [7] [9] [10] [11] [16] [17] [19] [20] [23] [30] [59] [60] [86] [89] [98]
33Vanessa Kääb [42]
34Christos Kaklamanis [4] [10] [73] [98]
35Hans Kellerer [22]
36Samir Khuller [90]
37Ekkehard Köhler [69]
38Danny Krizanc [85] [88]
39Simon Künzli [37]
40Erik Jan van Leeuwen [91] [93]
41Asaf Levin [67] [82] [97]
42Zsuzsanna Lipták [35] [49]
43Milena Mihail [10]
44Matús Mihalák [50] [52] [62] [63] [65] [71] [72] [79] [81] [85] [88] [92]
45Moritz Minzlaff [86] [89]
46Dieter Mitsche [51]
47Hiroyuki Miyazawa [47]
48Rolf H. Möhring [42]
49Linda S. Moonen [68] [95]
50Gabriele Neyer [25]
51Marc Nunkesser [50] [52] [72] [79]
52Yoshio Okamoto [41]
53Aris Pagourtzis [25] [40]
54Alessandro Panconesi [58] [68] [77]
55Maurizio Patrignani [78]
56Daniël Paulusma [94]
57Paolo Penna [25]
58Giuseppe Persiano (Pino Persiano) [4] [10] [76] [83] [98]
59Ulrich Pferschy [22]
60Maurizio Pizzonia [78]
61Katerina Potika [40]
62L. Shankar Ram [62] [63] [65]
63Rajeev Raman [85] [88]
64Peter Rossmanith [6] [18]
65Maurice Rüegg [27] [56]
66Thomas Schank [78]
67Heiko Schilling [69]
68Roman Schilter [27]
69Konrad Schlude [25]
70Ingo Schurr [51]
71Eike Seidel [23] [59]
72Ambreen Shahnaz [99]
73Martin Skutella [69]
74Bettina Speckmann [51]
75Frits C. R. Spieksma [15] [39] [68] [95]
76Hans Stadtherr [6] [18]
77Stamatis Stefanakos [31] [38] [40] [45] [46] [55] [61] [84]
78Angelika Steger [6] [18]
79Kathleen Steinhöfel [25]
80Jens Stoye [35] [49]
81Gábor Szabó [50] [52] [79]
82David Scot Taylor [25]
83Lothar Thiele [21] [37]
84Danica Vukadinovic [26] [27] [34] [58] [66] [68] [77] [95]
85Birgitta Weber [57]
86Emo Welzl [35] [49] [51]
87Peter Widmayer [25] [50] [52] [57] [79] [92]
88Roland Wismüller [13]
89Alexander Wolff [86] [89]
90Thomas Zeugmann [6] [18]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)