On the Maximization of a Pseudo-Boolean Function. - Peter L. Hammer; Uri N. Peled (J. ACM, 1972)

Facet of regular 0-1 polytopes. - Peter L. Hammer; Ellis L. Johnson; Uri N. Peled (Math. Program., 1975)

Matroidal graphs. - Uri N. Peled (Discret. Math., 1977)

An Algorithm to Dualize a Regular Switching Function. - Peter L. Hammer; Uri N. Peled; Moshe Asher Pollatschek (IEEE Trans. Computers, 1979)

Boolean distance for graphs. - Frank Harary; Robert A. Melter; Uri N. Peled; Ioan Tomescu (Discret. Math., 1982)

Computing low-capacity 0-1 knapsack polytopes. - Peter L. Hammer; Uri N. Peled (Z. Oper. Research, 1982)

Box-threshold graphs. - Uri N. Peled; Bruno Simeone (J. Graph Theory, 1984)

Polynomial-time algorithms for regular set-covering and threshold synthesis. - Uri N. Peled; Bruno Simeone (Discret. Appl. Math., 1985)

Hamiltonian threshold graphs. - Frank Harary; Uri N. Peled (Discret. Appl. Math., 1987)

Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials. - Janet Simpson Beissinger; Uri N. Peled (Graphs Comb., 1987)

Strict 2-threshold graphs. - Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Appl. Math., 1988)

Preface. - Uri N. Peled (Discret. Appl. Math., 1989)

Some properties of 2-threshold graphs. - Peter Ladislaw Hammer; Nadimpalli V. R. Mahadev; Uri N. Peled (Networks, 1989)

Difference graphs. - Peter L. Hammer; Uri N. Peled; Xiaorong Sun (Discret. Appl. Math., 1990)

Vicinal orders of trees. - Uri N. Peled; Murali K. Srinivasan (Discret. Appl. Math., 1990)

On a conjecture of wang and williams. - Nadimpalli V. R. Mahadev; Uri N. Peled (J. Graph Theory, 1991)

A Linear Algorithm for the Group Path Problem on Chordal Graphs. - Srinivasa Rao Arikati; Uri N. Peled (Discret. Appl. Math., 1993)

Bipartite bithreshold graphs. - Peter L. Hammer; Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Math., 1993)

Poset matching - a distributive analog of independent matching. - Uri N. Peled; Murali K. Srinivasan (Discret. Math., 1993)

Edge-Chromatic Scheduling with Simultaneity Constraints. - Dominique de Werra; Nadimpalli V. R. Mahadev; Uri N. Peled (SIAM J. Discret. Math., 1993)

A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function. - Uri N. Peled; Bruno Simeone (Discret. Appl. Math., 1994)

Total Matchings and Total Coverings of Threshold Graphs. - Uri N. Peled; Feng Sun (Discret. Appl. Math., 1994)

Longest cycles in threshold graphs. - Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Math., 1994)

Equistable graphs. - Nadimpalli V. R. Mahadev; Uri N. Peled; Feng Sun (J. Graph Theory, 1994)

Enumeration of Difference Graphs. - Uri N. Peled; Feng Sun (Discret. Appl. Math., 1995)

or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles? - Uri N. Peled; Julin Wu (Electron. J. Comb., 1996)

A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. - Srinivasa Rao Arikati; Uri N. Peled (Discret. Appl. Math., 1996)

Restrictions and Preassignments in Preemptive open Shop Scheduling. - Dominique de Werra; Alan J. Hoffman; Nadimpalli V. R. Mahadev; Uri N. Peled (Discret. Appl. Math., 1996)

A note on major sequences and external activity in trees. - Janet Simpson Beissinger; Uri N. Peled (Electron. J. Comb., 1997)

Horn Functions and Submodular Boolean Functions. - Oya Ekin; Peter L. Hammer; Uri N. Peled (Theor. Comput. Sci., 1997)

(n, e)-Graphs with maximum sum of squares of degrees. - Uri N. Peled; Rossella Petreschi; Andrea Sterbini (J. Graph Theory, 1999)

Restricted unimodular chordal graphs. - Uri N. Peled; Julin Wu (J. Graph Theory, 1999)

Trees. - Lisa Carbone; Uri N. Peled; Paul K. Stockmeyer (Handbook of Discrete and Combinatorial Mathematics, 1999)

Block duplicate graphs and a hierarchy of chordal graphs. - Martin Charles Golumbic; Uri N. Peled (Discret. Appl. Math., 2002)

Equistable series-parallel graphs. - Ephraim Korach; Uri N. Peled (Discret. Appl. Math., 2003)

Equistable chordal graphs. - Uri N. Peled; Udi Rotics (Discret. Appl. Math., 2003)

Explicit construction of families of LDPC codes with no 4-cycles. - Jon-Lark Kim; Uri N. Peled (ISIT, 2004)

Explicit construction of families of LDPC codes with no 4-cycles. - Jon-Lark Kim; Uri N. Peled; I. Perepelitsa; Vera Pless; Shmuel Friedland (IEEE Trans. Inf. Theory, 2004)

Theory of computation of multidimensional entropy with an application to the monomer-dimer problem. - Shmuel Friedland; Uri N. Peled (Adv. Appl. Math., 2005)

On the First Eigenvalue of Bipartite Graphs. - Amitava Bhattacharya; Shmuel Friedland; Uri N. Peled (Electron. J. Comb., 2008)

Equistable distance-hereditary graphs. - Ephraim Korach; Uri N. Peled; Udi Rotics (Discret. Appl. Math., 2008)