Michael Tarsi

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