Michael Tarsi
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 23
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 6
-
- graph theory and CDMA systems 13
- Co-authors
- Noga Alon (4 shared papers)Dorit Dor (3 shared papers)Nathan Linial (5 shared papers)Charles Payan (1 shared paper)François Jaeger (1 shared paper)Judea Pearl (1 shared paper)Luis Goddyn (2 shared papers)Edith Cohen (1 shared paper)
- Journals
- Journal of Combinatorial Theory Series B (12 papers)Discrete Mathematics (7 papers)Journal of Graph Theory (2 papers)Journal of Complexity (2 papers)COMBINATORICA (2 papers)
- Partner nations
- IsraelUnited StatesFrance
In The Last Decade
Michael Tarsi
37 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 68
- Discrete Mathematics and Combinatorics 439
- Computational Theory and Mathematics 875
- Computer Graphics and Computer-Aided Design 68
- Geometry and Topology 151
- Computer Networks and Communications 219
Countries citing papers authored by Michael Tarsi
This map shows the geographic impact of Michael Tarsi'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 Michael Tarsi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Tarsi more than expected).
Fields of papers citing papers by Michael Tarsi
This network shows the impact of papers produced by Michael Tarsi. 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 Michael Tarsi. The network helps show where Michael Tarsi may publish in the future.
Co-authors
The 17 scholars most cited alongside Michael Tarsi, 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 37 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1992 | 253 | |
| 2 | 1992 | 112 | |
| 3 | 1997 | 73 | |
| 4 | 1983 | 70 | |
| 5 | 1986 | 48 | |
| 6 | 1979 | 46 | |
| 7 | 1985 | 46 | |
| 8 | 1998 | 39 | |
| 9 | 1992 | 37 | |
| 10 | 1989 | 37 | |
| 11 | 1998 | 35 | |
| 12 | A simple algorithm to construct a consistent extension of a partially oriented graph | 1992 | 35 |
| 13 | 1983 | 35 | |
| 14 | 1996 | 34 | |
| 15 | 1991 | 31 | |
| 16 | 1997 | 27 | |
| 17 | 1996 | 27 | |
| 18 | 1992 | 25 | |
| 19 | 1989 | 24 | |
| 20 | 1988 | 19 |
About Michael Tarsi
Michael Tarsi is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics, Artificial Intelligence and Computer Networks and Communications, having authored 37 papers that have together received 1.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (23 papers), graph theory and CDMA systems (13 papers), Limits and Structures in Graph Theory (9 papers), Graph Labeling and Dimension Problems (8 papers), Complexity and Algorithms in Graphs (6 papers), Interconnection Networks and Systems (5 papers), Graph theory and applications (3 papers) and Coding theory and cryptography (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (439 citations), Computational Theory and Mathematics (875 citations), Computer Graphics and Computer-Aided Design (68 citations), Geometry and Topology (151 citations) and Computer Networks and Communications (219 citations). Michael Tarsi has collaborated with scholars based in Israel, United States and France. Frequent co-authors include Noga Alon, Dorit Dor, Nathan Linial, Charles Payan, François Jaeger, Judea Pearl, Luis Goddyn, Edith Cohen, Cun‐Quan Zhang and Yair Caro. Their work appears in journals such as Journal of Combinatorial Theory Series B, Discrete Mathematics, Journal of Graph Theory, Journal of Complexity and COMBINATORICA.
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.