Uri N. Peled

1.2k total citations
47 papers, 707 citations indexed

About

Uri N. Peled is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Electrical and Electronic Engineering. According to data from OpenAlex, Uri N. Peled has authored 47 papers receiving a total of 707 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 14 papers in Geometry and Topology and 13 papers in Electrical and Electronic Engineering. Recurrent topics in Uri N. Peled's work include Advanced Graph Theory Research (25 papers), Graph theory and applications (13 papers) and graph theory and CDMA systems (11 papers). Uri N. Peled is often cited by papers focused on Advanced Graph Theory Research (25 papers), Graph theory and applications (13 papers) and graph theory and CDMA systems (11 papers). Uri N. Peled collaborates with scholars based in United States, Italy and Canada. Uri N. Peled's co-authors include Bruno Simeone, Shmuel Friedland, E. L. Johnson, Peter L. Hammer, N. V. R. Mahadev, Xiaorong Sun, Vera Pless, Rossella Petreschi, Andrea Sterbini and Udi Rotics and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of Bacteriology and Annals of the New York Academy of Sciences.

In The Last Decade

Uri N. Peled

46 papers receiving 657 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Uri N. Peled United States	14	423	177	165	134	130	47	707
E. F. Schmeichel United States	17	621 1.5×	262 1.5×	230 1.4×	68 0.5×	274 2.1×	76	944
Renu Laskar United States	15	773 1.8×	191 1.1×	234 1.4×	23 0.2×	201 1.5×	52	932
Bohdan Zelinka Czechia	15	638 1.5×	241 1.4×	108 0.7×	23 0.2×	146 1.1×	199	829
Fǎnicǎ Gavril Israel	17	1.2k 2.9×	200 1.1×	575 3.5×	99 0.7×	199 1.5×	35	1.5k
Jan Arne Telle Norway	16	720 1.7×	82 0.5×	343 2.1×	29 0.2×	131 1.0×	69	864
Clemens Heuberger Austria	13	339 0.8×	211 1.2×	43 0.3×	59 0.4×	57 0.4×	71	640
Bjarne Toft Denmark	12	610 1.4×	129 0.7×	117 0.7×	36 0.3×	319 2.5×	33	762
Tommy R. Jensen Germany	7	481 1.1×	71 0.4×	143 0.9×	53 0.4×	223 1.7×	20	627
Feodor F. Dragan United States	20	781 1.8×	245 1.4×	275 1.7×	20 0.1×	147 1.1×	82	1.0k
Bruce A. Reed Canada	15	719 1.7×	141 0.8×	199 1.2×	21 0.2×	200 1.5×	30	854

Countries citing papers authored by Uri N. Peled

Since Specialization

Citations

This map shows the geographic impact of Uri N. Peled's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Uri N. Peled with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Uri N. Peled more than expected).

Fields of papers citing papers by Uri N. Peled

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Uri N. Peled. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Uri N. Peled. The network helps show where Uri N. Peled may publish in the future.

Co-authorship network of co-authors of Uri N. Peled

This figure shows the co-authorship network connecting the top 25 collaborators of Uri N. Peled. A scholar is included among the top collaborators of Uri N. Peled based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Uri N. Peled. Uri N. Peled is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Korach, Ephraim, Uri N. Peled, & Udi Rotics. (2007). Equistable distance-hereditary graphs. Discrete Applied Mathematics. 156(4). 462–477. 8 indexed citations

Friedland, Shmuel & Uri N. Peled. (2004). Theory of computation of multidimensional entropy with an application to the monomer–dimer problem. Advances in Applied Mathematics. 34(3). 486–522. 26 indexed citations

Peled, Uri N. & Udi Rotics. (2003). Equistable chordal graphs. Discrete Applied Mathematics. 132(1-3). 203–210. 9 indexed citations

Golumbic, Martin Charles & Uri N. Peled. (2002). Block duplicate graphs and a hierarchy of chordal graphs. Discrete Applied Mathematics. 124(1-3). 67–71. 7 indexed citations

Peled, Uri N., et al.. (1999). The realization graph of a degree sequence with majorization gap 1 is Hamiltonian. Linear Algebra and its Applications. 290(1-3). 213–235. 3 indexed citations

Peled, Uri N., et al.. (1996). A polynomial algorithm for the parity path problem on perfectly orientable graphs. Discrete Applied Mathematics. 65(1-3). 5–20. 8 indexed citations

Mahadev, N. V. R. & Uri N. Peled. (1994). Longest cycles in threshold graphs. Discrete Mathematics. 135(1-3). 169–176. 6 indexed citations

Peled, Uri N. & Bruno Simeone. (1994). An O(nm)-time algorithm for computing the dual of a regular Boolean function. Discrete Applied Mathematics. 49(1-3). 309–323. 26 indexed citations

Hammer, Peter L., N. V. R. Mahadev, & Uri N. Peled. (1993). Bipartite bithreshold graphs. Discrete Mathematics. 119(1-3). 79–96. 2 indexed citations

10.

Peled, Uri N., et al.. (1993). A linear algorithm for the group path problem on chordal graphs. Discrete Applied Mathematics. 44(1-3). 185–190. 9 indexed citations

11.

Werra, D. de, N. V. R. Mahadev, & Uri N. Peled. (1993). Edge-Chromatic Scheduling with Simultaneity Constraints. SIAM Journal on Discrete Mathematics. 6(4). 631–641. 8 indexed citations

12.

Peled, Uri N. & Bruno Simeone. (1989). The Threshold Measure of a Graph^a. Annals of the New York Academy of Sciences. 576(1). 441–457. 3 indexed citations

13.

Hammer, P. L., N. V. R. Mahadev, & Uri N. Peled. (1989). Some properties of 2‐threshold graphs. Networks. 19(1). 17–23. 5 indexed citations

14.

Peled, Uri N., et al.. (1989). The polytope of degree sequences. Linear Algebra and its Applications. 114-115. 349–377. 26 indexed citations

15.

Mahadev, N. V. R. & Uri N. Peled. (1988). Strict 2-threshold graphs. Discrete Applied Mathematics. 21(2). 113–131. 8 indexed citations

16.

Peled, Uri N., et al.. (1987). Hamiltonian threshold graphs. Discrete Applied Mathematics. 16(1). 11–15. 18 indexed citations

17.

Peled, Uri N., et al.. (1987). Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials. Graphs and Combinatorics. 3(1). 213–219. 13 indexed citations

18.

Harary, Frank, Robert A. Melter, Uri N. Peled, & Ioan Tomescu. (1982). Boolean distance for graphs. Discrete Mathematics. 39(2). 123–127. 4 indexed citations

19.

Johnson, E. L., et al.. (1975). Facet of regular 0–1 polytopes. Mathematical Programming. 8(1). 179–206. 114 indexed citations

20.

Hammer, Peter L., Manfred Padberg, & Uri N. Peled. (1975). Constraint Pairing In Integer Programming. INFOR Information Systems and Operational Research. 13(1). 68–81. 13 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact