Brodal, G. S., Fagerberg, R., Meyer, U. & Zeh, N. (2004).
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. In T. Hagerup & J. Katajainen (Eds.),
Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings (pp. 480-492). Springer.
https://doi.org/10.1007/978-3-540-27810-8_41
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Eades, P. (Ed.) & Takaoka, T. (Ed.) (2001).
Computing the Quartet Distance Between Evolutionary Trees in Time O(n log² n). In
Proceedings of Algorithms and Computation : 12th International Symposium, ISAAC 2001 (2223 of Lecture Notes in Computer Science ed., Vol. 2223/2001, pp. 731-742). Springer.
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S. & Östlin, A. (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. In F. Orejas, P. G. Spirakis & J. van Leeuwen (Eds.),
Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings (pp. 140-151). Springer.
https://doi.org/10.1007/3-540-48224-5_12
Brodal, G. S., Fagerberg, R., Östlin, A.
, Pedersen, C. N. S. & Rao, S. S. (2003).
Computing Refined Buneman Trees in Cubic Time. In G. Benson & R. Page (Eds.),
Algorithms in Bioinformatics: Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003. Proceedings (pp. 259-270). Springer.
https://doi.org/10.1007/978-3-540-39763-2_20
Brodal, G. S., Lagogiannis, G., Makris, C., Tsakalidis, A. & Tsichlas, K. (2003).
Optimal Finger Search Trees in the Pointer Machine.
Journal of Computer and System Sciences,
67(2), 381-418.
https://doi.org/10.1016/S0022-0000(03)00013-8
Brodal, G. S., Lyngsø, R. B., Östlin, A.
& Pedersen, C. N. S. (2002).
Solving the String Statistics Problem in Time O(n log n). In P. Widmayer, S. Eidenbenz, F. Triguero, R. Morales, R. Conejo & M. Hennessy (Eds.),
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings (pp. 728-739). Springer.
https://doi.org/10.1007/3-540-45465-9_62
Brodal, G. S., Makris, C., Sioutas, S., Tsakalidis, A. K. & Tsichlas, K. (2002).
Optimal Solutions for the Temporal Precedence Problem.
Algorithmica,
33(4), 494-510.
https://doi.org/10.1007/s00453-002-0935-z
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Östlin, A., Orejas, F. (Ed.), Spirakis, P. G. (Ed.) & Leeuwen, J. V. (Ed.) (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. In
Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science ed., Vol. 2076/2001, pp. 140-151). Springer.
Brodal, G. S., Kaporis, A. C., Sioutas, S.
, Tsakalidis, K. & Tsichlas, K. (2009).
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time.
Lecture Notes in Computer Science,
5878, 193-202.
https://doi.org/10.1007/978-3-642-10631-6_21
Brodal, G. S., Demaine, E. D., Fineman, J. T., Iacono, J., Langerman, S. & Munro, J. I. (2010).
Cache-Oblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff.
Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 1448-1456.
http://www.siam.org/proceedings/soda/2010/SODA10_117_brodalg.pdf