Uri N. Peled - RankMe

41 papers B 1Journal 39

Year	Rank	Type	Title / Venue / Authors
2008	J	`jnl`	Equistable distance-hereditary graphs. Discret. Appl. Math. Ephraim Korach, Uri N. Peled, Udi Rotics
2008	J	`jnl`	On the First Eigenvalue of Bipartite Graphs. Electron. J. Comb. Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
2005	J	`jnl`	Theory of computation of multidimensional entropy with an application to the monomer-dimer problem. Adv. Appl. Math. Shmuel Friedland, Uri N. Peled
2004	B	`conf`	Explicit construction of families of LDPC codes with no 4-cycles. ISIT Jon-Lark Kim, Uri N. Peled
2004	J	`jnl`	Explicit construction of families of LDPC codes with no 4-cycles. IEEE Trans. Inf. Theory Jon-Lark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland
2003	J	`jnl`	Equistable chordal graphs. Discret. Appl. Math. Uri N. Peled, Udi Rotics
2003	J	`jnl`	Equistable series-parallel graphs. Discret. Appl. Math. Ephraim Korach, Uri N. Peled
2002	J	`jnl`	Block duplicate graphs and a hierarchy of chordal graphs. Discret. Appl. Math. Martin Charles Golumbic, Uri N. Peled
1999	J	`jnl`	(n, e)-Graphs with maximum sum of squares of degrees. J. Graph Theory Uri N. Peled, Rossella Petreschi, Andrea Sterbini
1999	J	`jnl`	Restricted unimodular chordal graphs. J. Graph Theory Uri N. Peled, Julin Wu
1999	—	`ch.`	Trees. Handbook of Discrete and Combinatorial Mathematics Lisa Carbone, Uri N. Peled, Paul K. Stockmeyer
1997	J	`jnl`	A note on major sequences and external activity in trees. Electron. J. Comb. Janet Simpson Beissinger, Uri N. Peled
1997	J	`jnl`	Horn Functions and Submodular Boolean Functions. Theor. Comput. Sci. Oya Ekin, Peter L. Hammer, Uri N. Peled
1996	J	`jnl`	A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. Discret. Appl. Math. Srinivasa Rao Arikati, Uri N. Peled
1996	J	`jnl`	Restrictions and Preassignments in Preemptive open Shop Scheduling. Discret. Appl. Math. Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled
1996	J	`jnl`	or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles? Electron. J. Comb. Uri N. Peled, Julin Wu
1995	J	`jnl`	Enumeration of Difference Graphs. Discret. Appl. Math. Uri N. Peled, Feng Sun
1994	J	`jnl`	A O( Discret. Appl. Math. Uri N. Peled, Bruno Simeone
1994	J	`jnl`	Equistable graphs. J. Graph Theory Nadimpalli V. R. Mahadev, Uri N. Peled, Feng Sun
1994	J	`jnl`	Longest cycles in threshold graphs. Discret. Math. Nadimpalli V. R. Mahadev, Uri N. Peled
1994	J	`jnl`	Total Matchings and Total Coverings of Threshold Graphs. Discret. Appl. Math. Uri N. Peled, Feng Sun
1993	J	`jnl`	A Linear Algorithm for the Group Path Problem on Chordal Graphs. Discret. Appl. Math. Srinivasa Rao Arikati, Uri N. Peled
1993	J	`jnl`	Bipartite bithreshold graphs. Discret. Math. Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
1993	J	`jnl`	Edge-Chromatic Scheduling with Simultaneity Constraints. SIAM J. Discret. Math. Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled
1993	J	`jnl`	Poset matching - a distributive analog of independent matching. Discret. Math. Uri N. Peled, Murali K. Srinivasan
1991	J	`jnl`	On a conjecture of wang and williams. J. Graph Theory Nadimpalli V. R. Mahadev, Uri N. Peled
1990	J	`jnl`	Difference graphs. Discret. Appl. Math. Peter L. Hammer, Uri N. Peled, Xiaorong Sun
1990	J	`jnl`	Vicinal orders of trees. Discret. Appl. Math. Uri N. Peled, Murali K. Srinivasan
1989	J	`jnl`	Preface. Discret. Appl. Math. Uri N. Peled
1989	J	`jnl`	Some properties of 2-threshold graphs. Networks Peter Ladislaw Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled
1988	J	`jnl`	Strict 2-threshold graphs. Discret. Appl. Math. Nadimpalli V. R. Mahadev, Uri N. Peled
1987	J	`jnl`	Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials. Graphs Comb. Janet Simpson Beissinger, Uri N. Peled
1987	J	`jnl`	Hamiltonian threshold graphs. Discret. Appl. Math. Frank Harary, Uri N. Peled
1985	J	`jnl`	Polynomial-time algorithms for regular set-covering and threshold synthesis. Discret. Appl. Math. Uri N. Peled, Bruno Simeone
1984	J	`jnl`	Box-threshold graphs. J. Graph Theory Uri N. Peled, Bruno Simeone
1982	J	`jnl`	Boolean distance for graphs. Discret. Math. Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu
1982	J	`jnl`	Computing low-capacity 0-1 knapsack polytopes. Z. Oper. Research Peter L. Hammer, Uri N. Peled
1979	J	`jnl`	An Algorithm to Dualize a Regular Switching Function. IEEE Trans. Computers Peter L. Hammer, Uri N. Peled, Moshe Asher Pollatschek
1977	J	`jnl`	Matroidal graphs. Discret. Math. Uri N. Peled
1975	J	`jnl`	Facet of regular 0-1 polytopes. Math. Program. Peter L. Hammer, Ellis L. Johnson, Uri N. Peled
1972	J	`jnl`	On the Maximization of a Pseudo-Boolean Function. J. ACM Peter L. Hammer, Uri N. Peled