Uri N. Peled

From MaRDI portal
Person:584288

Available identifiers

zbMath Open peled.uri-nMaRDI QIDQ584288

List of research outcomes





PublicationDate of PublicationType
The Pressure, Densities and First-order Phase Transitions Associated with Multidimensional SOFT2012-09-03Paper
The cone of balanced subgraphs2009-06-04Paper
On the first eigenvalue of bipartite graphs2009-04-07Paper
Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles2008-12-21Paper
Equistable distance-hereditary graphs2008-02-26Paper
The polytope of dual degree partitions2007-09-14Paper
Cones of closed alternating walks and trails2007-05-10Paper
Chain Graphs have Unbounded Readability2006-10-15Paper
Alternating Reachability2005-11-28Paper
Theory of computation of multidimensional entropy with an application to the monomer-dimer problem2005-10-07Paper
https://portal.mardi4nfdi.de/entity/Q46779092005-05-23Paper
Equistable series-parallel graphs2003-12-04Paper
Equistable chordal graphs2003-12-04Paper
Block duplicate graphs and a hierarchy of chordal graphs2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q42611842000-05-10Paper
The realization graph of a degree sequence with majorization gap 1 is Hamiltonian2000-03-13Paper
Restricted unimodular chordal graphs1999-05-09Paper
Horn functions and submodular Boolean functions1998-07-23Paper
A note on major sequences and external activity in trees1998-02-15Paper
Powers of circulants in bottleneck algebra1997-08-19Paper
For which graphs does every edge belong to exactly two chordless cycles?1996-07-21Paper
A polynomial algorithm for the parity path problem on perfectly orientable graphs1996-07-07Paper
Restrictions and preassignments in preemptive open shop scheduling1996-07-07Paper
Threshold graphs and related topics1995-10-09Paper
Enumeration of difference graphs1995-07-24Paper
Longest cycles in threshold graphs1995-02-01Paper
Degree sequences and majorization1995-01-26Paper
An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function1994-12-18Paper
Edge-Chromatic Scheduling with Simultaneity Constraints1994-08-14Paper
https://portal.mardi4nfdi.de/entity/Q42946221994-08-10Paper
Bipartite bithreshold graphs1994-06-26Paper
Total matchings and total coverings of threshold graphs1994-06-15Paper
Equistable graphs1994-06-06Paper
A linear algorithm for the group path problem on chordal graphs1994-01-19Paper
Poset matching---a distributive analog of independent matching1993-10-24Paper
On a conjecture of wang and williams1991-01-01Paper
Difference graphs1990-01-01Paper
Vicinal orders of trees1990-01-01Paper
The polytope of degree sequences1989-01-01Paper
Some properties of 2-threshold graphs1989-01-01Paper
Strict 2-threshold graphs1988-01-01Paper
Hamiltonian threshold graphs1987-01-01Paper
Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials1987-01-01Paper
Polynomial-time algorithms for regular set-covering and threshold synthesis1985-01-01Paper
Box-threshold graphs1984-01-01Paper
Boolean distance for graphs1982-01-01Paper
Computing low-capacity 0–1 knapsack polytopes1982-01-01Paper
Sufficient Conditions for Graphs to Have Threshold Number 21981-01-01Paper
Threshold Numbers and Threshold Completions1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190751981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39015421980-01-01Paper
Threshold Numbers and Threshold Completions1980-01-01Paper
An Algorithm to Dualize a Regular Switching Function1979-01-01Paper
Report of the Session on Algorithms for Special Classes of Combinatorial Optimization Problems1979-01-01Paper
Matroidal graphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41384811977-01-01Paper
The Role of Master Polytopes in the Unit Cube1977-01-01Paper
Facet of regular 0–1 polytopes1975-01-01Paper
Constraint Pairing In Integer Programming1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40607331974-01-01Paper
On the Maximization of a Pseudo-Boolean Function1972-01-01Paper

Research outcomes over time

This page was built for person: Uri N. Peled