Upper Bounds on Number of Steals in Rooted Trees.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 223, doi. 10.1007/s00224-015-9613-9
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2016 AND VI 58 AND IP 2
Results: 9
1
2
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 287, doi. 10.1007/s00224-015-9615-7
- By:
- Publication type:
- Article
3
Exact Algorithms for Intervalizing Coloured Graphs.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 273, doi. 10.1007/s00224-015-9616-6
- By:
- Publication type:
- Article
4
The Outer-connected Domination Number of Sierpiński-like Graphs.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 345, doi. 10.1007/s00224-015-9621-9
- By:
- Publication type:
- Article
5
Speed Scaling for Maximum Lateness.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 304, doi. 10.1007/s00224-015-9622-8
- By:
- Publication type:
- Article
6
Online Scheduling FIFO Policies with Admission and Push-Out.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 322, doi. 10.1007/s00224-015-9626-4
- By:
- Publication type:
- Article
7
A Fast Branching Algorithm for Cluster Vertex Deletion.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 357, doi. 10.1007/s00224-015-9631-7
- By:
- Publication type:
- Article
8
Erratum to: 'Top-down Tree Transducers with Regular Look-ahead'.
- Published in:
- 2016
- By:
- Publication type:
- Erratum
9
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 241, doi. 10.1007/s00224-015-9612-x
- By:
- Publication type:
- Article