| Publication | Date of Publication | Type |
|---|
| Approximation algorithms for graph search problems with imperfect detection | 2026-02-10 | Paper |
Exact and approximation algorithms for routing a convoy through a graph
Mathematical Programming. Series A. Series B | 2025-09-09 | Paper |
| Exact and approximation algorithms for routing a convoy through a graph | 2024-12-03 | Paper |
Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
SIAM Journal on Computing | 2021-11-19 | Paper |
The Chinese deliveryman problem
4OR | 2021-05-11 | Paper |
| Fixed-order scheduling on parallel machines | 2020-02-06 | Paper |
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Operations Research Letters | 2019-06-11 | Paper |
A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Operations Research Letters | 2019-06-11 | Paper |
| scientific article; zbMATH DE number 7051292 (Why is no real title available?) | 2019-05-06 | Paper |
| The itinerant list update problem | 2019-01-15 | Paper |
The triangle scheduling problem
Journal of Scheduling | 2018-11-07 | Paper |
The triangle scheduling problem
Journal of Scheduling | 2018-11-07 | Paper |
A priori TSP in the scenario model
Discrete Applied Mathematics | 2018-10-26 | Paper |
Scheduling reclaimer operations in the stockyard to minimize makespan
Acta Mathematicae Applicatae Sinica. English Series | 2018-09-18 | Paper |
The A priori traveling repairman problem
Algorithmica | 2018-07-26 | Paper |
Approximation and complexity of multi-target graph search and the Canadian traveler problem
Theoretical Computer Science | 2018-06-07 | Paper |
Minimizing worst-case and average-case makespan over scenarios
Journal of Scheduling | 2018-02-28 | Paper |
A $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
(available as arXiv preprint) | 2017-06-23 | Paper |
A priori TSP in the Scenario Model
Approximation and Online Algorithms | 2017-04-04 | Paper |
Approximability of average completion time scheduling on unrelated machines
Mathematical Programming. Series A. Series B | 2017-02-03 | Paper |
On some special cases of the restricted assignment problem
Information Processing Letters | 2016-07-27 | Paper |
Routing under uncertainty: the \textit{a priori} traveling repairman problem
Approximation and Online Algorithms | 2015-11-20 | Paper |
On the complexity of master problems
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Split scheduling with uniform setup times
Journal of Scheduling | 2015-04-24 | Paper |
Scheduling over scenarios on two machines
Lecture Notes in Computer Science | 2014-09-26 | Paper |
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
SIAM Journal on Computing | 2014-06-04 | Paper |
The traveling salesman problem on cubic and subcubic graphs
Mathematical Programming. Series A. Series B | 2014-06-02 | Paper |
On the complexity of the highway problem
Theoretical Computer Science | 2012-11-27 | Paper |
Computer-aided complexity classification of dial-a-ride problems
INFORMS Journal on Computing | 2012-06-08 | Paper |
A note on sorting buffers offline
Theoretical Computer Science | 2012-05-14 | Paper |
| The traveling salesman problem under squared Euclidean distances | 2012-01-23 | Paper |
TSP on cubic and subcubic graphs
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
Automation and Remote Control | 2011-01-03 | Paper |
Competitive analysis of preemptive single-machine scheduling
Operations Research Letters | 2010-12-23 | Paper |
Efficient algorithms for average completion time scheduling
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Connected feedback vertex set in planar graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
On profit-maximizing pricing for the highway and tollbooth problems
Algorithmic Game Theory | 2009-12-01 | Paper |
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry | 2009-08-14 | Paper |
Optimal pricing of capacitated networks
Networks | 2009-07-28 | Paper |
APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
International Journal of Computational Geometry & Applications | 2009-06-30 | Paper |
Minimizing Average Flow Time on Unrelated Machines
Approximation and Online Algorithms | 2009-02-12 | Paper |
The generalized two-server problem
Journal of the ACM | 2008-12-21 | Paper |
Approximability of Average Completion Time Scheduling on Unrelated Machines
Algorithms - ESA 2008 | 2008-11-25 | Paper |
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
Algorithms – ESA 2007 | 2008-09-25 | Paper |
How to Sell a Graph: Guidelines for Graph Retailers
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
On Approximating the TSP with Intersecting Neighborhoods
Algorithms and Computation | 2008-04-24 | Paper |
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
Approximation and Online Algorithms | 2008-02-21 | Paper |
On the Value of Preemption in Scheduling
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
The geometric generalized minimum spanning tree problem with grid clustering
4OR | 2007-05-24 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Complexity of preemptive minsum scheduling on unrelated parallel machines
Journal of Algorithms | 2005-11-16 | Paper |
On-line dial-a-ride problems under a restricted information model
Algorithmica | 2004-11-05 | Paper |
| scientific article; zbMATH DE number 2086925 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2038743 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1947431 (Why is no real title available?) | 2003-07-08 | Paper |
A class of on-line scheduling algorithms to minimize total completion time
Operations Research Letters | 2003-06-17 | Paper |
| scientific article; zbMATH DE number 1757970 (Why is no real title available?) | 2002-06-20 | Paper |
A short proof of a conjecture on the \(T_r\)-choice number of even cycles
Discrete Applied Mathematics | 2000-02-23 | Paper |
