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

Search the dblp DataBase

Title:
Author:
Maxim Sviridenko: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maxim Sviridenko
    Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:193-199 [Conf]
  2. Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
    An approximation algorithm for MAX DICUT with given sizes of parts. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:34-41 [Conf]
  3. Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
    LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:140-151 [Conf]
  4. Retsef Levi, Maxim Sviridenko
    Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:188-199 [Conf]
  5. Alexander A. Ageev, Maxim Sviridenko
    An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:32-41 [Conf]
  6. 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]
  7. Nikhil Bansal, Andrea Lodi, Maxim Sviridenko
    A Tale of Two Dimensional Bin Packing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:657-666 [Conf]
  8. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:56-0 [Conf]
  9. Maxim Sviridenko, Gerhard J. Woeginger
    Approximability and in-approximability results for no-wait shop scheduling. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:116-125 [Conf]
  10. Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
    Improved approximation algorithms for multidimensional bin packing problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:697-708 [Conf]
  11. Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
    Further Improvements in Competitive Guarantees for QoS Buffering. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:196-207 [Conf]
  12. Alexander A. Ageev, Maxim Sviridenko
    Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:17-30 [Conf]
  13. Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
    Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:182-195 [Conf]
  14. Maurice Queyranne, Maxim Sviridenko
    A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:361-369 [Conf]
  15. Maxim Sviridenko
    An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:240-257 [Conf]
  16. Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
    A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:177-188 [Conf]
  17. Nikhil Bansal, Don Coppersmith, Maxim Sviridenko
    Improved approximation algorithms for broadcast scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:344-353 [Conf]
  18. Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko
    Job shop scheduling with unit processing times. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:207-214 [Conf]
  19. Nikhil Bansal, Maxim Sviridenko
    New approximability and inapproximability results for 2-dimensional Bin Packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:196-203 [Conf]
  20. Don Coppersmith, David Gamarnik, Maxim Sviridenko
    The diameter of a long range percolation graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:329-337 [Conf]
  21. Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
    Tight approximation algorithms for maximum general assignment problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:611-620 [Conf]
  22. Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
    Minimizing migrations in fair multiprocessor scheduling of persistent tasks. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:982-991 [Conf]
  23. Moshe Lewenstein, Maxim Sviridenko
    Approximating asymmetric maximum TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:646-654 [Conf]
  24. Maurice Queyranne, Maxim Sviridenko
    New and improved algorithms for minsum shop scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:871-878 [Conf]
  25. Klaus Jansen, Maxim Sviridenko
    Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:455-465 [Conf]
  26. Nikhil Bansal, Maxim Sviridenko
    The Santa Claus problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:31-40 [Conf]
  27. Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
    Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:394-399 [Conf]
  28. T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko
    Online server allocation in a server farm via benefit task systems. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:540-549 [Conf]
  29. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
    Buffer overflow management in QoS switches. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:520-529 [Conf]
  30. Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
    Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:280-287 [Conf]
  31. Markus Bläser, L. Shankar Ram, Maxim Sviridenko
    Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:350-359 [Conf]
  32. Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi
    Dynamic Application Placement Under Service and Memory Constraints. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:391-402 [Conf]
  33. A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike Spreitzer, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi
    Dynamic placement for clustered web applications. [Citation Graph (0, 0)][DBLP]
    WWW, 2006, pp:595-604 [Conf]
  34. Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
    Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:2, pp:175-187 [Journal]
  35. Maxim Sviridenko
    Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:398-405 [Journal]
  36. Alexander A. Ageev, Maxim Sviridenko
    An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:2-3, pp:149-156 [Journal]
  37. David Gamarnik, Maxim Sviridenko
    Hamiltonian completions of sparse random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:139-158 [Journal]
  38. Esther M. Arkin, Refael Hassin, Maxim Sviridenko
    Approximating the maximum quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:13-16 [Journal]
  39. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:602-626 [Journal]
  40. Maurice Queyranne, Maxim Sviridenko
    A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:202-212 [Journal]
  41. Alexander A. Ageev, Maxim Sviridenko
    Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:3, pp:307-328 [Journal]
  42. Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
    Machine scheduling with resource dependent processing times. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:209-228 [Journal]
  43. David Gamarnik, Moshe Lewenstein, Maxim Sviridenko
    An improved upper bound for the TSP in cubic 3-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:5, pp:467-474 [Journal]
  44. Alexander Kononov, Maxim Sviridenko
    A linear time approximation scheme for makespan minimization in an open shop with release dates. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:4, pp:276-280 [Journal]
  45. Maxim Sviridenko
    A note on maximizing a submodular set function subject to a knapsack constraint. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:41-43 [Journal]
  46. Don Coppersmith, David Gamarnik, Maxim Sviridenko
    The diameter of a long-range percolation graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:1, pp:1-13 [Journal]
  47. Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
    Minimizing migrations in fair multiprocessor scheduling of persistent tasks. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:4, pp:365-379 [Journal]
  48. Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan
    Approximation algorithms for shop scheduling problems with minsum objective: A correction. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:6, pp:569-570 [Journal]
  49. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
    Buffer Overflow Management in QoS Switches. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:563-583 [Journal]
  50. Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
    A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:246-255 [Journal]
  51. Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
    Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:288-300 [Journal]
  52. Moshe Lewenstein, Maxim Sviridenko
    A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:2, pp:237-248 [Journal]
  53. Maxim Sviridenko
    Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:313-322 [Journal]
  54. Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld
    Bundle Pricing with Comparable Items. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:475-486 [Conf]
  55. Retsef Levi, Andrea Lodi, Maxim Sviridenko
    Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:454-468 [Conf]
  56. Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
    Dynamic pricing for impatient bidders. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:726-735 [Conf]
  57. Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
    Harmonic algorithm for 3-dimensional strip packing problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1197-1206 [Conf]

  58. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. [Citation Graph (, )][DBLP]


  59. On Hardness of Pricing Items for Single-Minded Bidders. [Citation Graph (, )][DBLP]


  60. Integrality Property in Preemptive Parallel Machine Scheduling. [Citation Graph (, )][DBLP]


  61. Complete Complexity Classification of Short Shop Scheduling. [Citation Graph (, )][DBLP]


  62. Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. [Citation Graph (, )][DBLP]


  63. Tight Bounds for Permutation Flow Shop Scheduling. [Citation Graph (, )][DBLP]


  64. Min Sum Edge Coloring in Multigraphs Via Configuration LP. [Citation Graph (, )][DBLP]


  65. Online make-to-order joint replenishment model: primal dual competitive algorithms. [Citation Graph (, )][DBLP]


  66. On the maximum quadratic assignment problem. [Citation Graph (, )][DBLP]


  67. Non-monotone submodular maximization under matroid and knapsack constraints. [Citation Graph (, )][DBLP]


  68. Matroid matching: the power of local search. [Citation Graph (, )][DBLP]


  69. Optimal bundle pricing for homogeneous items. [Citation Graph (, )][DBLP]


  70. Non-monotone submodular maximization under matroid and knapsack constraints [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.014secs
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