| Publication | Date of Publication | Type |
|---|
| On-line graph algorithms for incremental compilation | 2024-01-05 | Paper |
| Feasibility Analysis of Conditional DAG Tasks | 2023-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098779 | 2023-06-14 | Paper |
| Approximation algorithms for replenishment problems with fixed turnover times | 2022-08-18 | Paper |
| Algorithms for hierarchical and semi-partitioned parallel scheduling | 2021-06-30 | Paper |
| Approximation algorithms for replenishment problems with fixed turnover times | 2020-02-12 | Paper |
| ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors | 2020-01-03 | Paper |
| On-line resource management with applications to routing and scheduling | 2019-01-10 | Paper |
| Minimizing worst-case and average-case makespan over scenarios | 2018-02-28 | Paper |
| Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling | 2017-07-27 | Paper |
| Scheduling Real-Time Mixed-Criticality Jobs | 2017-07-12 | Paper |
| Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems | 2017-06-08 | Paper |
| Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems | 2016-03-24 | Paper |
| Strong LP formulations for scheduling splittable jobs on unrelated machines | 2015-12-09 | Paper |
| Assigning sporadic tasks to unrelated machines | 2015-08-31 | Paper |
| Algorithms and complexity for periodic real-time scheduling | 2014-12-05 | Paper |
| Latency-constrained aggregation in sensor networks | 2014-11-18 | Paper |
| Scheduling over Scenarios on Two Machines | 2014-09-26 | Paper |
| Minimizing flow time in the wireless gathering problem | 2014-09-09 | Paper |
| Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines | 2014-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417713 | 2014-05-22 | Paper |
| Assigning Sporadic Tasks to Unrelated Parallel Machines | 2013-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910712 | 2013-03-19 | Paper |
| Feasibility analysis of sporadic real-time multiprocessor task systems | 2012-12-06 | Paper |
| Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets | 2012-10-11 | Paper |
| Universal Sequencing on an Unreliable Machine | 2012-09-12 | Paper |
| A constant-approximate feasibility test for multiprocessor real-time scheduling | 2012-04-26 | Paper |
| Nonclairvoyant Speed Scaling for Flow and Energy | 2012-04-24 | Paper |
| Nonclairvoyant speed scaling for flow and energy | 2011-11-07 | Paper |
| Mixed-Criticality Scheduling of Sporadic Task Systems | 2011-09-16 | Paper |
| Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks | 2011-09-16 | Paper |
| The distributed wireless gathering problem | 2011-02-21 | Paper |
| Improved multiprocessor global schedulability analysis | 2010-09-20 | Paper |
| Feasibility analysis of sporadic real-time multiprocessor task systems | 2010-09-06 | Paper |
| Scheduling Real-Time Mixed-Criticality Jobs | 2010-09-03 | Paper |
| The complexity of existential quantification in concept languages. | 2010-08-27 | Paper |
| Universal Sequencing on a Single Machine | 2010-06-22 | Paper |
| The complexity of interval routing on random graphs | 2010-06-17 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Data Gathering in Wireless Networks | 2010-02-09 | Paper |
| Balanced cut approximation in random geometric graphs | 2009-07-10 | Paper |
| Data aggregation in sensor networks: Balancing communication and delay costs | 2009-03-30 | Paper |
| An approximation algorithm for the wireless gathering problem | 2008-11-27 | Paper |
| A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling | 2008-11-25 | Paper |
| The Distributed Wireless Gathering Problem | 2008-07-10 | Paper |
| Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm | 2008-05-27 | Paper |
| Balanced Cut Approximation in Random Geometric Graphs | 2008-04-24 | Paper |
| Latency Constrained Aggregation in Sensor Networks | 2008-03-11 | Paper |
| Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs | 2007-11-15 | Paper |
| An Approximation Algorithm for the Wireless Gathering Problem | 2007-09-07 | Paper |
| Approximating call-scheduling makespan in all-optical networks | 2007-04-26 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Online weighted flow time and deadline scheduling | 2006-10-31 | Paper |
| Efficient token-based control in rings. | 2006-01-17 | Paper |
| Semi-clairvoyant scheduling | 2004-11-23 | Paper |
| Fully dynamic shortest paths in digraphs with arbitrary arc weights | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472463 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470497 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411288 | 2003-07-07 | Paper |
| Maintaining a topological order under edge insertions | 2003-06-24 | Paper |
| Approximation algorithms for routing and call scheduling in all-optical chains and rings. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780781 | 2002-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766665 | 2002-08-11 | Paper |
| A broadcasting protocol in line digraphs | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503935 | 2001-11-28 | Paper |
| Dynamic algorithms for classes of constraint satisfaction problems | 2001-08-20 | Paper |
| On-line Randomized Call Control Revisited | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501672 | 2000-09-04 | Paper |
| Fully Dynamic Algorithms for Maintaining Shortest Paths Trees | 2000-08-28 | Paper |
| Multiprocessor Scheduling with Rejection | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252034 | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258216 | 1999-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250198 | 1999-07-08 | Paper |
| Semidynamic algorithms for maintaining single-source shortest path trees | 1999-06-22 | Paper |
| The Complexity of Interval Routing on Random Graphs | 1999-01-25 | Paper |
| Memory Paging for Connectivity and Path Problems in Graphs | 1998-10-28 | Paper |
| Average case analysis of fully dynamic reachability for directed graphs | 1997-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875173 | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875188 | 1996-04-28 | Paper |
| Stochastic on-line knapsack problems | 1996-03-05 | Paper |
| On learning monotone DNF formulae under uniform distributions | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138872 | 1994-01-02 | Paper |
| Dynamic algorithms for shortest paths in planar graphs | 1993-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694731 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037423 | 1993-05-18 | Paper |
| The weighted list update problem and the lazy adversary | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028899 | 1993-03-28 | Paper |
| Probabilistic analysis of the minimum weighted flowtime scheduling problem | 1993-01-16 | Paper |
| On-line computation of minimal and maximal length paths | 1992-06-28 | Paper |
| Incremental algorithms for minimal length paths | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974877 | 1992-06-26 | Paper |
| Comparison of methods for logic-query implementation | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820038 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783565 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3749073 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740257 | 1985-01-01 | Paper |
| Hierarchical vehicle routing problems | 1984-01-01 | Paper |
| The largest tree in a random graph | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041238 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674056 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3326854 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3923600 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3923601 | 1981-01-01 | Paper |
| Toward a unified approach for the classification of NP-complete optimization problems | 1980-01-01 | Paper |
| Combinatorial problems over power sets | 1979-01-01 | Paper |
