default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Tarsi
Person information
- affiliation: Tel Aviv University, Blavatnik School of Computer Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j34]Michael Tarsi
:
Bounded-excess flows in cubic graphs. J. Graph Theory 95(1): 138-159 (2020)
2010 – 2019
- 2017
- [j33]Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi:
Flows and Bisections in Cubic Graphs. J. Graph Theory 86(2): 149-158 (2017) - 2011
- [j32]Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu:
Short cycle covers of graphs and nowhere-zero flows. J. Graph Theory 68(4): 340-348 (2011)
2000 – 2009
- 2009
- [j31]David Tankus, Michael Tarsi:
Greedily constructing maximal partial f-factors. Discret. Math. 309(8): 2180-2189 (2009) - [j30]Shai Gutner, Michael Tarsi:
Some results on (a: b)-choosability. Discret. Math. 309(8): 2260-2270 (2009) - 2008
- [i1]Shai Gutner, Michael Tarsi:
Some results on (a:b)-choosability. CoRR abs/0802.1338 (2008) - 2007
- [j29]David Tankus, Michael Tarsi:
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. Discret. Math. 307(15): 1833-1843 (2007) - 2005
- [j28]Miri Priesler, Michael Tarsi:
Multigraph decomposition into stars and into multistars. Discret. Math. 296(2-3): 235-244 (2005) - 2004
- [j27]Miri Priesler, Michael Tarsi:
On some multigraph decomposition problems and their computational complexity. Discret. Math. 281(1-3): 247-254 (2004)
1990 – 1999
- 1998
- [j26]Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi:
Flows, View Obstructions, and the Lonely Runner. J. Comb. Theory B 72(1): 1-9 (1998) - [j25]Luis A. Goddyn, Michael Tarsi, Cun-Quan Zhang:
On (k, d)-colorings and fractional nowhere-zero flows. J. Graph Theory 28(3): 155-161 (1998) - 1997
- [j24]David Tankus, Michael Tarsi:
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. J. Comb. Theory B 69(2): 230-233 (1997) - [j23]Noga Alon, Michael Tarsi:
A Note on Graph Colorings and Graph Polynomials. J. Comb. Theory B 70(1): 197-201 (1997) - [j22]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
- [j21]Yair Caro, András Sebö, Michael Tarsi:
Recognizing Greedy Structures. J. Algorithms 20(1): 137-156 (1996) - [j20]David Tankus, Michael Tarsi:
Well-Covered Claw-Free Graphs. J. Comb. Theory B 66(2): 293-302 (1996) - [j19]Michael Tarsi:
Graphs Where Every Maximal Path Is Maximum. J. Comb. Theory B 67(2): 304-324 (1996) - 1992
- [j18]Noga Alon, Michael Tarsi:
Colorings and orientations of graphs. Comb. 12(2): 125-134 (1992) - [j17]François Jaeger, Nathan Linial, Charles Payan, Michael Tarsi:
Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties. J. Comb. Theory B 56(2): 165-182 (1992) - [j16]Ury Jamshy, Michael Tarsi:
Short cycle covers and the cycle double cover conjecture. J. Comb. Theory B 56(2): 197-204 (1992) - [c1]Dorit Dor, Michael Tarsi:
Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture. STOC 1992: 252-263 - 1991
- [j15]Edith Cohen, Michael Tarsi:
NP-Completeness of graph decomposition problems. J. Complex. 7(2): 200-212 (1991)
1980 – 1989
- 1989
- [j14]Noga Alon, Michael Tarsi:
A nowhere-zero point in liner mappings. Comb. 9(4): 393-396 (1989) - [j13]Nathan Linial, Michael Tarsi:
Interpolation Between Bases and the Shuffle Exchange Network. Eur. J. Comb. 10(1): 29-39 (1989) - [j12]Ury Jamshy, Michael Tarsi:
Cycle covering of binary matroids. J. Comb. Theory B 46(2): 154-161 (1989) - 1988
- [j11]Nathan Linial, Roy Meshulam, Michael Tarsi:
Matroidal bijections between graphs. J. Comb. Theory B 45(1): 31-44 (1988) - 1987
- [j10]Ury Jamshy, André Raspaud, Michael Tarsi:
Short circuit covers for regular matroids with a nowhere zero 5-flow. J. Comb. Theory B 43(3): 354-357 (1987) - 1986
- [j9]Judea Pearl, Michael Tarsi:
Structuring causal trees. J. Complex. 2(1): 60-77 (1986) - [j8]Michael Tarsi:
Semi-duality and the cycle double cover conjecture. J. Comb. Theory B 41(3): 332-340 (1986) - 1985
- [j7]Michael Tarsi:
Nowhere zero flow and circuit covering in regular matroids. J. Comb. Theory B 39(3): 346-352 (1985) - [j6]Nathan Linial, Michael Tarsi:
Deciding Hypergraph 2-Colourability by H-Resolution. Theor. Comput. Sci. 38: 343-347 (1985) - 1983
- [j5]Michael Tarsi:
Optimal Search on Some Game Trees. J. ACM 30(3): 389-396 (1983) - [j4]Michael Tarsi:
Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs. J. Comb. Theory A 34(1): 60-70 (1983) - 1982
- [j3]Nathan Linial, Michael Tarsi:
The Counterfeit Coin Problem Revisited. SIAM J. Comput. 11(3): 409-415 (1982) - 1981
- [j2]Michael Tarsi:
On the decomposition of a graph into stars. Discret. Math. 36(3): 299-304 (1981)
1970 – 1979
- 1979
- [j1]Michael Tarsi:
Decomposition of complete multigraphs into stars. Discret. Math. 26(3): 273-278 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
