U. Feige

Most-cited papers

Maximizing Non-Monotone Submodular Functions
U. Feige, V. Mirrokni, J. Vondrák
2011IEEE Annual Symposium on Foundations of Computer Science720 citations
Semantic Scholar
Fair and Truthful Mechanisms for Dichotomous Valuations
Moshe Babaioff, T. Ezra, U. Feige
2020AAAI Conference on Artificial Intelligence153 citations Open access
Semantic Scholar
A tight negative example for MMS fair allocations
U. Feige, Ariel Sapir, Laliv Tauber
2021Workshop on Internet and Network Economics122 citations Open access
Semantic Scholar
Min-max Graph Partitioning and Small Set Expansion
N. Bansal, U. Feige, Robert Krauthgamer, K. Makarychev +4 more
2011IEEE Annual Symposium on Foundations of Computer Science94 citations Open access
Semantic Scholar
Fair-Share Allocations for Agents with Arbitrary Entitlements
Moshe Babaioff, T. Ezra, U. Feige
2021ACM Conference on Economics and Computation87 citations
Semantic Scholar
Learning and inference in the presence of corrupted inputs
U. Feige, Y. Mansour, R. Schapire
2015Annual Conference Computational Learning Theory64 citations
Semantic Scholar
Welfare maximization and the supermodular degree
U. Feige, Rani Izsak
2013Information Technology Convergence and Services64 citations
Semantic Scholar
Best-of-Both-Worlds Fair-Share Allocations
Moshe Babaioff, T. Ezra, U. Feige
2021Workshop on Internet and Network Economics61 citations
Semantic Scholar
Contagious Sets in Expanders
Amin Coja-Oghlan, U. Feige, Michael Krivelevich, Daniel Reichman
2013ACM-SIAM Symposium on Discrete Algorithms59 citations
Semantic Scholar
A Unifying Hierarchy of Valuations with Complements and Substitutes
U. Feige, Michal Feldman, N. Immorlica, Rani Izsak +2 more
2014AAAI Conference on Artificial Intelligence56 citations Open access
Semantic Scholar
Hardness results for approximating the bandwidth
C. Dubey, U. Feige, Walter Unger
2011Journal of computer and system sciences (Print)38 citations Open access
Semantic Scholar
On Fair Allocation of Indivisible Goods to Submodular Agents
Gilad Ben Uziahu, U. Feige
2023arXiv.org36 citations Open access
Semantic Scholar
Contagious Sets in Random Graphs
U. Feige, Michael Krivelevich, Daniel Reichman
201632 citations Open access
Semantic Scholar
Short tandem repeat stutter model inferred from direct measurement of in vitro stutter noise
Ofir Raz, Tamir Biezuner, A. Spiro, Shiran Amir +8 more
2016bioRxiv30 citations Open access
Semantic Scholar
Improved maximin fair allocation of indivisible items to three agents
U. Feige, A. Norkin
2022arXiv.org28 citations Open access
Semantic Scholar
Fair Shares: Feasibility, Domination and Incentives
Moshe Babaioff, U. Feige
2022ACM Conference on Economics and Computation26 citations Open access
Semantic Scholar
Oblivious Rounding and the Integrality Gap
U. Feige, Michal Feldman, Inbal Talgam-Cohen
2016International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques24 citations
Semantic Scholar
On picking sequences for chores
U. Feige, Xin Huang
2022ACM Conference on Economics and Computation22 citations Open access
Semantic Scholar
Quantitative Group Testing and the rank of random matrices
U. Feige, Amir Lellouche
2020arXiv.org22 citations
Semantic Scholar
Mechanism design with uncertain inputs: (to err is human, to forgive divine)
U. Feige, Moshe Tennenholtz
2011Symposium on the Theory of Computing22 citations
Semantic Scholar
PASS Approximation: A Framework for Analyzing and Designing Heuristics
U. Feige, N. Immorlica, V. Mirrokni, Hamid Nazerzadeh
2013Algorithmica20 citations
Semantic Scholar
Fair Allocations for Smoothed Utilities
Yushi Bai, U. Feige, Paul Gölz, Ariel D. Procaccia
2022ACM Conference on Economics and Computation19 citations Open access
Semantic Scholar
Heuristic for maximizing DNA reuse in synthetic DNA library assembly.
J. Blakes, Ofir Raz, U. Feige, J. Bacardit +4 more
2014ACS Synthetic Biology19 citations Open access
Semantic Scholar
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
U. Feige, Janardhan Kulkarni, Shi Li
2018ACM-SIAM Symposium on Discrete Algorithms18 citations Open access
Semantic Scholar
Shotgun assembly of random jigsaw puzzles
Charles Bordenave, U. Feige, Elchanan Mossel
2016Random Struct. Algorithms18 citations Open access
Semantic Scholar
NP-hardness of hypercube 2-segmentation
U. Feige
2014arXiv.org18 citations
Semantic Scholar
Maximin fair allocations with two item values
U. Feige
202217 citations
Semantic Scholar
On the effect of randomness on planted 3-coloring models
R. David, U. Feige
2016Symposium on the Theory of Computing17 citations
Semantic Scholar
Finding cliques using few probes
U. Feige, D. Gamarnik, Joe Neeman, Miklós Z. Rácz +1 more
2018Random Struct. Algorithms15 citations Open access
Semantic Scholar
Robust Inference for Multiclass Classification
U. Feige, Y. Mansour, R. Schapire
2018International Conference on Algorithmic Learning Theory14 citations
Semantic Scholar
Tighter bounds for online bipartite matching
U. Feige
2018Bolyai Society Mathematical Studies13 citations Open access
Semantic Scholar
Random walks with the minimum degree local rule have $O(n^2)$ cover time
R. David, U. Feige
2016SIAM journal on computing (Print)13 citations Open access
Semantic Scholar
Short Tours through Large Linear Forests
U. Feige, R. Ravi, Mohit Singh
2014Conference on Integer Programming and Combinatorial Optimization13 citations
Semantic Scholar
Navigating in Trees with Permanently Noisy Advice
Lucas Boczkowski, U. Feige, Amos Korman, Y. Rodeh
2021ACM Trans. Algorithms12 citations Open access
Semantic Scholar
On the path partition number of 6‐regular graphs
U. Feige, Elena D. Fuchs
2019Journal of Graph Theory12 citations Open access
Semantic Scholar
Max-min greedy matching
Alon Eden, U. Feige, Michal Feldman
2018NetEcon@SIGMETRICS12 citations Open access
Semantic Scholar
Separation between Estimation and Approximation
U. Feige, Shlomo Jozeph
2015Electron. Colloquium Comput. Complex.12 citations
Semantic Scholar
Universal Factor Graphs
U. Feige, Shlomo Jozeph
2012International Colloquium on Automata, Languages and Programming12 citations
Semantic Scholar
The Simplex Algorithm
U. Feige
2020Linear Algebra and Optimization with Applications to Machine Learning11 citations
Semantic Scholar
On the Probe Complexity of Local Computation Algorithms
U. Feige, B. Patt-Shamir, Shai Vardi
2017International Colloquium on Automata, Languages and Programming11 citations
Semantic Scholar
Chasing Ghosts: Competing with Stateful Policies
U. Feige, Tomer Koren, Moshe Tennenholtz
2014IEEE Annual Symposium on Foundations of Computer Science10 citations Open access
Semantic Scholar
Are Gross Substitutes a Substitute for Submodular Valuations?
Shahar Dobzinski, U. Feige, Michal Feldman, R. P. Leme
2021ACM Conference on Economics and Computation9 citations Open access
Semantic Scholar
Random Walks with the Minimum Degree Local Rule Have O(N2) Cover Time
R. David, U. Feige
2017ACM-SIAM Symposium on Discrete Algorithms9 citations
Semantic Scholar
Approximate modularity revisited
U. Feige, Michal Feldman, Inbal Talgam-Cohen
2016Symposium on the Theory of Computing9 citations Open access
Semantic Scholar
On fair division of a homogeneous good
U. Feige, Moshe Tennenholtz
2014Games Econ. Behav.9 citations Open access
Semantic Scholar
A greedy approximation algorithm for minimum-gap scheduling
M. Chrobak, U. Feige, M. Hajiaghayi, S. Khanna +2 more
2013Journal of Scheduling9 citations
Semantic Scholar
Recoverable values for independent sets
U. Feige, Daniel Reichman
2011Random Struct. Algorithms9 citations Open access
Semantic Scholar
Introduction to Semirandom Models
U. Feige
2020Beyond the Worst-Case Analysis of Algorithms8 citations
Semantic Scholar
A randomized strategy in the mirror game
U. Feige
2019arXiv.org8 citations
Semantic Scholar
Generalized Girth Problems in Graphs and Hypergraphs
U. Feige, Tal Wagner
20138 citations
Semantic Scholar