TODO: Add link to paper.

MLopez-Ibanez · MLopez-Ibanez · commit b5ef9bfe9bf5 · 2026-04-17T20:16:49.000+01:00
diff --git a/TODO b/TODO
@@ -32,7 +32,7 @@ Computation, pp. 465–472 (2012)]
 )
     - Jensen-style divide-and-conquer with small-size subroutines?
  - [ ] 3D Nondominated sorting:
-     Y. Nekrich. A fast algorithm for three-dimensional layers of maxima problem. In Algorithms and Data Structures, number 6844 in Lecture Notes in Computer Science, pages 607–618. 2011.
+     Y. Nekrich. A fast algorithm for three-dimensional layers of maxima problem. In Algorithms and Data Structures, number 6844 in Lecture Notes in Computer Science, pages 607–618. 2011. [Paper](https://link.springer.com/chapter/10.1007/978-3-642-22300-6_51)
  - [ ] Epsilon-dominance:
    - https://github.com/matthewjwoodruff/pareto.py
  - [ ] HSSP (Hypervolume Subset Selection Problem)

Original file line number	Diff line number	Diff line change
`@@ -32,7 +32,7 @@ Computation, pp. 465–472 (2012)]`
`32`	`32`	`)`
`33`	`33`	`- Jensen-style divide-and-conquer with small-size subroutines?`
`34`	`34`	`- [ ] 3D Nondominated sorting:`
`35`		`- Y. Nekrich. A fast algorithm for three-dimensional layers of maxima problem. In Algorithms and Data Structures, number 6844 in Lecture Notes in Computer Science, pages 607–618. 2011.`
	`35`	`+ Y. Nekrich. A fast algorithm for three-dimensional layers of maxima problem. In Algorithms and Data Structures, number 6844 in Lecture Notes in Computer Science, pages 607–618. 2011. [Paper](https://link.springer.com/chapter/10.1007/978-3-642-22300-6_51)`
`36`	`36`	`- [ ] Epsilon-dominance:`
`37`	`37`	`- https://github.com/matthewjwoodruff/pareto.py`
`38`	`38`	`- [ ] HSSP (Hypervolume Subset Selection Problem)`