Decomposition of complete multigraphs into stars. - Michael Tarsi (Discret. Math., 1979)

On the decomposition of a graph into stars. - Michael Tarsi (Discret. Math., 1981)

The Counterfeit Coin Problem Revisited. - Nathan Linial; Michael Tarsi (SIAM J. Comput., 1982)

Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs. - Michael Tarsi (J. Comb. Theory A, 1983)

Optimal Search on Some Game Trees - Michael Tarsi (J. ACM, 1983)

Nowhere zero flow and circuit covering in regular matroids. - Michael Tarsi (J. Comb. Theory B, 1985)

Deciding Hypergraph 2-Colourability by H-Resolution. - Nathan Linial; Michael Tarsi (Theor. Comput. Sci., 1985)

Structuring causal trees. - Judea Pearl; Michael Tarsi (J. Complex., 1986)

Semi-duality and the cycle double cover conjecture. - Michael Tarsi (J. Comb. Theory B, 1986)

Short circuit covers for regular matroids with a nowhere zero 5-flow. - Ury Jamshy; André Raspaud; Michael Tarsi (J. Comb. Theory B, 1987)

Matroidal bijections between graphs. - Nathan Linial; Roy Meshulam; Michael Tarsi (J. Comb. Theory B, 1988)

A nowhere-zero point in liner mappings. - Noga Alon; Michael Tarsi (Comb., 1989)

Interpolation Between Bases and the Shuffle Exchange Network. - Nathan Linial; Michael Tarsi (Eur. J. Comb., 1989)

Cycle covering of binary matroids. - Ury Jamshy; Michael Tarsi (J. Comb. Theory B, 1989)

NP-Completeness of graph decomposition problems. - Edith Cohen; Michael Tarsi (J. Complex., 1991)

Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture - Dorit Dor; Michael Tarsi (STOC, 1992)

Colorings and orientations of graphs. - Noga Alon; Michael Tarsi (Comb., 1992)

Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties. - François Jaeger; Nathan Linial; Charles Payan; Michael Tarsi (J. Comb. Theory B, 1992)

Short cycle covers and the cycle double cover conjecture. - Ury Jamshy; Michael Tarsi (J. Comb. Theory B, 1992)

Recognizing Greedy Structures. - Yair Caro; András Sebö; Michael Tarsi (J. Algorithms, 1996)

Well-Covered Claw-Free Graphs. - David Tankus; Michael Tarsi (J. Comb. Theory B, 1996)

Graphs Where Every Maximal Path Is Maximum. - Michael Tarsi (J. Comb. Theory B, 1996)

A Note on Graph Colorings and Graph Polynomials. - Noga Alon; Michael Tarsi (J. Comb. Theory B, 1997)

The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. - David Tankus; Michael Tarsi (J. Comb. Theory B, 1997)

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. - Dorit Dor; Michael Tarsi (SIAM J. Comput., 1997)

Flows, View Obstructions, and the Lonely Runner. - Wojciech Bienia; Luis A. Goddyn; Pavol Gvozdjak; András Sebö; Michael Tarsi (J. Comb. Theory B, 1998)

On (k, d)-colorings and fractional nowhere-zero flows. - Luis A. Goddyn; Michael Tarsi; Cun-Quan Zhang (J. Graph Theory, 1998)

On some multigraph decomposition problems and their computational complexity. - Miri Priesler; Michael Tarsi (Discret. Math., 2004)

Multigraph decomposition into stars and into multistars. - Miri Priesler; Michael Tarsi (Discret. Math., 2005)

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. - David Tankus; Michael Tarsi (Discret. Math., 2007)

Some results on (a:b)-choosability - Shai Gutner; Michael Tarsi (CoRR, 2008)

Some results on (a: b)-choosability. - Shai Gutner; Michael Tarsi (Discret. Math., 2009)

Greedily constructing maximal partial f-factors. - David Tankus; Michael Tarsi (Discret. Math., 2009)

Short cycle covers of graphs and nowhere-zero flows. - Edita Mácajová; André Raspaud; Michael Tarsi; Xuding Zhu (J. Graph Theory, 2011)

Flows and Bisections in Cubic Graphs. - Louis Esperet; Giuseppe Mazzuoccolo; Michael Tarsi (J. Graph Theory, 2017)

Bounded-excess flows in cubic graphs. - Michael Tarsi (J. Graph Theory, 2020)