default search action
Elisabet Burjons
Person information
- affiliation: York University, Toronto, Canada
- affiliation: RWTH Aachen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions with Neighborly Help. Algorithmica 86(6): 1921-1947 (2024) - 2023
- [c11]Elisabet Burjons
, Fabian Frei
Delaying Decisions and Reservation Costs. COCOON (1) 2023: 371-383 - [c10]Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
The Online Simple Knapsack Problem with Reservation and Removability. MFCS 2023: 29:1-29:12 - [i6]Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
Delaying Decisions and Reservation Costs. CoRR abs/2307.07284 (2023) - 2022
- [j3]Hans-Joachim Böckenhauer
Reoptimization of parameterized problems. Acta Informatica 59(4): 427-450 (2022) - [c9]Elisabet Burjons
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. IWOCA 2022: 243-256 - [i5]Elisabet Burjons, Janosch Fuchs, Henri Lotze:
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. CoRR abs/2201.04061 (2022) - 2021
- [c8]Elisabet Burjons
The Secretary Problem with Reservation Costs. COCOON 2021: 553-564 - [c7]Elisabet Burjons
Lower Bounds for Conjunctive and Disjunctive Turing Kernels. IPEC 2021: 12:1-12:17 - [c6]Elisabet Burjons
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata. LICS 2021: 1-13 - [c5]Hans-Joachim Böckenhauer, Elisabet Burjons
Online Simple Knapsack with Reservation Costs. STACS 2021: 16:1-16:18 - 2020
- [i4]Elisabet Burjons, Fabian Frei, Martin Raszyk:
From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata. CoRR abs/2005.13710 (2020) - [i3]Hans-Joachim Böckenhauer
Online Simple Knapsack with Reservation Costs. CoRR abs/2009.14043 (2020)
2010 – 2019
- 2019
- [b1]Elisabet Burjons:
The Impact of Additional Information on Online and Parameterized Problems. ETH Zurich, Zürich, Switzerland, 2019 - [j2]Elisabet Burjons
The k-Server Problem with Advice in d Dimensions and on the Sphere. Algorithmica 81(5): 1859-1880 (2019) - [c4]Elisabet Burjons
Finding Optimal Solutions With Neighborly Help. MFCS 2019: 78:1-78:14 - [i2]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions With Neighborly Help. CoRR abs/1906.10078 (2019) - 2018
- [j1]Elisabet Burjons
Online Graph Coloring Against a Randomized Adversary. Int. J. Found. Comput. Sci. 29(4): 551-569 (2018) - [c3]Elisabet Burjons
Length-Weighted Disjoint Path Allocation - Advice and Parametrization. Adventures Between Lower Bounds and Higher Altitudes 2018: 231-256 - [c2]Elisabet Burjons
The k-Server Problem with Advice in d Dimensions and on the Sphere. SOFSEM 2018: 396-409 - [i1]Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith:
Reoptimization of Parameterized Problems. CoRR abs/1809.10578 (2018) - 2016
- [c1]Elisabet Burjons
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). SOFSEM 2016: 229-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: