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.
This map shows the geographic impact of Bart Selman'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 Bart Selman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bart Selman more than expected).
This network shows the impact of papers produced by Bart Selman. 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 Bart Selman. The network helps show where Bart Selman may publish in the future.
Co-authorship network of co-authors of Bart Selman
This figure shows the co-authorship network connecting the top 25 collaborators of Bart Selman.
A scholar is included among the top collaborators of Bart Selman 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 Bart Selman. Bart Selman is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Ermon, Stefano, Carla P. Gomes, Ashish Sabharwal, & Bart Selman. (2014). Low-density Parity Constraints for Hashing-Based Discrete Integration. International Conference on Machine Learning. 271–279.28 indexed citations
2.
Ermon, Stefano, Carla P. Gomes, Ashish Sabharwal, & Bart Selman. (2011). Accelerated Adaptive Markov Chain for Partition Function Computation. Neural Information Processing Systems. 24. 2744–2752.6 indexed citations
Kroc, Lukáš, Ashish Sabharwal, Carla P. Gomes, & Bart Selman. (2009). Integrating systematic and local search paradigms: a new strategy for MaxSAT. International Joint Conference on Artificial Intelligence. 544–551.22 indexed citations
7.
Gomes, Carla P., Ashish Sabharwal, & Bart Selman. (2006). Model counting: a new strategy for obtaining good bounds. National Conference on Artificial Intelligence. 54–61.56 indexed citations
8.
Interian, Yannet, et al.. (2006). Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs..1 indexed citations
9.
Hoffmann, Jöerg, Carla P. Gomes, & Bart Selman. (2006). STRUCTURE AND PROBLEM HARDNESS: GOAL ASYMMETRY AND DPLL PROOFS IN SAT-BASED PLANNING.8 indexed citations
10.
Kautz, Henry, Eric Horvitz, Yongshao Ruan, Carla P. Gomes, & Bart Selman. (2002). Dynamic restart policies. National Conference on Artificial Intelligence. 674–681.57 indexed citations
11.
Huang, Yi‐Cheng, Bart Selman, & Henry Kautz. (2000). Learning Declarative Control Rules for Constraint-BAsed Planning. International Conference on Machine Learning. 415–422.27 indexed citations
12.
Huang, Yi‐Cheng, Bart Selman, & Henry Kautz. (1999). Control knowledge in planning: benefits and tradeoffs. National Conference on Artificial Intelligence. 511–517.31 indexed citations
13.
McAllester, David, Bart Selman, & Henry Kautz. (1997). Evidence for invariants in local search. National Conference on Artificial Intelligence. 321–326.184 indexed citations
14.
Gomes, Carla P. & Bart Selman. (1997). Problem structure in the presence of perturbations. National Conference on Artificial Intelligence. 221–226.67 indexed citations
15.
Kautz, Henry, David McAllester, & Bart Selman. (1996). Encoding plans in propositional logic. Principles of Knowledge Representation and Reasoning. 374–384.175 indexed citations
16.
Kautz, Henry, et al.. (1995). The comparative linguistics of knowledge representation. International Joint Conference on Artificial Intelligence. 862–869.60 indexed citations
17.
Selman, Bart. (1994). Domain-specific complexity tradeoffs. European Conference on Artificial Intelligence. 416–420.1 indexed citations
18.
Kautz, Henry, Michael Kearns, & Bart Selman. (1993). Reasoning with characteristic models. National Conference on Artificial Intelligence. 34–39.33 indexed citations
19.
Kautz, Henry & Bart Selman. (1992). Planning as satisfiability. European Conference on Artificial Intelligence. 359–363.461 indexed citations breakdown →
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.