Try with accents

docs/src/background/bibliography.md

@@ -1,4 +1,4 @@
-#
+# Bibliography
 
 ```@bibliography
 ```

docs/src/references.bib

@@ -8,11 +8,49 @@ @Book{Barvinok2002
   doi       = {https://doi.org/10.1090/gsm/054},
 }
 
+@Article{Bertsimas2018,
+  author  = {Bertsimas, Dimitris and Gupta, Vishal and Kallus, Nathan},
+  journal = {Mathematical Programming},
+  title   = {Data-driven robust optimization},
+  year    = {2018},
+  issn    = {1436-4646},
+  number  = {2},
+  pages   = {235--292},
+  volume  = {167},
+  doi     = {10.1007/s10107-017-1125-8},
+}
+
 @Article{Knuth1994,
-  author = {Knuth, Donald E.},
-  title = {The sandwich theorem},
+  author  = {Knuth, Donald E.},
+  title   = {The sandwich theorem},
   journal = {The Electronic Journal of Combinatorics},
-  doi = {https://doi.org/10.37236%2F1193},
-  volume = {1},
-  year = {1994},
+  volume  = {1},
+  year    = {1994},
+  doi     = {10.37236/1193},
+}
+
+@InProceedings{Linial2002,
+  author    = {Linial, Nathan},
+  title     = {Finite Metric Spaces: Combinatorics, Geometry and Algorithms},
+  year      = {2002},
+  address   = {New York, NY, USA},
+  pages     = {63},
+  publisher = {Association for Computing Machinery},
+  series    = {SCG '02},
+  doi       = {10.1145/513400.513441},
+  isbn      = {1581135041},
+  location  = {Barcelona, Spain},
+  numpages  = {1},
+}
+
+@Book{Matousek2013,
+  author    = {Matou{\v{s}}ek, Jiri},
+  publisher = {Springer Science \& Business Media},
+  title     = {Lectures on discrete geometry},
+  year      = {2013},
+  isbn      = {978-1-4613-0039-7},
+  number    = {1},
+  series    = {Graduate Texts in Mathematics},
+  volume    = {212},
+  doi       = {10.1007/978-1-4613-0039-7},
 }

docs/src/tutorials/conic/simple_examples.jl

@@ -254,14 +254,7 @@ example_correlation_problem()
 # which gives us the SDP formulation below.
 # Since we may choose any point to be the origin, we fix the first vertex at 0.
 #
-# For more details, see:
-#
-# J. Matoušek (2002), [_Lectures on discrete geometry_](https://doi.org/10.1007/978-1-4613-0039-7),
-# Springer, pp. 378-379
-#
-#  N. Linial (2002),
-# _[Finite metric spaces--combinatorics, geometry and algorithms](https://arxiv.org/abs/math/0304466)_,
-# Proceedings of the ICM, Vol. 3, 573-586
+# For more details, see [Matousek2013,Linial2002](@cite).
 
 function example_minimum_distortion()
     model = Model(SCS.Optimizer)
@@ -379,11 +372,7 @@ example_theta_problem()
 
 # This example computes the Value at Risk for a data-driven uncertainty set.
 # Closed-form expressions for the optimal value are available.
-# For more details, see:
-
-# Bertsimas, D., Gupta, V., & Kallus, N. (2018).
-# [_Data-driven robust optimization._](https://doi.org/10.1007/s10107-017-1125-8)
-# Mathematical Programming, 167, 235-292.
+# For more details, see [Bertsimas2018](@cite).
 
 function example_robust_uncertainty_sets()
     R, d, 𝛿, ɛ = 1, 3, 0.05, 0.05