The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Tarsi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  28. Some results on (a:b)-choosability [Citation Graph (, )][DBLP]


  29. Some results on (a: b)-choosability. [Citation Graph (, )][DBLP]


  30. Greedily constructing maximal partial f-factors. [Citation Graph (, )][DBLP]


Search in 0.115secs, Finished in 0.116secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002