- Home
- Best Scientists - Computer Science
- Jan Vondrák

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
36
Citations
7,437
77
World Ranking
5580
National Ranking
2727

- Combinatorics
- Real number
- Discrete mathematics

Jan Vondrák spends much of his time researching Combinatorics, Submodular set function, Discrete mathematics, Matroid and Approximation algorithm. His research investigates the connection between Combinatorics and topics such as Greedy algorithm that intersect with problems in Hypergraph. His work carried out in the field of Submodular set function brings together such families of science as Cardinality and Generalized assignment problem.

His study ties his expertise on Knapsack problem together with the subject of Discrete mathematics. In his study, which falls under the umbrella issue of Matroid, Randomized rounding, Bipartite graph, Spanning tree and Function is strongly linked to Polytope. His Approximation algorithm study is concerned with the field of Mathematical optimization as a whole.

- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (550 citations)
- Optimal approximation for the submodular welfare problem in the value oracle model (475 citations)
- Maximizing Non-monotone Submodular Functions (345 citations)

Jan Vondrák focuses on Combinatorics, Submodular set function, Discrete mathematics, Matroid and Approximation algorithm. As a part of the same scientific family, Jan Vondrák mostly works in the field of Combinatorics, focusing on Upper and lower bounds and, on occasion, Maximization. He has researched Submodular set function in several fields, including Function, Cardinality and Greedy algorithm.

His biological study deals with issues like Bounded function, which deal with fields such as Algorithm and Supermodular function. His Matroid research is multidisciplinary, incorporating elements of Disjoint sets, Reduction and Matching. Many of his studies on Approximation algorithm apply to Knapsack problem as well.

- Combinatorics (66.91%)
- Submodular set function (52.21%)
- Discrete mathematics (46.32%)

- Submodular set function (52.21%)
- Combinatorics (66.91%)
- Function (16.18%)

Jan Vondrák mostly deals with Submodular set function, Combinatorics, Function, Degree and Bounded function. His Submodular set function study combines topics from a wide range of disciplines, such as Cardinality, Approximation algorithm, Combinatorial optimization and Greedy algorithm. His research in Approximation algorithm intersects with topics in Mathematical economics, Supermodular function, Matroid and Constant factor.

The study incorporates disciplines such as Local search, Heuristics and Resolution in addition to Greedy algorithm. His Combinatorics study combines topics in areas such as Probabilistic logic and Lattice. His Bounded function research is multidisciplinary, incorporating perspectives in Range and Algorithm.

- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature (78 citations)
- High probability generalization bounds for uniformly stable algorithms with nearly optimal rate (29 citations)
- Generalization Bounds for Uniformly Stable Algorithms (21 citations)

- Combinatorics
- Real number
- Algorithm

Jan Vondrák mainly focuses on Uniformly stable, Generalization, Algorithm, Range and Bounded function. His Uniformly stable research includes a combination of various areas of study, such as Generalization error, Stochastic gradient descent, Sampling error and High probability. He has included themes like Function, Lovász local lemma and Degree in his Bounded function study.

His work carried out in the field of Function brings together such families of science as Approximation algorithm, Matroid, Combinatorics and Supermodular function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

Gruia Calinescu;Chandra Chekuri;Martin Pál;Jan Vondrák.

SIAM Journal on Computing **(2011)**

793 Citations

Optimal approximation for the submodular welfare problem in the value oracle model

Jan Vondrak.

symposium on the theory of computing **(2008)**

722 Citations

Maximizing Non-monotone Submodular Functions

Uriel Feige;Vahab S. Mirrokni;Jan Vondrák.

SIAM Journal on Computing **(2011)**

662 Citations

Maximizing a Submodular Set Function subject to a Matroid Constraint

Chandra Chekuri;Gruia Calinescu;Martin Pál;Jan Vondrák.

integer programming and combinatorial optimization **(2007)**

372 Citations

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

Brian C. Dean;Michel X. Goemans;Jan Vondrák.

Mathematics of Operations Research **(2008)**

368 Citations

Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e

U. Feige;J. Vondrak.

foundations of computer science **(2006)**

320 Citations

Maximizing Non-Monotone Submodular Functions

U. Feigc;V.S. Mirrokni;J. Vondrak.

foundations of computer science **(2007)**

314 Citations

Lazier than lazy greedy

Baharan Mirzasoleiman;Ashwinkumar Badanidiyuru;Amin Karbasi;Jan Vondrák.

national conference on artificial intelligence **(2015)**

224 Citations

Fast algorithms for maximizing submodular functions

Ashwinkumar Badanidiyuru;Jan Vondrák.

symposium on discrete algorithms **(2014)**

213 Citations

Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

Gruia Calinescu;Chandra Chekuri;Martin Pál;Jan Vondrák.

integer programming and combinatorial optimization **(2007)**

211 Citations

Apple (United States)

University of Illinois at Urbana-Champaign

Yahoo (United Kingdom)

ETH Zurich

Columbia University

Weizmann Institute of Science

Google (United States)

University of California, Santa Cruz

University of Massachusetts Amherst

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.