Uri N. Peled

Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled: On the First Eigenvalue of Bipartite Graphs. Electr. J. Comb. 15(1) (2008)

Ephraim Korach, Uri N. Peled, Udi Rotics: Equistable distance-hereditary graphs. Discrete Applied Mathematics 156(4): 462-477 (2008)

Jon-Lark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland: Explicit construction of families of LDPC codes with no 4-cycles. IEEE Transactions on Information Theory 50(10): 2378-2388 (2004)

Ephraim Korach, Uri N. Peled: Equistable series-parallel graphs. Discrete Applied Mathematics 132(1-3): 149-162 (2003)

Uri N. Peled, Udi Rotics: Equistable chordal graphs. Discrete Applied Mathematics 132(1-3): 203-210 (2003)

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

Uri N. Peled, Julin Wu: Restricted unimodular chordal graphs. Journal of Graph Theory 30(2): 121-136 (1999)

Uri N. Peled, Rossella Petreschi, Andrea Sterbini: (n, e)-Graphs with maximum sum of squares of degrees. Journal of Graph Theory 31(4): 283-295 (1999)

Janet Simpson Beissinger, Uri N. Peled: A note on major sequences and external activity in trees. Electr. J. Comb. 4(2) (1997)

Oya Ekin, Peter L. Hammer, Uri N. Peled: Horn Functions and Submodular Boolean Functions. Theor. Comput. Sci. 175(2): 257-270 (1997)

Uri N. Peled, Julin Wu: or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles? Electr. J. Comb. 3(1) (1996)

Srinivasa Rao Arikati, Uri N. Peled: A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. Discrete Applied Mathematics 65(1-3): 5-20 (1996)

Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled: Restrictions and Preassignments in Preemptive open Shop Scheduling. Discrete Applied Mathematics 68(1-2): 169-188 (1996)

Uri N. Peled, Feng Sun: Enumeration of Difference Graphs. Discrete Applied Mathematics 60(1-3): 311-318 (1995)

Uri N. Peled, Bruno Simeone: A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function. Discrete Applied Mathematics 49(1-3): 309-323 (1994)

Uri N. Peled, Feng Sun: Total Matchings and Total Coverings of Threshold Graphs. Discrete Applied Mathematics 49(1-3): 325-330 (1994)

Nadimpalli V. R. Mahadev, Uri N. Peled: Longest cycles in threshold graphs. Discrete Mathematics 135(1-3): 169-176 (1994)

Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun: Equistable graphs. Journal of Graph Theory 18(3): 281-299 (1994)

Srinivasa Rao Arikati, Uri N. Peled: A Linear Algorithm for the Group Path Problem on Chordal Graphs. Discrete Applied Mathematics 44(1-3): 185-190 (1993)

Uri N. Peled, Murali K. Srinivasan: Poset matching - a distributive analog of independent matching. Discrete Mathematics 114(1-3): 403-424 (1993)

Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled: Bipartite bithreshold graphs. Discrete Mathematics 119(1-3): 79-96 (1993)

Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled: Edge-Chromatic Scheduling with Simultaneity Constraints. SIAM J. Discrete Math. 6(4): 631-641 (1993)

Nadimpalli V. R. Mahadev, Uri N. Peled: On a conjecture of wang and williams. Journal of Graph Theory 15(2): 115-120 (1991)

Peter L. Hammer, Uri N. Peled, Xiaorong Sun: Difference graphs. Discrete Applied Mathematics 28(1): 35-44 (1990)

Uri N. Peled, Murali K. Srinivasan: Vicinal orders of trees. Discrete Applied Mathematics 29(2-3): 211-219 (1990)

Uri N. Peled: Preface. Discrete Applied Mathematics 25(1-2): 1 (1989)

Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled: Some properties of 2-threshold graphs. Networks 19(1): 17-23 (1989)

Nadimpalli V. R. Mahadev, Uri N. Peled: Strict 2-threshold graphs. Discrete Applied Mathematics 21(2): 113-131 (1988)

Janet Simpson Beissinger, Uri N. Peled: Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials. Graphs and Combinatorics 3(1): 213-219 (1987)

Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu: Boolean distance for graphs. Discrete Mathematics 39(2): 123-127 (1982)

Peter L. Hammer, Uri N. Peled, M. A. Pollatschek: An Algorithm to Dualize a Regular Switching Function. IEEE Trans. Computers 28(3): 238-243 (1979)

Peter L. Hammer, Uri N. Peled: On the Maximization of a Pseudo-Boolean Function. J. ACM 19(2): 265-282 (1972)