Close mobile menu

Author Image

Elisabet Burjons

Assistant Professor


Electrical Engineering & Computer Science


Elisabet Burjons is an assistant professor in Computer Science at the Lassonde School of Engineering of York University since 2022. After studying Mathematics and Physics, she pursued a PhD in Theoretical Computer Science in the topics of online algorithms and parameterized complexity at ETH Zürich. Then she was awarded a 2 year postdoc mobility grant from the Swiss National Science Foundation to further her research on the topic of Turing Kernelization at RWTH Aachen. Her main research interests lie in the areas of kernelization and parameterized complexity, algorithms and complexity of geometric problems, online algorithms and applications.

Research Interests

  •  kernelization and parameterized complexity
  • algorithms for computational geometry
  • online algorithms and applications

Recent Publications

  • H-J. Böckenhauer, E. Burjons, M. Raszyk, and P. Rossmanith. Reoptimization of parameterized problems. Acta Informatica , 2022.
  • E. Burjons, J. Fuchs, and H. Lotze. The slotted online one-sided crossing minimization problem on 2-regular graphs. Proceedings of IWOCA 2022, pp 243–256, 2022.
  • E. Burjons, P. Rossmanith. Lower bounds for conjunctive and disjunctive Turing kernels. Proceedings of IPEC 2021, 12:1--12:17, 2021.
  • E. Burjons, M. Gehnen, H. Lotze, D. Mock, and P. Rossmanith. The secretary problem with reservation costs. Proceedings of COCOON 2021, 553--564, 2021.
  • E. Burjons, F. Frei, and M. Raszyk. From functional nondeterministic transducers to deterministic two-tape automata. Proceedings of LICS 2021, 1--13, 2021.
  • H-J. Böckenhauer, E. Burjons, J. Hromkovic, H. Lotze, and P. Rossmanith. Online simple knapsack with reservation costs. Proceedings of STACS 2021, 16:1--16:18, 2021.
  • E. Burjons, D. Komm, and M. Schöngens. The k-server problem with advice in d dimensions and on the sphere. Algorithmica, 81(5):1859--1880, 2019.
  • E. Burjons, F. Frei, E. Hemaspaandra, D. Komm, and D. Wehner. Finding optimal solutions with neighborly help. In Proceedings of MFCS 2019, LIPIcs 138, 78:1--78:14, 2019.
  • E. Burjons, J. Hromkovič, R. Královič, R. Královič, X. Muñoz, and W. Unger. Online graph coloring against a randomized adversary. Int. J. Found. Comput. Sci., 29(4):551--569, 2018.
  • B. Radics, E. Burjons, and A. Rubbia. Matching problem for primary and secondary signals in dual-phase TPC detectors. Nuclear Instruments and Methods in Physics, 889:16--21, 2018.
  • E. Burjons, F. Frei, J. Smula, and D. Wehner. Length-weighted disjoint path allocation - Advice and parameterization. Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, 231--256, 2018.

Other publications can be found in Dblp


  • LE/EECS2001A Introduction to the Theory of Computation (Fall 2022/2023)

If you are a student in one of my courses, you will find the materials in eClass