| 2009 |
|---|
| 72 | EE | Viswanath Nagarajan,
Maxim Sviridenko:
On the maximum quadratic assignment problem.
SODA 2009: 516-524 |
| 71 | EE | Jon Lee,
Vahab S. Mirrokni,
Viswanath Nagarajan,
Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints
CoRR abs/0902.0353: (2009) |
| 2008 |
|---|
| 70 | EE | Viswanath Nagarajan,
Maxim Sviridenko:
Tight Bounds for Permutation Flow Shop Scheduling.
IPCO 2008: 154-168 |
| 69 | EE | Magnús M. Halldórsson,
Guy Kortsarz,
Maxim Sviridenko:
Min Sum Edge Coloring in Multigraphs Via Configuration LP.
IPCO 2008: 359-373 |
| 68 | EE | Niv Buchbinder,
Tracy Kimbrel,
Retsef Levi,
Konstantin Makarychev,
Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms.
SODA 2008: 952-961 |
| 67 | EE | Maxim Sviridenko:
Minimum Makespan on Unrelated Machines.
Encyclopedia of Algorithms 2008 |
| 66 | EE | Guy Even,
Retsef Levi,
Dror Rawitz,
Baruch Schieber,
Shimon Shahar,
Maxim Sviridenko:
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.
ACM Transactions on Algorithms 4(3): (2008) |
| 65 | EE | Tracy Kimbrel,
Maxim Sviridenko:
High-multiplicity cyclic job shop scheduling.
Oper. Res. Lett. 36(5): 574-578 (2008) |
| 64 | EE | Alexander Grigoriev,
Joyce van Loon,
Maxim Sviridenko,
Marc Uetz,
Tjark Vredeveld:
Optimal bundle pricing with monotonicity constraint.
Oper. Res. Lett. 36(5): 609-614 (2008) |
| 63 | EE | Nikhil Bansal,
Don Coppersmith,
Maxim Sviridenko:
Improved Approximation Algorithms for Broadcast Scheduling.
SIAM J. Comput. 38(3): 1157-1174 (2008) |
| 2007 |
|---|
| 62 | | Alexander Grigoriev,
Joyce van Loon,
Maxim Sviridenko,
Marc Uetz,
Tjark Vredeveld:
Optimal bundle pricing for homogeneous items.
CTW 2007: 57-60 |
| 61 | EE | Alexander Grigoriev,
Joyce van Loon,
Maxim Sviridenko,
Marc Uetz,
Tjark Vredeveld:
Bundle Pricing with Comparable Items.
ESA 2007: 475-486 |
| 60 | EE | Retsef Levi,
Andrea Lodi,
Maxim Sviridenko:
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.
IPCO 2007: 454-468 |
| 59 | EE | Nikhil Bansal,
Xin Han,
Kazuo Iwama,
Maxim Sviridenko,
Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem.
SODA 2007: 1197-1206 |
| 58 | EE | Nikhil Bansal,
Ning Chen,
Neva Cherniavsky,
Atri Rudra,
Baruch Schieber,
Maxim Sviridenko:
Dynamic pricing for impatient bidders.
SODA 2007: 726-735 |
| 57 | EE | Nikhil Bansal,
Maxim Sviridenko:
Two-dimensional bin packing with one-dimensional resource augmentation.
Discrete Optimization 4(2): 143-153 (2007) |
| 56 | EE | Francisco Barahona,
Pawan Chowdhary,
Markus Ettl,
Pu Huang,
Tracy Kimbrel,
Laszlo Ladányi,
Young M. Lee,
Baruch Schieber,
Karthik Sourirajan,
Maxim Sviridenko,
Grzegorz Swirszcz:
Inventory allocation and transportation scheduling for logistics of network-centric military operations.
IBM Journal of Research and Development 51(3/4): 391-408 (2007) |
| 55 | EE | Alexander Grigoriev,
Maxim Sviridenko,
Marc Uetz:
Machine scheduling with resource dependent processing times.
Math. Program. 110(1): 209-228 (2007) |
| 2006 |
|---|
| 54 | EE | Alexander Grigoriev,
Maxim Sviridenko,
Marc Uetz:
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times.
APPROX-RANDOM 2006: 140-151 |
| 53 | EE | Retsef Levi,
Maxim Sviridenko:
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem.
APPROX-RANDOM 2006: 188-199 |
| 52 | EE | Nikhil Bansal,
Alberto Caprara,
Maxim Sviridenko:
Improved approximation algorithms for multidimensional bin packing problems.
FOCS 2006: 697-708 |
| 51 | EE | Nikhil Bansal,
Don Coppersmith,
Maxim Sviridenko:
Improved approximation algorithms for broadcast scheduling.
SODA 2006: 344-353 |
| 50 | EE | Lisa Fleischer,
Michel X. Goemans,
Vahab S. Mirrokni,
Maxim Sviridenko:
Tight approximation algorithms for maximum general assignment problems.
SODA 2006: 611-620 |
| 49 | EE | Nikhil Bansal,
Maxim Sviridenko:
The Santa Claus problem.
STOC 2006: 31-40 |
| 48 | EE | A. Karve,
Tracy Kimbrel,
Giovanni Pacifici,
Mike Spreitzer,
Malgorzata Steinder,
Maxim Sviridenko,
Asser N. Tantawi:
Dynamic placement for clustered web applications.
WWW 2006: 595-604 |
| 47 | EE | Tracy Kimbrel,
Baruch Schieber,
Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.
J. Scheduling 9(4): 365-379 (2006) |
| 46 | EE | Wenhua Li,
Maurice Queyranne,
Maxim Sviridenko,
Jinjiang Yuan:
Approximation algorithms for shop scheduling problems with minsum objective: A correction.
J. Scheduling 9(6): 569-570 (2006) |
| 2005 |
|---|
| 45 | EE | Nikhil Bansal,
Andrea Lodi,
Maxim Sviridenko:
A Tale of Two Dimensional Bin Packing.
FOCS 2005: 657-666 |
| 44 | EE | Alexander Grigoriev,
Maxim Sviridenko,
Marc Uetz:
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times.
IPCO 2005: 182-195 |
| 43 | EE | Nikhil Bansal,
Tracy Kimbrel,
Maxim Sviridenko:
Job shop scheduling with unit processing times.
SODA 2005: 207-214 |
| 42 | EE | Markus Bläser,
L. Shankar Ram,
Maxim Sviridenko:
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems.
WADS 2005: 350-359 |
| 41 | EE | Tracy Kimbrel,
Malgorzata Steinder,
Maxim Sviridenko,
Asser N. Tantawi:
Dynamic Application Placement Under Service and Memory Constraints.
WEA 2005: 391-402 |
| 40 | EE | David Gamarnik,
Maxim Sviridenko:
Hamiltonian completions of sparse random graphs.
Discrete Applied Mathematics 152(1-3): 139-158 (2005) |
| 39 | EE | Haim Kaplan,
Moshe Lewenstein,
Nira Shafrir,
Maxim Sviridenko:
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
J. ACM 52(4): 602-626 (2005) |
| 38 | EE | David Gamarnik,
Moshe Lewenstein,
Maxim Sviridenko:
An improved upper bound for the TSP in cubic 3-edge-connected graphs.
Oper. Res. Lett. 33(5): 467-474 (2005) |
| 2004 |
|---|
| 37 | EE | Nikhil Bansal,
Lisa Fleischer,
Tracy Kimbrel,
Mohammad Mahdian,
Baruch Schieber,
Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering.
ICALP 2004: 196-207 |
| 36 | EE | Nikhil Bansal,
Maxim Sviridenko:
New approximability and inapproximability results for 2-dimensional Bin Packing.
SODA 2004: 196-203 |
| 35 | EE | Tracy Kimbrel,
Baruch Schieber,
Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.
SODA 2004: 982-991 |
| 34 | EE | Esther M. Arkin,
Refael Hassin,
Shlomi Rubinstein,
Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica 39(2): 175-187 (2004) |
| 33 | EE | Maxim Sviridenko:
A Note on Permutation Flow Shop Problem.
Annals OR 129(1-4): 247-252 (2004) |
| 32 | EE | Alexander A. Ageev,
Maxim Sviridenko:
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.
J. Comb. Optim. 8(3): 307-328 (2004) |
| 31 | EE | Maxim Sviridenko:
A note on maximizing a submodular set function subject to a knapsack constraint.
Oper. Res. Lett. 32(1): 41-43 (2004) |
| 30 | EE | Alexander Kesselman,
Zvi Lotker,
Yishay Mansour,
Boaz Patt-Shamir,
Baruch Schieber,
Maxim Sviridenko:
Buffer Overflow Management in QoS Switches.
SIAM J. Comput. 33(3): 563-583 (2004) |
| 2003 |
|---|
| 29 | EE | Haim Kaplan,
Moshe Lewenstein,
Nira Shafrir,
Maxim Sviridenko:
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.
FOCS 2003: 56- |
| 28 | EE | Moshe Lewenstein,
Maxim Sviridenko:
Approximating asymmetric maximum TSP.
SODA 2003: 646-654 |
| 27 | EE | Klaus Jansen,
Roberto Solis-Oba,
Maxim Sviridenko:
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.
SIAM J. Discrete Math. 16(2): 288-300 (2003) |
| 26 | EE | Maxim Sviridenko:
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme.
SIAM J. Discrete Math. 16(2): 313-322 (2003) |
| 25 | EE | Moshe Lewenstein,
Maxim Sviridenko:
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP.
SIAM J. Discrete Math. 17(2): 237-248 (2003) |
| 2002 |
|---|
| 24 | EE | Maxim Sviridenko:
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.
IPCO 2002: 240-257 |
| 23 | EE | Don Coppersmith,
David Gamarnik,
Maxim Sviridenko:
The diameter of a long range percolation graph.
SODA 2002: 329-337 |
| 22 | EE | Esther M. Arkin,
Refael Hassin,
Shlomi Rubinstein,
Maxim Sviridenko:
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
SWAT 2002: 280-287 |
| 21 | EE | Maurice Queyranne,
Maxim Sviridenko:
A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective.
J. Algorithms 45(2): 202-212 (2002) |
| 20 | EE | Alexander Kononov,
Maxim Sviridenko:
A linear time approximation scheme for makespan minimization in an open shop with release dates.
Oper. Res. Lett. 30(4): 276-280 (2002) |
| 19 | EE | Don Coppersmith,
David Gamarnik,
Maxim Sviridenko:
The diameter of a long-range percolation graph.
Random Struct. Algorithms 21(1): 1-13 (2002) |
| 2001 |
|---|
| 18 | EE | Maurice Queyranne,
Maxim Sviridenko:
A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective.
IPCO 2001: 361-369 |
| 17 | EE | Alexander Kesselman,
Zvi Lotker,
Yishay Mansour,
Boaz Patt-Shamir,
Baruch Schieber,
Maxim Sviridenko:
Buffer overflow management in QoS switches.
STOC 2001: 520-529 |
| 16 | EE | T. S. Jayram,
Tracy Kimbrel,
Robert Krauthgamer,
Baruch Schieber,
Maxim Sviridenko:
Online server allocation in a server farm via benefit task systems.
STOC 2001: 540-549 |
| 15 | EE | Maxim Sviridenko:
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint.
Algorithmica 30(3): 398-405 (2001) |
| 14 | EE | Esther M. Arkin,
Refael Hassin,
Maxim Sviridenko:
Approximating the maximum quadratic assignment problem.
Inf. Process. Lett. 77(1): 13-16 (2001) |
| 13 | EE | Alexander A. Ageev,
Refael Hassin,
Maxim Sviridenko:
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
SIAM J. Discrete Math. 14(2): 246-255 (2001) |
| 2000 |
|---|
| 12 | EE | Alexander A. Ageev,
Refael Hassin,
Maxim Sviridenko:
An approximation algorithm for MAX DICUT with given sizes of parts.
APPROX 2000: 34-41 |
| 11 | | Alexander A. Ageev,
Maxim Sviridenko:
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts.
ESA 2000: 32-41 |
| 10 | | Maxim Sviridenko,
Gerhard J. Woeginger:
Approximability and in-approximability results for no-wait shop scheduling.
FOCS 2000: 116-125 |
| 9 | EE | Maurice Queyranne,
Maxim Sviridenko:
New and improved algorithms for minsum shop scheduling.
SODA 2000: 871-878 |
| 8 | EE | Klaus Jansen,
Maxim Sviridenko:
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.
STACS 2000: 455-465 |
| 7 | EE | Maxim Sviridenko:
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem.
Oper. Res. Lett. 26(4): 193-197 (2000) |
| 1999 |
|---|
| 6 | EE | 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 |
| 5 | EE | Alexander A. Ageev,
Maxim Sviridenko:
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.
IPCO 1999: 17-30 |
| 4 | | Klaus Jansen,
Roberto Solis-Oba,
Maxim Sviridenko:
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.
RANDOM-APPROX 1999: 177-188 |
| 3 | EE | Klaus Jansen,
Roberto Solis-Oba,
Maxim Sviridenko:
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.
STOC 1999: 394-399 |
| 2 | EE | Alexander A. Ageev,
Maxim Sviridenko:
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem.
Discrete Applied Mathematics 93(2-3): 149-156 (1999) |
| 1998 |
|---|
| 1 | EE | Maxim Sviridenko:
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint.
APPROX 1998: 193-199 |
