[2] Uriel Feige.
On maximizing welfare when utility functions are subadditive
SICOMP 39(1): 122-142 (2009). Preliminary version in 38th STOC, 2006, 41-50.
Version: October 2007.

[3] Uriel Feige.
On Allocations that Maximize Fairness
SODA 2008, 287-293.
Version: October 2007.

[4] Uriel Feige and Eran Ofek.
Finding a Maximum Independent Set in a Sparse Random Graph
SIAM Journal on Discrete Mathematics, Volume 22(2), 693-718 (2008).
Version: December 2007.

[5] Uriel Feige, Nicole Immorlica, Vahab Mirrokni and Hamid Nazerzadeh.
A Combinatorial Allocation Mechanism With Penalties For Banner Advertising
Proceedings of the 17th International World Wide Web Conference, 169-178, 2008.
Version: February 2008.

[6] Reid Andersen, Christian Borgs, Jennifer Chayes, Uriel Feige, Abraham Flaxman, Adam Kalai, Vahab Mirrokni and Moshe Tennenholtz.
Trust-based recommendation systems: an axiomatic approach
Proceedings the 17th International World Wide Web Conference, 199-208, 2008.
Version: February 2008.

[7] Arash Asadpour, Uriel Feige and Amin Saberi.
Santa Claus Meets Hypergraph Matchings
Proceedings of APPROX-RANDOM 2008: 10-20.
Version: June 2008.

[8] Uriel Feige and Mohit Singh.
Edge coloring and decompositions of weighted graphs
Proceedings of ESA 2008: 405-416.
Version: June 2008.

[9] Uriel Feige.
Small linear dependencies for binary vectors of low weight
In Building Bridges Between Mathematics and Computer Science, Bolyai Society Mathematical Studies, 19, Springer. Editors: Martin Grotschel and Gyula Katona. Pages 283-307, 2008.
Version: June 2008.

[10] Noga Alon and Uriel Feige.
On the power of two, three and four probes
Proceedings of SODA 2009, 346-354.
Version: December 2008.

[11] Amin Coja-Oghlan, Uriel Feige, Alan Frieze, Michael Krivelevich and Dan Vilenchik.
On smoothed k-CNF formulas and the Walksat algorithm
Proceedings of SODA 2009, 451-460.
Version: October 2008.

[12] Yossi Azar, Uriel Feige and Daniel Glasner.
A preemptive algorithm for maximizing disjoint paths on trees
Algorithmica 57(3): 517-537 (2010). Preliminary version in Proceedings of SWAT 2008: 319-330.
Version: October 2008.

[13] Uriel Feige, Elchanan Mossel and Dan Vilenchik.
Complete convergence of message passing algorithms for some satisfiability problems
Submitted for journal publication. Preliminary version in Proceedings of APPROX-RANDOM 2006: 339-350.
Version: November 2008.

[14] Uriel Feige, Abraham Flaxman and Dan Vilenchik.
On the diameter of the set of satisfying assignments in random satisfiable k-CNF formulas
Submitted for journal publication.
Version: December 2008.

[15] Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda and Prasad Raghavendra.
Buffer Management for Colored Packets with Deadlines
Proceedings of SPAA 2009, 319-327.
Version: May 2009.

[16] Chandan Dubey, Uriel Feige and Walter Unger.
Hardness results for approximating the bandwidth
J. Comput. Syst. Sci. 77(1): 62-90 (2011)
Version: June 2009.

[17] Uriel Feige and Shimon Kogan.
Balanced coloring of bipartite graphs
Journal of Graph Theory, Volume 64, Number 4, pages 277-291.
Version: June 2009.

[18] Reid Andersen and Uriel Feige.
Interchanging distance and capacity in probabilistic mappings
In arxiv.org.
Version: July 2009.

[19] Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh.
PASS Approximation: A Framework for Analyzing and Designing Heuristics
Preliminary version appeared in proceedings of APPROX 2009, 111-124.
Version: August 2009.

[20] Uriel Feige and Ofer Zeitouni.
Deterministic approximation for the cover time of trees
In arxiv.org.
Version: September 2009.

[21] Uriel Feige.
Faster FAST (Feedback Arc Set in Tournaments)
In arxiv.org.
Version: November 2009.

[22] Uriel Feige.
On optimal strategies for a hat game on graphs
SIAM Journal on Discrete Mathematics, 2010.
Version: April 2010.

[23] Uriel Feige, Vahab Mirrokni, Jan Vondrak.
Maximizing non-monotone submodular functions
Submitted for journal publication.
Version: December 2009.

[24] Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan.
Detecting High Log-Densities - an O(n^1/4) Approximation for Densest k-Subgraph
In arxiv.org. Proceedings of STOC 2010.
Version: January 2010.

[25] Uriel Feige and Dorit Ron.
Finding hidden cliques in linear time.
Proceedings of AOFA 2010.
Version: May 2010.

[26] Uriel Feige and Inbal Talgam.
A direct reduction from k-player to 2-player approximate Nash equilibrium.
In arxiv.org. SAGT 2010.
Version: July 2010.

[27] Uriel Feige and Shlomo Joseph.
Oblivious Algorithms for the Maximum Directed Cut Problem.
In arxiv.org.
Version: October 2010.

[28] Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov.
Oblivious collaboration.
In arxiv.org. DISC 2011.
Version: March 2011.

[29] Uriel Feige and Moshe Tennenholtz.
Responsive lotteries.
Proceedings of SAGT 2010.
Version: March 2011.

[30] Uriel Feige and Moshe Tennenholtz.
Mechanism design with uncertain inputs (to err is human, to forgive divine).
In arxiv.org. STOC 2011.
Version: March 2011.

[31] Uriel Feige and Daniel Reichman.
Recoverable values for independent sets.
In arxiv.org. ICALP 2011.
Version: March 2011.

[32] Nikhil Devanur and Uriel Feige.
An O(n log n) Algorithm for a Load Balancing Problem on Paths.
WADS 2011.

[33] Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph (Seffi) Naor, Roy Schwartz.
Min-Max Graph Partitioning and Small Set Expansion.
In arxiv.org. FOCS 2011.