| 2009 | ||
|---|---|---|
| 66 | Evripidis Bampis, Martin Skutella: Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers Springer 2009 | |
| 65 | Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese: Real-Time Message Routing and Scheduling. APPROX-RANDOM 2009: 217-230 | |
| 64 | José R. Correa, Martin Skutella, José Verschae: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. APPROX-RANDOM 2009: 84-97 | |
| 63 | Ekkehard Köhler, Rolf H. Möhring, Martin Skutella: Traffic Networks and Flows over Time. Algorithmics of Large and Complex Networks 2009: 166-196 | |
| 62 | Ronald Koch, Martin Skutella: Nash Equilibria and the Price of Anarchy for Flows over Time. SAGT 2009: 323-334 | |
| 61 | Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu: Multiline Addressing by Network Flow. Algorithmica 53(4): 583-596 (2009) | |
| 60 | Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. Math. Oper. Res. 34(2): 481-498 (2009) | |
| 59 | Nadine Baumann, Martin Skutella: Earliest Arrival Flows with Multiple Sources. Math. Oper. Res. 34(2): 499-512 (2009) | |
| 58 | Fernanda Salazar, Martin Skutella: Single-source k-splittable min-cost flows. Oper. Res. Lett. 37(2): 71-74 (2009) | |
| 2008 | ||
| 57 | Christos Kaklamanis, Martin Skutella: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers Springer 2008 | |
| 56 | Maren Martens, Martin Skutella: Flows with Unit Path Capacities and Related Packing and Covering Problems. COCOA 2008: 180-189 | |
| 55 | Frank Neumann, Joachim Reichel, Martin Skutella: Computing minimum cuts by randomized search heuristics. GECCO 2008: 779-786 | |
| 54 | Katharina Skutella, Martin Skutella: Minimale aufspannende Bäume (Wenn das Naheliegende das Beste ist... ). Taschenbuch der Algorithmen 2008: 353-360 | |
| 53 | Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella: A short proof of the VPN Tree Routing Conjecture on ring networks. Oper. Res. Lett. 36(3): 361-365 (2008) | |
| 52 | Ronald Koch, Martin Skutella, Ines Spenke: Maximum k -Splittable s , t -Flows. Theory Comput. Syst. 43(1): 56-66 (2008) | |
| 2007 | ||
| 51 | Maren Martens, Fernanda Salazar, Martin Skutella: Convex Combinations of Single Source Unsplittable Flows. ESA 2007: 395-406 | |
| 50 | Joachim Reichel, Martin Skutella: Evolutionary algorithms and matroid optimization problems. GECCO 2007: 947-954 | |
| 49 | Alexander Hall, Katharina Langkau, Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica 47(3): 299-321 (2007) | |
| 48 | Lisa Fleischer, Martin Skutella: Quickest Flows Over Time. SIAM J. Comput. 36(6): 1600-1630 (2007) | |
| 47 | Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007) | |
| 46 | Alexander Hall, Steffen Hippler, Martin Skutella: Multicommodity flows over time: Efficient algorithms and complexity. Theor. Comput. Sci. 379(3): 387-404 (2007) | |
| 2006 | ||
| 45 | Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu: Multiline Addressing by Network Flow. ESA 2006: 744-755 | |
| 44 | Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti: Latency Constrained Aggregation in Sensor Networks. ESA 2006: 88-99 | |
| 43 | Nadine Baumann, Martin Skutella: Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources. FOCS 2006: 399-410 | |
| 42 | Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella: Length-Bounded Cuts and Flows. ICALP (1) 2006: 679-690 | |
| 41 | Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella: The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. Algorithmica 46(2): 193-221 (2006) | |
| 40 | Maren Martens, Martin Skutella: Flows on few paths: Algorithms and lower bounds. Networks 48(2): 68-76 (2006) | |
| 2005 | ||
| 39 | Nadine Baumann, Martin Skutella: Computing earliest arrival flows with multiple sources. Algorithmic Aspects of Large and Complex Networks 2005 | |
| 38 | Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. Algorithms for Optimization with Incomplete Information 2005 | |
| 37 | Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162 | |
| 36 | Maren Martens, Martin Skutella: Length-Bounded and Dynamic k-Splittable Flows. OR 2005: 297-302 | |
| 35 | Ronald Koch, Martin Skutella, Ines Spenke: Approximation and Complexity of k-Splittable Flows. WAOA 2005: 244-257 | |
| 34 | Georg Baier, Ekkehard Köhler, Martin Skutella: The k-Splittable Flow Problem. Algorithmica 42(3-4): 231-248 (2005) | |
| 33 | Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella: Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005) | |
| 32 | Martin Skutella, Marc Uetz: Stochastic Machine Scheduling with Precedence Constraints. SIAM J. Comput. 34(4): 788-802 (2005) | |
| 2004 | ||
| 31 | Maren Martens, Martin Skutella: Flows on Few Paths: Algorithms and Lower Bounds. ESA 2004: 520-531 | |
| 30 | Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. ICALP 2004: 1111-1122 | |
| 29 | Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella: The Freeze-Tag Problem: How to Wake Up a Swarm of Robots CoRR cs.DS/0402045: (2004) | |
| 28 | Michel X. Goemans, Martin Skutella: Cooperative facility location games. J. Algorithms 50(2): 194-214 (2004) | |
| 27 | Rolf H. Möhring, Martin Skutella, Frederik Stork: Scheduling with AND/OR Precedence Constraints. SIAM J. Comput. 33(2): 393-415 (2004) | |
| 2003 | ||
| 26 | Alexander Hall, Steffen Hippler, Martin Skutella: Multicommodity Flows over Time: Efficient Algorithms and Complexity. ICALP 2003: 397-409 | |
| 25 | Alexander Hall, Katharina Langkau, Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. RANDOM-APPROX 2003: 71-82 | |
| 24 | Lisa Fleischer, Martin Skutella: Minimum cost flows over time without intermediate storage. SODA 2003: 66-75 | |
| 23 | Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger: The complexity of economic equilibria for house allocation markets. Inf. Process. Lett. 88(5): 219-223 (2003) | |
| 2002 | ||
| 22 | Georg Baier, Ekkehard Köhler, Martin Skutella: On the k-Splittable Flow Problem. ESA 2002: 101-113 | |
| 21 | Ekkehard Köhler, Katharina Langkau, Martin Skutella: Time-Expanded Graphs for Flow-Dependent Transit Times. ESA 2002: 599-611 | |
| 20 | Lisa Fleischer, Martin Skutella: The Quickest Multicommodity Flow Problem. IPCO 2002: 36-53 | |
| 19 | Ekkehard Köhler, Martin Skutella: Flows over time with load-dependent transit times. SODA 2002: 174-183 | |
| 18 | Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella: The freeze-tag problem: how to wake up a swarm of robots. SODA 2002: 568-577 | |
| 17 | Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang: Single Machine Scheduling with Release Dates. SIAM J. Discrete Math. 15(2): 165-192 (2002) | |
| 16 | Andreas S. Schulz, Martin Skutella: Scheduling Unrelated Machines by Randomized Rounding. SIAM J. Discrete Math. 15(4): 450-469 (2002) | |
| 2001 | ||
| 15 | Martin Skutella, Marc Uetz: Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. SODA 2001: 589-590 | |
| 14 | Martin Skutella: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2): 206-242 (2001) | |
| 2000 | ||
| 13 | Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger: Preemptive Scheduling with Rejection. ESA 2000: 268-277 | |
| 12 | Martin Skutella: Approximating the single source unsplittable min-cost flow problem. FOCS 2000: 136-145 | |
| 11 | Rolf H. Möhring, Martin Skutella, Frederik Stork: Forcing relations for AND/OR precedence constraints. SODA 2000: 235-236 | |
| 10 | Michel X. Goemans, Martin Skutella: Cooperative facility location games. SODA 2000: 76-85 | |
| 9 | Martin Skutella, Gerhard J. Woeginger: A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines. Math. Oper. Res. 25(1): 63-75 (2000) | |
| 1999 | ||
| 8 | Martin Skutella: Convex Quadratic Programming Relaxations for Network Scheduling Problems. ESA 1999: 127-138 | |
| 7 | Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44 | |
| 6 | Martin Skutella, Gerhard J. Woeginger: A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. STOC 1999: 400-407 | |
| 1998 | ||
| 5 | Martin Skutella: Semidefinite Relaxations for Parallel Machine Scheduling. FOCS 1998: 472-481 | |
| 1997 | ||
| 4 | Andreas S. Schulz, Martin Skutella: Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. ESA 1997: 416-429 | |
| 3 | Clemens Gröpl, Martin Skutella: Parallel Repetition of MIP(2, 1) Systems. Lectures on Proof Verification and Approximation Algorithms 1997: 161-178 | |
| 2 | Andreas S. Schulz, Martin Skutella: Random-Based Scheduling: New Approximations and LP Lower Bounds. RANDOM 1997: 119-133 | |
| 1 | Martin Skutella: Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. SODA 1997: 501-508 | |