Thomas Erlebach

According to our database1, Thomas Erlebach authored at least 151 papers between 1996 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm.
CoRR, 2018

Car-Sharing between Two Locations: Online Scheduling with Two Servers.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Faster Exploration of Degree-Bounded Temporal Graphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Scheduling with Explorable Uncertainty.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Computing and Scheduling with Explorable Uncertainty.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
The extra-bit technique for reducing idle listening in data collection.
IJSNet, 2017

Scheduling with Explorable Uncertainty.
CoRR, 2017

A Bi-objective Scheduling Approach for Energy Optimisation of Executing and Transmitting HPC Applications in Decentralised Multi-cloud Systems.
Proceedings of the 16th International Symposium on Parallel and Distributed Computing, 2017

Throughput Improvement by Reducing Dropped Packets at Interface Queue (IFQ) in Multi-channel Wireless Mesh Networks.
Proceedings of the 14th International Symposium on Pervasive Systems, 2017

Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals.
Proceedings of the Combinatorial Optimization and Applications, 2017

Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Query-competitive algorithms for cheapest set problems under uncertainty.
Theor. Comput. Sci., 2016

Energy Aware Scheduling of HPC Tasks in Decentralised Cloud Systems.
Proceedings of the 24th Euromicro International Conference on Parallel, 2016

Algorithms for Queryable Uncertainty.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015
Computational complexity of traffic hijacking under BGP and S-BGP.
Theor. Comput. Sci., 2015

Special Issue on Approximation and Online Algorithms.
Theory Comput. Syst., 2015

Query-Competitive Algorithms for Computing with Uncertainty.
Bulletin of the EATCS, 2015

On Temporal Graph Exploration.
CoRR, 2015

Further Results on Capacitated Network Design Games.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks.
Proceedings of the 12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2015

Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

On Temporal Graph Exploration.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
An experimental study of small multi-hop wireless networks using chirp spread spectrum.
Wireless Networks, 2014

Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities.
Theor. Comput. Sci., 2014

Minimum Spanning Tree Verification Under Uncertainty.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Reducing Idle Listening during Data Collection in Wireless Sensor Networks.
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Least Channel Variation Multi-channel MAC (LCV-MMAC).
Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

Approximating Maximum Disjoint Coverage in Wireless Sensor Networks.
Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012
Computational Complexity of Traffic Hijacking under BGP and S-BGP
CoRR, 2012

Computational Complexity of Traffic Hijacking under BGP and S-BGP.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A simple scheme to improve the throughput of small multi-hop wireless networks.
Proceedings of the 8th International Symposium on Communication Systems, 2012

2011
Broadcast scheduling: Algorithms and complexity.
ACM Trans. Algorithms, 2011

Maximising lifetime for fault-tolerant target coverage in sensor networks.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

A hybrid scheduling technique for grid workflows in advance reservation environments.
Proceedings of the 2011 International Conference on High Performance Computing & Simulation, 2011

Majority - Who Gets Elected Class Rep?
Proceedings of the Algorithms Unplugged, 2011

2010
Discovery of network properties with all-shortest-paths queries.
Theor. Comput. Sci., 2010

Length-bounded cuts and flows.
ACM Trans. Algorithms, 2010

Trimming of Graphs, with Application to Point Labeling.
Theory Comput. Syst., 2010

CMAB: cross layer mobility-adaptive broadcasting in mobile ad hoc networks.
Proceedings of the MoMM'2010, 2010

Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks.
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, 2010

A new resource mapping technique for Grid workflows in advance reservation environments.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

Assigning AS relationships to satisfy the Gao-Rexford conditions.
Proceedings of the 18th annual IEEE International Conference on Network Protocols, 2010

Frontmatter, Table of Contents, Preface, Organization.
Proceedings of the ATMOS 2010, 2010

PTAS for Weighted Set Cover on Unit Squares.
Proceedings of the Approximation, 2010

Scheduling Multicast Transmissions under SINR Constraints.
Proceedings of the Algorithms for Sensor Systems, 2010

2009
Directed Tree Networks.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Online Capacitated Interval Coloring.
SIAM J. Discrete Math., 2009

WAOA 2006 Special Issue of TOCS.
Theory Comput. Syst., 2009

Connectivity Measures for Internet Topologies on the Level of Autonomous Systems.
Operations Research, 2009

Variable Sized Online Interval Coloring with Bandwidth.
Algorithmica, 2009

Foreword.
Algorithmica, 2009

A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Approximating node-weighted multicast trees in wireless ad-hoc networks.
Proceedings of the International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, 2009

Path Splicing with Guaranteed Fault Tolerance.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2008
Mehrheitsbestimmung - Wer wird Klassensprecher?.
Proceedings of the Taschenbuch der Algorithmen, 2008

WAOA 2005 Special Issue of TOCS.
Theory Comput. Syst., 2008

Routing to reduce the cost of wavelength conversion.
Discrete Applied Mathematics, 2008

Computing Minimum Spanning Trees with Uncertainty
CoRR, 2008

Trimming of Graphs, with Application to Point Labeling
CoRR, 2008

Computing Minimum Spanning Trees with Uncertainty.
Proceedings of the STACS 2008, 2008

