Johann A. Makowsky
-
- Advanced Combinatorial Mathematics 19
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research 28
- semigroups and automata theory 16
- Advanced Algebra and Logic 15
- Formal Methods in Verification 14
- Computability, Logic, AI Algorithms 14
- Geometry and Topology top 2%
- Artificial Intelligence top 5%
- Logic, Reasoning, and Knowledge 24
- Logic, programming, and type systems 14
Johann A. Makowsky
71 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 62
- Discrete Mathematics and Combinatorics 250
- Computational Theory and Mathematics 966
- Geometry and Topology 286
- Computer Networks and Communications 280
- Artificial Intelligence 372
Countries citing papers authored by Johann A. Makowsky
This map shows the geographic impact of Johann A. Makowsky'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 Johann A. Makowsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Johann A. Makowsky more than expected).
Fields of papers citing papers by Johann A. Makowsky
This network shows the impact of papers produced by Johann A. Makowsky. 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 Johann A. Makowsky. The network helps show where Johann A. Makowsky may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Johann A. Makowsky, 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 | 2021 | 0 | |
| 2 | 2017 | 1 | |
| 3 | 2014 | 5 | |
| 4 | 2011 | 15 | |
| 5 | 2009 | 25 | |
| 6 | Computing graph polynomials on graphs of bounded clique-width | 2008 | 1 |
| 7 | 2007 | 40 | |
| 8 | 2004 | 86 | |
| 9 | 2003 | 8 | |
| 10 | 2001 | 18 | |
| 11 | 2001 | 98 | |
| 12 | Review: Heikki Mannila, Kari-Jouko Raiha, The Design of Relational Databases; Serge Abiteboul, Richard Hull, Victor Vianu, Foundations of Databases; Paris C. Kanellakis, Jan van Leeuwen, Elements of Relational Database Theory | 1997 | 1 |
| 13 | Invariant Definability (Extended Abstract) | 1997 | 1 |
| 14 | 1997 | 29 | |
| 15 | 1991 | 1 | |
| 16 | 1988 | 8 | |
| 17 | 1987 | 35 | |
| 18 | On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems | 1986 | 6 |
| 19 | 1985 | 31 | |
| 20 | Problemi di decidibilità in logica topologica | 1976 | 1 |
About Johann A. Makowsky
Johann A. Makowsky is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 80 papers that have together received 1.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (28 papers), Logic, Reasoning, and Knowledge (24 papers), Advanced Combinatorial Mathematics (19 papers), semigroups and automata theory (16 papers), Advanced Algebra and Logic (15 papers), Logic, programming, and type systems (14 papers), Formal Methods in Verification (14 papers) and Computability, Logic, AI Algorithms (14 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (250 citations), Computational Theory and Mathematics (966 citations) and Geometry and Topology (286 citations). Johann A. Makowsky has collaborated with scholars based in Israel, France and Germany. Frequent co-authors include Udi Rotics, B. Courcelle, Victor Markowitz, Bruno Courcelle, Saharon Shelah, E. Fischer, Jonathan Stavi, Julián P. Mariño, Benny Godlin and Willem P. de Roever.
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.