Michael Tarsi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2020

Bounded-excess flows in cubic graphsMichael Tarsi. jgt, 95(1):138-159, 2020. [doi]

2011

Short cycle covers of graphs and nowhere-zero flowsEdita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu. jgt, 68(4):340-348, 2011. [doi]

2009

Some results on (a: b)-choosabilityShai Gutner, Michael Tarsi. DM, 309(8):2260-2270, 2009. [doi]

Greedily constructing maximal partial f-factorsDavid Tankus, Michael Tarsi. DM, 309(8):2180-2189, 2009. [doi]

2007

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forestsDavid Tankus, Michael Tarsi. DM, 307(15):1833-1843, 2007. [doi]

2005

Multigraph decomposition into stars and into multistarsMiri Priesler, Michael Tarsi. DM, 296(2-3):235-244, 2005. [doi]

2004

On some multigraph decomposition problems and their computational complexityMiri Priesler, Michael Tarsi. DM, 281(1-3):247-254, 2004. [doi]

1998

Flows, View Obstructions, and the Lonely RunnerWojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi. JCT, 72(1):1-9, 1998. [doi]

d)-colorings and fractional nowhere-zero flowsLuis A. Goddyn, Michael Tarsi, Cun-Quan Zhang. jgt, 28(3):155-161, 1998. [doi]

1997

A Note on Graph Colorings and Graph PolynomialsNoga Alon, Michael Tarsi. JCT, 70(1):197-201, 1997. [doi]

Graph Decomposition is NP-Complete: A Complete Proof of Holyer s ConjectureDorit Dor, Michael Tarsi. SICOMP, 26(4):1166-1187, 1997.

The Structure of Well-Covered Graphs and the Complexity of Their Recognition ProblemsDavid Tankus, Michael Tarsi. JCT, 69(2):230-233, 1997. [doi]

1996

Recognizing Greedy StructuresYair Caro, András Sebö, Michael Tarsi. jal, 20(1):137-156, 1996.

Well-Covered Claw-Free GraphsDavid Tankus, Michael Tarsi. JCT, 66(2):293-302, 1996. [doi]

Graphs Where Every Maximal Path Is MaximumMichael Tarsi. JCT, 67(2):304-324, 1996. [doi]

1992

Colorings and orientations of graphsNoga Alon, Michael Tarsi. combinatorica, 12(2):125-134, 1992.

Graph Decomposition Is NPC-A Complete Proof of Holyer s ConjectureDorit Dor, Michael Tarsi. stoc 1992: 252-263

Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow propertiesFrançois Jaeger, Nathan Linial, Charles Payan, Michael Tarsi. JCT, 56(2):165-182, 1992. [doi]

1991

NP-Completeness of graph decomposition problemsEdith Cohen, Michael Tarsi. jc, 7(2):200-212, 1991. [doi]

1989

A nowhere-zero point in liner mappingsNoga Alon, Michael Tarsi. combinatorica, 9(4):393-396, 1989.

Cycle covering of binary matroidsUry Jamshy, Michael Tarsi. JCT, 46(2):154-161, 1989. [doi]

Interpolation Between Bases and the Shuffle Exchange NetworkNathan Linial, Michael Tarsi. ejc, 10(1):29-39, 1989. [doi]

1988

Matroidal bijections between graphsNathan Linial, Roy Meshulam, Michael Tarsi. JCT, 45(1):31-44, 1988. [doi]

1987

Short circuit covers for regular matroids with a nowhere zero 5-flowUry Jamshy, André Raspaud, Michael Tarsi. JCT, 43(3):354-357, 1987. [doi]

1986

Structuring causal treesJudea Pearl, Michael Tarsi. jc, 2(1):60-77, 1986. [doi]

Semi-duality and the cycle double cover conjectureMichael Tarsi. JCT, 41(3):332-340, 1986. [doi]

1985

Deciding Hypergraph 2-Colourability by H-ResolutionNathan Linial, Michael Tarsi. TCS, 38:343-347, 1985.

Nowhere zero flow and circuit covering in regular matroidsMichael Tarsi. JCT, 39(3):346-352, 1985. [doi]

1983

Optimal Search on Some Game TreesMichael Tarsi. JACM, 30(3):389-396, July 1983. [doi]

Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed DesignsMichael Tarsi. JCT, 34(1):60-70, 1983.

1982

The Counterfeit Coin Problem RevisitedNathan Linial, Michael Tarsi. SICOMP, 11(3):409-415, 1982.

1981

On the decomposition of a graph into starsMichael Tarsi. DM, 36(3):299-304, 1981. [doi]

1979

Decomposition of complete multigraphs into starsMichael Tarsi. DM, 26(3):273-278, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL