Leen Stougie

According to our database1, Leen Stougie authored at least 105 papers between 1982 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A Generalized Parallel Task Model for Recurrent Real-Time Processes.
TOPC, 2019

The Genetic Diversity of Viruses on a Graphical Map: Discovery of Resistant and Virulent Strains.
ERCIM News, 2019

Fixed-Order Scheduling on Parallel Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
The stochastic programming heritage of Maarten van der Vlerk.
Comput. Manag. Science, 2018

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.
Algorithmica, 2018

The Itinerant List Update Problem.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Approximation Algorithms for Replenishment Problems with Fixed Turnover Times.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

A Fully Polynomial Time Approximation Scheme for Packing While Traveling.
Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

2017
Minimizing worst-case and average-case makespan over scenarios.
J. Scheduling, 2017

Tight Bounds for Online TSP on the Line.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Enumeration of minimal stoichiometric precursor sets in metabolic networks.
Algorithms for Molecular Biology, 2016

2015
Split scheduling with uniform setup times.
J. Scheduling, 2015

Erratum to: Computational complexity of stochastic programming problems.
Math. Program., 2015

WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads.
Journal of Computational Biology, 2015

Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems.
J. ACM, 2015

Optimal Algorithms and a PTAS for Cost-Aware Scheduling.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Stochastic and Robust Scheduling in the Cloud.
Proceedings of the Approximation, 2015

2014
Approximation Algorithms for Nonbinary Agreement Forests.
SIAM J. Discrete Math., 2014

A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming.
Math. Program., 2014

The traveling salesman problem on cubic and subcubic graphs.
Math. Program., 2014

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
Bioinformatics, 2014

WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads.
Proceedings of the Research in Computational Molecular Biology, 2014

Fast Flux Module Detection Using Matroid Theory.
Proceedings of the Research in Computational Molecular Biology, 2014

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Scheduling over Scenarios on Two Machines.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Charge Group Partitioning in Biomolecular Simulation.
Journal of Computational Biology, 2013

2012
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.
Theor. Comput. Sci., 2012

Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set.
SIAM J. Discrete Math., 2012

Universal Sequencing on an Unreliable Machine.
SIAM J. Comput., 2012

Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks.
Bioinformatics, 2012

A Generalized Parallel Task Model for Recurrent Real-time Processes.
Proceedings of the 33rd IEEE Real-Time Systems Symposium, 2012

Charge Group Partitioning in Biomolecular Simulation.
Proceedings of the Research in Computational Molecular Biology, 2012

The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems.
Proceedings of the 24th Euromicro Conference on Real-Time Systems, 2012

2011
Some Mathematical Refinements Concerning Error Minimization in the Genetic Code.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

TSP on Cubic and Subcubic Graphs.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Mixed-Criticality Scheduling of Sporadic Task Systems.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Graph-Based Analysis of the Metabolic Exchanges between Two Co-Resident Intracellular Symbionts, Baumannia cicadellinicola and Sulcia muelleri, with Their Insect Host, Homalodisca coagulata.
PLoS Computational Biology, 2010

A note on the complexity of finding and enumerating elementary modes.
Biosystems, 2010

Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Towards the Design of Certifiable Mixed-criticality Systems.
Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, 2010

Scheduling Real-Time Mixed-Criticality Jobs.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Universal Sequencing on a Single Machine.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Mixed-criticality Scheduling: Improved Resource-augmentation Results.
Proceedings of the ISCA 25th International Conference on Computers and Their Applications, 2010

Data Gathering in Wireless Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
Latency-constrained aggregation in sensor networks.
ACM Trans. Algorithms, 2009

Modes and cuts in metabolic networks: Complexity and algorithms.
Biosystems, 2009

2008
Bincoloring.
Theor. Comput. Sci., 2008

Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
IEEE/ACM Trans. Comput. Biology Bioinform., 2008

Stochastic facility location with general long-run costs and convex short-run costs.
Computers & OR, 2008

Enumerating Precursor Sets of Target Metabolites in a Metabolic Network.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Minimizing Flow Time in the Wireless Gathering Problem.
Proceedings of the STACS 2008, 2008

