default search action
Uri N. Peled
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j39]Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled:
On the First Eigenvalue of Bipartite Graphs. Electron. J. Comb. 15(1) (2008) - [j38]Ephraim Korach, Uri N. Peled, Udi Rotics:
Equistable distance-hereditary graphs. Discret. Appl. Math. 156(4): 462-477 (2008) - 2005
- [j37]Shmuel Friedland, Uri N. Peled:
Theory of computation of multidimensional entropy with an application to the monomer-dimer problem. Adv. Appl. Math. 34(3): 486-522 (2005) - 2004
- [j36]Jon-Lark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland:
Explicit construction of families of LDPC codes with no 4-cycles. IEEE Trans. Inf. Theory 50(10): 2378-2388 (2004) - [c1]Jon-Lark Kim, Uri N. Peled:
Explicit construction of families of LDPC codes with no 4-cycles. ISIT 2004: 235 - 2003
- [j35]Ephraim Korach, Uri N. Peled:
Equistable series-parallel graphs. Discret. Appl. Math. 132(1-3): 149-162 (2003) - [j34]Uri N. Peled, Udi Rotics:
Equistable chordal graphs. Discret. Appl. Math. 132(1-3): 203-210 (2003) - 2002
- [j33]Martin Charles Golumbic, Uri N. Peled:
Block duplicate graphs and a hierarchy of chordal graphs. Discret. Appl. Math. 124(1-3): 67-71 (2002)
1990 – 1999
- 1999
- [j32]Uri N. Peled, Julin Wu:
Restricted unimodular chordal graphs. J. Graph Theory 30(2): 121-136 (1999) - [j31]Uri N. Peled, Rossella Petreschi, Andrea Sterbini:
(n, e)-Graphs with maximum sum of squares of degrees. J. Graph Theory 31(4): 283-295 (1999) - [r1]Lisa Carbone, Uri N. Peled, Paul K. Stockmeyer:
Trees. Handbook of Discrete and Combinatorial Mathematics 1999 - 1997
- [j30]Janet Simpson Beissinger, Uri N. Peled:
A note on major sequences and external activity in trees. Electron. J. Comb. 4(2) (1997) - [j29]Oya Ekin, Peter L. Hammer, Uri N. Peled:
Horn Functions and Submodular Boolean Functions. Theor. Comput. Sci. 175(2): 257-270 (1997) - 1996
- [j28]Uri N. Peled, Julin Wu:
or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles? Electron. J. Comb. 3(1) (1996) - [j27]Srinivasa Rao Arikati, Uri N. Peled:
A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. Discret. Appl. Math. 65(1-3): 5-20 (1996) - [j26]Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled:
Restrictions and Preassignments in Preemptive open Shop Scheduling. Discret. Appl. Math. 68(1-2): 169-188 (1996) - 1995
- [j25]Uri N. Peled, Feng Sun:
Enumeration of Difference Graphs. Discret. Appl. Math. 60(1-3): 311-318 (1995) - 1994
- [j24]Uri N. Peled, Bruno Simeone:
A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function. Discret. Appl. Math. 49(1-3): 309-323 (1994) - [j23]Uri N. Peled, Feng Sun:
Total Matchings and Total Coverings of Threshold Graphs. Discret. Appl. Math. 49(1-3): 325-330 (1994) - [j22]Nadimpalli V. R. Mahadev, Uri N. Peled:
Longest cycles in threshold graphs. Discret. Math. 135(1-3): 169-176 (1994) - [j21]Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun:
Equistable graphs. J. Graph Theory 18(3): 281-299 (1994) - 1993
- [j20]Srinivasa Rao Arikati, Uri N. Peled:
A Linear Algorithm for the Group Path Problem on Chordal Graphs. Discret. Appl. Math. 44(1-3): 185-190 (1993) - [j19]Uri N. Peled, Murali K. Srinivasan:
Poset matching - a distributive analog of independent matching. Discret. Math. 114(1-3): 403-424 (1993) - [j18]Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled:
Bipartite bithreshold graphs. Discret. Math. 119(1-3): 79-96 (1993) - [j17]Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled:
Edge-Chromatic Scheduling with Simultaneity Constraints. SIAM J. Discret. Math. 6(4): 631-641 (1993) - 1991
- [j16]Nadimpalli V. R. Mahadev, Uri N. Peled:
On a conjecture of wang and williams. J. Graph Theory 15(2): 115-120 (1991) - 1990
- [j15]Peter L. Hammer, Uri N. Peled, Xiaorong Sun:
Difference graphs. Discret. Appl. Math. 28(1): 35-44 (1990) - [j14]Uri N. Peled, Murali K. Srinivasan:
Vicinal orders of trees. Discret. Appl. Math. 29(2-3): 211-219 (1990)
1980 – 1989
- 1989
- [j13]Uri N. Peled:
Preface. Discret. Appl. Math. 25(1-2): 1 (1989) - [j12]Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled:
Some properties of 2-threshold graphs. Networks 19(1): 17-23 (1989) - 1988
- [j11]Nadimpalli V. R. Mahadev, Uri N. Peled:
Strict 2-threshold graphs. Discret. Appl. Math. 21(2): 113-131 (1988) - 1987
- [j10]Frank Harary, Uri N. Peled:
Hamiltonian threshold graphs. Discret. Appl. Math. 16(1): 11-15 (1987) - [j9]Janet Simpson Beissinger, Uri N. Peled:
Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials. Graphs Comb. 3(1): 213-219 (1987) - 1985
- [j8]Uri N. Peled, Bruno Simeone:
Polynomial-time algorithms for regular set-covering and threshold synthesis. Discret. Appl. Math. 12(1): 57-69 (1985) - 1984
- [j7]Uri N. Peled, Bruno Simeone:
Box-threshold graphs. J. Graph Theory 8(2): 331-345 (1984) - 1982
- [j6]Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu
:
Boolean distance for graphs. Discret. Math. 39(2): 123-127 (1982) - [j5]Peter L. Hammer, Uri N. Peled:
Computing low-capacity 0-1 knapsack polytopes. Z. Oper. Research 26(1): 243-249 (1982)
1970 – 1979
- 1979
- [j4]Peter L. Hammer, Uri N. Peled, Moshe Asher Pollatschek:
An Algorithm to Dualize a Regular Switching Function. IEEE Trans. Computers 28(3): 238-243 (1979) - 1977
- [j3]Uri N. Peled:
Matroidal graphs. Discret. Math. 20: 263-286 (1977) - 1975
- [j2]Peter L. Hammer, Ellis L. Johnson, Uri N. Peled:
Facet of regular 0-1 polytopes. Math. Program. 8(1): 179-206 (1975) - 1972
- [j1]Peter L. Hammer, Uri N. Peled:
On the Maximization of a Pseudo-Boolean Function. J. ACM 19(2): 265-282 (1972)
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-04-24 22:58 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: