Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Pseudo-Boolean optimization
2002462 citationsEndre Boros, Peter L. HammerDiscrete Applied Mathematicsprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
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).
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 of co-authors of Endre Boros
This figure shows the co-authorship network connecting the top 25 collaborators of Endre Boros.
A scholar is included among the top collaborators of Endre Boros based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Endre Boros. Endre Boros is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Boros, Endre, et al.. (2018). Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables. Open Repository and Bibliography (University of Liège).3 indexed citations
3.
Boros, Endre, et al.. (2016). A combinatorial min-max theorem and minimization of pure-Horn functions..
4.
Bodlaender, Hans L., Endre Boros, Pinar Heggernes, & Dieter Kratsch. (2015). Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure". Utrecht University Repository (Utrecht University).3 indexed citations
Boros, Endre. (2002). On the Learnability and Design of Output Codes for Multiclass Problems. Machine Learning.86 indexed citations
15.
Kantor, Paul B., et al.. (1999). The Information Quest: A Dynamic Model of User's Information Needs.. Proceedings of the ASIS Annual Meeting. 36.9 indexed citations
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.