- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j30 |      | Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu: Short cycle covers of graphs and nowhere-zero flows. Journal of Graph Theory 68(4): 340-348 (2011) |
| 2009 | ||
| j29 | | David Tankus, Michael Tarsi: Greedily constructing maximal partial f-factors. Discrete Mathematics 309(8): 2180-2189 (2009) |
| j28 | | Shai Gutner, Michael Tarsi: Some results on (a: b)-choosability. Discrete Mathematics 309(8): 2260-2270 (2009) |
| 2008 | ||
| i1 | | |
| 2007 | ||
| j27 | | David Tankus, Michael Tarsi: Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. Discrete Mathematics 307(15): 1833-1843 (2007) |
| 2005 | ||
| j26 | | Miri Priesler, Michael Tarsi: Multigraph decomposition into stars and into multistars. Discrete Mathematics 296(2-3): 235-244 (2005) |
| 2004 | ||
| j25 | | Miri Priesler, Michael Tarsi: On some multigraph decomposition problems and their computational complexity. Discrete Mathematics 281(1-3): 247-254 (2004) |
| 1998 | ||
| j24 | | 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) |
| j23 | | Luis A. Goddyn, Michael Tarsi, Cun-Quan Zhang: On (k, d)-colorings and fractional nowhere-zero flows. Journal of Graph Theory 28(3): 155-161 (1998) |
| 1997 | ||
| j22 | | 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) |
| j21 | | Noga Alon, Michael Tarsi: A Note on Graph Colorings and Graph Polynomials. J. Comb. Theory, Ser. B 70(1): 197-201 (1997) |
| j20 | | 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 | ||
| j19 | | Yair Caro, András Sebö, Michael Tarsi: Recognizing Greedy Structures. J. Algorithms 20(1): 137-156 (1996) |
| j18 | | David Tankus, Michael Tarsi: Well-Covered Claw-Free Graphs. J. Comb. Theory, Ser. B 66(2): 293-302 (1996) |
| j17 | | Michael Tarsi: Graphs Where Every Maximal Path Is Maximum. J. Comb. Theory, Ser. B 67(2): 304-324 (1996) |
| 1992 | ||
| j16 | | |
| j15 | | 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) |
| j14 | | Ury Jamshy, Michael Tarsi: Short cycle covers and the cycle double cover conjecture. J. Comb. Theory, Ser. B 56(2): 197-204 (1992) |
| c1 | | |
| 1991 | ||
| j13 | | Edith Cohen, Michael Tarsi: NP-Completeness of graph decomposition problems. J. Complexity 7(2): 200-212 (1991) |
| 1989 | ||
| j12 | | Noga Alon, Michael Tarsi: A nowhere-zero point in liner mappings. Combinatorica 9(4): 393-396 (1989) |
| j11 | | Ury Jamshy, Michael Tarsi: Cycle covering of binary matroids. J. Comb. Theory, Ser. B 46(2): 154-161 (1989) |
| 1988 | ||
| j10 | | Nathan Linial, Roy Meshulam, Michael Tarsi: Matroidal bijections between graphs. J. Comb. Theory, Ser. B 45(1): 31-44 (1988) |
| 1987 | ||
| j9 | | 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 | ||
| j8 | | |
| j7 | | Michael Tarsi: Semi-duality and the cycle double cover conjecture. J. Comb. Theory, Ser. B 41(3): 332-340 (1986) |
| 1985 | ||
| j6 | | Michael Tarsi: Nowhere zero flow and circuit covering in regular matroids. J. Comb. Theory, Ser. B 39(3): 346-352 (1985) |
| j5 | | Nathan Linial, Michael Tarsi: Deciding Hypergraph 2-Colourability by H-Resolution. Theor. Comput. Sci. 38: 343-347 (1985) |
| 1983 | ||
| j4 | | |
| j3 | | Michael Tarsi: Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs. J. Comb. Theory, Ser. A 34(1): 60-70 (1983) |
| 1982 | ||
| j2 | | Nathan Linial, Michael Tarsi: The Counterfeit Coin Problem Revisited. SIAM J. Comput. 11(3): 409-415 (1982) |
| 1981 | ||
| j1 | | Michael Tarsi: On the decomposition of a graph into stars. Discrete Mathematics 36(3): 299-304 (1981) |
Colors in the list of coauthors
Last update Fri May 24 09:20:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page