Elisabet Burjons

E-mail:	[lastname] at yorku.ca
Office:	Room 3052D Lassonde Building
Office Hours:	Wednesdays 11-12h

My research interests lie in the areas of kernelization and parameterized complexity, algorithms and complexity of geometric problems, online algorithms and applications.

Teaching

• Introduction to the Theory of Computation. Fall 2022: The material will be on eClass.

Publications

Most of my publications can be found in Dblp, but here is a list.

• 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. arXiv:2201.04061, 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 parametrization. Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, 231--256, 2018.
• H-J. Böckenhauer, E. Burjons, M. Raszyk, and P. Rossmanith. Reoptimization of parameterized problems. arXiv:1809.10578, 2018.

Thesis and Postdoc

On December 2019 I defended my Phd Thesis under the supervision of Prof. Juraj Hromkovič at ETH with title The Impact of Additional Information on Online and Parameterized Problems.

Between 2020 and 2022 I was a postdoc in the Theoretical Computer Science group thanks to an Early Postdoc Mobility grant from the Swiss National Research Foundation.