![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 13 | Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288 | |
| 11 | Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman: Computing Minimum Spanning Trees with Uncertainty CoRR abs/0802.2855: (2008) |
Selection of 2 from 34 records - Matús Mihalák has 33 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page