Thomas Erlebach

J. Comput. Syst. Sci., August, 2023

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries.

[BibT_eX]

[DOI]

Murilo Santos de Lima

Algorithmica, February, 2023

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous.

[BibT_eX]

[DOI]

CoRR, 2023

Sorting and Hypergraph Orientation under Uncertainty with Predictions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Banu Baklan Sen

Öznur Yasar Diner

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Car-sharing between two locations: Online scheduling with flexible advance bookings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Exploration of k-edge-deficient temporal graphs.

[BibT_eX]

[DOI]

Acta Informatica, 2022

Parameterized Temporal Exploration Problems.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Package Delivery Using Drones with Restricted Movement Areas.

[BibT_eX]

[DOI]

Frits C. R. Spieksma

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty.

[BibT_eX]

[DOI]

Murilo Santos de Lima

Nicole Megow

Jens Schlöter

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

"Green" barrier coverage with mobile sensors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On temporal graph exploration.

[BibT_eX]

[DOI]

Frank Kammer

J. Comput. Syst. Sci., 2021

On the fast delivery problem with one or two packages.

[BibT_eX]

[DOI]

Iago A. Carvalho

Kleitos Papadopoulos

J. Comput. Syst. Sci., 2021

Algorithms that Access the Input via Queries.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.

[BibT_eX]

[DOI]

Evripidis Bampis

Christoph Dürr

Murilo Santos de Lima

Nicole Megow

Jens Schlöter

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Correction to: Special Issue on Approximation and Online Algorithms.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Special Issue on Approximation and Online Algorithms.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Untrusted Predictions Improve Trustable Query Policies.

[BibT_eX]

[DOI]

CoRR, 2020

An Adversarial Model for Scheduling with Testing.

[BibT_eX]

[DOI]

Algorithmica, 2020

A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Non-strict Temporal Exploration.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

2019

Complexity and online algorithms for minimum skyline coloring of intervals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Car-Sharing on a Star Network: On-Line Scheduling with k Servers.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Two Moves per Time Step Make a Difference.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

An Efficient Algorithm for the Fast Delivery Problem.

[BibT_eX]

[DOI]

Iago A. Carvalho

Kleitos Papadopoulos

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018

Car-Sharing between Two Locations: Online Scheduling with Two Servers.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Faster Exploration of Degree-Bounded Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

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

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Scheduling with Explorable Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Computing and Scheduling with Explorable Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

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

[BibT_eX]

[DOI]

Aram Rasul

Int. J. Sens. Networks, 2017

A Bi-objective Scheduling Approach for Energy Optimisation of Executing and Transmitting HPC Applications in Decentralised Multi-cloud Systems.

[BibT_eX]

[DOI]

Aeshah Alsughayyir

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.

[BibT_eX]

[DOI]

Aisha Mousa Mashraqi

Proceedings of the 14th International Symposium on Pervasive Systems, 2017

Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors.

[BibT_eX]

[DOI]

Aeshah Alsughayyir

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Query-competitive algorithms for cheapest set problems under uncertainty.

[BibT_eX]

[DOI]

Frank Kammer

Theor. Comput. Sci., 2016

Energy Aware Scheduling of HPC Tasks in Decentralised Cloud Systems.

[BibT_eX]

[DOI]

Aeshah Alsughayyir

Proceedings of the 24th Euromicro International Conference on Parallel, 2016

Algorithms for Queryable Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015

Computational complexity of traffic hijacking under BGP and S-BGP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Special Issue on Approximation and Online Algorithms.

[BibT_eX]

[DOI]

Giuseppe Persiano

Theory Comput. Syst., 2015

Query-Competitive Algorithms for Computing with Uncertainty.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Further Results on Capacitated Network Design Games.

[BibT_eX]

[DOI]

Matthew Radoja

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Aram Rasul

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.

[BibT_eX]

[DOI]

Hasna Mohsen Alqahtani

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

An experimental study of small multi-hop wireless networks using chirp spread spectrum.

[BibT_eX]

[DOI]

Wirel. Networks, 2014

Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities.

[BibT_eX]

[DOI]

Amotz Bar-Noy

Magnús M. Halldórsson

Sotiris E. Nikoletseas

Pekka Orponen

Theor. Comput. Sci., 2014

Minimum Spanning Tree Verification Under Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth.

[BibT_eX]

[DOI]

Hasna Mohsen Alqahtani

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Reducing Idle Listening during Data Collection in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Aram Rasul

Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

2013

Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost.

[BibT_eX]

[DOI]

