The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Yair Caro: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yair Caro
    Simple proffs to three parity theorems. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  2. Yair Caro
    On graphs determined by their k-subgraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  3. Yair Caro, Arieh Lev, Yehuda Roditty
    Some results in step domination of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:68, n:, pp:- [Journal]
  4. Yair Caro, Yehuda Roditty
    Improved bounds for the product of the domination and chromatic numbers of a graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  5. Yair Caro, Yehuda Roditty
    Connected colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:70, n:, pp:- [Journal]
  6. Yair Caro, Yehuda Roditty, J. Schönheim
    Covering designs with minimum overlap. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:55, n:, pp:- [Journal]
  7. Yair Caro, Raphael Yuster
    Graphs with Large Variance. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:57, n:, pp:- [Journal]
  8. Yair Caro, Raphael Yuster
    Graphs Having the Local Decomposition Property. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:52, n:, pp:- [Journal]
  9. Yair Caro, Cecil C. Rousseau
    Asymptotic Bounds for Bipartite Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  10. Yair Caro, Raphael Yuster
    A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  11. Yair Caro, Raphael Yuster
    The Order of Monochromatic Subgraphs with a Given Minimum Degree. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  12. Yair Caro, Raphael Yuster
    Packing Graphs: The packing problem solved. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  13. Yair Caro, Raphael Yuster
    Efficient Covering Designs of the Complete Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  14. Yair Caro, Raphael Yuster
    Orthogonal Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  15. Yair Caro, Raphael Yuster
    Dominating A Family Of Graphs With Small Connected Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:4, pp:- [Journal]
  16. Yair Caro, Yusheng Li, Cecil C. Rousseau, Yuming Zhang
    Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:51-56 [Journal]
  17. Yair Caro, Yehuda Roditty, J. Schönheim
    On colored designs-III: on lambda-colored H-designs, H having lambda edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:51-64 [Journal]
  18. Yair Caro, Raphael Yuster
    List decomposition of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:243, n:1-3, pp:67-77 [Journal]
  19. Yair Caro, Raphael Yuster
    2-connected graphs with small 2-connected dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:265-271 [Journal]
  20. Yair Caro, Dieter Rautenbach
    Reconstructing graphs from size and degree properties of their induced k-subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:694-703 [Journal]
  21. Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster
    Zero-sum Square Matrices. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:5, pp:489-497 [Journal]
  22. 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]
  23. Yair Caro, Raphael Yuster
    Recognizing Global Occurrence of Local Properties. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:3, pp:340-352 [Journal]
  24. Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty
    Combinatorial reconstruction problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:153-161 [Journal]
  25. Noga Alon, Yair Caro, Raphael Yuster
    Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:144-161 [Journal]
  26. Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
    Covering Non-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:270-284 [Journal]
  27. Yair Caro
    A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:68, n:1, pp:205-211 [Journal]
  28. Yair Caro
    Binomial Coefficients and Zero-Sum Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:367-373 [Journal]
  29. Yair Caro, Zsolt Tuza
    Hypergraph coverings and local colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:79-85 [Journal]
  30. Yair Caro, Raphael Yuster
    Intersecting Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:1, pp:113-125 [Journal]
  31. Yair Caro, Raphael Yuster
    Edge coloring complete uniform hypergraphs with many components. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:2, pp:215-227 [Journal]
  32. Yair Caro, Raphael Yuster
    Covering Graphs: The Covering Problem Solved. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:83, n:2, pp:273-282 [Journal]
  33. Yair Caro, Raphael Yuster
    Orthogonal Decomposition and Packing of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:88, n:1, pp:93-111 [Journal]
  34. Yair Caro, Mark N. Ellingham, J. E. Ramey
    Local Structure When All Maximal Independent Sets Have Equal Weight. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:644-654 [Journal]
  35. Yair Caro, Douglas B. West, Raphael Yuster
    Connected Domination and Spanning Trees with Many Leaves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:202-211 [Journal]
  36. Yair Caro, J. Schönheim
    Generalized 1-factorization of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:3, pp:319-321 [Journal]
  37. Yair Caro, Raphael Yuster
    The uniformity space of hypergraphs and its applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:202, n:1-3, pp:1-19 [Journal]
  38. Yair Caro, Yehuda Roditty, J. Schönheim
    On colored designs - I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:47-65 [Journal]
  39. Yair Caro, Yehuda Roditty
    A note on packing trees into complete bipartite graphs and on fishburn's conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:3, pp:323-326 [Journal]
  40. Yair Caro
    On zero-sum Ramsey numbers - stars. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:104, n:1, pp:1-6 [Journal]
  41. Yair Caro, Zsolt Tuza
    Bounded degrees and prescribed distances in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:87-93 [Journal]
  42. Noga Alon, Yair Caro, Ilia Krasikov
    Bisection of trees and sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:3-7 [Journal]
  43. Yair Caro
    Zero-sum problems - A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:93-113 [Journal]
  44. Yair Caro
    On the generalized Erdös-Szekeres Conjecture - a new upper bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:229-233 [Journal]
  45. Yair Caro
    On induced subgraphs with odd degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:132, n:1-3, pp:23-28 [Journal]
  46. Yair Caro, Yehuda Roditty, J. Schönheim
    On colored designs - II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:177-186 [Journal]
  47. Yair Caro, Ilia Krasikov, Yehuda Roditty
    On induced subgraphs of trees, with restricted degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:101-106 [Journal]

  48. Large induced subgraphs with equated maximum degree. [Citation Graph (, )][DBLP]


  49. Large disjoint subgraphs with the same order and size. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.305secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002