Michael Tarsi

发表

Interpolation Between Bases and the Shuffle Exchange Network

Nathan Linial, Michael Tarsi, N. Linial, 1989, Eur. J. Comb..

Colorings and orientations of graphs

Noga Alon, Michael Tarsi, N. Alon, 1992, Comb..

Cycle covering of binary matroids

Michael Tarsi, Ury Jamshy, M. Tarsi, 1989, J. Comb. Theory, Ser. B.

Bounded-excess flows in cubic graphs

Michael Tarsi, 2020, J. Graph Theory.

Circuit Double Cover of Graphs: Foreword

Michael Tarsi, 2012 .

Multigraph decomposition into stars and into multistars

Michael Tarsi, Miri Priesler, 2005, Discret. Math..

Well-Covered Claw-Free Graphs

Michael Tarsi, David Tankus, 1996, J. Comb. Theory, Ser. B.

Some results on (a: b)-choosability

Shai Gutner, Michael Tarsi, M. Tarsi, 2008, Discret. Math..

Recognizing Greedy Structures

Yair Caro, András Sebö, Michael Tarsi, 1996, J. Algorithms.

Graph decomposition is NPC - a complete proof of Holyer's conjecture

Michael Tarsi, Dorit Dor, M. Tarsi, 1992, STOC '92.

A Note on Graph Colorings and Graph Polynomials

Noga Alon, Michael Tarsi, 1997, J. Comb. Theory, Ser. B.

Semi-duality and the cycle double cover conjecture

Michael Tarsi, M. Tarsi, 1986, J. Comb. Theory, Ser. B.

Optimal Search on Some Game Trees

Michael Tarsi, M. Tarsi, 1983, JACM.

Short cycle covers and the cycle double cover conjecture

Michael Tarsi, Ury Jamshy, M. Tarsi, 1992, J. Comb. Theory, Ser. B.

Structuring causal trees

Judea Pearl, Michael Tarsi, J. Pearl, 1986, J. Complex..

NP-Completeness of graph decomposition problems

Edith Cohen, Michael Tarsi, 1991, J. Complex..

The Counterfeit Coin Problem Revisited

Nathan Linial, Michael Tarsi, 1982, SIAM J. Comput..

Graphs Where Every Maximal Path Is Maximum

Michael Tarsi, 1996, J. Comb. Theory, Ser. B.

Nowhere zero flow and circuit covering in regular matroids

Michael Tarsi, M. Tarsi, 1985, J. Comb. Theory, Ser. B.

Deciding Hypergraph 2-Colourability by H-Resolution

Nathan Linial, Michael Tarsi, N. Linial, 1985, Theor. Comput. Sci..

On the decomposition of a graph into stars

Michael Tarsi, 1981, Discret. Math..

The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems

Michael Tarsi, David Tankus, 1997, J. Comb. Theory, Ser. B.

Matroidal bijections between graphs

Nathan Linial, Roy Meshulam, Michael Tarsi, 1988, J. Comb. Theory, Ser. B.

On (k, d)-colorings and fractional nowhere-zero flows

Cun-Quan Zhang, Luis A. Goddyn, Michael Tarsi, 1998, J. Graph Theory.

Short circuit covers for regular matroids with a nowhere zero 5-flow

André Raspaud, Michael Tarsi, Ury Jamshy, 1987, J. Comb. Theory, Ser. B.

Short cycle covers of graphs and nowhere-zero flows

André Raspaud, Edita Mácajová, Xuding Zhu, 2011, J. Graph Theory.

Decomposition of complete multigraphs into stars

Michael Tarsi, 1979, Discret. Math..

A nowhere-zero point in linear mappings

Noga Alon, Michael Tarsi, N. Alon, 1989, Comb..

Greedily constructing maximal partial f-factors

Michael Tarsi, David Tankus, 2009, Discret. Math..

Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties

Nathan Linial, François Jaeger, Michael Tarsi, 1992, J. Comb. Theory, Ser. B.

Flows, View Obstructions, and the Lonely Runner

András Sebö, Luis A. Goddyn, Michael Tarsi, 1998, J. Comb. Theory B.

On some multigraph decomposition problems and their computational complexity

Michael Tarsi, Miri Priesler, 2004, Discret. Math..

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

Michael Tarsi, Dorit Dor, M. Tarsi, 1997, SIAM J. Comput..

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

Michael Tarsi, David Tankus, 2007, Discret. Math..

The graph polynomial and the number of proper vertex coloring

Michael Tarsi, 1999 .

The structure of graphs with Circular flow number 5 or more, and the complexity of their recognition problem

Giuseppe Mazzuoccolo, Louis Esperet, Michael Tarsi, 2015 .

On (k, d)-colorings and fractional nowhere-zero flows

Michael Tarsi, Luis Goddyn, Cun-Quan Zhang, 1998 .