2009 | ||
---|---|---|
58 | EE | Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti: Data aggregation in sensor networks: Balancing communication and delay costs. Theor. Comput. Sci. 410(14): 1346-1354 (2009) |
2008 | ||
57 | EE | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: The Distributed Wireless Gathering Problem. AAIM 2008: 72-83 |
56 | EE | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: Minimizing Average Flow Time in Sensor Data Gathering. ALGOSENSORS 2008: 18-29 |
55 | EE | Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout: Constructing Level-2 Phylogenetic Networks from Triplets. RECOMB 2008: 450-462 |
54 | EE | Ludovic Cottret, Paulo Vieira Milreu, Vicente Acuña, Alberto Marchetti-Spaccamela, Fábio Viduani Martinez, Marie-France Sagot, Leen Stougie: Enumerating Precursor Sets of Target Metabolites in a Metabolic Network. WABI 2008: 233-244 |
53 | EE | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: Minimizing Flow Time in the Wireless Gathering Problem CoRR abs/0802.2836: (2008) |
52 | EE | Peter Schütz, Leen Stougie, Asgeir Tomasgard: Stochastic facility location with general long-run costs and convex short-run costs. Computers & OR 35(9): 2988-3000 (2008) |
51 | EE | Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie: Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 301-312 (2008) |
50 | EE | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: An approximation algorithm for the wireless gathering problem. Oper. Res. Lett. 36(5): 605-608 (2008) |
49 | EE | Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie: Random walks on the vertices of transportation polytopes with constant number of sources. Random Struct. Algorithms 33(3): 333-355 (2008) |
48 | EE | Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie: Bincoloring. Theor. Comput. Sci. 407(1-3): 231-241 (2008) |
2007 | ||
47 | EE | Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp: Prefix Reversals on Binary and Ternary Strings. AB 2007: 292-306 |
46 | EE | Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti: Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. SIROCCO 2007: 139-150 |
45 | EE | Cor A. J. Hurkens, J. C. M. Keijsper, Leen Stougie: Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. SIAM J. Discrete Math. 21(2): 482-503 (2007) |
44 | EE | Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp: Prefix Reversals on Binary and Ternary Strings. SIAM J. Discrete Math. 21(3): 592-611 (2007) |
2006 | ||
43 | EE | Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti: Latency Constrained Aggregation in Sensor Networks. ESA 2006: 88-99 |
42 | EE | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie: An Approximation Algorithm for the Wireless Gathering Problem. SWAT 2006: 328-338 |
41 | EE | Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie: Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. WABI 2006: 80-91 |
40 | EE | Vincenzo Bonifaci, Leen Stougie: Online k-Server Routing Problems. WAOA 2006: 83-94 |
39 | EE | Graham Brightwell, Jan van den Heuvel, Leen Stougie: A Linear Bound On The Diameter Of The Transportation Polytope. Combinatorica 26(2): 133-139 (2006) |
38 | EE | John v. d. Broek, Peter Schütz, Leen Stougie, Asgeir Tomasgard: Location of slaughterhouses under economies of scale. European Journal of Operational Research 175(2): 740-750 (2006) |
37 | EE | René A. Sitters, Leen Stougie: The generalized two-server problem. J. ACM 53(3): 437-458 (2006) |
36 | EE | Judith Keijsper, Rudi Pendavingh, Leen Stougie: A linear programming formulation of Mader's edge-disjoint paths problem. J. Comb. Theory, Ser. B 96(1): 159-163 (2006) |
35 | EE | Martin E. Dyer, Leen Stougie: Computational complexity of stochastic programming problems. Math. Program. 106(3): 423-432 (2006) |
34 | EE | Willem K. Klein Haneveld, Leen Stougie, Maarten H. van der Vlerk: Simple integer recourse models: convexity and convex approximations. Math. Program. 108(2-3): 435-473 (2006) |
33 | EE | 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]. Theor. Comput. Sci. 352(1-3): 347-348 (2006) |
2005 | ||
32 | EE | Peter Schütz, Leen Stougie, Asgeir Tomasgard: Facility location with uncertain demand and economies of scale. Algorithms for Optimization with Incomplete Information 2005 |
31 | EE | Cor A. J. Hurkens, Judith Keijsper, Leen Stougie: Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. IPCO 2005: 407-421 |
30 | EE | 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. WAOA 2005: 258-269 |
2004 | ||
29 | EE | Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie: On-Line Dial-a-Ride Problems Under a Restricted Information Model. Algorithmica 40(4): 319-329 (2004) |
28 | EE | Leen Stougie: Polynomial solvability of Mader's edge-disjoint paths problem. Electronic Notes in Discrete Mathematics 17: 7 (2004) |
27 | EE | Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie: Computer-Aided Complexity Classification of Dial-a-Ride Problems. INFORMS Journal on Computing 16(2): 120-132 (2004) |
2003 | ||
26 | EE | René Sitters, Leen Stougie, Willem de Paepe: A Competitive Algorithm for the General 2-Server Problem. ICALP 2003: 624-636 |
25 | EE | Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie: Random walks on the vertices of transportation polytopes with constant number of sources. SODA 2003: 330-339 |
24 | EE | Shane Dye, Leen Stougie, Asgeir Tomasgard: Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network. Discrete Applied Mathematics 129(1): 63-81 (2003) |
23 | Esteban Feuerstein, Marcelo Mydlarz, Leen Stougie: On-line Multi-threaded Scheduling. J. Scheduling 6(2): 167-181 (2003) | |
22 | EE | Xiwen Lu, René Sitters, Leen Stougie: A class of on-line scheduling algorithms to minimize total completion time. Oper. Res. Lett. 31(3): 232-236 (2003) |
21 | EE | Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie: News from the online traveling repairman. Theor. Comput. Sci. 295: 279-294 (2003) |
2002 | ||
20 | EE | 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. APPROX 2002: 200-214 |
19 | EE | 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. ESA 2002: 223-233 |
18 | EE | Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie: On-Line Dial-a-Ride Problems under a Restricted Information Model. ESA 2002: 674-685 |
17 | EE | 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. SODA 2002: 263-264 |
16 | EE | Leen Stougie, Arjen P. A. Vestjens: Randomized algorithms for on-line scheduling problems: how low can't you go? Oper. Res. Lett. 30(2): 89-96 (2002) |
2001 | ||
15 | EE | Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie: Online Bin Coloring. ESA 2001: 74-85 |
14 | EE | Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie: News from the Online Traveling Repairman. MFCS 2001: 487-499 |
13 | EE | Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo: Algorithms for the On-Line Travelling Salesman. Algorithmica 29(4): 560-581 (2001) |
12 | EE | Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie: The Online TSP Against Fair Adversaries. INFORMS Journal on Computing 13(2): 138-148 (2001) |
11 | EE | Esteban Feuerstein, Leen Stougie: On-line single-server dial-a-ride problems. Theor. Comput. Sci. 268(1): 91-105 (2001) |
2000 | ||
10 | EE | Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie: The Online-TSP against Fair Adversaries. CIAC 2000: 137-149 |
9 | EE | Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SIAM J. Discrete Math. 13(1): 64-78 (2000) |
1998 | ||
8 | 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. Math. Program. 83: 229-252 (1998) | |
1996 | ||
7 | Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie: Multiprocessor Scheduling with Rejection. SODA 1996: 95-103 | |
1995 | ||
6 | Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo: Competitive Algorithms for the On-line Traveling Salesman. WADS 1995: 206-217 | |
1994 | ||
5 | Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo: Serving Requests with On-line Routing. SWAT 1994: 37-48 | |
1993 | ||
4 | EE | A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis: A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem. Discrete Applied Mathematics 42(2): 279-290 (1993) |
3 | EE | Leen Stougie: A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length. Discrete Applied Mathematics 42(2): 291-303 (1993) |
1991 | ||
2 | Sara van de Geer, Leen Stougie: On rates of convergence and asymptotic normality in the multiknapsack problem. Math. Program. 51: 349-358 (1991) | |
1990 | ||
1 | M. Meanti, A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis: A Probabilistic Analysis of the Multiknapsack Value Function. Math. Program. 46: 237-247 (1990) |