| 2023 | ICML | Gradient Descent Converges Linearly for Logistic Regression on Separable Data. | Kyriakos Axiotis, Maxim Sviridenko |
| 2022 | ICML | Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. | Kyriakos Axiotis, Maxim Sviridenko |
| 2021 | CIKM | TSI: An Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity. | Shaunak Mishra, Changwei Hu, Manisha Verma, Kevin Yen, Yifan Hu, Maxim Sviridenko |
| 2021 | ICLR | Local Search Algorithms for Rank-Constrained Convex Optimization. | Kyriakos Axiotis, Maxim Sviridenko |
| 2021 | KDD | VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search. | Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava, Maxim Sviridenko |
| 2020 | ICML | Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. | Kyriakos Axiotis, Maxim Sviridenko |
| 2017 | ALENEX | Determining Tournament Payout Structures for Daily Fantasy Sports. | Christopher Musco, Maxim Sviridenko, Justin Thaler |
| 2017 | WWW | Sponsored Search Auctions with Rich Ads. | Ruggiero Cavallo, Prabhakar Krishnamurthy, Maxim Sviridenko, Christopher A. Wilkens |
| 2016 | ALENEX | An Algorithm for Online K-Means Clustering. | Edo Liberty, Ram Sriharsha, Maxim Sviridenko |
| 2015 | SODA | New Approximations for Broadcast Scheduling via Variants of α-point Rounding. | Sungjin Im, Maxim Sviridenko |
| 2015 | SODA | Optimal approximation for submodular and supermodular optimization with bounded curvature. | Maxim Sviridenko, Jan Vondrk, Justin Ward |
| 2014 | ESA | Polynomial-Time Approximation Schemes for Circle Packing Problems. | Flvio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi |
| 2014 | FOCS | Solving Optimization Problems with Diseconomies of Scale via Decoupling. | Konstantin Makarychev, Maxim Sviridenko |
| 2014 | LATIN | Integrated Supply Chain Management via Randomized Rounding. | Lehilton L. C. Pedrosa, Maxim Sviridenko |
| 2014 | STACS | Submodular Stochastic Probing on Matroids. | Marek Adamczyk, Maxim Sviridenko, Justin Ward |
| 2014 | STACS | Stochastic Scheduling on Unrelated Machines. | Martin Skutella, Maxim Sviridenko, Marc Uetz |
| 2013 | ICALP | Approximation Algorithms for the Joint Replenishment Problem with Deadlines. | Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young |
| 2013 | ICALP | No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. | Marcin Mucha, Maxim Sviridenko |
| 2013 | ICALP | Large Neighborhood Local Search for the Maximum Set Packing Problem. | Maxim Sviridenko, Justin Ward |
| 2013 | IPCO | An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem. | Tim Nonner, Maxim Sviridenko |
| 2013 | IPCO | Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. | Maxim Sviridenko, Andreas Wiese |
| 2012 | SODA | Inapproximability of the multi-level uncapacitated facility location problem. | Ravishankar Krishnaswamy, Maxim Sviridenko |
| 2012 | SODA | Concentration inequalities for nonlinear matroid intersection. | Konstantin Makarychev, Warren Schudy, Maxim Sviridenko |
| 2012 | SODA | Concentration and moment inequalities for polynomials of independent random variables. | Warren Schudy, Maxim Sviridenko |
| 2012 | STACS | Preemptive and Non-Preemptive Generalized Min Sum Set Cover. | Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan |
| 2011 | ICALP | Maximizing Polynomials Subject to Assignment Constraints. | Konstantin Makarychev, Maxim Sviridenko |
| 2010 | ICALP | Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. | Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko |
| 2010 | STOC | Matroid matching: the power of local search. | Jon Lee, Maxim Sviridenko, Jan Vondrk |
| 2009 | CSR | Integrality Property in Preemptive Parallel Machine Scheduling. | Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko |
| 2009 | CSR | Complete Complexity Classification of Short Shop Scheduling. | Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko |
| 2009 | ISAAC | A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. | Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prdel, Maxim Sviridenko |
| 2009 | SODA | On the maximum quadratic assignment problem. | Viswanath Nagarajan, Maxim Sviridenko |
| 2009 | STOC | Non-monotone submodular maximization under matroid and knapsack constraints. | Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko |
| 2008 | IPCO | Min Sum Edge Coloring in Multigraphs Via Configuration LP. | Magns M. Halldrsson, Guy Kortsarz, Maxim Sviridenko |
| 2008 | IPCO | Tight Bounds for Permutation Flow Shop Scheduling. | Viswanath Nagarajan, Maxim Sviridenko |
| 2008 | SODA | Online make-to-order joint replenishment model: primal dual competitive algorithms. | Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko |
| 2007 | ESA | Bundle Pricing with Comparable Items. | Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld |
| 2007 | IPCO | Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. | Retsef Levi, Andrea Lodi, Maxim Sviridenko |
| 2007 | SODA | Dynamic pricing for impatient bidders. | Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko |
| 2007 | SODA | Harmonic algorithm for 3-dimensional strip packing problem. | Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang |
| 2006 | FOCS | Improved approximation algorithms for multidimensional bin packing problems. | Nikhil Bansal, Alberto Caprara, Maxim Sviridenko |
| 2006 | WWW | Dynamic placement for clustered web applications. | Alexei A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike Spreitzer, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi |
| 2006 | SODA | Improved approximation algorithms for broadcast scheduling. | Nikhil Bansal, Don Coppersmith, Maxim Sviridenko |
| 2006 | SODA | Tight approximation algorithms for maximum general assignment problems. | Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko |
| 2006 | STOC | The Santa Claus problem. | Nikhil Bansal, Maxim Sviridenko |
| 2005 | FOCS | A Tale of Two Dimensional Bin Packing. | Nikhil Bansal, Andrea Lodi, Maxim Sviridenko |
| 2005 | IPCO | Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. | Alexander Grigoriev, Maxim Sviridenko, Marc Uetz |
| 2005 | SODA | Job shop scheduling with unit processing times. | Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko |
| 2005 | WADS | Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. | Markus Blser, L. Shankar Ram, Maxim Sviridenko |
| 2004 | ICALP | Further Improvements in Competitive Guarantees for QoS Buffering. | Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko |
| 2004 | SODA | New approximability and inapproximability results for 2-dimensional Bin Packing. | Nikhil Bansal, Maxim Sviridenko |
| 2004 | SODA | Minimizing migrations in fair multiprocessor scheduling of persistent tasks. | Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko |
| 2003 | FOCS | Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
| 2003 | SODA | Approximating asymmetric maximum TSP. | Moshe Lewenstein, Maxim Sviridenko |
| 2002 | IPCO | An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. | Maxim Sviridenko |
| 2002 | SODA | The diameter of a long range percolation graph. | Don Coppersmith, David Gamarnik, Maxim Sviridenko |
| 2001 | IPCO | A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. | Maurice Queyranne, Maxim Sviridenko |
| 2001 | STOC | Online server allocation in a server farm via benefit task systems. | T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko |
| 2001 | STOC | Buffer overflow management in QoS switches. | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko |
| 2000 | ESA | An Approximation Algorithm for Hypergraph Max | Alexander A. Ageev, Maxim Sviridenko |
| 2000 | FOCS | Approximability and in-approximability results for no-wait shop scheduling. | Maxim Sviridenko, Gerhard J. Woeginger |
| 2000 | SODA | New and improved algorithms for minsum shop scheduling. | Maurice Queyranne, Maxim Sviridenko |
| 2000 | STACS | Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. | Klaus Jansen, Maxim Sviridenko |
| 1999 | FOCS | Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. | Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko |
| 1999 | IPCO | Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. | Alexander A. Ageev, Maxim Sviridenko |
| 1999 | STOC | Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. | Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko |