The following pages link to Eberhard Triesch (Q213186):
Displaying 46 items.
- A note on the duality between matchings and vertex covers in balanced hypergraphs (Q306113) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- An asymptotic bound for the complexity of monotone graph properties (Q653841) (← links)
- Reconstructing infinite sets of integers (Q696913) (← links)
- (Q909655) (redirect page) (← links)
- A note on a theorem of Blum, Shub, and Smale (Q909656) (← links)
- A short proof that matching matroids are transversal (Q1186958) (← links)
- Extremals of the cone of norms and the cohomology of \(c^ 3\)- stratifications (Q1190767) (← links)
- On the convergence of product-sum series of \(L-R\) fuzzy numbers (Q1311833) (← links)
- Characterisation of Archimedean \(t\)-norms and a law of large numbers (Q1315874) (← links)
- A probabilistic upper bound for the edge identification complexity of graphs (Q1322293) (← links)
- Codings of graphs with binary edge labels (Q1323484) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- A note on the reconstruction of sets of finite measure (Q1416140) (← links)
- A ternary search problem on two disjoint sets (Q1627863) (← links)
- Edge search in graphs and hypergraphs of bounded rank (Q1801680) (← links)
- Using the generalized assignment problem in scheduling the ROSAT space telescope (Q1806665) (← links)
- Reconstruction up to isometries (Q1861229) (← links)
- Superdominance order and distance of trees with bounded maximum degree (Q1861561) (← links)
- Perfect matchings in balanced hypergraphs---a combinatorial approach (Q1872893) (← links)
- Searching for acyclic orientations of graphs (Q1898338) (← links)
- A group testing problem for hypergraphs of bounded rank (Q1917312) (← links)
- On the recognition complexity of some graph properties (Q1924495) (← links)
- On the burning number of \(p\)-caterpillars (Q2056898) (← links)
- New estimates for the gap chromatic number (Q2449176) (← links)
- Transitive avoidance games on boards of odd size (Q2665970) (← links)
- Upper and lower bounds for competitive group testing (Q2700623) (← links)
- (Q2791973) (← links)
- (Q3355250) (← links)
- (Q3680877) (← links)
- Irregular Assignments of Trees and Forests (Q3970584) (← links)
- (Q3971995) (← links)
- (Q3977472) (← links)
- (Q3993041) (← links)
- (Q3993083) (← links)
- (Q4028414) (← links)
- Reconstructing a Graph from its Neighborhood Lists (Q4290082) (← links)
- Some Results on Elusive Graph Properties (Q4291554) (← links)
- (Q4347876) (← links)
- Improved Results for Competitive Group Testing (Q4660563) (← links)
- (Q4728247) (← links)
- (Q4828904) (← links)
- Degree sequences of graphs and dominance order (Q4879171) (← links)
- A Lower Bound for the Complexity of Monotone Graph Properties (Q5300493) (← links)
- (Q5688997) (← links)
- Searching for an edge in a graph (Q5948111) (← links)
