The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Uri N. Peled: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Janet Simpson Beissinger, Uri N. Peled
    A note on major sequences and external activity in trees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  2. Uri N. Peled, Julin Wu
    or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles? [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:1, pp:- [Journal]
  3. Srinivasa Rao Arikati, Uri N. Peled
    A Linear Algorithm for the Group Path Problem on Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:185-190 [Journal]
  4. Srinivasa Rao Arikati, Uri N. Peled
    A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:5-20 [Journal]
  5. Martin Charles Golumbic, Uri N. Peled
    Block duplicate graphs and a hierarchy of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:67-71 [Journal]
  6. Ephraim Korach, Uri N. Peled
    Equistable series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:149-162 [Journal]
  7. Uri N. Peled, Udi Rotics
    Equistable chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:203-210 [Journal]
  8. Uri N. Peled, Bruno Simeone
    A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:309-323 [Journal]
  9. Uri N. Peled, Feng Sun
    Total Matchings and Total Coverings of Threshold Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:325-330 [Journal]
  10. Uri N. Peled, Feng Sun
    Enumeration of Difference Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:311-318 [Journal]
  11. Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled
    Restrictions and Preassignments in Preemptive open Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:169-188 [Journal]
  12. Peter L. Hammer, Uri N. Peled
    On the Maximization of a Pseudo-Boolean Function. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:2, pp:265-282 [Journal]
  13. Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled
    Edge-Chromatic Scheduling with Simultaneity Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:631-641 [Journal]
  14. Peter L. Hammer, Uri N. Peled, M. A. Pollatschek
    An Algorithm to Dualize a Regular Switching Function. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1979, v:28, n:3, pp:238-243 [Journal]
  15. Oya Ekin, Peter L. Hammer, Uri N. Peled
    Horn Functions and Submodular Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:2, pp:257-270 [Journal]
  16. Jon-Lark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland
    Explicit construction of families of LDPC codes with no 4-cycles. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:2378-2388 [Journal]
  17. Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu
    Boolean distance for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:39, n:2, pp:123-127 [Journal]
  18. Uri N. Peled, Murali K. Srinivasan
    Poset matching - a distributive analog of independent matching. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:403-424 [Journal]
  19. Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
    Bipartite bithreshold graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:119, n:1-3, pp:79-96 [Journal]
  20. Nadimpalli V. R. Mahadev, Uri N. Peled
    Longest cycles in threshold graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:135, n:1-3, pp:169-176 [Journal]

  21. Equistable distance-hereditary graphs. [Citation Graph (, )][DBLP]


  22. Strict 2-threshold graphs. [Citation Graph (, )][DBLP]


  23. Preface. [Citation Graph (, )][DBLP]


  24. Difference graphs. [Citation Graph (, )][DBLP]


  25. Vicinal orders of trees. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002