 | 2009 |
|---|
| 101 |       | Thomas Erlebach,
Ambreen Shahnaz:
Approximating node-weighted multicast trees in wireless ad-hoc networks.
IWCMC 2009: 639-643 |
| 100 | | Thomas Erlebach,
Klaus Jansen,
Christos Kaklamanis,
Giuseppe Persiano:
Directed Tree Networks.
Encyclopedia of Optimization 2009: 716-725 |
| 99 | | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth.
Algorithmica 53(3): 385-401 (2009) |
| 98 | | Yossi Azar,
Thomas Erlebach:
Foreword.
Algorithmica 53(4): 455-456 (2009) |
| 97 | | Thomas 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) |
| 96 | | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Online Capacitated Interval Coloring.
SIAM J. Discrete Math. 23(2): 822-841 (2009) |
| 95 | | Thomas Erlebach,
Christos Kaklamanis:
WAOA 2006 Special Issue of TOCS.
Theory Comput. Syst. 45(3): 427-428 (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 |
| 93 | | Thomas Erlebach,
Erik Jan van Leeuwen:
Domination in Geometric Intersection Graphs.
LATIN 2008: 747-758 |
| 92 | | Davide Bilò,
Thomas Erlebach,
Matús Mihalák,
Peter Widmayer:
Discovery of Network Properties with All-Shortest-Paths Queries.
SIROCCO 2008: 89-103 |
| 91 | | Thomas Erlebach,
Erik Jan van Leeuwen:
Approximating geometric coverage problems.
SODA 2008: 1267-1276 |
| 90 | | Jessica Chang,
Thomas Erlebach,
Renars Gailis,
Samir Khuller:
Broadcast scheduling: algorithms and complexity.
SODA 2008: 473-482 |
| 89 | | Thomas Erlebach,
Torben Hagerup,
Klaus Jansen,
Moritz Minzlaff,
Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling.
STACS 2008: 265-276 |
| 88 | | Michael Hoffmann,
Thomas Erlebach,
Danny Krizanc,
Matús Mihalák,
Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty.
STACS 2008: 277-288 |
| 87 | | Thomas Erlebach:
Mehrheitsbestimmung - Wer wird Klassensprecher?.
Taschenbuch der Algorithmen 2008: 245-254 |
| 86 | | Thomas Erlebach,
Torben Hagerup,
Klaus Jansen,
Moritz Minzlaff,
Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling
CoRR abs/0802.2854: (2008) |
| 85 | | Thomas Erlebach,
Michael Hoffmann,
Danny Krizanc,
Matús Mihalák,
Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty
CoRR abs/0802.2855: (2008) |
| 84 | | Thomas Erlebach,
Stamatis Stefanakos:
Routing to reduce the cost of wavelength conversion.
Discrete Applied Mathematics 156(15): 2911-2923 (2008) |
| 83 | | Thomas Erlebach,
Giuseppe Persiano:
WAOA 2005 Special Issue of TOCS.
Theory Comput. Syst. 43(1): 1-2 (2008) |
| 2007 |
|---|
| 82 | | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Online Capacitated Interval Coloring.
ESCAPE 2007: 243-254 |
| 81 | | Thomas Erlebach,
Alexander Hall,
Matús Mihalák:
Approximate Discovery of Random Graphs.
SAGA 2007: 82-92 |
| 80 | | Udo Adamy,
Christoph Ambühl,
R. Sai Anand,
Thomas Erlebach:
Call Control in Rings.
Algorithmica 47(3): 217-238 (2007) |
| 79 | | Thomas 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) |
| 78 | | Giuseppe 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 |
| 72 | | Christoph 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 |
| 71 | | Thomas 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 |
| 69 | | Georg Baier,
Thomas Erlebach,
Alexander Hall,
Ekkehard Köhler,
Heiko Schilling,
Martin Skutella:
Length-Bounded Cuts and Flows.
ICALP (1) 2006: 679-690 |
| 68 | | Thomas 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 |
| 67 | | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth.
SWAT 2006: 29-40 |
| 66 | | Thomas Erlebach,
Danica Vukadinovic:
Path problems in generalized stars, complete graphs, and brick wall graphs.
Discrete Applied Mathematics 154(4): 673-683 (2006) |
| 65 | | Zuzana 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 |
| 63 | | Zuzana 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 |
| 62 | | Zuzana Beerliova,
Felix Eberhard,
Thomas Erlebach,
Alexander Hall,
Michael Hoffmann,
Matús Mihalák,
L. Shankar Ram:
Network Discovery and Verification.
WG 2005: 127-138 |
| 61 | | Thomas Erlebach,
Stamatis Stefanakos:
Wavelength Conversion in All-Optical Networks with Shortest-Path Routing.
Algorithmica 43(1-2): 43-61 (2005) |
| 60 | | Thomas Erlebach,
Klaus Jansen:
Conversion of coloring algorithms into maximum weight independent set algorithms.
Discrete Applied Mathematics 148(1): 107-125 (2005) |
| 59 | | Thomas Erlebach,
Klaus Jansen,
Eike Seidel:
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs.
SIAM J. Comput. 34(6): 1302-1323 (2005) |
| 2004 |
|---|
| 58 | | Thomas 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 |
| 56 | | Thomas Erlebach,
Maurice Rüegg:
Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing.
INFOCOM 2004 |
| 55 | | Stamatis Stefanakos,
Thomas Erlebach:
Routing in all-optical ring networks revisited.
ISCC 2004: 288-293 |
| 54 | | Ulrik Brandes,
Thomas Erlebach:
Introduction.
Network Analysis 2004: 1-6 |
| 53 | | Ulrik Brandes,
Thomas Erlebach:
Fundamentals.
Network Analysis 2004: 7-15 |
| 52 | | Thomas 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 |
| 51 | | Udo 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 |
| 50 | | Thomas Erlebach,
Riko Jacob,
Matús Mihalák,
Marc Nunkesser,
Gábor Szabó,
Peter Widmayer:
Joint Base Station Scheduling.
WAOA 2004: 225-238 |
| 49 | | Mark 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) |
| 48 | | Thomas Erlebach,
Alexander Hall:
NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow.
J. Scheduling 7(3): 223-241 (2004) |
| 47 | | Hiroyuki Miyazawa,
Thomas Erlebach:
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem.
J. Scheduling 7(4): 293-311 (2004) |
| 2003 |
|---|
| 46 | | Thomas Erlebach,
Stamatis Stefanakos:
Wavelength Conversion in Shortest-Path All-Optical Networks.
ISAAC 2003: 595-604 |
| 45 | | Thomas Erlebach,
Stamatis Stefanakos:
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements.
STACS 2003: 133-144 |
| 44 | | R. Sai Anand,
Thomas Erlebach:
Routing and Call Control Algorithms for Ring Networks.
WADS 2003: 186-197 |
| 43 | | Udo Adamy,
Thomas Erlebach:
Online Coloring of Intervals with Bandwidth.
WAOA 2003: 1-12 |
| 42 | | Thomas Erlebach,
Vanessa Kääb,
Rolf H. Möhring:
Scheduling AND/OR-Networks on Identical Parallel Machines.
WAOA 2003: 123-136 |
| 41 | | Paz Carmi,
Thomas Erlebach,
Yoshio Okamoto:
Greedy Edge-Disjoint Paths in Complete Graphs.
WG 2003: 143-155 |
| 40 | | Thomas Erlebach,
Aris Pagourtzis,
Katerina Potika,
Stamatis Stefanakos:
Resource Allocation Problems in Multifiber WDM Tree Networks.
WG 2003: 218-229 |
| 39 | | Thomas Erlebach,
Frits C. R. Spieksma:
Interval selection: Applications, algorithms, and lower bounds.
J. Algorithms 46(1): 27-53 (2003) |
| 38 | | R. Sai Anand,
Thomas Erlebach,
Alexander Hall,
Stamatis Stefanakos:
Call control with k rejections.
J. Comput. Syst. Sci. 67(4): 707-722 (2003) |
| 2002 |
|---|
| 37 | | Samarjit Chakraborty,
Thomas Erlebach,
Simon Künzli,
Lothar Thiele:
Schedulability of event-driven code blocks in real-time embedded systems.
DAC 2002: 616-621 |
| 36 | | Udo 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 |
| 34 | | Danica Vukadinovic,
Polly Huang,
Thomas Erlebach:
On the Spectrum and Structure of Internet Topology Graphs.
IICS 2002: 83-95 |
| 33 | | R. Sai Anand,
Thomas Erlebach:
On-line Algorithms for Edge-Disjoint Paths in Trees of Rings.
LATIN 2002: 584-597 |
| 32 | | Thomas Erlebach,
Alexander Hall:
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow.
SODA 2002: 194-202 |
| 31 | | R. Sai Anand,
Thomas Erlebach,
Alexander Hall,
Stamatis Stefanakos:
Call Control with k Rejections.
SWAT 2002: 308-317 |
| 30 | | Thomas 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) |
| 29 | | Thomas 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) |
| 27 | | Danica 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 |
|---|
| 26 | | Thomas Erlebach,
Danica Vukadinovic:
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs.
FCT 2001: 483-494 |
| 25 | | Thomas 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 |
| 24 | | Thomas Erlebach:
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings.
MFCS 2001: 351-362 |
| 23 | | Thomas Erlebach,
Klaus Jansen,
Eike Seidel:
Polynomial-time approximation schemes for geometric graphs.
SODA 2001: 671-679 |
| 22 | | Thomas Erlebach,
Hans Kellerer,
Ulrich Pferschy:
Approximating Multi-objective Knapsack Problems.
WADS 2001: 210-221 |
| 21 | | Samarjit Chakraborty,
Thomas Erlebach,
Lothar Thiele:
On the Complexity of Scheduling Conditional Real-Time Code.
WADS 2001: 38-49 |
| 20 | | Thomas Erlebach,
Klaus Jansen:
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees.
SIAM J. Discrete Math. 14(3): 326-355 (2001) |
| 19 | | Thomas Erlebach,
Klaus Jansen:
The complexity of path coloring and call scheduling.
Theor. Comput. Sci. 255(1-2): 33-50 (2001) |
| 18 | | 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.
Theor. Comput. Sci. 261(1): 119-156 (2001) |
| 2000 |
|---|
| 17 | | Thomas 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 |
| 15 | | Thomas Erlebach,
Frits C. R. Spieksma:
Simple Algorithms for a Weighted Interval Selection Problem.
ISAAC 2000: 228-240 |
| 14 | | Stefan 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 |
| 12 | | Stefan Bischof,
Ralf Ebner,
Thomas Erlebach:
Parallel Load Balancing for Problems with Good Bisectors.
IPPS/SPDP 1999: 531-538 |
| 11 | | Thomas 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) |
| 10 | | Thomas 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 |
| 8 | | Stefan Bischof,
Ralf Ebner,
Thomas Erlebach:
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations.
Euro-Par 1998: 383-389 |
| 7 | | Thomas 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 |
| 5 | | Thomas Erlebach,
Klaus Jansen:
Call Scheduling in Trees, Rings and Meshes.
HICSS (1) 1997: 221- |
| 4 | | Christos Kaklamanis,
Pino Persiano,
Thomas Erlebach,
Klaus Jansen:
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.
ICALP 1997: 493-504 |
| 3 | | Thomas 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) |
