| 2008 |
|---|
| 25 | EE | Ephraim Korach,
Uri N. Peled,
Udi Rotics:
Equistable distance-hereditary graphs.
Discrete Applied Mathematics 156(4): 462-477 (2008) |
| 2004 |
|---|
| 24 | | 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) |
| 2003 |
|---|
| 23 | EE | Ephraim Korach,
Uri N. Peled:
Equistable series-parallel graphs.
Discrete Applied Mathematics 132(1-3): 149-162 (2003) |
| 22 | EE | Uri N. Peled,
Udi Rotics:
Equistable chordal graphs.
Discrete Applied Mathematics 132(1-3): 203-210 (2003) |
| 2002 |
|---|
| 21 | | Martin Charles Golumbic,
Uri N. Peled:
Block duplicate graphs and a hierarchy of chordal graphs.
Discrete Applied Mathematics 124(1-3): 67-71 (2002) |
| 1997 |
|---|
| 20 | EE | Janet Simpson Beissinger,
Uri N. Peled:
A note on major sequences and external activity in trees.
Electr. J. Comb. 4(2): (1997) |
| 19 | EE | Oya Ekin,
Peter L. Hammer,
Uri N. Peled:
Horn Functions and Submodular Boolean Functions.
Theor. Comput. Sci. 175(2): 257-270 (1997) |
| 1996 |
|---|
| 18 | EE | 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) |
| 17 | EE | 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) |
| 16 | EE | Uri N. Peled,
Julin Wu:
or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles?
Electr. J. Comb. 3(1): (1996) |
| 1995 |
|---|
| 15 | EE | Uri N. Peled,
Feng Sun:
Enumeration of Difference Graphs.
Discrete Applied Mathematics 60(1-3): 311-318 (1995) |
| 1994 |
|---|
| 14 | | 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) |
| 13 | | Uri N. Peled,
Feng Sun:
Total Matchings and Total Coverings of Threshold Graphs.
Discrete Applied Mathematics 49(1-3): 325-330 (1994) |
| 12 | EE | Nadimpalli V. R. Mahadev,
Uri N. Peled:
Longest cycles in threshold graphs.
Discrete Mathematics 135(1-3): 169-176 (1994) |
| 1993 |
|---|
| 11 | EE | 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) |
| 10 | EE | Uri N. Peled,
Murali K. Srinivasan:
Poset matching - a distributive analog of independent matching.
Discrete Mathematics 114(1-3): 403-424 (1993) |
| 9 | EE | Peter L. Hammer,
Nadimpalli V. R. Mahadev,
Uri N. Peled:
Bipartite bithreshold graphs.
Discrete Mathematics 119(1-3): 79-96 (1993) |
| 8 | | 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) |
| 1990 |
|---|
| 7 | EE | Peter L. Hammer,
Uri N. Peled,
Xiaorong Sun:
Difference graphs.
Discrete Applied Mathematics 28(1): 35-44 (1990) |
| 6 | EE | Uri N. Peled,
Murali K. Srinivasan:
Vicinal orders of trees.
Discrete Applied Mathematics 29(2-3): 211-219 (1990) |
| 1989 |
|---|
| 5 | EE | Uri N. Peled:
Preface.
Discrete Applied Mathematics 25(1-2): 1 (1989) |
| 1988 |
|---|
| 4 | EE | Nadimpalli V. R. Mahadev,
Uri N. Peled:
Strict 2-threshold graphs.
Discrete Applied Mathematics 21(2): 113-131 (1988) |
| 1982 |
|---|
| 3 | EE | Frank Harary,
Robert A. Melter,
Uri N. Peled,
Ioan Tomescu:
Boolean distance for graphs.
Discrete Mathematics 39(2): 123-127 (1982) |
| 1979 |
|---|
| 2 | | 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) |
| 1972 |
|---|
| 1 | EE | Peter L. Hammer,
Uri N. Peled:
On the Maximization of a Pseudo-Boolean Function.
J. ACM 19(2): 265-282 (1972) |
