Michael Tarsi

Publication Activity (10 Years)

Years Active: 1979-2020
Publications (10 Years): 2

Top Topics

Structured Objects

Top Venues

J. Graph Theory

Publications

Michael Tarsi
Bounded-excess flows in cubic graphs. J. Graph Theory 95 (1) (2020)
Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi
Flows and Bisections in Cubic Graphs. J. Graph Theory 86 (2) (2017)
Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu
Short cycle covers of graphs and nowhere-zero flows. J. Graph Theory 68 (4) (2011)
David Tankus, Michael Tarsi
Greedily constructing maximal partial f-factors. Discret. Math. 309 (8) (2009)
Shai Gutner, Michael Tarsi
Some results on (a: b)-choosability. Discret. Math. 309 (8) (2009)
Shai Gutner, Michael Tarsi
Some results on (a:b)-choosability CoRR (2008)
David Tankus, Michael Tarsi
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. Discret. Math. 307 (15) (2007)
Miri Priesler, Michael Tarsi
Multigraph decomposition into stars and into multistars. Discret. Math. 296 (2-3) (2005)
Miri Priesler, Michael Tarsi
On some multigraph decomposition problems and their computational complexity. Discret. Math. 281 (1-3) (2004)
Luis A. Goddyn, Michael Tarsi, Cun-Quan Zhang
)-colorings and fractional nowhere-zero flows. J. Graph Theory 28 (3) (1998)
Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi
Flows, View Obstructions, and the Lonely Runner. J. Comb. Theory, Ser. B 72 (1) (1998)
Noga Alon, Michael Tarsi
A Note on Graph Colorings and Graph Polynomials. J. Comb. Theory, Ser. B 70 (1) (1997)
Dorit Dor, Michael Tarsi
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. SIAM J. Comput. 26 (4) (1997)
David Tankus, Michael Tarsi
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. J. Comb. Theory, Ser. B 69 (2) (1997)
Michael Tarsi
Graphs Where Every Maximal Path Is Maximum. J. Comb. Theory, Ser. B 67 (2) (1996)
Yair Caro, András Sebö, Michael Tarsi
Recognizing Greedy Structures. J. Algorithms 20 (1) (1996)
David Tankus, Michael Tarsi
Well-Covered Claw-Free Graphs. J. Comb. Theory, Ser. B 66 (2) (1996)
François Jaeger, Nathan Linial, Charles Payan, Michael Tarsi
Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties. J. Comb. Theory, Ser. B 56 (2) (1992)
Dorit Dor, Michael Tarsi
Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture STOC (1992)
Noga Alon, Michael Tarsi
Colorings and orientations of graphs. Comb. 12 (2) (1992)
Ury Jamshy, Michael Tarsi
Short cycle covers and the cycle double cover conjecture. J. Comb. Theory, Ser. B 56 (2) (1992)
Edith Cohen, Michael Tarsi
NP-Completeness of graph decomposition problems. J. Complex. 7 (2) (1991)
Ury Jamshy, Michael Tarsi
Cycle covering of binary matroids. J. Comb. Theory, Ser. B 46 (2) (1989)
Noga Alon, Michael Tarsi
A nowhere-zero point in liner mappings. Comb. 9 (4) (1989)
Nathan Linial, Michael Tarsi
Interpolation Between Bases and the Shuffle Exchange Network. Eur. J. Comb. 10 (1) (1989)
Nathan Linial, Roy Meshulam, Michael Tarsi
Matroidal bijections between graphs. J. Comb. Theory, Ser. B 45 (1) (1988)
Ury Jamshy, André Raspaud, Michael Tarsi
Short circuit covers for regular matroids with a nowhere zero 5-flow. J. Comb. Theory, Ser. B 43 (3) (1987)
Judea Pearl, Michael Tarsi
Structuring causal trees. J. Complex. 2 (1) (1986)
Michael Tarsi
Semi-duality and the cycle double cover conjecture. J. Comb. Theory, Ser. B 41 (3) (1986)
Michael Tarsi
Nowhere zero flow and circuit covering in regular matroids. J. Comb. Theory, Ser. B 39 (3) (1985)
Nathan Linial, Michael Tarsi
Deciding Hypergraph 2-Colourability by H-Resolution. Theor. Comput. Sci. 38 (1985)
Michael Tarsi
Optimal Search on Some Game Trees J. ACM 30 (3) (1983)
Michael Tarsi
Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs. J. Comb. Theory, Ser. A 34 (1) (1983)
Nathan Linial, Michael Tarsi
The Counterfeit Coin Problem Revisited. SIAM J. Comput. 11 (3) (1982)
Michael Tarsi
On the decomposition of a graph into stars. Discret. Math. 36 (3) (1981)
Michael Tarsi
Decomposition of complete multigraphs into stars. Discret. Math. 26 (3) (1979)