Trimming of Graphs, with Application to Point Labeling.
Proceedings of the STACS 2008, 2008

Approximating geometric coverage problems.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Broadcast scheduling: algorithms and complexity.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Discovery of Network Properties with All-Shortest-Paths Queries.
Proceedings of the Structural Information and Communication Complexity, 2008

Domination in Geometric Intersection Graphs.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Computing the types of the relationships between autonomous systems.
IEEE/ACM Trans. Netw., 2007

Cuts and Disjoint Paths in the Valley-Free Model.
Internet Mathematics, 2007

An Algorithmic View on OVSF Code Assignment.
Algorithmica, 2007

Call Control in Rings.
Algorithmica, 2007

Approximate Discovery of Random Graphs.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Online Capacitated Interval Coloring.
Proceedings of the Combinatorics, 2007

2006
Independence and Coloring Problems on Intersection Graphs of Disks.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

Network Discovery and Verification.
IEEE Journal on Selected Areas in Communications, 2006

Path problems in generalized stars, complete graphs, and brick wall graphs.
Discrete Applied Mathematics, 2006

Variable Sized Online Interval Coloring with Bandwidth.
Proceedings of the Algorithm Theory, 2006

Length-Bounded Cuts and Flows.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Robustness of the Internet at the Topology and Routing Level.
Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

Call control on lines.
Proceedings of the First International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2006), 2006

Network Discovery and Verification with Distance Queries.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.
Proceedings of the Approximation, 2006

2005
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs.
SIAM J. Comput., 2005

Conversion of coloring algorithms into maximum weight independent set algorithms.
Discrete Applied Mathematics, 2005

Wavelength Conversion in All-Optical Networks with Shortest-Path Routing.
Algorithmica, 2005

Network Discovery and Verification.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Network Discovery and Verification.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem.
J. Scheduling, 2004

NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow.
J. Scheduling, 2004

Algorithmic complexity of protein identification: combinatorics of weighted strings.
Discrete Applied Mathematics, 2004

Joint Base Station Scheduling.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Off-line Admission Control for Advance Reservations in Star Networks.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

An Algorithmic View on OVSF Code Assignment.
Proceedings of the STACS 2004, 2004

Routing in all-optical ring networks revisited.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Scheduling with Release Times and Deadlines on a Minimum Number of Machines.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Fundamentals.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

Introduction.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
Call control with k rejections.
J. Comput. Syst. Sci., 2003

Interval selection: Applications, algorithms, and lower bounds.
J. Algorithms, 2003

Resource Allocation Problems in Multifiber WDM Tree Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Greedy Edge-Disjoint Paths in Complete Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Scheduling AND/OR-Networks on Identical Parallel Machines.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Online Coloring of Intervals with Bandwidth.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Routing and Call Control Algorithms for Ring Networks.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Wavelength Conversion in Shortest-Path All-Optical Networks.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Approximating Multiobjective Knapsack Problems.
Management Science, 2002

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.
ACM Journal of Experimental Algorithmics, 2002

On-line coloring of geometric intersection graphs.
Comput. Geom., 2002

Real and generated internet AS topologies: structure, spectrum, robustness.
Computer Communication Review, 2002

Routing Flow Through a Strongly Connected Graph.
Algorithmica, 2002

Call Control with k Rejections.
Proceedings of the Algorithm Theory, 2002

NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

On-line Algorithms for Edge-Disjoint Paths in Trees of Rings.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Spectrum and Structure of Internet Topology Graphs.
Proceedings of the Innovative Internet Computing Systems, Second International Workshop, 2002

Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Call Control in Rings.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Schedulability of event-driven code blocks in real-time embedded systems.
Proceedings of the 39th Design Automation Conference, 2002

2001
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries.
Theor. Comput. Sci., 2001

The complexity of path coloring and call scheduling.
Theor. Comput. Sci., 2001

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees.
SIAM J. Discrete Math., 2001

Approximating Multi-objective Knapsack Problems.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

On the Complexity of Scheduling Conditional Real-Time Code.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Polynomial-time approximation schemes for geometric graphs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

On the Complexity of Train Assignment Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000
Parallel Load Balancing for Problems with Good Bisectors.
J. Parallel Distrib. Comput., 2000

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.
Proceedings of the Algorithm Engineering, 2000

Simple Algorithms for a Weighted Interval Selection Problem.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms.
ICALP Satellite Workshops, 2000

1999
Scheduling connections in fast networks.
PhD thesis, 1999

Optimal Wavelength Routing on Directed Fiber Trees.
Theor. Comput. Sci., 1999

Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.
ACM Journal of Experimental Algorithmics, 1999

Parallel Load Balancing for Problems with Good Bisectors.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing.
Proceedings of the Workshops zur Architektur von Rechensystemen, 1999

1998
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.
Proceedings of the Algorithm Engineering, 1998

Maximizing the Number of Connections in Optical Tree Networks.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Off-Line and On-Line Call-Scheduling in Stars and Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Call Scheduling in Trees, Rings and Meshes.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

An optimal greedy algorithm for wavelength allocation in directed tree networks.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
Scheduling of Virtual Connections in Fast Networks
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996


  Loading...