| 2008 |
|---|
| 28 | EE | Shai Gutner,
Michael Tarsi:
Some results on (a:b)-choosability
CoRR abs/0802.1338: (2008) |
| 2007 |
|---|
| 27 | EE | David Tankus,
Michael Tarsi:
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests.
Discrete Mathematics 307(15): 1833-1843 (2007) |
| 2005 |
|---|
| 26 | EE | Miri Priesler,
Michael Tarsi:
Multigraph decomposition into stars and into multistars.
Discrete Mathematics 296(2-3): 235-244 (2005) |
| 2004 |
|---|
| 25 | EE | Miri Priesler,
Michael Tarsi:
On some multigraph decomposition problems and their computational complexity.
Discrete Mathematics 281(1-3): 247-254 (2004) |
| 1998 |
|---|
| 24 | EE | 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): 1-9 (1998) |
| 1997 |
|---|
| 23 | EE | David Tankus,
Michael Tarsi:
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems.
J. Comb. Theory, Ser. B 69(2): 230-233 (1997) |
| 22 | EE | Noga Alon,
Michael Tarsi:
A Note on Graph Colorings and Graph Polynomials.
J. Comb. Theory, Ser. B 70(1): 197-201 (1997) |
| 21 | | Dorit Dor,
Michael Tarsi:
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture.
SIAM J. Comput. 26(4): 1166-1187 (1997) |
| 1996 |
|---|
| 20 | | Yair Caro,
András Sebö,
Michael Tarsi:
Recognizing Greedy Structures.
J. Algorithms 20(1): 137-156 (1996) |
| 19 | EE | David Tankus,
Michael Tarsi:
Well-Covered Claw-Free Graphs.
J. Comb. Theory, Ser. B 66(2): 293-302 (1996) |
| 18 | EE | Michael Tarsi:
Graphs Where Every Maximal Path Is Maximum.
J. Comb. Theory, Ser. B 67(2): 304-324 (1996) |
| 1992 |
|---|
| 17 | | Dorit Dor,
Michael Tarsi:
Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture
STOC 1992: 252-263 |
| 16 | | Noga Alon,
Michael Tarsi:
Colorings and orientations of graphs.
Combinatorica 12(2): 125-134 (1992) |
| 15 | EE | 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): 165-182 (1992) |
| 14 | EE | Ury Jamshy,
Michael Tarsi:
Short cycle covers and the cycle double cover conjecture.
J. Comb. Theory, Ser. B 56(2): 197-204 (1992) |
| 1991 |
|---|
| 13 | EE | Edith Cohen,
Michael Tarsi:
NP-Completeness of graph decomposition problems.
J. Complexity 7(2): 200-212 (1991) |
| 1989 |
|---|
| 12 | | Noga Alon,
Michael Tarsi:
A nowhere-zero point in liner mappings.
Combinatorica 9(4): 393-396 (1989) |
| 11 | EE | Ury Jamshy,
Michael Tarsi:
Cycle covering of binary matroids.
J. Comb. Theory, Ser. B 46(2): 154-161 (1989) |
| 1988 |
|---|
| 10 | EE | Nathan Linial,
Roy Meshulam,
Michael Tarsi:
Matroidal bijections between graphs.
J. Comb. Theory, Ser. B 45(1): 31-44 (1988) |
| 1987 |
|---|
| 9 | EE | 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): 354-357 (1987) |
| 1986 |
|---|
| 8 | EE | Michael Tarsi:
Semi-duality and the cycle double cover conjecture.
J. Comb. Theory, Ser. B 41(3): 332-340 (1986) |
| 7 | EE | Judea Pearl,
Michael Tarsi:
Structuring causal trees.
J. Complexity 2(1): 60-77 (1986) |
| 1985 |
|---|
| 6 | EE | Michael Tarsi:
Nowhere zero flow and circuit covering in regular matroids.
J. Comb. Theory, Ser. B 39(3): 346-352 (1985) |
| 5 | | Nathan Linial,
Michael Tarsi:
Deciding Hypergraph 2-Colourability by H-Resolution.
Theor. Comput. Sci. 38: 343-347 (1985) |
| 1983 |
|---|
| 4 | EE | Michael Tarsi:
Optimal Search on Some Game Trees
J. ACM 30(3): 389-396 (1983) |
| 3 | | Michael Tarsi:
Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs.
J. Comb. Theory, Ser. A 34(1): 60-70 (1983) |
| 1982 |
|---|
| 2 | | Nathan Linial,
Michael Tarsi:
The Counterfeit Coin Problem Revisited.
SIAM J. Comput. 11(3): 409-415 (1982) |
| 1981 |
|---|
| 1 | EE | Michael Tarsi:
On the decomposition of a graph into stars.
Discrete Mathematics 36(3): 299-304 (1981) |
