128 citations · 451 across the 30 of their papers we have counts for
3 papers · 1 filter
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
Georgios Amanatidis, Pieter Kleer
The approximate uniform sampling of graphs with a given degree sequence is a well-known, extensively studied problem in theoretical computer science and has significant application…
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
Georgios Amanatidis, Georgios Birmpas, Federico Fusco +3
We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary transfers and, therefo…
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Georgios Amanatidis, Federico Fusco, Philip Lazos +3
Submodular maximization is a classic algorithmic problem with multiple applications in data mining and machine learning; there, the growing need to deal with massive instances moti…