Pages that link to "Item:Q3756532"
From MaRDI portal
The following pages link to Searching in Trees, Series-Parallel and Interval Orders (Q3756532):
Displayed 11 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- Series-parallel posets and the Tutte polynomial (Q1815311) (← links)
- Understanding the generalized median stable matchings (Q1959721) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- Algorithmic combinatorics based on slicing posets (Q2503297) (← links)
- On Generalized Comparison-Based Sorting Problems (Q2848974) (← links)
- On complexity of maximizatin of submodular functions<sup>*</sup> (Q4256098) (← links)