Constructing Level-2 Phylogenetic Networks from Triplets.
Proceedings of the Research in Computational Molecular Biology, 2008

Minimizing Average Flow Time in Sensor Data Gathering.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

The Distributed Wireless Gathering Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs.
Proceedings of the Structural Information and Communication Complexity, 2007

Prefix Reversals on Binary and Ternary Strings.
Proceedings of the Algebraic Biology, Second International Conference, 2007

2006
Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294].
Theor. Comput. Sci., 2006

Simple integer recourse models: convexity and convex approximations.
Math. Program., 2006

Computational complexity of stochastic programming problems.
Math. Program., 2006

A linear programming formulation of Mader's edge-disjoint paths problem.
J. Comb. Theory, Ser. B, 2006

The generalized two-server problem.
J. ACM, 2006

Location of slaughterhouses under economies of scale.
European Journal of Operational Research, 2006

A Linear Bound On The Diameter Of The Transportation Polytope.
Combinatorica, 2006

Online k-Server Routing Problems.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

An Approximation Algorithm for the Wireless Gathering Problem.
Proceedings of the Algorithm Theory, 2006

Latency Constrained Aggregation in Sensor Networks.
Proceedings of the Algorithms, 2006

2005
On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Facility location with uncertain demand and economies of scale.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
Computer-Aided Complexity Classification of Dial-a-Ride Problems.
INFORMS Journal on Computing, 2004

Polynomial Solvability of Mader's Edge-disjoint Paths Problem.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003
On-line Multi-threaded Scheduling.
J. Scheduling, 2003

A class of on-line scheduling algorithms to minimize total completion time.
Oper. Res. Lett., 2003

Approximation algorithms for the test cover problem.
Math. Program., 2003

Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network.
Discrete Applied Mathematics, 2003

Random walks on the vertices of transportation polytopes with constant number of sources.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Competitive Algorithm for the General 2-Server Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Randomized algorithms for on-line scheduling problems: how low can't you go?
Oper. Res. Lett., 2002

How to cut a cake almost fairly.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

On-Line Dial-a-Ride Problems under a Restricted Information Model.
Proceedings of the Algorithms, 2002

Branch-and-Bound Algorithms for the Test Cover Problem.
Proceedings of the Algorithms, 2002

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
On-line single-server dial-a-ride problems.
Theor. Comput. Sci., 2001

Algorithms for the On-Line Travelling Salesman.
Algorithmica, 2001

News from the Online Traveling Repairman.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Online Bin Coloring.
Proceedings of the Algorithms, 2001

2000
The Online-TSP against Fair Adversaries.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
Towards a model and algorithm management system for vehicle routing and scheduling problems.
Decision Support Systems, 1999

1998
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions.
Math. Program., 1998

Modelling aspects of distributed processingin telecommunication networks.
Annals OR, 1998

1996
An algorithm for the construction of convex hulls in simple integer recourse programming.
Annals OR, 1996

Multiprocessor Scheduling with Rejection.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
On the convex hull of the simple integer recourse objective function.
Annals OR, 1995

Competitive Algorithms for the On-line Traveling Salesman.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994
Serving Requests with On-line Routing.
Proceedings of the Algorithm Theory, 1994

1993
A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length.
Discrete Applied Mathematics, 1993

A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem.
Discrete Applied Mathematics, 1993

1992
Probabilistic analysis of the minimum weighted flowtime scheduling problem.
Oper. Res. Lett., 1992

1991
On rates of convergence and asymptotic normality in the multiknapsack problem.
Math. Program., 1991

1990
A Probabilistic Analysis of the Multiknapsack Value Function.
Math. Program., 1990

1984
Hierarchical vehicle routing problems.
Networks, 1984

A framework for the probabilistic analysis of hierarchical planning systems.
Annals OR, 1984

A hierarchical scheduling problem with a well-solvable second stage.
Annals OR, 1984

1982
A stochastic method for global optimization.
Math. Program., 1982


  Loading...