Alina Ene

From MaRDI portal
Person:896266

Available identifiers

zbMath Open ene.alinaMaRDI QIDQ896266

List of research outcomes





PublicationDate of PublicationType
Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tails2023-04-03Paper
High Probability Convergence of Clipped-SGD Under Heavy-tailed Noise2023-02-10Paper
Node-weighted Network Design in Planar and Minor-closed Families of Graphs2022-02-16Paper
Approximation algorithms for stochastic \(k\)-TSP2020-11-25Paper
Local distribution and the symmetry gap: approximability of multiway partitioning problems2019-05-15Paper
Poly-logarithmic approximation for maximum node disjoint paths with constant congestion2019-05-15Paper
Submodular unsplittable flow on trees2018-10-26Paper
Constant congestion routing of symmetric demands in planar directed graphs2018-08-22Paper
Online Buy-at-Bulk Network Design2018-08-03Paper
https://portal.mardi4nfdi.de/entity/Q45981392017-12-19Paper
Geometric Packing under Nonuniform Constraints2017-11-22Paper
On routing disjoint paths in bounded treewidth graphs2017-10-17Paper
https://portal.mardi4nfdi.de/entity/Q53650982017-09-29Paper
Routing under balance2017-09-29Paper
Hardness of submodular cost allocation: lattice matching and a simplex coloring conjecture2017-03-22Paper
Submodular unsplittable flow on trees2016-08-10Paper
The all-or-nothing flow problem in directed graphs with symmetric demand pairs2015-12-09Paper
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements2015-06-26Paper
From graph to hypergraph multiway partition: is the single threshold the only route?2014-10-08Paper
Geometric packing under non-uniform constraints2014-08-07Paper
Approximation Algorithms for Submodular Multiway Partition2014-07-30Paper
The all-or-nothing flow problem in directed graphs with symmetric demand pairs2014-06-02Paper
Approximation algorithms and hardness of integral concurrent flow2014-05-13Paper
Node-weighted network design in planar and minor-closed families of graphs2013-08-12Paper
Prize-collecting survivable network design in node-weighted graphs2012-11-02Paper
Submodular Cost Allocation Problem and Applications2011-07-06Paper
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs2009-10-28Paper

Research outcomes over time

This page was built for person: Alina Ene