| Publication | Date of Publication | Type |
|---|
| Connecting de Bruijn graphs | 2025-12-02 | 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 |
Elastic-degenerate string matching with 1 error or mismatch
Theory of Computing Systems | 2024-11-12 | Paper |
| Reconstructing phylogenetic networks via Cherry picking and machine learning | 2024-08-13 | Paper |
| Total completion time scheduling under scenarios | 2024-07-19 | Paper |
| Making de Bruijn graphs Eulerian | 2024-05-06 | Paper |
Complexity of inventory routing problems when routing is easy
Networks | 2023-11-13 | Paper |
Elastic-degenerate string matching with 1 error
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| scientific article; zbMATH DE number 7695995 (Why is no real title available?) | 2023-06-14 | Paper |
scientific article; zbMATH DE number 7696005 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-14 | Paper |
A duality based 2-approximation algorithm for maximum agreement forest
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
| scientific article; zbMATH DE number 7651098 (Why is no real title available?) | 2023-02-07 | Paper |
Competitive algorithms for the on-line traveling salesman
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Serving requests with on-line routing
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Approximation algorithms for replenishment problems with fixed turnover times
Algorithmica | 2022-08-18 | Paper |
Tight Bounds for Online TSP on the Line
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Optimal algorithms for scheduling under time-of-use tariffs
Annals of Operations Research | 2021-11-09 | Paper |
Local improvement algorithms for a path packing problem: a performance analysis based on linear programming
Operations Research Letters | 2021-04-07 | Paper |
Minimizing bed occupancy variance by scheduling patients under uncertainty
European Journal of Operational Research | 2020-05-27 | 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 |
| Fixed-order scheduling on parallel machines | 2020-02-06 | Paper |
| The itinerant list update problem | 2019-01-15 | Paper |
On unrooted and root-uncertain variants of several well-known phylogenetic network problems
Algorithmica | 2019-01-11 | Paper |
Tight bounds for online TSP on the line
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Minimizing worst-case and average-case makespan over scenarios
Journal of Scheduling | 2018-02-28 | Paper |
| Stochastic and robust scheduling in the cloud | 2017-08-31 | Paper |
Scheduling Real-Time Mixed-Criticality Jobs
IEEE Transactions on Computers | 2017-07-12 | 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 |
Erratum to: ``Computational complexity of stochastic programming problems''
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
Optimal algorithms and a PTAS for cost-aware scheduling
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Split scheduling with uniform setup times
Journal of Scheduling | 2015-04-24 | Paper |
Latency-constrained aggregation in sensor networks
ACM Transactions on Algorithms | 2014-11-18 | Paper |
A simple randomised algorithm for convex optimisation
Mathematical Programming. Series A. Series B | 2014-10-17 | 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 |
Approximation algorithms for nonbinary agreement forests
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
The traveling salesman problem on cubic and subcubic graphs
Mathematical Programming. Series A. Series B | 2014-06-02 | Paper |
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| Polynomial time vertex enumeration of convex polytopes of bounded branch-width | 2014-04-22 | Paper |
| A short note on exponential-time algorithms for hybridization number | 2013-12-04 | Paper |
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
| Minimizing flow time in the wireless gathering problem | 2013-03-19 | 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 |
Computer-aided complexity classification of dial-a-ride problems
INFORMS Journal on Computing | 2012-06-08 | Paper |
The online TSP against fair adversaries
INFORMS Journal on Computing | 2012-05-30 | Paper |
Mixed-criticality scheduling of sporadic task systems
Algorithms – ESA 2011 | 2011-09-16 | Paper |
TSP on cubic and subcubic graphs
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
The distributed wireless gathering problem
Theoretical Computer Science | 2011-02-21 | Paper |
Scheduling real-time mixed-criticality jobs
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Universal sequencing on a single machine
Integer Programming and Combinatorial Optimization | 2010-06-22 | 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 |
Data aggregation in sensor networks: Balancing communication and delay costs
Theoretical Computer Science | 2009-03-30 | Paper |
Random walks on the vertices of transportation polytopes with constant number of sources
Random Structures & Algorithms | 2009-03-04 | Paper |
The generalized two-server problem
Journal of the ACM | 2008-12-21 | Paper |
An approximation algorithm for the wireless gathering problem
Operations Research Letters | 2008-11-27 | Paper |
Bincoloring
Theoretical Computer Science | 2008-11-18 | Paper |
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
The Distributed Wireless Gathering Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
Latency Constrained Aggregation in Sensor Networks
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Stochastic facility location with general long-run costs and convex short-run costs
Computers & Operations Research | 2008-03-11 | Paper |
| Virtual private network design | 2008-03-06 | Paper |
Online k-Server Routing Problems
Approximation and Online Algorithms | 2008-02-21 | Paper |
On-line multi-threaded scheduling
Journal of Scheduling | 2007-12-20 | Paper |
Prefix Reversals on Binary and Ternary Strings
Algebraic Biology | 2007-11-29 | 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 |
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
A linear bound on the diameter of the transportation polytope
Combinatorica | 2007-01-08 | Paper |
Location of slaughterhouses under economies of scale
European Journal of Operational Research | 2006-10-27 | Paper |
Simple integer recourse models: convexity and convex approximations
Mathematical Programming. Series A. Series B | 2006-09-12 | Paper |
Computational complexity of stochastic programming problems
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
A linear programming formulation of Mader's edge-disjoint paths problem
Journal of Combinatorial Theory. Series B | 2006-01-10 | Paper |
The stochastic single resource service-provision problem
Naval Research Logistics | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2119670 (Why is no real title available?) | 2004-11-29 | Paper |
On-line dial-a-ride problems under a restricted information model
Algorithmica | 2004-11-05 | Paper |
| scientific article; zbMATH DE number 2079356 (Why is no real title available?) | 2004-07-28 | Paper |
Approximation algorithms for the test cover problem
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2038743 (Why is no real title available?) | 2004-02-08 | Paper |
News from the online traveling repairman.
Theoretical Computer Science | 2003-08-17 | Paper |
Approximation algorithms and relaxations for a service provision problem on a telecommunication network
Discrete Applied Mathematics | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1947395 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947431 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947058 (Why is no real title available?) | 2003-07-07 | 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 1875408 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1834671 (Why is no real title available?) | 2002-11-25 | Paper |
Randomized algorithms for on-line scheduling problems: How low can't you go?
Operations Research Letters | 2002-08-28 | Paper |
On-line single-server dial-a-ride problems
Theoretical Computer Science | 2002-03-03 | Paper |
Algorithms for the on-line travelling salesman
Algorithmica | 2002-02-19 | Paper |
| scientific article; zbMATH DE number 1629852 (Why is no real title available?) | 2001-11-06 | Paper |
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics | 2000-03-19 | Paper |
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
Two‐stage stochastic integer programming: a survey
Statistica Neerlandica | 1999-01-04 | Paper |
Modelling aspects of distributed processing in telecommunication networks
Annals of Operations Research | 1998-11-03 | Paper |
| scientific article; zbMATH DE number 1175949 (Why is no real title available?) | 1998-07-19 | Paper |
| scientific article; zbMATH DE number 1031377 (Why is no real title available?) | 1998-02-05 | Paper |
| scientific article; zbMATH DE number 1043891 (Why is no real title available?) | 1998-01-13 | Paper |
| scientific article; zbMATH DE number 871904 (Why is no real title available?) | 1996-09-15 | Paper |
An algorithm for the construction of convex hulls in simple integer recourse programming
Annals of Operations Research | 1996-07-31 | Paper |
On the convex hull of the simple integer recourse objective function
Annals of Operations Research | 1995-08-27 | Paper |
A class of generalized greedy algorithms for the multi-knapsack problem
Discrete Applied Mathematics | 1993-06-29 | Paper |
A fast randomized algorithm for partitioning a graph into paths of fixed length
Discrete Applied Mathematics | 1993-06-29 | Paper |
Probabilistic analysis of the minimum weighted flowtime scheduling problem
Operations Research Letters | 1993-01-16 | Paper |
On rates of convergence and asymptotic normality in the multiknapsack problem
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
A probabilistic analysis of the multiknapsack value function
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4137536 (Why is no real title available?) | 1989-01-01 | Paper |
On the relation between complexity and uncertainty
Annals of Operations Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4066603 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4108494 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4089326 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4053339 (Why is no real title available?) | 1987-01-01 | Paper |
STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING
Statistica Neerlandica | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4099043 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 4099020 (Why is no real title available?) | 1984-01-01 | Paper |
Hierarchical vehicle routing problems
Networks | 1984-01-01 | Paper |
A stochastic method for global optimization
Mathematical Programming | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3718859 (Why is no real title available?) | 1980-01-01 | Paper |
