Endre Boros
Impact in
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Rough Sets and Fuzzy Logic
- Formal Methods in Verification
Papers in
-
- Advanced Graph Theory Research 82
- Complexity and Algorithms in Graphs 63
- Formal Methods in Verification 21
-
- Machine Learning and Algorithms 26
- Co-authors
- Peter L. Hammer (23 shared papers)Vladimir Gurvich (57 shared papers)Leonid Khachiyan (41 shared papers)Khaled Elbassioni (63 shared papers)Toshihide Ibaraki (16 shared papers)Kazuhisa Makino (66 shared papers)Vladimir Gurvich (47 shared papers)Alexander Kogan (11 shared papers)
- Journals
- Discrete Applied Mathematics (27 papers)Discrete Mathematics (19 papers)Annals of Operations Research (11 papers)Theoretical Computer Science (6 papers)Journal of Graph Theory (6 papers)
- Partner nations
- United StatesJapanGermany
In The Last Decade
Endre Boros
220 papers receiving 4.0k citations
Endre Boros's Hit Papers
Peers
Comparison fields: 5 of 125
- Computational Theory and Mathematics 2.1k
- Discrete Mathematics and Combinatorics 245
- Computer Graphics and Computer-Aided Design 278
- Artificial Intelligence 1.6k
- Numerical Analysis 211
Countries citing papers authored by Endre Boros
This map shows the geographic impact of Endre Boros's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Endre Boros with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Endre Boros more than expected).
Fields of papers citing papers by Endre Boros
This network shows the impact of papers produced by Endre Boros. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Endre Boros. The network helps show where Endre Boros may publish in the future.
Co-authors
The 25 scholars most cited alongside Endre Boros, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 236 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Pseudo-Boolean optimization Hit paper breakdown → | 2002 | 559 |
| 2 | 2000 | 316 | |
| 3 | 1997 | 193 | |
| 4 | On the Learnability and Design of Output Codes for Multiclass Problems | 2002 | 96 |
| 5 | 2007 | 89 | |
| 6 | 1989 | 84 | |
| 7 | 2008 | 76 | |
| 8 | 2002 | 70 | |
| 9 | 1991 | 66 | |
| 10 | 1998 | 65 | |
| 11 | 1990 | 64 | |
| 12 | 2007 | 63 | |
| 13 | 2006 | 60 | |
| 14 | 1997 | 53 | |
| 15 | 2016 | 52 | |
| 16 | Preprocessing of unconstrained quadratic binary optimization | 2006 | 52 |
| 17 | 2011 | 50 | |
| 18 | 1994 | 49 | |
| 19 | 1998 | 48 | |
| 20 | 1984 | 48 |
About Endre Boros
Endre Boros is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications and Management Science and Operations Research, having authored 236 papers that have together received 4.3k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (82 papers), Complexity and Algorithms in Graphs (63 papers), Machine Learning and Algorithms (26 papers), Game Theory and Applications (26 papers), graph theory and CDMA systems (24 papers), Game Theory and Voting Systems (22 papers), Formal Methods in Verification (21 papers) and Optimization and Packing Problems (20 papers). The work is most often cited by research in Computational Theory and Mathematics (2.1k citations), Discrete Mathematics and Combinatorics (245 citations), Computer Graphics and Computer-Aided Design (278 citations), Artificial Intelligence (1.6k citations) and Numerical Analysis (211 citations). Endre Boros has collaborated with scholars based in United States, Japan and Germany. Frequent co-authors include Peter L. Hammer, Vladimir Gurvich, Leonid Khachiyan, Khaled Elbassioni, Toshihide Ibaraki, Kazuhisa Makino, Vladimir Gurvich, Alexander Kogan, P. L. Hammer and Yves Crama. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics, Annals of Operations Research, Theoretical Computer Science and Journal of Graph Theory.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.