Michael Tarsi

2.1k total citations
37 papers, 1.2k citations indexed

About

Michael Tarsi is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Michael Tarsi has authored 37 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 13 papers in Electrical and Electronic Engineering and 12 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Michael Tarsi's work include Advanced Graph Theory Research (23 papers), graph theory and CDMA systems (13 papers) and Limits and Structures in Graph Theory (9 papers). Michael Tarsi is often cited by papers focused on Advanced Graph Theory Research (23 papers), graph theory and CDMA systems (13 papers) and Limits and Structures in Graph Theory (9 papers). Michael Tarsi collaborates with scholars based in Israel, United States and France. Michael Tarsi's 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 and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Michael Tarsi

37 papers receiving 1.1k citations

Peers

Michael Tarsi
Arthur T. White United States
Stéphan Thomassé France
Wayne Goddard United States
Michael D. Plummer United States
Renu Laskar United States
Paul A. Catlin United States
Aiden A. Bruen Canada
C. A. Rodger United States
Mikio Kanō Japan
Xuding Zhu Taiwan
Arthur T. White United States
Michael Tarsi
Citations per year, relative to Michael Tarsi Michael Tarsi (= 1×) peers Arthur T. White

Countries citing papers authored by Michael Tarsi

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Michael Tarsi

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Tarsi. A scholar is included among the top collaborators of Michael Tarsi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Tarsi. Michael Tarsi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gutner, Shai & Michael Tarsi. (2008). Some results on (a:b)-choosability. Discrete Mathematics. 309(8). 2260–2270. 12 indexed citations
2.
Tarsi, Michael, et al.. (2007). Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. Discrete Mathematics. 307(15). 1833–1843. 4 indexed citations
3.
Tarsi, Michael, et al.. (2003). On some multigraph decomposition problems and their computational complexity. Discrete Mathematics. 281(1-3). 247–254. 3 indexed citations
4.
Bienia, Wojciech, et al.. (1998). Flows, View Obstructions, and the Lonely Runner. Journal of Combinatorial Theory Series B. 72(1). 1–9. 35 indexed citations
5.
Tarsi, Michael, et al.. (1997). The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. Journal of Combinatorial Theory Series B. 69(2). 230–233. 27 indexed citations
6.
Alon, Noga & Michael Tarsi. (1997). A Note on Graph Colorings and Graph Polynomials. Journal of Combinatorial Theory Series B. 70(1). 197–201. 13 indexed citations
7.
Tarsi, Michael. (1996). Graphs Where Every Maximal Path Is Maximum. Journal of Combinatorial Theory Series B. 67(2). 304–324. 5 indexed citations
8.
Tarsi, Michael, et al.. (1996). Well-Covered Claw-Free Graphs. Journal of Combinatorial Theory Series B. 66(2). 293–302. 27 indexed citations
9.
Jaeger, François, Nathan Linial, Charles Payan, & Michael Tarsi. (1992). Group connectivity of graphs—A nonhomogeneous analogue of nowhere-zero flow properties. Journal of Combinatorial Theory Series B. 56(2). 165–182. 112 indexed citations
10.
Tarsi, Michael, et al.. (1992). Short cycle covers and the cycle double cover conjecture. Journal of Combinatorial Theory Series B. 56(2). 197–204. 25 indexed citations
11.
Cohen, Edith & Michael Tarsi. (1991). NP-Completeness of graph decomposition problems. Journal of Complexity. 7(2). 200–212. 31 indexed citations
12.
Linial, Nathan & Michael Tarsi. (1989). Interpolation Between Bases and the Shuffle Exchange Network. European Journal of Combinatorics. 10(1). 29–39. 23 indexed citations
13.
Tarsi, Michael, et al.. (1989). Cycle covering of binary matroids. Journal of Combinatorial Theory Series B. 46(2). 154–161. 12 indexed citations
14.
Raspaud, André, et al.. (1987). Short circuit covers for regular matroids with a nowhere zero 5-flow. Journal of Combinatorial Theory Series B. 43(3). 354–357. 16 indexed citations
15.
Pearl, Judea & Michael Tarsi. (1986). Structuring causal trees. Journal of Complexity. 2(1). 60–77. 47 indexed citations
16.
Tarsi, Michael. (1986). Semi-duality and the cycle double cover conjecture. Journal of Combinatorial Theory Series B. 41(3). 332–340. 17 indexed citations
17.
Tarsi, Michael. (1985). Nowhere zero flow and circuit covering in regular matroids. Journal of Combinatorial Theory Series B. 39(3). 346–352. 12 indexed citations
18.
Tarsi, Michael. (1983). Decomposition of a complete multigraph into simple paths: Nonbalanced handcuffed designs. Journal of Combinatorial Theory Series A. 34(1). 60–70. 69 indexed citations
19.
Tarsi, Michael. (1981). On the decomposition of a graph into stars. Discrete Mathematics. 36(3). 299–304. 19 indexed citations
20.
Tarsi, Michael. (1979). Decomposition of complete multigraphs into stars. Discrete Mathematics. 26(3). 273–278. 45 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Arthur T. White Breakdown of academic impact, for papers by Stéphan Thomassé Breakdown of academic impact, for papers by Wayne Goddard Breakdown of academic impact, for papers by Michael D. Plummer Breakdown of academic impact, for papers by Renu Laskar Breakdown of academic impact, for papers by Paul A. Catlin Breakdown of academic impact, for papers by Aiden A. Bruen Breakdown of academic impact, for papers by C. A. Rodger Breakdown of academic impact, for papers by Mikio Kanō Breakdown of academic impact, for papers by Xuding Zhu
Rankless by CCL
2026