Endre Boros

179 papers receiving 2.8k citations

Hit Papers

Pseudo-Boolean optimization4622002202620102018100200300400

Peers

Endre Boros
Comparison fields: 5 of 122
  • Computational Theory and Mathematics 1.4k
  • Discrete Mathematics and Combinatorics 201
  • Computer Graphics and Computer-Aided Design 167
  • Artificial Intelligence 1.2k
  • Numerical Analysis 183
Replace Peter L. Hammer with:
Peter L. Hammer United States
Adam N. Letchford United Kingdom
Leonid Khachiyan United States
Gregory Gutin United Kingdom
Howard Karloff United States
Bruno Simeone Italy
Venkatesan Guruswami United States
Kazuo Murota Japan
Robert E. Bixby United States
Sanjeev Khanna United States
Endre Boros relative to Peter L. Hammer United States Peter L. Hammer's profile →
Citations per field
00.5×1.5×
Peter L. Hammer · 1×
Citations per year

Countries citing papers authored by Endre Boros

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network

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.

Border = papers with Endre Boros Line = papers co-authored together Endre Boros links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20231
2
Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables
20183
3
A combinatorial min-max theorem and minimization of pure-Horn functions.
20160
4
Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure"
20153
5 20139
6
Hardness Results for Approximate Pure Horn CNF Formulae Minimization.
20123
7 20121
8
Incompatibility graphs and data mining.
20112
9
On split and almost CIS-graphs.
20098
10 200612
11
Comparison of Convex Hulls and Box Hulls.
20052
12 200513
13 20042
14
On the Learnability and Design of Output Codes for Multiclass Problems
200286
15 19991
16
The Information Quest: A Dynamic Model of User's Information Needs.
19999
17 19999
18
On Minimally Imperfect Graphs with Circular Symmetry
199711
19 199438
20 19873

About Endre Boros

Endre Boros is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering and Management Science and Operations Research, having authored 195 papers that have together received 3.1k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (72 papers), Complexity and Algorithms in Graphs (51 papers), graph theory and CDMA systems (23 papers), Game Theory and Applications (22 papers), Game Theory and Voting Systems (21 papers), Optimization and Packing Problems (20 papers), Machine Learning and Algorithms (19 papers) and Computational Geometry and Mesh Generation (15 papers). The work is most often cited by research in Computational Theory and Mathematics (1.4k citations), Discrete Mathematics and Combinatorics (201 citations), Computer Graphics and Computer-Aided Design (167 citations), Artificial Intelligence (1.2k citations) and Numerical Analysis (183 citations). Endre Boros has collaborated with scholars based in United States, Japan and Germany. Frequent co-authors include Peter L. Hammer, Vladimir Gurvich, Toshihide Ibaraki, Alexander Kogan, Khaled Elbassioni, Leonid Khachiyan, Vladimir Gurvich, P. L. Hammer, Kazuhisa Makino and Yves Crama. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics, Annals of Operations Research, Journal of Graph Theory and International Journal of Game 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026