| Publication | Date of Publication | Type |
|---|
| Efficient certifying algorithms for linear classification | 2025-11-11 | Paper |
Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard
Theoretical Computer Science | 2025-02-12 | Paper |
Egalitarian roommate allocations: complexity and stability
Theoretical Computer Science | 2025-01-08 | Paper |
Physarum-inspired multi-commodity flow dynamics
Theoretical Computer Science | 2022-05-17 | Paper |
A Laplacian approach to _1-norm minimization
Computational Optimization and Applications | 2021-08-09 | Paper |
Algorithms for hierarchical and semi-partitioned parallel scheduling
Journal of Computer and System Sciences | 2021-06-30 | Paper |
On the convergence time of a natural dynamics for linear programming
(available as arXiv preprint) | 2020-11-25 | Paper |
On the convergence time of a natural dynamics for linear programming
Algorithmica | 2020-04-09 | Paper |
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
Journal of Scheduling | 2020-01-03 | Paper |
Two results on slime mold computations
Theoretical Computer Science | 2019-05-21 | Paper |
\textit{Physarum} can compute shortest paths
Journal of Theoretical Biology | 2019-05-14 | Paper |
| \textit{Physarum} can compute shortest paths | 2019-05-10 | 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 |
A revised model of fluid transport optimization in \textit{Physarum polycephalum}
Journal of Mathematical Biology | 2017-02-10 | Paper |
Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
Journal of the ACM | 2016-03-24 | Paper |
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm
Real-Time Systems | 2016-03-09 | Paper |
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Partitioned EDF scheduling on a few types of unrelated multiprocessors
Real-Time Systems | 2014-07-14 | Paper |
| Algorithms and complexity for periodic real-time scheduling | 2014-05-22 | Paper |
Physarum can compute shortest paths: convergence proofs and complexity bounds
Automata, Languages, and Programming | 2013-08-07 | Paper |
Physarum can compute shortest paths: a short proof
Information Processing Letters | 2013-03-21 | 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 |
| Complexity and approximation in reoptimization | 2012-09-05 | Paper |
A constant-approximate feasibility test for multiprocessor real-time scheduling
Algorithmica | 2012-04-26 | Paper |
Efficiency of restricted tolls in non-atomic network routing games
Algorithmic Game Theory | 2011-10-28 | Paper |
Mixed-criticality scheduling of sporadic task systems
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Stackelberg Routing in Arbitrary Networks
Mathematics of Operations Research | 2011-04-27 | 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 online prize-collecting traveling salesman problem
Information Processing Letters | 2010-04-19 | Paper |
Data gathering in wireless networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Online k-server routing problems
Theory of Computing Systems | 2009-09-02 | Paper |
On the power of lookahead in on-line server routing problems
Theoretical Computer Science | 2008-12-12 | 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 on-line asymmetric traveling salesman problem
Journal of Discrete Algorithms | 2008-08-08 | Paper |
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science | 2008-07-31 | Paper |
The Distributed Wireless Gathering Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Online k-Server Routing Problems
Approximation and Online Algorithms | 2008-02-21 | Paper |
An Approximation Algorithm for the Wireless Gathering Problem
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
An adversarial queueing model for online server routing
Theoretical Computer Science | 2007-09-03 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| scientific article; zbMATH DE number 2089606 (Why is no real title available?) | 2004-08-12 | Paper |
