World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
7846
World Ranking
7591
National Ranking
3291

Mathematics

D-Index
41
Citations
7594
World Ranking
1899
National Ranking
809

Overview

Endre Boros is affiliated with Rutgers, The State University of New Jersey in the United States. Their research is primarily situated within computer science, with a focus on computational theory and mathematics. They have published extensively across various subfields including artificial intelligence, economics and econometrics, computer networks and communications, and management science and operations research.

Their research topics cover a diverse set of areas such as advanced graph theory research, complexity and algorithms in graphs, and several aspects of game theory including voting systems and applications. They have also worked on subjects related to artificial intelligence in games, computability and logic, AI algorithms, as well as auction theory and its applications.

Endre Boros has authored multiple papers published in respected venues, including:

  • "Envy-free Relaxations for Goods, Chores, and Mixed Items" (2020, arXiv (Cornell University))
  • "On the Sprague-Grundy function of extensions of proper Nim" (2020, International Journal of Game Theory)
  • "Computing remoteness functions of Moore, Wythoff, and Euclid's games" (2024, International Journal of Game Theory)
  • "Envy-free relaxations for goods, chores, and mixed items" (2024, Theoretical Computer Science)
  • "Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies" (2023, International Journal of Game Theory)

Boros collaborates frequently with several coauthors, notably:

  • Vladimir Gurvich
  • Kazuhisa Makino
  • Martin Milanič
  • Kristóf Bérczi
  • Jernej Vičič

The scientist has a consistent publication record in specific academic outlets, with many papers appearing in arXiv (Cornell University). Other common publication venues include Zenodo (CERN European Organization for Nuclear Research), the International Journal of Game Theory, Theoretical Computer Science, and the Journal of Graph Theory.

Best Publications

  • Pseudo-boolean optimization

    Endre Boros;Peter L. Hammer

  • An implementation of logical analysis of data

    E. Boros;P.L. Hammer;T. Ibaraki;A. Kogan

  • Logical analysis of numerical data

    Endre Boros;Peter L. Hammer;Toshihide Ibaraki;Alexander Kogan

  • Generating All Vertices of a Polyhedron Is Hard

    Leonid Khachiyan;Endre Boros;Konrad Borys;Khaled Elbassioni

  • Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

    Endre Boros;Peter L. Hammer;Gabriel Tavares

  • Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur

    Endre Boros;Andras Prekopa

  • Polynomial-time inference of all valid implications for Horn and related formulae

    E. Boros;Y. Crama;P. L. Hammer

  • On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction

    Leonid Khachiyan;Endre Boros;Konrad Borys;Khaled Elbassioni

  • The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds

    Endre Boros;Peter L. Hammer

  • On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets

    Endre Boros;Vladimir Gurvich;Leonid Khachiyan;Kazuhisa Makino

  • Perfect graphs, kernels, and cores of cooperative games

    E. Boros;V. Gurvich

  • Recognition of q -Horn formulae in linear time

    Endre Boros;Peter L. Hammer;Xiaorong Sun

  • A graph cut algorithm for higher-order Markov Random Fields

    Alexander Fix;Aritanan Gruber;Endre Boros;Ramin Zabih

  • The number of triangles covering the center of an n-set

    E. Boros;Z. Füredi

  • Error-free and best-fit extensions of partially defined Boolean functions

    Endre Boros;Toshihide Ibaraki;Kazuhisa Makino

  • Preprocessing of unconstrained quadratic binary optimization

    Endre Boros;Peter L. Hammer;Gabriel Tavares

  • On the sharpness of a theorem of B Segre

    E Boros;T Szönyi

  • On the Complexity of Some Enumeration Problems for Matroids

    L. Khachiyan;E. Boros;K. Elbassioni;V. Gurvich

  • Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle

    Endre Boros;Peter L. Hammer;Toshihide Ibaraki;Kazuhiko Kawakami

  • Dual subimplicants of positive Boolean functions

    Endre Boros;Vladimir Gurvich;Vladimir Gurvich;Peter L. Hammer

Frequent Co-Authors

Peter L. Hammer
Peter L. Hammer Rutgers, The State University of New Jersey
Yves Crama
Yves Crama University of Liège
Toshihide Ibaraki
Toshihide Ibaraki Kyoto College of Graduate Studies for Informatics
Alexander Kogan
Alexander Kogan Rutgers, The State University of New Jersey
Zoltán Füredi
Zoltán Füredi University of Illinois at Urbana-Champaign
Fred S. Roberts
Fred S. Roberts Rutgers, The State University of New Jersey
András Prékopa
András Prékopa Rutgers, The State University of New Jersey
Ramin Zabih
Ramin Zabih Cornell University
Ron Shamir
Ron Shamir Tel Aviv University
Benjamin Melamed
Benjamin Melamed Rutgers, The State University of New Jersey

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

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring related online degrees can enhance career opportunities for those interested in Mathematics. For example, business professionals often consider programs like the easiest mba programs which provide foundational management skills with flexible online structures.

For individuals aiming to reach executive-level positions, pursuing a Doctorate in Business Administration is a strategic choice. Those looking for budget-friendly options should explore the cheapest dba online programs, combining affordability with advanced business expertise.

Finance enthusiasts can benefit significantly by enrolling in specialized degrees as well. The cheapest masters in finance highlight accessible pathways for gaining strong quantitative and analytical skills applicable to numerous industries.

Additionally, those motivated to complete their education swiftly might consider the shortest mba program online options, which reduce time to graduation while maintaining curriculum quality. Combining mathematics with these complementary business-focused degrees can open diverse, lucrative career avenues.

Best Scientists Citing Endre Boros

Trending Scientists

Recently Published Articles