| Publication | Date of Publication | Type |
|---|
Efficient parallel algorithms for some tree layout problems
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| Dynamic tree routing under the “matching with consumption” model | 2023-01-25 | Paper |
The vacation planning problem: a multi-level clustering-based metaheuristic approach
Computers & Operations Research | 2022-12-19 | Paper |
On the computation of fast data transmissions in networks with capacities and delays
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Efficient parallel algorithms for shortest paths in planar graphs
SWAT 90 | 2022-12-09 | Paper |
Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Efficient metaheuristics for the mixed team orienteering problem with time windows
Algorithms | 2019-03-26 | Paper |
Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach
Computers & Operations Research | 2018-07-12 | Paper |
On-line and dynamic algorithms for shortest path problems
STACS 95 | 2017-12-04 | Paper |
Heuristics for the time dependent team orienteering problem: application to tourist route planning
Computers & Operations Research | 2016-11-10 | Paper |
A glimpse at Paul G. Spirakis
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Advances in the parallelization of the simplex method
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Approximation algorithms for the arc orienteering problem
Information Processing Letters | 2014-12-09 | Paper |
Clustering in mobile ad hoc networks through neighborhood stability-based mobility prediction
Computer Networks | 2008-06-25 | Paper |
Competitive video on demand schedulers for popular movies
Discrete Applied Mathematics | 2003-07-30 | Paper |
Competitive call control in mobile networks
Theory of Computing Systems | 2003-05-04 | Paper |
| scientific article; zbMATH DE number 1760005 (Why is no real title available?) | 2002-11-06 | Paper |
Robust parallel computations through randomization
Theory of Computing Systems | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1555943 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1555968 (Why is no real title available?) | 2001-01-24 | Paper |
Improved algorithms for dynamic shortest paths
Algorithmica | 2000-11-14 | Paper |
| Transmissions in a network with capacities and delays | 1999-06-29 | Paper |
| scientific article; zbMATH DE number 1263991 (Why is no real title available?) | 1999-03-16 | Paper |
A note on parallel algorithms for optimal h-v drawings of binary trees
Computational Geometry | 1998-08-19 | Paper |
Many-to-many routing on trees via matchings
Theoretical Computer Science | 1998-07-22 | Paper |
Parallel algorithms for the minimum cut and the minimum length tree layout problems
Theoretical Computer Science | 1998-07-22 | Paper |
The fourth moment in Luby's distribution
Theoretical Computer Science | 1997-02-28 | Paper |
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 219240 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176745 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 139775 (Why is no real title available?) | 1993-03-28 | Paper |
Efficient parallel algorithms for shortest paths in planar digraphs
BIT | 1992-12-14 | Paper |
| scientific article; zbMATH DE number 18532 (Why is no real title available?) | 1992-06-26 | Paper |
