The following pages link to Uri N. Peled (Q584288):
Displayed 50 items.
- The polytope of degree sequences (Q584289) (← links)
- Poset matching---a distributive analog of independent matching (Q685701) (← links)
- A linear algorithm for the group path problem on chordal graphs (Q686257) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- Vicinal orders of trees (Q810522) (← links)
- Cones of closed alternating walks and trails (Q880043) (← links)
- The polytope of dual degree partitions (Q996302) (← links)
- On the first eigenvalue of bipartite graphs (Q1010881) (← links)
- The cone of balanced subgraphs (Q1019652) (← links)
- (Q1080869) (redirect page) (← links)
- Hamiltonian threshold graphs (Q1080870) (← links)
- Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
- Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials (Q1089352) (← links)
- Strict 2-threshold graphs (Q1111574) (← links)
- Boolean distance for graphs (Q1160140) (← links)
- Matroidal graphs (Q1244250) (← links)
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian (Q1300907) (← links)
- Degree sequences and majorization (Q1322868) (← links)
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236) (← links)
- Total matchings and total coverings of threshold graphs (Q1327237) (← links)
- Longest cycles in threshold graphs (Q1343260) (← links)
- Powers of circulants in bottleneck algebra (Q1359181) (← links)
- A note on major sequences and external activity in trees (Q1378539) (← links)
- Horn functions and submodular Boolean functions (Q1392203) (← links)
- Equistable series-parallel graphs (Q1414590) (← links)
- Equistable chordal graphs (Q1414594) (← links)
- (Q1850115) (redirect page) (← links)
- Block duplicate graphs and a hierarchy of chordal graphs (Q1850116) (← links)
- Enumeration of difference graphs (Q1894373) (← links)
- Threshold graphs and related topics (Q1899209) (← links)
- A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- For which graphs does every edge belong to exactly two chordless cycles? (Q1918870) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem (Q2568107) (← links)
- The Pressure, Densities and First-order Phase Transitions Associated with Multidimensional SOFT (Q2911824) (← links)
- Box-threshold graphs (Q3322144) (← links)
- On a conjecture of wang and williams (Q3358771) (← links)
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles (Q3547154) (← links)
- Some properties of 2-threshold graphs (Q3824454) (← links)
- (Q3901542) (← links)
- (Q3919075) (← links)
- Sufficient Conditions for Graphs to Have Threshold Number 2 (Q3936783) (← links)
- Computing low-capacity 0–1 knapsack polytopes (Q3958269) (← links)
- Constraint Pairing In Integer Programming (Q4058478) (← links)
- (Q4060733) (← links)
- Facet of regular 0–1 polytopes (Q4074672) (← links)
- The Role of Master Polytopes in the Unit Cube (Q4135227) (← links)
- (Q4138481) (← links)
- An Algorithm to Dualize a Regular Switching Function (Q4177485) (← links)