Uri N. Peled

According to our database1, Uri N. Peled authored at least 41 papers between 1972 and 2008.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2008
Equistable distance-hereditary graphs.
Discrete Applied Mathematics, 2008

On the First Eigenvalue of Bipartite Graphs.
Electr. J. Comb., 2008

2005
Theory of computation of multidimensional entropy with an application to the monomer-dimer problem.
Adv. Appl. Math., 2005

2004
Explicit construction of families of LDPC codes with no 4-cycles.
IEEE Trans. Information Theory, 2004

Explicit construction of families of LDPC codes with no 4-cycles.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Equistable chordal graphs.
Discrete Applied Mathematics, 2003

Equistable series-parallel graphs.
Discrete Applied Mathematics, 2003

2002
Block duplicate graphs and a hierarchy of chordal graphs.
Discrete Applied Mathematics, 2002

1999
Trees.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Restricted unimodular chordal graphs.
Journal of Graph Theory, 1999

(n, e)-Graphs with maximum sum of squares of degrees.
Journal of Graph Theory, 1999

1997
Horn Functions and Submodular Boolean Functions.
Theor. Comput. Sci., 1997

A note on major sequences and external activity in trees.
Electr. J. Comb., 1997

1996
Restrictions and Preassignments in Preemptive open Shop Scheduling.
Discrete Applied Mathematics, 1996

A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs.
Discrete Applied Mathematics, 1996

or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles?
Electr. J. Comb., 1996

1995
Enumeration of Difference Graphs.
Discrete Applied Mathematics, 1995

1994
Equistable graphs.
Journal of Graph Theory, 1994

Longest cycles in threshold graphs.
Discrete Mathematics, 1994

Total Matchings and Total Coverings of Threshold Graphs.
Discrete Applied Mathematics, 1994

A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function.
Discrete Applied Mathematics, 1994

1993
Edge-Chromatic Scheduling with Simultaneity Constraints.
SIAM J. Discrete Math., 1993

Poset matching - a distributive analog of independent matching.
Discrete Mathematics, 1993

Bipartite bithreshold graphs.
Discrete Mathematics, 1993

A Linear Algorithm for the Group Path Problem on Chordal Graphs.
Discrete Applied Mathematics, 1993

1991
On a conjecture of wang and williams.
Journal of Graph Theory, 1991

1990
Vicinal orders of trees.
Discrete Applied Mathematics, 1990

Difference graphs.
Discrete Applied Mathematics, 1990

1989
Some properties of 2-threshold graphs.
Networks, 1989

Preface.
Discrete Applied Mathematics, 1989

1988
Strict 2-threshold graphs.
Discrete Applied Mathematics, 1988

1987
Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials.
Graphs and Combinatorics, 1987

Hamiltonian threshold graphs.
Discrete Applied Mathematics, 1987

1985
Polynomial-time algorithms for regular set-covering and threshold synthesis.
Discrete Applied Mathematics, 1985

1984
Box-threshold graphs.
Journal of Graph Theory, 1984

1982
Computing low-capacity 0-1 knapsack polytopes.
Zeitschr. für OR, 1982

Boolean distance for graphs.
Discrete Mathematics, 1982

1979
An Algorithm to Dualize a Regular Switching Function.
IEEE Trans. Computers, 1979

1977
Matroidal graphs.
Discrete Mathematics, 1977

1975
Facet of regular 0-1 polytopes.
Math. Program., 1975

1972
On the Maximization of a Pseudo-Boolean Function.
J. ACM, 1972


  Loading...