List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A survey on algorithms for the maximum internal spanning tree and related problems | 2013-11-08 | Paper |
| On finding spanning trees with few leaves Information Processing Letters | 2010-03-24 | Paper |
| Approximating the maximum internal spanning tree problem Theoretical Computer Science | 2009-11-06 | Paper |
| Vulnerability bounds on the number of spanning tree leaves Ars Mathematica Contemporanea | 2009-10-14 | Paper |
| Improving size-bounds for subcases of square-shaped switchbox routing | 2008-11-18 | Paper |
| Approximation Algorithms for the Maximum Internal Spanning Tree Problem Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Research outcomes over time
This page was built for person: Gábor Salamon
