Elisabet Burjons

Orcid: 0000-0001-6161-7440

Affiliations:
  • York University, Toronto, Canada
  • RWTH Aachen, Germany


According to our database1, Elisabet Burjons authored at least 15 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Online Simple Knapsack Problem with Reservation and Removability.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Delaying Decisions and Reservation Costs.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Reoptimization of parameterized problems.
Acta Informatica, 2022

The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021
Online Simple Knapsack with Reservation Costs.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Lower Bounds for Conjunctive and Disjunctive Turing Kernels.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

The Secretary Problem with Reservation Costs.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata.
CoRR, 2020

2019
The Impact of Additional Information on Online and Parameterized Problems.
PhD thesis, 2019

The k-Server Problem with Advice in d Dimensions and on the Sphere.
Algorithmica, 2019

Finding Optimal Solutions With Neighborly Help.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Online Graph Coloring Against a Randomized Adversary.
Int. J. Found. Comput. Sci., 2018

Length-Weighted Disjoint Path Allocation - Advice and Parametrization.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract).
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016


  Loading...