![]() | ![]() |
| 2008 | ||
|---|---|---|
| 3 | Vojtech Bálint: A distance approximating trees. Discrete Applied Mathematics 156(14): 2740-2752 (2008) | |
| 2003 | ||
| 2 | Vojtech Bálint: The non-approximability of bicriteria network design problems. J. Discrete Algorithms 1(3-4): 339-355 (2003) | |
| 1998 | ||
| 1 | Vojtech Bálint: Two packing problems. Discrete Mathematics 178(1-3): 233-236 (1998) | |
Data released under the ODC-BY 1.0 license — See also our legal information page