Bart Selman

19.7k citations
176 papers · 13.1k · 7 hit papers · h-index 53

Impact in

Papers in

Bart Selman

171 papers receiving 11.7k citations

Bart Selman's Hit Papers

Determining computational complexity from characteristic ‘phase transitions’ 1999 · 534 citations
5340+11+22Years since publication250500750

Peers

Bart Selman
Comparison fields: 5 of 157
  • Computer Networks and Communications 6.1k
  • Artificial Intelligence 8.1k
  • Computational Theory and Mathematics 3.7k
  • Software 942
  • Signal Processing 1.5k
Replace Toby Walsh with:
Toby Walsh Australia
Christos H. Papadimitriou United States
John E. Hopcroft United States
Krzysztof R. Apt Netherlands
Mihalis Yannakakis United States
Michael Luby United States
Brian W. Kernighan United States
Joseph Y. Halpern United States
Roberto Tamassia United States
Leslie G. Valiant United States
Bart Selman relative to Toby Walsh Australia Toby Walsh's profile →
Citations per field
00.5×1.5×
Toby Walsh · 1×
Citations per year

Countries citing papers authored by Bart Selman

Since Specialization
Citations

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).

Fields of papers citing papers by Bart Selman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authors

The 25 scholars most cited alongside Bart Selman, 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 Bart Selman Line = papers co-authored together Bart Selman links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 176 papers — load more, or switch the sort, to bring in the rest.

#Work
1
A new method for solving hard satisfiability problems
Hit paper breakdown →
1992938
2
Referral Web
Hit paper breakdown →
1997682
3
Pushing the envelope: planning, propositional logic, and stochastic search
Hit paper breakdown →
1996660
4
Planning as satisfiability
Hit paper breakdown →
1992628
5
Noise strategies for improving local search
Hit paper breakdown →
1994615
6
Hard and easy distributions of SAT problems
Hit paper breakdown →
1992600
7
Determining computational complexity from characteristic ‘phase transitions’
Hit paper breakdown →
1999534
8
Boosting combinatorial search through randomization
1998405
9 1994394
10 1996392
11
Unifying SAT-based and graph-based planning
1999324
12 2001320
13
Evidence for invariants in local search
1997288
14 2000261
15
Domain-independent extensions to GSAT: solving large structured satisfiability problems
1993239
16
Human Activity Detection from RGBD Images
2011225
17
Encoding plans in propositional logic
1996218
18 1996215
19 1996213
20 2004212

About Bart Selman

Bart Selman is a scholar working on Artificial Intelligence, Computer Networks and Communications, Computational Theory and Mathematics, Signal Processing and Management Science and Operations Research, having authored 176 papers that have together received 13.1k indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (63 papers), Logic, Reasoning, and Knowledge (45 papers), AI-based Problem Solving and Planning (36 papers), Bayesian Modeling and Causal Inference (36 papers), Machine Learning and Algorithms (26 papers), Data Management and Algorithms (25 papers), Semantic Web and Ontologies (18 papers) and Formal Methods in Verification (16 papers). The work is most often cited by research in Computer Networks and Communications (6.1k citations), Artificial Intelligence (8.1k citations), Computational Theory and Mathematics (3.7k citations), Software (942 citations) and Signal Processing (1.5k citations). Bart Selman has collaborated with scholars based in United States, Canada and United Kingdom. Frequent co-authors include Henry Kautz, Carla P. Gomes, Hector J. Levesque, David G. M. Mitchell, Scott Kirkpatrick, Mehul A. Shah, David McAllester, Bram Cohen, Ashish Sabharwal and Riccardo Zecchina. Their work appears in journals such as Artificial Intelligence, Communications of the ACM, Lecture notes in computer science, Journal of Automated Reasoning and Nature.

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