Oliver Kullmann
-
- Formal Methods in Verification 8
- Advanced Graph Theory Research 7
- Advanced Algebra and Logic 4
- semigroups and automata theory 3
- Complexity and Algorithms in Graphs 2
- Software top 10%
-
- Constraint Satisfaction and Optimization 12
- Artificial Intelligence top 10%
- Logic, Reasoning, and Knowledge 6
- Logic, programming, and type systems 4
- Journals
- Discrete Applied Mathematics (4 papers)Theoretical Computer Science (3 papers)Communications of the ACM (1 paper)
- Partner nations
- United KingdomCanadaUnited States
In The Last Decade
Oliver Kullmann
23 papers receiving 321 citations
Peers
Comparison fields: 5 of 52
- Computational Theory and Mathematics 267
- Software 39
- Computer Networks and Communications 137
- Artificial Intelligence 185
- Computer Graphics and Computer-Aided Design 12
Countries citing papers authored by Oliver Kullmann
This map shows the geographic impact of Oliver Kullmann'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 Oliver Kullmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oliver Kullmann more than expected).
Fields of papers citing papers by Oliver Kullmann
This network shows the impact of papers produced by Oliver Kullmann. 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 Oliver Kullmann. The network helps show where Oliver Kullmann may publish in the future.
Co-authorship network
The 4 scholars most cited alongside Oliver Kullmann, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 1 | |
| 2 | 2022 | 1 | |
| 3 | 2017 | 48 | |
| 4 | 2014 | 6 | |
| 5 | 2013 | 4 | |
| 6 | 2011 | 8 | |
| 7 | The OKlibrary: Introducing a "holistic" research platform for (generalised) SAT solving | 2009 | 3 |
| 8 | The OKlibrary: A generative research platform for (generalised) SAT solving | 2008 | 3 |
| 9 | Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. | 2007 | 3 |
| 10 | 2006 | 2 | |
| 11 | 2006 | 11 | |
| 12 | 2004 | 11 | |
| 13 | 2003 | 23 | |
| 14 | 2002 | 46 | |
| 15 | 2002 | 9 | |
| 16 | An improved version of width restricted resolution. | 2000 | 2 |
| 17 | 2000 | 34 | |
| 18 | Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs | 1999 | 16 |
| 19 | 1999 | 36 | |
| 20 | 1999 | 76 |
About Oliver Kullmann
Oliver Kullmann is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Hardware and Architecture and Computer Graphics and Computer-Aided Design, having authored 23 papers that have together received 357 indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (12 papers), Formal Methods in Verification (8 papers), Advanced Graph Theory Research (7 papers), Logic, Reasoning, and Knowledge (6 papers), Advanced Algebra and Logic (4 papers), Logic, programming, and type systems (4 papers), semigroups and automata theory (3 papers) and Complexity and Algorithms in Graphs (2 papers). The work is most often cited by research in Computational Theory and Mathematics (267 citations), Software (39 citations), Computer Networks and Communications (137 citations), Artificial Intelligence (185 citations) and Computer Graphics and Computer-Aided Design (12 citations). Oliver Kullmann has collaborated with scholars based in United Kingdom, Canada and United States. Frequent co-authors include Marijn J. H. Heule, Herbert Fleischner, Stefan Szeider and Hunter S. Snevily. Their work appears in journals such as Discrete Applied Mathematics, Theoretical Computer Science, Communications of the ACM, Annals of Mathematics and Artificial Intelligence and Fundamenta Informaticae.
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.