| Publication | Date of Publication | Type |
|---|
| Average case and smoothed competitive analysis of the multi-level feedback algorithm | 2026-05-29 | Paper |
Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity
Theoretical Computer Science | 2025-12-15 | Paper |
Total completion time scheduling under scenarios
Theory of Computing Systems | 2025-10-24 | Paper |
Missing value replacement in strings and applications
Data Mining and Knowledge Discovery | 2025-03-24 | Paper |
Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard
Theoretical Computer Science | 2025-02-12 | Paper |
| Total completion time scheduling under scenarios | 2024-07-19 | Paper |
On-line graph algorithms for incremental compilation
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
| Feasibility Analysis of Conditional DAG Tasks | 2023-06-20 | Paper |
| scientific article; zbMATH DE number 7695995 (Why is no real title available?) | 2023-06-14 | Paper |
Approximation algorithms for replenishment problems with fixed turnover times
Algorithmica | 2022-08-18 | Paper |
Algorithms for hierarchical and semi-partitioned parallel scheduling
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Approximation algorithms for replenishment problems with fixed turnover times
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
Approximation algorithms for replenishment problems with fixed turnover times
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
Journal of Scheduling | 2020-01-03 | Paper |
On-line resource management with applications to routing and scheduling
Automata, Languages and Programming | 2019-01-10 | Paper |
Minimizing worst-case and average-case makespan over scenarios
Journal of Scheduling | 2018-02-28 | Paper |
Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling
IEEE Transactions on Computers | 2017-07-27 | Paper |
Scheduling Real-Time Mixed-Criticality Jobs
IEEE Transactions on Computers | 2017-07-12 | Paper |
Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems
IEEE Transactions on Computers | 2017-06-08 | Paper |
Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
Journal of the ACM | 2016-03-24 | Paper |
Strong LP formulations for scheduling splittable jobs on unrelated machines
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Assigning sporadic tasks to unrelated machines
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Latency-constrained aggregation in sensor networks
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Scheduling over scenarios on two machines
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| Algorithms and complexity for periodic real-time scheduling | 2014-05-22 | Paper |
Assigning sporadic tasks to unrelated parallel machines
Automata, Languages, and Programming | 2013-08-12 | Paper |
| Minimizing flow time in the wireless gathering problem | 2013-03-19 | Paper |
Feasibility analysis of sporadic real-time multiprocessor task systems
Algorithmica | 2012-12-06 | Paper |
Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Theoretical Computer Science | 2012-10-11 | Paper |
Universal sequencing on an unreliable machine
SIAM Journal on Computing | 2012-09-12 | Paper |
A constant-approximate feasibility test for multiprocessor real-time scheduling
Algorithmica | 2012-04-26 | Paper |
| Nonclairvoyant speed scaling for flow and energy | 2012-04-24 | Paper |
Nonclairvoyant speed scaling for flow and energy
Algorithmica | 2011-11-07 | Paper |
Mixed-criticality scheduling of sporadic task systems
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Social-aware forwarding improves routing performance in pocket switched networks
Algorithms – ESA 2011 | 2011-09-16 | Paper |
The distributed wireless gathering problem
Theoretical Computer Science | 2011-02-21 | Paper |
Improved multiprocessor global schedulability analysis
Real-Time Systems | 2010-09-20 | Paper |
Feasibility analysis of sporadic real-time multiprocessor task systems
Lecture Notes in Computer Science | 2010-09-06 | Paper |
Scheduling real-time mixed-criticality jobs
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
The complexity of existential quantification in concept languages.
Artificial Intelligence | 2010-08-27 | Paper |
Universal sequencing on a single machine
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
The complexity of interval routing on random graphs
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Semi-clairvoyant scheduling
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Data gathering in wireless networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Balanced cut approximation in random geometric graphs
Theoretical Computer Science | 2009-07-10 | Paper |
Data aggregation in sensor networks: Balancing communication and delay costs
Theoretical Computer Science | 2009-03-30 | Paper |
An approximation algorithm for the wireless gathering problem
Operations Research Letters | 2008-11-27 | Paper |
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Algorithms - ESA 2008 | 2008-11-25 | Paper |
The Distributed Wireless Gathering Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research | 2008-05-27 | Paper |
Balanced Cut Approximation in Random Geometric Graphs
Algorithms and Computation | 2008-04-24 | Paper |
Latency Constrained Aggregation in Sensor Networks
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
Structural Information and Communication Complexity | 2007-11-15 | Paper |
An Approximation Algorithm for the Wireless Gathering Problem
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Approximating call-scheduling makespan in all-optical networks
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Online weighted flow time and deadline scheduling
Journal of Discrete Algorithms | 2006-10-31 | Paper |
Efficient token-based control in rings.
Information Processing Letters | 2006-01-17 | Paper |
Semi-clairvoyant scheduling
Theoretical Computer Science | 2004-11-23 | Paper |
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2080220 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2077114 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1947058 (Why is no real title available?) | 2003-07-07 | Paper |
Maintaining a topological order under edge insertions
Information Processing Letters | 2003-06-24 | Paper |
Approximation algorithms for routing and call scheduling in all-optical chains and rings.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1833400 (Why is no real title available?) | 2002-11-21 | Paper |
| scientific article; zbMATH DE number 1696518 (Why is no real title available?) | 2002-08-11 | Paper |
A broadcasting protocol in line digraphs
Journal of Parallel and Distributed Computing | 2002-06-30 | Paper |
| scientific article; zbMATH DE number 1507215 (Why is no real title available?) | 2001-11-28 | Paper |
Dynamic algorithms for classes of constraint satisfaction problems
Theoretical Computer Science | 2001-08-20 | Paper |
On-line randomized call control revisited
SIAM Journal on Computing | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1500650 (Why is no real title available?) | 2000-09-04 | Paper |
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
Journal of Algorithms | 2000-08-28 | Paper |
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1305092 (Why is no real title available?) | 2000-03-13 | Paper |
| scientific article; zbMATH DE number 1330033 (Why is no real title available?) | 1999-09-01 | Paper |
| scientific article; zbMATH DE number 1303572 (Why is no real title available?) | 1999-07-08 | Paper |
Semidynamic algorithms for maintaining single-source shortest path trees
Algorithmica | 1999-06-22 | Paper |
The Complexity of Interval Routing on Random Graphs
The Computer Journal | 1999-01-25 | Paper |
Memory Paging for Connectivity and Path Problems in Graphs
Journal of Graph Algorithms and Applications | 1998-10-28 | Paper |
Average case analysis of fully dynamic reachability for directed graphs
RAIRO - Theoretical Informatics and Applications | 1997-05-06 | Paper |
| scientific article; zbMATH DE number 871904 (Why is no real title available?) | 1996-09-15 | Paper |
| scientific article; zbMATH DE number 871917 (Why is no real title available?) | 1996-04-28 | Paper |
Stochastic on-line knapsack problems
Mathematical Programming. Series A. Series B | 1996-03-05 | Paper |
On learning monotone DNF formulae under uniform distributions
Information and Computation | 1994-05-05 | Paper |
| scientific article; zbMATH DE number 432746 (Why is no real title available?) | 1994-01-02 | Paper |
Dynamic algorithms for shortest paths in planar graphs
Theoretical Computer Science | 1993-10-17 | Paper |
| scientific article; zbMATH DE number 219245 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177552 (Why is no real title available?) | 1993-05-18 | Paper |
The weighted list update problem and the lazy adversary
Theoretical Computer Science | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 140481 (Why is no real title available?) | 1993-03-28 | Paper |
Probabilistic analysis of the minimum weighted flowtime scheduling problem
Operations Research Letters | 1993-01-16 | Paper |
Incremental algorithms for minimal length paths
Journal of Algorithms | 1992-06-28 | Paper |
On-line computation of minimal and maximal length paths
Theoretical Computer Science | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 17552 (Why is no real title available?) | 1992-06-26 | Paper |
Comparison of methods for logic-query implementation
The Journal of Logic Programming | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4092808 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4047112 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3985248 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3974320 (Why is no real title available?) | 1985-01-01 | Paper |
Hierarchical vehicle routing problems
Networks | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3829248 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3834019 (Why is no real title available?) | 1983-01-01 | Paper |
The largest tree in a random graph
Theoretical Computer Science | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3858430 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3737032 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3737033 (Why is no real title available?) | 1981-01-01 | Paper |
Toward a unified approach for the classification of NP-complete optimization problems
Theoretical Computer Science | 1980-01-01 | Paper |
Combinatorial problems over power sets
Calcolo | 1979-01-01 | Paper |
