Barry O’Sullivan
Impact in
-
- Constraint Satisfaction and Optimization
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Constraint Satisfaction and Optimization 71
-
- AI-based Problem Solving and Planning 17
- Co-authors
- Igor Razgon (5 shared papers)Emmanuel Hébrard (5 shared papers)Deepak Mehta (25 shared papers)Songjian Lu (2 shared papers)Yang Liu (2 shared papers)Jianer Chen (2 shared papers)Christian Bessière (5 shared papers)Eugene C. Freuder (9 shared papers)
In The Last Decade
Barry O’Sullivan
149 papers receiving 1.3k citations
Peers
Comparison fields: 5 of 126
- Computer Networks and Communications 486
- Computational Theory and Mathematics 295
- Industrial and Manufacturing Engineering 163
- Management Science and Operations Research 150
- Artificial Intelligence 365
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 171 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 105 | |
| 2 | 2016 | 80 | |
| 3 | 2014 | 68 | |
| 4 | 2009 | 56 | |
| 5 | Finding diverse and similar solutions in constraint programming | 2005 | 50 |
| 6 | 2012 | 50 | |
| 7 | 2010 | 46 | |
| 8 | 2015 | 42 | |
| 9 | 2013 | 41 | |
| 10 | 2003 | 39 | |
| 11 | Representative explanations for over-constrained problems | 2007 | 36 |
| 12 | 2014 | 36 | |
| 13 | 2014 | 27 | |
| 14 | Query-driven constraint acquisition | 2007 | 25 |
| 15 | 2008 | 23 | |
| 16 | 2002 | 22 | |
| 17 | 2021 | 22 | |
| 18 | 2014 | 20 | |
| 19 | 2016 | 19 | |
| 20 | 2022 | 17 |
About Barry O’Sullivan
Barry O’Sullivan is a scholar working on Computer Networks and Communications, Artificial Intelligence, Computational Theory and Mathematics, Management Science and Operations Research and Information Systems, having authored 171 papers that have together received 1.3k indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (71 papers), Data Management and Algorithms (22 papers), AI-based Problem Solving and Planning (17 papers), Advanced Optical Network Technologies (14 papers), Scheduling and Optimization Algorithms (12 papers), Optical Network Technologies (11 papers), Scheduling and Timetabling Solutions (11 papers) and Cloud Computing and Resource Management (10 papers). The work is most often cited by research in Computer Networks and Communications (486 citations), Computational Theory and Mathematics (295 citations), Industrial and Manufacturing Engineering (163 citations), Management Science and Operations Research (150 citations) and Artificial Intelligence (365 citations). Barry O’Sullivan has collaborated with scholars based in Ireland, Italy and France. Frequent co-authors include Igor Razgon, Emmanuel Hébrard, Deepak Mehta, Songjian Lu, Yang Liu, Jianer Chen, Christian Bessière, Eugene C. Freuder, Toby Walsh and Hadrien Cambazard. Their work appears in journals such as Constraints, AI Magazine, IEEE Intelligent Systems, Theoretical Computer Science and Journal of Heuristics.
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.