Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Martin Skutella
2010 – today
- 2013
[c54]Martin Skutella: Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines. SEA 2013: 1-3- 2012
- [j39]José R. Correa, Martin Skutella, José Verschae: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. Math. Oper. Res. 37(2): 379-398 (2012)
- [j38]Michael Hintermüller, Martin Skutella: Special issue of the ISMP 2012 in Berlin. Math. Program. 134(1): 1-3 (2012)
- [j37]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie: Universal Sequencing on an Unreliable Machine. SIAM J. Comput. 41(3): 565-586 (2012)
- [c53]Sandro Bosio, Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis, Martin Skutella: Flows over Time with Negative Transit Times and Arc Release Dates. CTW 2012: 30-33
- [c52]Martin Groß, Martin Skutella: Maximum Multicommodity Flows over Time without Intermediate Storage. ESA 2012: 539-550
- [c51]Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese: The Power of Recourse for Online MST and TSP. ICALP (1) 2012: 689-700
- 2011
- [j36]Frank Neumann, Joachim Reichel, Martin Skutella: Computing Minimum Cuts by Randomized Search Heuristics. Algorithmica 59(3): 323-342 (2011)
- [j35]Friedrich Eisenbrand, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese: Real-time Avionics Optimization. it - Information Technology 53(6): 274-279 (2011)
- [j34]Ronald Koch, Ebrahim Nasrabadi, Martin Skutella: Continuous and discrete flows over time - A general model based on measure theory. Math. Meth. of OR 73(3): 301-337 (2011)
- [j33]Ronald Koch, Martin Skutella: Nash Equilibria and the Price of Anarchy for Flows over Time. Theory Comput. Syst. 49(1): 71-97 (2011)
- [j32]Martin Skutella, David P. Williamson: A note on the generalized min-sum set cover problem. Oper. Res. Lett. 39(6): 433-436 (2011)
- [j31]
- [p2]Katharina Skutella, Martin Skutella: Minimum Spanning Trees - Sometimes Greed Pays Off. Algorithms Unplugged 2011: 325-331
- [c50]
- [i2]Martin Skutella, David P. Williamson: A note on the generalized min-sum set cover problem. CoRR abs/1107.2033 (2011)
- 2010
- [j30]Joachim Reichel, Martin Skutella: Evolutionary Algorithms and Matroid Optimization Problems. Algorithmica 57(1): 187-206 (2010)
- [j29]Melanie Schmidt, Martin Skutella: Earliest Arrival Flows in Networks with Multiple Sinks. Electronic Notes in Discrete Mathematics 36: 607-614 (2010)
- [j28]Martin Skutella, Alexia Weber: On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency. Math. Program. 124(1-2): 441-454 (2010)
- [j27]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella: Length-bounded cuts and flows. ACM Transactions on Algorithms 7(1): 4 (2010)
- [c49]Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese: Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. ESA (1) 2010: 11-22
- [c48]
- [c47]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese: Scheduling Periodic Tasks in a Hard Real-Time Environment. ICALP (1) 2010: 299-311
- [c46]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie: Universal Sequencing on a Single Machine. IPCO 2010: 230-243
- [c45]
- [c44]Daniel Dressler, Martin Skutella: An FPTAS for Flows over Time with Aggregate Arc Capacities. WAOA 2010: 106-117
2000 – 2009
- 2009
- [j26]Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu: Multiline Addressing by Network Flow. Algorithmica 53(4): 583-596 (2009)
- [j25]Maren Martens, Martin Skutella: Flows with unit path capacities and related packing and covering problems. J. Comb. Optim. 18(3): 272-293 (2009)
- [j24]Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. Math. Oper. Res. 34(2): 481-498 (2009)
- [j23]Nadine Baumann, Martin Skutella: Earliest Arrival Flows with Multiple Sources. Math. Oper. Res. 34(2): 499-512 (2009)
- [j22]Fernanda Salazar, Martin Skutella: Single-source k-splittable min-cost flows. Oper. Res. Lett. 37(2): 71-74 (2009)
- [j21]Luca Becchetti, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Peter Korteweg, Martin Skutella, Leen Stougie: Latency-constrained aggregation in sensor networks. ACM Transactions on Algorithms 6(1) (2009)
- [c43]José R. Correa, Martin Skutella, José Verschae: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. APPROX-RANDOM 2009: 84-97
- [c42]Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese: Real-Time Message Routing and Scheduling. APPROX-RANDOM 2009: 217-230
- [c41]Ekkehard Köhler, Rolf H. Möhring, Martin Skutella: Traffic Networks and Flows over Time. Algorithmics of Large and Complex Networks 2009: 166-196
- [c40]Joachim Reichel, Martin Skutella: On the size of weights in randomized search heuristics. FOGA 2009: 21-28
- [c39]Ronald Koch, Martin Skutella: Nash Equilibria and the Price of Anarchy for Flows over Time. SAGT 2009: 323-334
- [c38]Britta Peis, Martin Skutella, Andreas Wiese: Packet Routing: Complexity and Algorithms. WAOA 2009: 217-228
- [e2]Evripidis Bampis, Martin Skutella (Eds.): Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers. Lecture Notes in Computer Science 5426, Springer 2009, ISBN 978-3-540-93979-5
- 2008
- [j20]Ronald Koch, Martin Skutella, Ines Spenke: Maximum k -Splittable s , t -Flows. Theory Comput. Syst. 43(1): 56-66 (2008)
- [j19]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)
- [c37]Martin Skutella: An Introduction to Network Flows over Time. Bonn Workshop of Combinatorial Optimization 2008: 451-482
- [c36]Maren Martens, Martin Skutella: Flows with Unit Path Capacities and Related Packing and Covering Problems. COCOA 2008: 180-189
- [c35]Frank Neumann, Joachim Reichel, Martin Skutella: Computing minimum cuts by randomized search heuristics. GECCO 2008: 779-786
- [p1]Katharina Skutella, Martin Skutella: Minimale aufspannende Bäume (Wenn das Naheliegende das Beste ist... ). Taschenbuch der Algorithmen 2008: 353-360
- [e1]Christos Kaklamanis, Martin Skutella (Eds.): Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers. Lecture Notes in Computer Science 4927, Springer 2008, ISBN 978-3-540-77917-9
- 2007
- [j18]Alexander Hall, Katharina Langkau, Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica 47(3): 299-321 (2007)
- [j17]
- [j16]Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007)
- [j15]Alexander Hall, Steffen Hippler, Martin Skutella: Multicommodity flows over time: Efficient algorithms and complexity. Theor. Comput. Sci. 379(3): 387-404 (2007)
- [c34]Maren Martens, Fernanda Salazar, Martin Skutella: Convex Combinations of Single Source Unsplittable Flows. ESA 2007: 395-406
- [c33]Joachim Reichel, Martin Skutella: Evolutionary algorithms and matroid optimization problems. GECCO 2007: 947-954
- 2006
- [j14]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)
- [j13]Maren Martens, Martin Skutella: Flows on few paths: Algorithms and lower bounds. Networks 48(2): 68-76 (2006)
- [c32]Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti: Latency Constrained Aggregation in Sensor Networks. ESA 2006: 88-99
- [c31]Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu: Multiline Addressing by Network Flow. ESA 2006: 744-755
- [c30]Nadine Baumann, Martin Skutella: Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources. FOCS 2006: 399-410
- [c29]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella: Length-Bounded Cuts and Flows. ICALP (1) 2006: 679-690
- 2005
- [j12]Georg Baier, Ekkehard Köhler, Martin Skutella: The k-Splittable Flow Problem. Algorithmica 42(3-4): 231-248 (2005)
- [j11]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)
- [j10]Martin Skutella, Marc Uetz: Stochastic Machine Scheduling with Precedence Constraints. SIAM J. Comput. 34(4): 788-802 (2005)
- [j9]Ekkehard Köhler, Martin Skutella: Flows over Time with Load-Dependent Transit Times. SIAM Journal on Optimization 15(4): 1185-1202 (2005)
- [c28]Nadine Baumann, Martin Skutella: Computing earliest arrival flows with multiple sources. Algorithmic Aspects of Large and Complex Networks 2005
- [c27]Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. Algorithms for Optimization with Incomplete Information 2005
- [c26]Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162
- [c25]
- [c24]Ronald Koch, Martin Skutella, Ines Spenke: Approximation and Complexity of k-Splittable Flows. WAOA 2005: 244-257
- 2004
- [j8]Michel X. Goemans, Martin Skutella: Cooperative facility location games. J. Algorithms 50(2): 194-214 (2004)
- [j7]Rolf H. Möhring, Martin Skutella, Frederik Stork: Scheduling with AND/OR Precedence Constraints. SIAM J. Comput. 33(2): 393-415 (2004)
- [c23]
- [c22]Peter Sanders, Naveen Sivadasan, Martin Skutella: Online Scheduling with Bounded Migration. ICALP 2004: 1111-1122
- [i1]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)
- 2003
- [j6]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)
- [j5]Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger: Preemptive scheduling with rejection. Math. Program. 94(2-3): 361-374 (2003)
- [c21]Alexander Hall, Steffen Hippler, Martin Skutella: Multicommodity Flows over Time: Efficient Algorithms and Complexity. ICALP 2003: 397-409
- [c20]Alexander Hall, Katharina Langkau, Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. RANDOM-APPROX 2003: 71-82
- [c19]Lisa Fleischer, Martin Skutella: Minimum cost flows over time without intermediate storage. SODA 2003: 66-75
- 2002
- [j4]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)
- [j3]Andreas S. Schulz, Martin Skutella: Scheduling Unrelated Machines by Randomized Rounding. SIAM J. Discrete Math. 15(4): 450-469 (2002)
- [c18]
- [c17]Ekkehard Köhler, Katharina Langkau, Martin Skutella: Time-Expanded Graphs for Flow-Dependent Transit Times. ESA 2002: 599-611
- [c16]
- [c15]Ekkehard Köhler, Martin Skutella: Flows over time with load-dependent transit times. SODA 2002: 174-183
- [c14]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
- 2001
- [j2]Martin Skutella: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2): 206-242 (2001)
- [c13]
- 2000
- [j1]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)
- [c12]Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger: Preemptive Scheduling with Rejection. ESA 2000: 268-277
- [c11]Martin Skutella: Approximating the single source unsplittable min-cost flow problem. FOCS 2000: 136-145
- [c10]
- [c9]Rolf H. Möhring, Martin Skutella, Frederik Stork: Forcing relations for AND/OR precedence constraints. SODA 2000: 235-236
1990 – 1999
- 1999
- [c8]Martin Skutella: Convex Quadratic Programming Relaxations for Network Scheduling Problems. ESA 1999: 127-138
- [c7]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
- [c6]Martin Skutella, Gerhard J. Woeginger: A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. STOC 1999: 400-407
- 1998
- [c5]
- 1997
- [c4]Clemens Gröpl, Martin Skutella: Parallel Repetition of MIP(2, 1) Systems. Lectures on Proof Verification and Approximation Algorithms 1997: 161-178
- [c3]Andreas S. Schulz, Martin Skutella: Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. ESA 1997: 416-429
- [c2]Andreas S. Schulz, Martin Skutella: Random-Based Scheduling: New Approximations and LP Lower Bounds. RANDOM 1997: 119-133
- [c1]Martin Skutella: Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. SODA 1997: 501-508
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:18 CEST by the dblp team