Author of the publication

Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games.

, and . IJCAI, page 310-316. ijcai.org, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A characterization of locally testable affine-invariant properties via decomposition theorems.. STOC, page 154-163. ACM, (2014)Statistically Efficient Estimation for Non-Smooth Probability Densities., , and . AISTATS, volume 84 of Proceedings of Machine Learning Research, page 978-987. PMLR, (2018)Using $k$-way Co-occurrences for Learning Word Embeddings., , and . CoRR, (2017)Partially Symmetric Functions are Efficiently Isomorphism-Testable, , and . CoRR, (2011)Maximizing Monotone Submodular Functions over the Integer Lattice., and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 325-336. Springer, (2016)Conjunctive Filter: Breaking the Entropy Barrier., and . ALENEX, page 77-83. SIAM, (2010)Sensitivity Analysis of Centralities on Unweighted Networks., and . WWW, page 1332-1342. ACM, (2019)Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization., , , , , and . AISTATS, volume 84 of Proceedings of Machine Learning Research, page 1027-1036. PMLR, (2018)Constant-Time Approximation Algorithms for the Knapsack Problem., , and . TAMC, volume 7287 of Lecture Notes in Computer Science, page 131-142. Springer, (2012)Algorithms for Finding a Maximum Non-k-linked Graph., and . ESA, volume 6942 of Lecture Notes in Computer Science, page 131-142. Springer, (2011)