Hasna Mohsen Alqahtani

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Least Channel Variation Multi-channel MAC (LCV-MMAC).

[BibT_eX]

[DOI]

Shagufta Henna

Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

Approximating Maximum Disjoint Coverage in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Shagufta Henna

Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012

A simple scheme to improve the throughput of small multi-hop wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Communication Systems, 2012

2011

Broadcast scheduling: Algorithms and complexity.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Maximising lifetime for fault-tolerant target coverage in sensor networks.

[BibT_eX]

[DOI]

Tom Grant

Frank Kammer

Sustain. Comput. Informatics Syst., 2011

A hybrid scheduling technique for grid workflows in advance reservation environments.

[BibT_eX]

[DOI]

Jawad Ashraf

Proceedings of the 2011 International Conference on High Performance Computing & Simulation, 2011

Majority - Who Gets Elected Class Rep?

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

2010

Discovery of network properties with all-shortest-paths queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Length-bounded cuts and flows.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Trimming of Graphs, with Application to Point Labeling.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

CMAB: cross layer mobility-adaptive broadcasting in mobile ad hoc networks.

[BibT_eX]

[DOI]

Shagufta Henna

Proceedings of the MoMM'2010, 2010

Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks.

[BibT_eX]

[DOI]

Ambreen Shahnaz

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, 2010

A new resource mapping technique for Grid workflows in advance reservation environments.

[BibT_eX]

[DOI]

Jawad Ashraf

Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

Assigning AS relationships to satisfy the Gao-Rexford conditions.

[BibT_eX]

[DOI]

Proceedings of the 18th annual IEEE International Conference on Network Protocols, 2010

Frontmatter, Table of Contents, Preface, Organization.

[BibT_eX]

[DOI]

Marco E. Lübbecke

Proceedings of the ATMOS 2010, 2010

PTAS for Weighted Set Cover on Unit Squares.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

Proceedings of the Approximation, 2010

Scheduling Multicast Transmissions under SINR Constraints.

[BibT_eX]

[DOI]

Tom Grant

Proceedings of the Algorithms for Sensor Systems, 2010

2009

Directed Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Online Capacitated Interval Coloring.

[BibT_eX]

[DOI]

Asaf Levin

SIAM J. Discret. Math., 2009

WAOA 2006 Special Issue of TOCS.

[BibT_eX]

[DOI]

Christos Kaklamanis

Theory Comput. Syst., 2009

Connectivity Measures for Internet Topologies on the Level of Autonomous Systems.

[BibT_eX]

[DOI]

Oper. Res., 2009

Variable Sized Online Interval Coloring with Bandwidth.

[BibT_eX]

[DOI]

Asaf Levin

Algorithmica, 2009

Foreword.

[BibT_eX]

[DOI]

Yossi Azar

Algorithmica, 2009

A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs.

[BibT_eX]

[DOI]

Matús Mihalák

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Approximating node-weighted multicast trees in wireless ad-hoc networks.

[BibT_eX]

[DOI]

Ambreen Shahnaz

Proceedings of the International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, 2009

Path Splicing with Guaranteed Fault Tolerance.

[BibT_eX]

[DOI]

Anna Mereu

Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2008

Mehrheitsbestimmung - Wer wird Klassensprecher?.

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

WAOA 2005 Special Issue of TOCS.

[BibT_eX]

[DOI]

Giuseppe Persiano

Theory Comput. Syst., 2008

Routing to reduce the cost of wavelength conversion.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Computing Minimum Spanning Trees with Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

Approximating geometric coverage problems.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Domination in Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Computing the types of the relationships between autonomous systems.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2007

Tim Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, Cambridge, MA (2005) ISBN 0-262-18243-2, pp 196.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Cuts and Disjoint Paths in the Valley-Free Model.

[BibT_eX]

[DOI]

Internet Math., 2007

An Algorithmic View on OVSF Code Assignment.

[BibT_eX]

[DOI]

Algorithmica, 2007

Call Control in Rings.

[BibT_eX]

[DOI]

Algorithmica, 2007

Approximate Discovery of Random Graphs.

[BibT_eX]

[DOI]

Alexander Hall

Matús Mihalák

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

2006

Independence and Coloring Problems on Intersection Graphs of Disks.

[BibT_eX]

[DOI]

Jirí Fiala

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow.

[BibT_eX]

[DOI]

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Network Discovery and Verification.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2006

Path problems in generalized stars, complete graphs, and brick wall graphs.

[BibT_eX]

[DOI]

Danica Vukadinovic

Discret. Appl. Math., 2006

