The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Erlebach: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:260-276 [Conf]
  2. Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser
    Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:3-14 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    ARCS Workshops, 1999, pp:155-162 [Conf]
  4. Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic
    Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:49-62 [Conf]
  5. Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák
    Network Discovery and Verification with Distance Queries. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:69-80 [Conf]
  6. R. Sai Anand, Thomas Erlebach
    Call control on lines. [Citation Graph (0, 0)][DBLP]
    COMSWARE, 2006, pp:- [Conf]
  7. Samarjit Chakraborty, Thomas Erlebach, Simon Künzli, Lothar Thiele
    Schedulability of event-driven code blocks in real-time embedded systems. [Citation Graph (0, 0)][DBLP]
    DAC, 2002, pp:616-621 [Conf]
  8. Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram
    Network Discovery and Verification. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  9. Ulrik Brandes, Thomas Erlebach
    Introduction. [Citation Graph (0, 0)][DBLP]
    Network Analysis, 2004, pp:1-6 [Conf]
  10. Ulrik Brandes, Thomas Erlebach
    Fundamentals. [Citation Graph (0, 0)][DBLP]
    Network Analysis, 2004, pp:7-15 [Conf]
  11. Stefan Bischof, Ralf Ebner, Thomas Erlebach
    Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:383-389 [Conf]
  12. Thomas Erlebach, Danica Vukadinovic
    New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:483-494 [Conf]
  13. Thomas Erlebach, Klaus Jansen
    Call Scheduling in Trees, Rings and Meshes. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:221-0 [Conf]
  14. Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
    Call Control in Rings. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:788-799 [Conf]
  15. Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella
    Length-Bounded Cuts and Flows. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:679-690 [Conf]
  16. Thomas Erlebach, Klaus Jansen
    Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:135-146 [Conf]
  17. Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen
    Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:493-504 [Conf]
  18. Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer
    Scheduling with Release Times and Deadlines on a Minimum Number of Machines. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:209-222 [Conf]
  19. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
    Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:143-156 [Conf]
  20. Danica Vukadinovic, Polly Huang, Thomas Erlebach
    On the Spectrum and Structure of Internet Topology Graphs. [Citation Graph (0, 0)][DBLP]
    IICS, 2002, pp:83-95 [Conf]
  21. Thomas Erlebach, Maurice Rüegg
    Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  22. Stefan Bischof, Ralf Ebner, Thomas Erlebach
    Parallel Load Balancing for Problems with Good Bisectors. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:531-538 [Conf]
  23. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:390-402 [Conf]
  24. Thomas Erlebach, Klaus Jansen
    Maximizing the Number of Connections in Optical Tree Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:179-188 [Conf]
  25. Thomas Erlebach, Frits C. R. Spieksma
    Simple Algorithms for a Weighted Interval Selection Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:228-240 [Conf]
  26. Thomas Erlebach, Stamatis Stefanakos
    Wavelength Conversion in Shortest-Path All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:595-604 [Conf]
  27. Stamatis Stefanakos, Thomas Erlebach
    Routing in all-optical ring networks revisited. [Citation Graph (0, 0)][DBLP]
    ISCC, 2004, pp:288-293 [Conf]
  28. R. Sai Anand, Thomas Erlebach
    On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:584-597 [Conf]
  29. Thomas Erlebach
    Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:351-362 [Conf]
  30. Thomas Erlebach, Alexander Hall
    NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:194-202 [Conf]
  31. Thomas Erlebach, Klaus Jansen, Eike Seidel
    Polynomial-time approximation schemes for geometric graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:671-679 [Conf]
  32. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
    An Algorithmic View on OVSF Code Assignment. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:270-281 [Conf]
  33. 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]
  34. 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]
  35. Leah Epstein, Thomas Erlebach, Asaf Levin
    Variable Sized Online Interval Coloring with Bandwidth. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:29-40 [Conf]
  36. R. Sai Anand, Thomas Erlebach
    Routing and Call Control Algorithms for Ring Networks. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:186-197 [Conf]
  37. Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele
    On the Complexity of Scheduling Conditional Real-Time Code. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:38-49 [Conf]
  38. Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
    Approximating Multi-objective Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:210-221 [Conf]
  39. Thomas Erlebach, Klaus Jansen
    Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:195-206 [Conf]
  40. Thomas Erlebach, Klaus Jansen
    Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:13-24 [Conf]
  41. Udo Adamy, Thomas Erlebach
    Online Coloring of Intervals with Bandwidth. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:1-12 [Conf]
  42. Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
    Off-line Admission Control for Advance Reservations in Star Networks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:211-224 [Conf]
  43. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
    Joint Base Station Scheduling. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:225-238 [Conf]
  44. Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring
    Scheduling AND/OR-Networks on Identical Parallel Machines. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:123-136 [Conf]
  45. Paz Carmi, Thomas Erlebach, Yoshio Okamoto
    Greedy Edge-Disjoint Paths in Complete Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:143-155 [Conf]
  46. Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram
    Network Discovery and Verification. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:127-138 [Conf]
  47. Thomas Erlebach, Klaus Jansen
    Off-Line and On-Line Call-Scheduling in Stars and Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:199-213 [Conf]
  48. 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]
  49. 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. [Citation Graph (0, 0)][DBLP]
    Research Results of the DICS Program, 2006, pp:260-274 [Conf]
  50. Thomas Erlebach, Torben Hagerup
    Routing Flow Through a Strongly Connected Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:3, pp:467-473 [Journal]
  51. 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]
  52. Danica Vukadinovic, Thomas Erlebach, Polly Huang, Maurice Rüegg, Roman Schilter
    Real and generated internet AS topologies: structure, spectrum, robustness. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2002, v:32, n:3, pp:13- [Journal]
  53. Thomas Erlebach, Jirí Fiala
    On-line coloring of geometric intersection graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:243-255 [Journal]
  54. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
    Algorithmic complexity of protein identification: combinatorics of weighted strings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:1, pp:27-46 [Journal]
  55. Thomas Erlebach, Klaus Jansen
    Conversion of coloring algorithms into maximum weight independent set algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:148, n:1, pp:107-125 [Journal]
  56. Thomas Erlebach, Danica Vukadinovic
    Path problems in generalized stars, complete graphs, and brick wall graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:4, pp:673-683 [Journal]
  57. Thomas Erlebach, Frits C. R. Spieksma
    Interval selection: Applications, algorithms, and lower bounds. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:46, n:1, pp:27-53 [Journal]
  58. 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]
  59. Thomas Erlebach, Klaus Jansen
    Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:6- [Journal]
  60. Thomas Erlebach, Klaus Jansen
    Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1999, v:4, n:, pp:4- [Journal]
  61. Stefan Bischof, Ralf Ebner, Thomas Erlebach
    Parallel Load Balancing for Problems with Good Bisectors. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:9, pp:1047-1073 [Journal]
  62. Hiroyuki Miyazawa, Thomas Erlebach
    An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:4, pp:293-311 [Journal]
  63. Thomas Erlebach, Alexander Hall
    NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:3, pp:223-241 [Journal]
  64. Thomas Erlebach, Klaus Jansen, Eike Seidel
    Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:6, pp:1302-1323 [Journal]
  65. Thomas Erlebach, Klaus Jansen
    The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:326-355 [Journal]
  66. Thomas Erlebach, Klaus Jansen
    The complexity of path coloring and call scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:33-50 [Journal]
  67. Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
    Optimal Wavelength Routing on Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:119-137 [Journal]
  68. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:1, pp:119-156 [Journal]
  69. Thomas Erlebach, Alexander Hall, Matús Mihalák
    Approximate Discovery of Random Graphs. [Citation Graph (0, 0)][DBLP]
    SAGA, 2007, pp:82-92 [Conf]
  70. Leah Epstein, Thomas Erlebach, Asaf Levin
    Online Capacitated Interval Coloring. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:243-254 [Conf]
  71. Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
    Call Control in Rings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:217-238 [Journal]
  72. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
    An Algorithmic View on OVSF Code Assignment. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:269-298 [Journal]
  73. Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank
    Computing the types of the relationships between autonomous systems. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2007, v:15, n:2, pp:267-280 [Journal]

  74. PTAS for Weighted Set Cover on Unit Squares. [Citation Graph (, )][DBLP]


  75. Domination in Geometric Intersection Graphs. [Citation Graph (, )][DBLP]


  76. Discovery of Network Properties with All-Shortest-Paths Queries. [Citation Graph (, )][DBLP]


  77. Broadcast scheduling: algorithms and complexity. [Citation Graph (, )][DBLP]


  78. Approximating geometric coverage problems. [Citation Graph (, )][DBLP]


  79. Computing Minimum Spanning Trees with Uncertainty. [Citation Graph (, )][DBLP]


  80. Trimming of Graphs, with Application to Point Labeling. [Citation Graph (, )][DBLP]


  81. A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. [Citation Graph (, )][DBLP]


  82. Approximating node-weighted multicast trees in wireless ad-hoc networks. [Citation Graph (, )][DBLP]


  83. Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks. [Citation Graph (, )][DBLP]


  84. Path Splicing with Guaranteed Fault Tolerance. [Citation Graph (, )][DBLP]


  85. A new resource mapping technique for Grid workflows in advance reservation environments. [Citation Graph (, )][DBLP]


  86. Foreword. [Citation Graph (, )][DBLP]


  87. Variable Sized Online Interval Coloring with Bandwidth. [Citation Graph (, )][DBLP]


  88. Trimming of Graphs, with Application to Point Labeling [Citation Graph (, )][DBLP]


  89. Computing Minimum Spanning Trees with Uncertainty [Citation Graph (, )][DBLP]


  90. Routing to reduce the cost of wavelength conversion. [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.045secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002