Travelled to:1 × Canada
1 × Greece
4 × USA
Collaborated with:B.Kimelfeld A.Sharma S.Dobzinski ∅ D.P.Woodruff R.Williams C.Chekuri R.Zenklusen J.Lee M.Sviridenko
Talks about:complex (3) submodular (2) approxim (2) propag (2) maxim (2) delet (2) multilinear (1) threshold (1) distribut (1) multiway (1)
Person: Jan Vondrák
DBLP: Vondr=aacute=k:Jan
Contributed to:
2014
20132012
2011201120102008Wrote 7 papers:
- STOC-2014-SharmaV #multi
- Multiway cut, pairwise realizable distributions, and descending thresholds (AS, JV), pp. 724–733.
- VLDB-2013-KimelfeldVW #approximate #complexity #multi
- Multi-Tuple Deletion Propagation: Approximations and Complexity (BK, JV, DPW), pp. 1558–1569.
- STOC-2012-DobzinskiV #complexity #query
- From query complexity to computational complexity (SD, JV), pp. 1107–1116.
- PODS-2011-KimelfeldVW
- Maximizing conjunctive views in deletion propagation (BK, JV, RW), pp. 187–198.
- STOC-2011-VondrakCZ #multi
- Submodular function maximization via the multilinear relaxation and contention resolution schemes (JV, CC, RZ), pp. 783–792.
- STOC-2010-LeeSV #power of
- Matroid matching: the power of local search (JL, MS, JV), pp. 369–378.
- STOC-2008-Vondrak #approximate #problem
- Optimal approximation for the submodular welfare problem in the value oracle model (JV), pp. 67–74.