The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Martin Skutella: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nadine Baumann, Martin Skutella
    Computing earliest arrival flows with multiple sources. [Citation Graph (0, 0)][DBLP]
    Algorithmic Aspects of Large and Complex Networks, 2005, pp:- [Conf]
  2. Clemens Gröpl, Martin Skutella
    Parallel Repetition of MIP(2, 1) Systems. [Citation Graph (0, 0)][DBLP]
    Lectures on Proof Verification and Approximation Algorithms, 1997, pp:161-178 [Conf]
  3. Peter Sanders, Naveen Sivadasan, Martin Skutella
    Online Scheduling with Bounded Migration. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  4. Georg Baier, Ekkehard Köhler, Martin Skutella
    On the k-Splittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:101-113 [Conf]
  5. 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]
  6. Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu
    Multiline Addressing by Network Flow. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:744-755 [Conf]
  7. Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
    Preemptive Scheduling with Rejection. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:268-277 [Conf]
  8. Ekkehard Köhler, Katharina Langkau, Martin Skutella
    Time-Expanded Graphs for Flow-Dependent Transit Times. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:599-611 [Conf]
  9. Maren Martens, Martin Skutella
    Flows on Few Paths: Algorithms and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:520-531 [Conf]
  10. Andreas S. Schulz, Martin Skutella
    Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:416-429 [Conf]
  11. Martin Skutella
    Convex Quadratic Programming Relaxations for Network Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:127-138 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:32-44 [Conf]
  13. Martin Skutella
    Approximating the single source unsplittable min-cost flow problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:136-145 [Conf]
  14. Martin Skutella
    Semidefinite Relaxations for Parallel Machine Scheduling. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:472-481 [Conf]
  15. Nadine Baumann, Martin Skutella
    Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:399-410 [Conf]
  16. Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella
    Length-Bounded Cuts and Flows. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:679-690 [Conf]
  17. Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
    New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1151-1162 [Conf]
  18. Alexander Hall, Steffen Hippler, Martin Skutella
    Multicommodity Flows over Time: Efficient Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:397-409 [Conf]
  19. Peter Sanders, Naveen Sivadasan, Martin Skutella
    Online Scheduling with Bounded Migration. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1111-1122 [Conf]
  20. Lisa Fleischer, Martin Skutella
    The Quickest Multicommodity Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:36-53 [Conf]
  21. Alexander Hall, Katharina Langkau, Martin Skutella
    An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:71-82 [Conf]
  22. Andreas S. Schulz, Martin Skutella
    Random-Based Scheduling: New Approximations and LP Lower Bounds. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:119-133 [Conf]
  23. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:568-577 [Conf]
  24. Lisa Fleischer, Martin Skutella
    Minimum cost flows over time without intermediate storage. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:66-75 [Conf]
  25. Michel X. Goemans, Martin Skutella
    Cooperative facility location games. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:76-85 [Conf]
  26. Ekkehard Köhler, Martin Skutella
    Flows over time with load-dependent transit times. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:174-183 [Conf]
  27. Rolf H. Möhring, Martin Skutella, Frederik Stork
    Forcing relations for AND/OR precedence constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:235-236 [Conf]
  28. Martin Skutella
    Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:501-508 [Conf]
  29. Martin Skutella, Marc Uetz
    Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:589-590 [Conf]
  30. Martin Skutella, Gerhard J. Woeginger
    A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:400-407 [Conf]
  31. Ronald Koch, Martin Skutella, Ines Spenke
    Approximation and Complexity of k-Splittable Flows. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:244-257 [Conf]
  32. Georg Baier, Ekkehard Köhler, Martin Skutella
    The k-Splittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:231-248 [Journal]
  33. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:2, pp:193-221 [Journal]
  34. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  35. Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger
    The complexity of economic equilibria for house allocation markets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:5, pp:219-223 [Journal]
  36. Martin Skutella
    Convex quadratic and semidefinite programming relaxations in scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:2, pp:206-242 [Journal]
  37. Michel X. Goemans, Martin Skutella
    Cooperative facility location games. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:2, pp:194-214 [Journal]
  38. Martin Skutella, Gerhard J. Woeginger
    A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:1, pp:63-75 [Journal]
  39. Maren Martens, Martin Skutella
    Flows on few paths: Algorithms and lower bounds. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:2, pp:68-76 [Journal]
  40. Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella
    Approximating k-hop minimum-spanning trees. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:115-120 [Journal]
  41. Rolf H. Möhring, Martin Skutella, Frederik Stork
    Scheduling with AND/OR Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:393-415 [Journal]
  42. Martin Skutella, Marc Uetz
    Stochastic Machine Scheduling with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:788-802 [Journal]
  43. Lisa Fleischer, Martin Skutella
    Quickest Flows Over Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1600-1630 [Journal]
  44. Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang
    Single Machine Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:165-192 [Journal]
  45. Andreas S. Schulz, Martin Skutella
    Scheduling Unrelated Machines by Randomized Rounding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:450-469 [Journal]
  46. Maren Martens, Fernanda Salazar, Martin Skutella
    Convex Combinations of Single Source Unsplittable Flows. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:395-406 [Conf]
  47. Joachim Reichel, Martin Skutella
    Evolutionary algorithms and matroid optimization problems. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:947-954 [Conf]
  48. Alexander Hall, Katharina Langkau, Martin Skutella
    An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:299-321 [Journal]
  49. Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
    New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:706-721 [Journal]
  50. Alexander Hall, Steffen Hippler, Martin Skutella
    Multicommodity flows over time: Efficient algorithms and complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:387-404 [Journal]

  51. Real-Time Message Routing and Scheduling. [Citation Graph (, )][DBLP]


  52. The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. [Citation Graph (, )][DBLP]


  53. Traffic Networks and Flows over Time. [Citation Graph (, )][DBLP]


  54. Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. [Citation Graph (, )][DBLP]


  55. A Robust PTAS for Machine Covering and Packing. [Citation Graph (, )][DBLP]


  56. Computing minimum cuts by randomized search heuristics. [Citation Graph (, )][DBLP]


  57. Scheduling Periodic Tasks in a Hard Real-Time Environment. [Citation Graph (, )][DBLP]


  58. Universal Sequencing on a Single Machine. [Citation Graph (, )][DBLP]


  59. Packet Routing on the Grid. [Citation Graph (, )][DBLP]


  60. Packet Routing: Complexity and Algorithms. [Citation Graph (, )][DBLP]


  61. Flows with Unit Path Capacities and Related Packing and Covering Problems. [Citation Graph (, )][DBLP]


  62. Nash Equilibria and the Price of Anarchy for Flows over Time. [Citation Graph (, )][DBLP]


  63. Length-Bounded and Dynamic k-Splittable Flows. [Citation Graph (, )][DBLP]


  64. Multiline Addressing by Network Flow. [Citation Graph (, )][DBLP]


  65. Evolutionary Algorithms and Matroid Optimization Problems. [Citation Graph (, )][DBLP]


Search in 0.118secs, Finished in 0.122secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002