Length-Bounded Cuts and Flows.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Robustness of the Internet at the Topology and Routing Level.

[BibT_eX]

[DOI]

Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

Call control on lines.

[BibT_eX]

[DOI]

R. Sai Anand

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

Network Discovery and Verification with Distance Queries.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Eike Seidel

SIAM J. Comput., 2005

Conversion of coloring algorithms into maximum weight independent set algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

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

[BibT_eX]

[DOI]

Algorithmica, 2005

2004

An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem.

[BibT_eX]

[DOI]

Hiroyuki Miyazawa

J. Sched., 2004

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

[BibT_eX]

[DOI]

Alexander Hall

J. Sched., 2004

Algorithmic complexity of protein identification: combinatorics of weighted strings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Joint Base Station Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Off-line Admission Control for Advance Reservations in Star Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Routing in all-optical ring networks revisited.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Maurice Rüegg

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Scheduling with Release Times and Deadlines on a Minimum Number of Machines.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Fundamentals.

[BibT_eX]

[DOI]

Ulrik Brandes

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

Introduction.

[BibT_eX]

[DOI]

Ulrik Brandes

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.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

Call control with k rejections.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Interval selection: Applications, algorithms, and lower bounds.

[BibT_eX]

[DOI]

Frits C. R. Spieksma

J. Algorithms, 2003

Resource Allocation Problems in Multifiber WDM Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Greedy Edge-Disjoint Paths in Complete Graphs.

[BibT_eX]

[DOI]

Paz Carmi

Yoshio Okamoto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Scheduling AND/OR-Networks on Identical Parallel Machines.

[BibT_eX]

[DOI]

Vanessa Kääb

Rolf H. Möhring

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Online Coloring of Intervals with Bandwidth.

[BibT_eX]

[DOI]

Udo Adamy

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Routing and Call Control Algorithms for Ring Networks.

[BibT_eX]

[DOI]

R. Sai Anand

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Approximating Multiobjective Knapsack Problems.

[BibT_eX]

[DOI]

Hans Kellerer

Ulrich Pferschy

Manag. Sci., 2002

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2002

On-line coloring of geometric intersection graphs.

[BibT_eX]

[DOI]

Jirí Fiala

Comput. Geom., 2002

Real and generated internet AS topologies: structure, spectrum, robustness.

[BibT_eX]

[DOI]

Comput. Commun. Rev., 2002

Routing Flow Through a Strongly Connected Graph.

[BibT_eX]

[DOI]

Torben Hagerup

Algorithmica, 2002

Call Control with k Rejections.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

On-line Algorithms for Edge-Disjoint Paths in Trees of Rings.

[BibT_eX]

[DOI]

R. Sai Anand

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Spectrum and Structure of Internet Topology Graphs.

[BibT_eX]

[DOI]

Danica Vukadinovic

Polly Huang

Proceedings of the Innovative Internet Computing Systems, Second International Workshop, 2002

Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Schedulability of event-driven code blocks in real-time embedded systems.

[BibT_eX]

[DOI]

Proceedings of the 39th Design Automation Conference, 2002

2001

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

The complexity of path coloring and call scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

Approximating Multi-objective Knapsack Problems.

[BibT_eX]

[DOI]

Hans Kellerer

Ulrich Pferschy

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

On the Complexity of Scheduling Conditional Real-Time Code.

[BibT_eX]

[DOI]

Samarjit Chakraborty

Lothar Thiele

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Polynomial-time approximation schemes for geometric graphs.

[BibT_eX]

[DOI]

Eike Seidel

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

On the Complexity of Train Assignment Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs.

[BibT_eX]

[DOI]

Danica Vukadinovic

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Parallel Load Balancing for Problems with Good Bisectors.

[BibT_eX]

[DOI]

Stefan Bischof

Ralf Ebner

J. Parallel Distributed Comput., 2000

Simple Algorithms for a Weighted Interval Selection Problem.

[BibT_eX]

[DOI]

Frits C. R. Spieksma

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Scheduling connections in fast networks.

[BibT_eX]

[DOI]

PhD thesis, 1999

Optimal Wavelength Routing on Directed Fiber Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 1999

A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing.

[BibT_eX]

Proceedings of the Workshops zur Architektur von Rechensystemen, 1999

1998

Maximizing the Number of Connections in Optical Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations.

[BibT_eX]

[DOI]

Stefan Bischof

Ralf Ebner

Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997

An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Off-Line and On-Line Call-Scheduling in Stars and Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Call Scheduling in Trees, Rings and Meshes.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996

Scheduling of Virtual Connections in Fast Networks

[BibT_eX]