Alina Ene

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Online and Streaming Algorithms for Constrained k-Submodular Maximization.

[BibT_eX]

[DOI]

Fabian Spaeh

CoRR, 2023

High Probability Convergence of Stochastic Gradient Methods.

[BibT_eX]

[DOI]

CoRR, 2023

Online Ad Allocation with Predictions.

[BibT_eX]

[DOI]

Fabian Spaeh

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Generalization Error of Stochastic Mirror Descent for Quadratically-Bounded Losses: an Improved Analysis.

[BibT_eX]

[DOI]

Ta Duy Nguyen

Huy Nguyen

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

High Probability Convergence of Stochastic Gradient Methods.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

On the Convergence of AdaGrad(Norm) on ℝ<sup>d</sup>: Beyond Convexity, Non-Asymptotic Rate and Acceleration.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint.

[BibT_eX]

[DOI]

Math. Oper. Res., November, 2022

High Probability Convergence for Accelerated Stochastic Mirror Descent.

[BibT_eX]

[DOI]

CoRR, 2022

META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions.

[BibT_eX]

[DOI]

CoRR, 2022

On the Convergence of AdaGrad on $\R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration.

[BibT_eX]

[DOI]

CoRR, 2022

Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence.

[BibT_eX]

[DOI]

Huy Le Nguyen

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Node-weighted Network Design in Planar and Minor-closed Families of Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

An Efficient Framework for Balancing Submodularity and Cost.

[BibT_eX]

[DOI]

Sofia Maria Nikolakaki

Evimaria Terzi

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Projection-Free Bandit Optimization with Privacy Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Adaptive and Universal Single-gradient Algorithms for Variational Inequalities.

[BibT_eX]

[DOI]

CoRR, 2020

Adaptive Gradient Methods for Constrained Convex Optimization.

[BibT_eX]

[DOI]

CoRR, 2020

A note on maximizing the difference between a monotone submodular function and a linear function.

[BibT_eX]

[DOI]

CoRR, 2020

Parallel Algorithm for Non-Monotone DR-Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

An Optimal Streaming Algorithm for Non-monotone Submodular Maximization.

[BibT_eX]

[DOI]

Andrew Suh

CoRR, 2019

Improved Convergence for $\ell_\infty$ and $\ell_1$ Regression via Iteratively Reweighted Least Squares.

[BibT_eX]

[DOI]

CoRR, 2019

Submodular maximization with matroid and packing constraints in parallel.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs.

[BibT_eX]

[DOI]

Marcin Pilipczuk

SIAM J. Discret. Math., 2018

Online Buy-at-Bulk Network Design.

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

Ravishankar Krishnaswamy

Debmalya Panigrahi

SIAM J. Comput., 2018

Submodular unsplittable flow on trees.

[BibT_eX]

[DOI]

Math. Program., 2018

A Parallel Double Greedy Algorithm for Submodular Maximization.

[BibT_eX]

[DOI]

CoRR, 2018

Submodular Maximization with Packing Constraints in Parallel.

[BibT_eX]

[DOI]

CoRR, 2018

Mining Tours and Paths in Activity Networks.

[BibT_eX]

[DOI]

Sofia Maria Nikolakaki

Charalampos Mavroforakis

Evimaria Terzi

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

2017

Geometric Packing under Nonuniform Constraints.

[BibT_eX]

[DOI]

Sariel Har-Peled

Benjamin Raichel

SIAM J. Comput., 2017

Decomposable Submodular Function Minimization: Discrete and Continuous.

[BibT_eX]

[DOI]

László A. Végh

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Approximation Algorithms for Stochastic k-TSP.

[BibT_eX]

[DOI]

Viswanath Nagarajan

Rishi Saket

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns.

[BibT_eX]

[DOI]

CoRR, 2016

On Routing Disjoint Paths in Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Routing under balance.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Constrained Submodular Maximization: Beyond 1/e.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

On Approximating Maximum Independent Set of Rectangles.

[BibT_eX]

[DOI]

Julia Chuzhoy

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

A New Framework for Distributed Submodular Maximization.

[BibT_eX]

[DOI]

Rafael da Ponte Barbosa

Justin Ward

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

The all-or-nothing flow problem in directed graphs with symmetric demand pairs.

[BibT_eX]

[DOI]

Math. Program., 2015

Examining User Experiences through a Multimodal BCI Puzzle Game.

[BibT_eX]

[DOI]

Fotis Liarokapis

Athanasios Vourvopoulos

Proceedings of the 19th International Conference on Information Visualisation, 2015

Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Machine Learning, 2015

The Power of Randomization: Distributed Submodular Maximization on Massive Datasets.

[BibT_eX]

[DOI]

Rafael da Ponte Barbosa

Justin Ward

Proceedings of the 32nd International Conference on Machine Learning, 2015

2014

Comparing interaction techniques for serious games through brain-computer interfaces: A user perception evaluation study.

[BibT_eX]

[DOI]

Fotis Liarokapis

Kurt Debattista

Athanasios Vourvopoulos

Panagiotis Petridis

Entertain. Comput., 2014

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?

[BibT_eX]

[DOI]

Huy L. Nguyên

Proceedings of the Algorithms - ESA 2014, 2014

Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture.

[BibT_eX]

[DOI]

Jan Vondrák

Proceedings of the Approximation, 2014

2013

Approximation algorithms for submodular optimization and graph problems

[BibT_eX]

[DOI]

PhD thesis, 2013

Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems

[BibT_eX]

[DOI]

CoRR, 2013

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small

[BibT_eX]

[DOI]

Sariel Har-Peled

Benjamin Raichel

CoRR, 2013

Assessing Brain-Computer Interfaces for Controlling Serious Games.

[BibT_eX]

[DOI]

Fotis Liarokapis

Athanasios Vourvopoulos

Panagiotis Petridis

Proceedings of the 5th International Conference on Games and Virtual Worlds for Serious Applications, 2013

Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems.

[BibT_eX]

[DOI]

Jan Vondrák

Yi Wu

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Approximation algorithms and hardness of integral concurrent flow.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Geometric packing under non-uniform constraints.

[BibT_eX]

[DOI]

Sariel Har-Peled

Benjamin Raichel

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

Prize-Collecting Survivable Network Design in Node-Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Prize-collecting Steiner Problems on Planar Graphs.

[BibT_eX]

[DOI]

MohammadHossein Bateni

Mohammad Taghi Hajiaghayi

Dániel Marx

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Fast clustering using MapReduce.

[BibT_eX]

[DOI]

Sungjin Im

Benjamin Moseley

Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Submodular Cost Allocation Problem and Applications.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Approximation Algorithms for Submodular Multiway Partition.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Prize-Collecting Steiner Tree and Forest in Planar Graphs

[BibT_eX]

[DOI]

CoRR, 2010

2009

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs.

[BibT_eX]

[DOI]