default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYehuda Roditty
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j43]Gideon Dror, Arieh Lev, Yehuda Roditty, Romina Zigdon:
On the rainbow connection number of graphs. Ars Comb. 133: 51-67 (2017)- [j42]Amir Averbuch, Irete Peeri, Yehuda Roditty:
New upper bound on m-time-relaxed k-broadcast graphs. Networks 70(2): 72-78 (2017) - 2016
- [j41]Shoni Gilboa, Yehuda Roditty:
Anti-Ramsey Numbers of Graphs with Small Connected Components. Graphs Comb. 32(2): 649-662 (2016) - [j40]Revital Hollander Shabtai, Yehuda Roditty:
Line-broadcasting in complete k-ary trees. Networks 67(2): 139-147 (2016) - 2015
- [j39]Arie Bialostocki, Shoni Gilboa, Yehuda Roditty:
Anti-Ramsey numbers of small graphs. Ars Comb. 123: 41-53 (2015) - [i2]Revital Hollander Shabtai, Yehuda Roditty:
Line-Broadcasting in Complete k-Trees. CoRR abs/1504.02491 (2015) - 2014
- [j38]Avi Averbuch, R. Hollander Shabtai, Yehuda Roditty:
Efficient construction of broadcast graphs. Discret. Appl. Math. 171: 9-14 (2014) - 2013
- [i1]Avi Averbuch, R. Hollander Shabtai, Yehuda Roditty:
Efficient construction of broadcast graphs. CoRR abs/1312.1523 (2013)
2000 – 2009
- 2009
- [j37]Gil Kaplan, Arieh Lev, Yehuda Roditty:
On graph labeling problems and regular decompositions of complete graphs. Ars Comb. 92 (2009) - [j36]Iris Gaber-Rosenblum, Yehuda Roditty:
The depression of a graph and the diameter of its line graph. Discret. Math. 309(6): 1774-1778 (2009) - [j35]Gil Kaplan, Arieh Lev, Yehuda Roditty:
On zero-sum partitions and anti-magic trees. Discret. Math. 309(8): 2010-2014 (2009) - 2008
- [j34]Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster:
On Rainbow Connection. Electron. J. Comb. 15(1) (2008) - [j33]Gil Kaplan, Arieh Lev, Yehuda Roditty:
Bertrand's postulate, the prime number theorem and product anti-magic graphs. Discret. Math. 308(5-6): 787-794 (2008) - 2004
- [j32]Yair Caro, Yehuda Roditty:
Connected colorings of graphs. Ars Comb. 70 (2004) - [j31]Gideon Dror, Arieh Lev, Yehuda Roditty:
A note: some results in step domination of trees. Discret. Math. 289(1-3): 137-144 (2004) - [j30]Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster:
Dense graphs are antimagic. J. Graph Theory 47(4): 297-309 (2004) - 2003
- [j29]Yair Caro, Arieh Lev, Yehuda Roditty:
Some results in step domination of graphs. Ars Comb. 68 (2003) - 2002
- [j28]Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs-III: on lambda-colored H-designs, H having lambda edges. Discret. Math. 247(1-3): 51-64 (2002) - [j27]Gil Kaplan, Arieh Lev, Yehuda Roditty:
Transitive large sets of disjoint decompositions and group sequencings. Discret. Math. 254(1-3): 207-219 (2002) - 2001
- [j26]Omer Berkman, Michal Parnas, Yehuda Roditty:
All Cycles are Edge-Magic. Ars Comb. 59 (2001) - [j25]Amir Averbuch, Yehuda Roditty, Barack Shoham:
Efficient line broadcasting in a d-dimensional grid. Discret. Appl. Math. 113(2-3): 129-141 (2001) - [j24]Yehuda Roditty, Barack Shoham, Raphael Yuster:
Monotone paths in edge-ordered sparse graphs. Discret. Math. 226(1-3): 411-417 (2001) - [j23]Gil Kaplan, Arieh Lev, Yehuda Roditty:
Regular Oberwolfach Problems and Group Sequencings. J. Comb. Theory A 96(1): 1-19 (2001) - [j22]Amir Averbuch, Iris Gaber, Yehuda Roditty:
Low-cost minimum-time line-broadcasting schemes in complete binary trees. Networks 38(4): 189-193 (2001) - 2000
- [j21]Yair Caro, Yehuda Roditty, Johanan Schönheim:
Covering designs with minimum overlap. Ars Comb. 55 (2000) - [j20]Yair Caro, Yehuda Roditty:
Improved bounds for the product of the domination and chromatic numbers of a graph. Ars Comb. 56 (2000) - [j19]Amir Averbuch, Yehuda Roditty, Barack Shoham:
Performance analysis of hybrid network multiprocessor architecture. Concurr. Pract. Exp. 12(9): 821-844 (2000) - [j18]Arieh Lev, Yehuda Roditty:
On Hering Decomposition ofDKnInduced by Group Actions on Conjugacy Classes. Eur. J. Comb. 21(3): 379-393 (2000)
1990 – 1999
- 1999
- [j17]Amir Averbuch, Yehuda Roditty, Barack Shoham:
Scheduling tasks of multi-join queries in a multiprocessor. Concurr. Pract. Exp. 11(5): 247-279 (1999) - 1997
- [j16]Yehuda Roditty, Barack Shoham:
On Broadcasting Multiple Messages in a D-dimensional Grid. Discret. Appl. Math. 75(3): 277-284 (1997) - [j15]Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs - I. Discret. Math. 164(1-3): 47-65 (1997) - [j14]Ilia Krasikov, Yehuda Roditty:
On a Reconstruction Problem for Sequences, . J. Comb. Theory A 77(2): 344-348 (1997) - 1996
- [j13]Yehuda Roditty:
Packing and covering of the complete graph, V: the forests of order six and their multiple copies. Ars Comb. 44 (1996) - 1995
- [j12]Yair Caro, Yehuda Roditty:
A zero-sum conjecture for trees. Ars Comb. 40 (1995) - [j11]Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs - II. Discret. Math. 138(1-3): 177-186 (1995) - 1994
- [j10]Yair Caro, Ilia Krasikov, Yehuda Roditty:
On induced subgraphs of trees, with restricted degrees. Discret. Math. 125(1-3): 101-106 (1994) - [j9]Ilia Krasikov, Yehuda Roditty:
More on Vertex-Switching Reconstruction. J. Comb. Theory B 60(1): 40-55 (1994) - [j8]Ilia Krasikov, Yehuda Roditty:
Bounds for the harmonious chromatic number of a graph. J. Graph Theory 18(2): 205-209 (1994) - 1992
- [j7]Ilia Krasikov, Yehuda Roditty:
Switching reconstruction and diophantine equations. J. Comb. Theory B 54(2): 189-195 (1992) - 1991
- [j6]Yair Caro, Ilia Krasikov, Yehuda Roditty:
On the largest tree of given maximum degree in a connected graph. J. Graph Theory 15(1): 7-13 (1991) - 1990
- [j5]Yair Caro, Yehuda Roditty:
A note on packing trees into complete bipartite graphs and on fishburn's conjecture. Discret. Math. 82(3): 323-326 (1990) - [j4]Ilia Krasikov, Yehuda Roditty:
Some applications of the nash-williams lemma to the edge-reconstruction conjecture. Graphs Comb. 6(1): 37-39 (1990)
1980 – 1989
- 1989
- [j3]Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty:
Combinatorial reconstruction problems. J. Comb. Theory B 47(2): 153-161 (1989) - 1987
- [j2]Chris D. Godsil
, Ilia Krasikov, Yehuda Roditty:
Reconstructing graphs from their k-edge deleted subgraphs. J. Comb. Theory B 43(3): 360-363 (1987) - 1983
- [j1]Yehuda Roditty:
Packing and Covering of the Complete Graph with a Graph G of Four Vertices or Less. J. Comb. Theory A 34(2): 231-243 (1983)
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 21:21 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:
