Barry O’Sullivan
Impact in
-
- Constraint Satisfaction and Optimization
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Formal Methods in Verification
Papers in
-
- Constraint Satisfaction and Optimization 131
-
- AI-based Problem Solving and Planning 34
- Co-authors
- Igor Razgon (10 shared papers)Deepak Mehta (46 shared papers)Christian Bessière (11 shared papers)Emmanuel Hébrard (9 shared papers)Helmut Simonis (20 shared papers)Eugene C. Freuder (16 shared papers)Hadrien Cambazard (15 shared papers)Songjian Lu (2 shared papers)
In The Last Decade
Barry O’Sullivan
253 papers receiving 2.5k citations
Peers
Comparison fields: 5 of 152
- Computer Networks and Communications 1.1k
- Computational Theory and Mathematics 622
- Industrial and Manufacturing Engineering 365
- Software 144
- Artificial Intelligence 889
Countries citing papers authored by Barry O’Sullivan
This map shows the geographic impact of Barry O’Sullivan'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 Barry O’Sullivan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Barry O’Sullivan more than expected).
Fields of papers citing papers by Barry O’Sullivan
This network shows the impact of papers produced by Barry O’Sullivan. 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 Barry O’Sullivan. The network helps show where Barry O’Sullivan may publish in the future.
Co-authors
The 25 scholars most cited alongside Barry O’Sullivan, 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 283 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 166 | |
| 2 | 2016 | 83 | |
| 3 | 2009 | 82 | |
| 4 | 2019 | 76 | |
| 5 | 2014 | 72 | |
| 6 | Finding diverse and similar solutions in constraint programming | 2005 | 69 |
| 7 | 2015 | 61 | |
| 8 | 2013 | 59 | |
| 9 | 2010 | 59 | |
| 10 | 2012 | 57 | |
| 11 | Representative explanations for over-constrained problems | 2007 | 52 |
| 12 | 2005 | 51 | |
| 13 | 2014 | 49 | |
| 14 | 2008 | 46 | |
| 15 | 2003 | 43 | |
| 16 | 2008 | 42 | |
| 17 | 2009 | 40 | |
| 18 | 2012 | 39 | |
| 19 | Query-driven constraint acquisition | 2007 | 38 |
| 20 | 2014 | 37 |
About Barry O’Sullivan
Barry O’Sullivan is a scholar working on Computer Networks and Communications, Artificial Intelligence, Industrial and Manufacturing Engineering, Signal Processing and Computational Theory and Mathematics, having authored 283 papers that have together received 2.6k indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (131 papers), Data Management and Algorithms (44 papers), AI-based Problem Solving and Planning (34 papers), Scheduling and Optimization Algorithms (22 papers), Vehicle Routing Optimization Methods (20 papers), Model-Driven Software Engineering Techniques (18 papers), Scheduling and Timetabling Solutions (18 papers) and Advanced Optical Network Technologies (18 papers). The work is most often cited by research in Computer Networks and Communications (1.1k citations), Computational Theory and Mathematics (622 citations), Industrial and Manufacturing Engineering (365 citations), Software (144 citations) and Artificial Intelligence (889 citations). Barry O’Sullivan has collaborated with scholars based in Ireland, France and Italy. Frequent co-authors include Igor Razgon, Deepak Mehta, Christian Bessière, Emmanuel Hébrard, Helmut Simonis, Eugene C. Freuder, Hadrien Cambazard, Songjian Lu, Jianer Chen and Yang Liu. Their work appears in journals such as Lecture notes in computer science, Constraints, IEEE Intelligent Systems, AI Magazine and Artificial intelligence for engineering design analysis and manufacturing.
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.