Uri N. Peled

Publication Activity (10 Years)

Years Active: 1972-2008
Publications (10 Years): 0

Publications

Ephraim Korach, Uri N. Peled, Udi Rotics
Equistable distance-hereditary graphs. Discret. Appl. Math. 156 (4) (2008)
Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
On the First Eigenvalue of Bipartite Graphs. Electron. J. Comb. 15 (1) (2008)
Shmuel Friedland, Uri N. Peled
Theory of computation of multidimensional entropy with an application to the monomer-dimer problem. Adv. Appl. Math. 34 (3) (2005)
Jon-Lark Kim, Uri N. Peled
Explicit construction of families of LDPC codes with no 4-cycles. ISIT (2004)
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) (2004)
Uri N. Peled, Udi Rotics
Equistable chordal graphs. Discret. Appl. Math. 132 (1-3) (2003)
Ephraim Korach, Uri N. Peled
Equistable series-parallel graphs. Discret. Appl. Math. 132 (1-3) (2003)
Martin Charles Golumbic, Uri N. Peled
Block duplicate graphs and a hierarchy of chordal graphs. Discret. Appl. Math. 124 (1-3) (2002)
Uri N. Peled, Rossella Petreschi, Andrea Sterbini
(n, e)-Graphs with maximum sum of squares of degrees. J. Graph Theory 31 (4) (1999)
Uri N. Peled, Julin Wu
Restricted unimodular chordal graphs. J. Graph Theory 30 (2) (1999)
Janet Simpson Beissinger, Uri N. Peled
A note on major sequences and external activity in trees. Electron. J. Comb. 4 (2) (1997)
Oya Ekin, Peter L. Hammer, Uri N. Peled
Horn Functions and Submodular Boolean Functions. Theor. Comput. Sci. 175 (2) (1997)
Srinivasa Rao Arikati, Uri N. Peled
A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. Discret. Appl. Math. 65 (1-3) (1996)
Uri N. Peled, Julin Wu
or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles? Electron. J. Comb. 3 (1) (1996)
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) (1996)
Uri N. Peled, Feng Sun
Enumeration of Difference Graphs. Discret. Appl. Math. 60 (1-3) (1995)
Nadimpalli V. R. Mahadev, Uri N. Peled
Longest cycles in threshold graphs. Discret. Math. 135 (1-3) (1994)
Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun
Equistable graphs. J. Graph Theory 18 (3) (1994)
Uri N. Peled, Feng Sun
Total Matchings and Total Coverings of Threshold Graphs. Discret. Appl. Math. 49 (1-3) (1994)
Uri N. Peled, Bruno Simeone
)-Time Algorithm for Computing the Dual of a Regular Boolean Function. Discret. Appl. Math. 49 (1-3) (1994)
Srinivasa Rao Arikati, Uri N. Peled
A Linear Algorithm for the Group Path Problem on Chordal Graphs. Discret. Appl. Math. 44 (1-3) (1993)
Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled
Edge-Chromatic Scheduling with Simultaneity Constraints. SIAM J. Discret. Math. 6 (4) (1993)
Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
Bipartite bithreshold graphs. Discret. Math. 119 (1-3) (1993)
Uri N. Peled, Murali K. Srinivasan
Poset matching - a distributive analog of independent matching. Discret. Math. 114 (1-3) (1993)
Nadimpalli V. R. Mahadev, Uri N. Peled
On a conjecture of wang and williams. J. Graph Theory 15 (2) (1991)
Uri N. Peled, Murali K. Srinivasan
Vicinal orders of trees. Discret. Appl. Math. 29 (2-3) (1990)
Peter L. Hammer, Uri N. Peled, Xiaorong Sun
Difference graphs. Discret. Appl. Math. 28 (1) (1990)
Uri N. Peled
Preface. Discret. Appl. Math. 25 (1-2) (1989)
Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
Some properties of 2-threshold graphs. Networks 19 (1) (1989)
Nadimpalli V. R. Mahadev, Uri N. Peled
Strict 2-threshold graphs. Discret. Appl. Math. 21 (2) (1988)
Frank Harary, Uri N. Peled
Hamiltonian threshold graphs. Discret. Appl. Math. 16 (1) (1987)
Janet Simpson Beissinger, Uri N. Peled
Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials. Graphs Comb. 3 (1) (1987)
Uri N. Peled, Bruno Simeone
Polynomial-time algorithms for regular set-covering and threshold synthesis. Discret. Appl. Math. 12 (1) (1985)
Uri N. Peled, Bruno Simeone
Box-threshold graphs. J. Graph Theory 8 (2) (1984)
Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu
Boolean distance for graphs. Discret. Math. 39 (2) (1982)
Peter L. Hammer, Uri N. Peled
Computing low-capacity 0-1 knapsack polytopes. Z. Oper. Research 26 (1) (1982)
Peter L. Hammer, Uri N. Peled, Moshe Asher Pollatschek
An Algorithm to Dualize a Regular Switching Function. IEEE Trans. Computers 28 (3) (1979)
Uri N. Peled
Matroidal graphs. Discret. Math. 20 (1977)
Peter L. Hammer, Ellis L. Johnson, Uri N. Peled
Facet of regular 0-1 polytopes. Math. Program. 8 (1) (1975)
Peter L. Hammer, Uri N. Peled
On the Maximization of a Pseudo-Boolean Function. J. ACM 19 (2) (1972)