Search the dblp DataBase
Leen Stougie :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Sven Oliver Krumke , Luigi Laura , Maarten Lipmann , Alberto Marchetti-Spaccamela , Willem de Paepe , Diana Poensgen , Leen Stougie Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP ] APPROX, 2002, pp:200-214 [Conf ] Michiel Blom , Sven Oliver Krumke , Willem de Paepe , Leen Stougie The Online-TSP against Fair Adversaries. [Citation Graph (0, 0)][DBLP ] CIAC, 2000, pp:137-149 [Conf ] Peter Schütz , Leen Stougie , Asgeir Tomasgard Facility location with uncertain demand and economies of scale. [Citation Graph (0, 0)][DBLP ] Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf ] Luca Becchetti , Peter Korteweg , Alberto Marchetti-Spaccamela , Martin Skutella , Leen Stougie , Andrea Vitaletti Latency Constrained Aggregation in Sensor Networks. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:88-99 [Conf ] Koen M. J. De Bontridder , B. J. Lageweg , Jan Karel Lenstra , James B. Orlin , Leen Stougie Branch-and-Bound Algorithms for the Test Cover Problem. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:223-233 [Conf ] Sven Oliver Krumke , Willem de Paepe , Jörg Rambau , Leen Stougie Online Bin Coloring. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:74-85 [Conf ] Maarten Lipmann , Xiwen Lu , Willem de Paepe , René Sitters , Leen Stougie On-Line Dial-a-Ride Problems under a Restricted Information Model. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:674-685 [Conf ] René Sitters , Leen Stougie , Willem de Paepe A Competitive Algorithm for the General 2-Server Problem. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:624-636 [Conf ] Cor A. J. Hurkens , Judith Keijsper , Leen Stougie Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:407-421 [Conf ] Sven Oliver Krumke , Willem de Paepe , Diana Poensgen , Leen Stougie News from the Online Traveling Repairman. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:487-499 [Conf ] Yair Bartal , Stefano Leonardi , Alberto Marchetti-Spaccamela , Jiri Sgall , Leen Stougie Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP ] SODA, 1996, pp:95-103 [Conf ] Mary Cryan , Martin E. Dyer , Haiko Müller , Leen Stougie Random walks on the vertices of transportation polytopes with constant number of sources. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:330-339 [Conf ] Sven Oliver Krumke , Maarten Lipmann , Willem de Paepe , Diana Poensgen , Jörg Rambau , Leen Stougie , Gerhard J. Woeginger How to cut a cake almost fairly. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:263-264 [Conf ] Vincenzo Bonifaci , Peter Korteweg , Alberto Marchetti-Spaccamela , Leen Stougie An Approximation Algorithm for the Wireless Gathering Problem. [Citation Graph (0, 0)][DBLP ] SWAT, 2006, pp:328-338 [Conf ] Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi , Leen Stougie , Maurizio Talamo Serving Requests with On-line Routing. [Citation Graph (0, 0)][DBLP ] SWAT, 1994, pp:37-48 [Conf ] Leo van Iersel , Judith Keijsper , Steven Kelk , Leen Stougie Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. [Citation Graph (0, 0)][DBLP ] WABI, 2006, pp:80-91 [Conf ] Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi , Leen Stougie , Maurizio Talamo Competitive Algorithms for the On-line Traveling Salesman. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:206-217 [Conf ] Sven Oliver Krumke , Willem de Paepe , Diana Poensgen , Maarten Lipmann , Alberto Marchetti-Spaccamela , Leen Stougie On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. [Citation Graph (0, 0)][DBLP ] WAOA, 2005, pp:258-269 [Conf ] Vincenzo Bonifaci , Leen Stougie Online k -Server Routing Problems. [Citation Graph (0, 0)][DBLP ] WAOA, 2006, pp:83-94 [Conf ] Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi , Leen Stougie , Maurizio Talamo Algorithms for the On-Line Travelling Salesman. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:29, n:4, pp:560-581 [Journal ] Maarten Lipmann , Xiwen Lu , Willem de Paepe , René Sitters , Leen Stougie On-Line Dial-a-Ride Problems Under a Restricted Information Model. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2004, v:40, n:4, pp:319-329 [Journal ] Graham Brightwell , Jan van den Heuvel , Leen Stougie A Linear Bound On The Diameter Of The Transportation Polytope. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2006, v:26, n:2, pp:133-139 [Journal ] Shane Dye , Leen Stougie , Asgeir Tomasgard Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:129, n:1, pp:63-81 [Journal ] A. H. G. Rinnooy Kan , Leen Stougie , Carlo Vercellis A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:42, n:2, pp:279-290 [Journal ] Leen Stougie A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:42, n:2, pp:291-303 [Journal ] Michiel Blom , Sven Oliver Krumke , Willem de Paepe , Leen Stougie The Online TSP Against Fair Adversaries. [Citation Graph (0, 0)][DBLP ] INFORMS Journal on Computing, 2001, v:13, n:2, pp:138-148 [Journal ] Willem de Paepe , Jan Karel Lenstra , Jiri Sgall , René A. Sitters , Leen Stougie Computer-Aided Complexity Classification of Dial-a-Ride Problems. [Citation Graph (0, 0)][DBLP ] INFORMS Journal on Computing, 2004, v:16, n:2, pp:120-132 [Journal ] René A. Sitters , Leen Stougie The generalized two-server problem. [Citation Graph (0, 0)][DBLP ] J. ACM, 2006, v:53, n:3, pp:437-458 [Journal ] Judith Keijsper , Rudi Pendavingh , Leen Stougie A linear programming formulation of Mader's edge-disjoint paths problem. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2006, v:96, n:1, pp:159-163 [Journal ] Martin E. Dyer , Leen Stougie Computational complexity of stochastic programming problems. [Citation Graph (0, 0)][DBLP ] Math. Program., 2006, v:106, n:3, pp:423-432 [Journal ] Sara van de Geer , Leen Stougie On rates of convergence and asymptotic normality in the multiknapsack problem. [Citation Graph (0, 0)][DBLP ] Math. Program., 1991, v:51, n:, pp:349-358 [Journal ] Willem K. Klein Haneveld , Leen Stougie , Maarten H. van der Vlerk Simple integer recourse models: convexity and convex approximations. [Citation Graph (0, 0)][DBLP ] Math. Program., 2006, v:108, n:2-3, pp:435-473 [Journal ] M. Meanti , A. H. G. Rinnooy Kan , Leen Stougie , Carlo Vercellis A Probabilistic Analysis of the Multiknapsack Value Function. [Citation Graph (0, 0)][DBLP ] Math. Program., 1990, v:46, n:, pp:237-247 [Journal ] Rüdiger Schultz , Leen Stougie , Maarten H. van der Vlerk Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:229-252 [Journal ] Xiwen Lu , René Sitters , Leen Stougie A class of on-line scheduling algorithms to minimize total completion time. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2003, v:31, n:3, pp:232-236 [Journal ] Leen Stougie , Arjen P. A. Vestjens Randomized algorithms for on-line scheduling problems: how low can't you go? [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2002, v:30, n:2, pp:89-96 [Journal ] Esteban Feuerstein , Marcelo Mydlarz , Leen Stougie On-line Multi-threaded Scheduling. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2003, v:6, n:2, pp:167-181 [Journal ] Yair Bartal , Stefano Leonardi , Alberto Marchetti-Spaccamela , Jiri Sgall , Leen Stougie Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2000, v:13, n:1, pp:64-78 [Journal ] Esteban Feuerstein , Leen Stougie On-line single-server dial-a-ride problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:268, n:1, pp:91-105 [Journal ] Sven Oliver Krumke , Willem de Paepe , Diana Poensgen , Leen Stougie News from the online traveling repairman. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:, pp:279-294 [Journal ] Sven Oliver Krumke , Willem de Paepe , Diana Poensgen , Leen Stougie Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294]. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:347-348 [Journal ] John v. d. Broek , Peter Schütz , Leen Stougie , Asgeir Tomasgard Location of slaughterhouses under economies of scale. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2006, v:175, n:2, pp:740-750 [Journal ] Peter Korteweg , Alberto Marchetti-Spaccamela , Leen Stougie , Andrea Vitaletti Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2007, pp:139-150 [Conf ] Cor A. J. Hurkens , Leo van Iersel , Judith Keijsper , Steven Kelk , Leen Stougie , John Tromp Prefix Reversals on Binary and Ternary Strings. [Citation Graph (0, 0)][DBLP ] AB, 2007, pp:292-306 [Conf ] The Distributed Wireless Gathering Problem. [Citation Graph (, )][DBLP ] Minimizing Average Flow Time in Sensor Data Gathering. [Citation Graph (, )][DBLP ] Mixed-criticality Scheduling: Improved Resource-augmentation Results. [Citation Graph (, )][DBLP ] Universal Sequencing on a Single Machine. [Citation Graph (, )][DBLP ] Scheduling Real-Time Mixed-Criticality Jobs. [Citation Graph (, )][DBLP ] Constructing Level-2 Phylogenetic Networks from Triplets. [Citation Graph (, )][DBLP ] Towards the Design of Certifiable Mixed-criticality Systems. [Citation Graph (, )][DBLP ] Enumerating Precursor Sets of Target Metabolites in a Metabolic Network. [Citation Graph (, )][DBLP ] Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. [Citation Graph (, )][DBLP ] Stochastic facility location with general long-run costs and convex short-run costs. [Citation Graph (, )][DBLP ] Minimizing Flow Time in the Wireless Gathering Problem [Citation Graph (, )][DBLP ] Search in 0.043secs, Finished in 0.045secs