default search action
Lene M. Favrholdt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j33]Joan Boyar
, Lene M. Favrholdt
Online Unit Profit Knapsack with Predictions. Algorithmica 86(9): 2786-2821 (2024) - 2022
- [j32]Joan Boyar
Relaxing the Irrevocability Requirement for Online Graph Algorithms. Algorithmica 84(7): 1916-1951 (2022) - [j31]Joan Boyar
Relative Worst-order Analysis: A Survey. ACM Comput. Surv. 54(1): 8:1-8:21 (2022) - 2021
- [j30]Joan Boyar
Online Bin Covering with Advice. Algorithmica 83(3): 795-821 (2021) - 2019
- [j29]Joan Boyar
Online Dominating Set. Algorithmica 81(5): 1938-1964 (2019) - 2018
- [j28]Lene M. Favrholdt
Online edge coloring of paths and trees with a fixed number of colors. Acta Informatica 55(1): 57-80 (2018) - [j27]Joan Boyar
Batch Coloring of Graphs. Algorithmica 80(11): 3293-3315 (2018) - [j26]Joan Boyar
Weighted Online Problems with Advice. Theory Comput. Syst. 62(6): 1443-1469 (2018) - [j25]Joan Boyar
Online-bounded analysis. J. Sched. 21(4): 429-441 (2018) - 2017
- [j24]Joan Boyar
Online Algorithms with Advice: A Survey. ACM Comput. Surv. 50(2): 19:1-19:34 (2017) - [j23]Joan Boyar
The Advice Complexity of a Class of Hard Online Problems. Theory Comput. Syst. 61(4): 1128-1177 (2017) - 2016
- [j22]Joan Boyar
Online Algorithms with Advice: A Survey. SIGACT News 47(3): 93-129 (2016) - 2015
- [j21]Marie G. Christ
Online multi-coloring with advice. Theor. Comput. Sci. 596: 79-91 (2015) - 2014
- [j20]Marie G. Christ
Online bin covering: Expectations vs. guarantees. Theor. Comput. Sci. 556: 71-84 (2014) - 2013
- [j19]Marie G. Christ
Online multi-coloring on the path revisited. Acta Informatica 50(5-6): 343-357 (2013) - 2012
- [j18]Leah Epstein, Lene M. Favrholdt
Comparing online algorithms for bin packing problems. J. Sched. 15(1): 13-21 (2012) - [j17]Joan Boyar
A new variable-sized bin packing problem. J. Sched. 15(3): 273-287 (2012) - 2011
- [j16]Leah Epstein, Lene M. Favrholdt
Online variable-sized bin packing with conflicts. Discret. Optim. 8(2): 333-343 (2011) - 2010
- [j15]Joan Boyar
Scheduling Jobs on Grid Processors. Algorithmica 57(4): 819-847 (2010) - [j14]Martin R. Ehmsen, Lene M. Favrholdt
Comparing First-Fit and Next-Fit for online edge coloring. Theor. Comput. Sci. 411(16-18): 1734-1741 (2010) - 2007
- [j13]Joan Boyar
The relative worst-order ratio applied to paging. J. Comput. Syst. Sci. 73(5): 818-843 (2007) - [j12]Joan Boyar
The relative worst order ratio for online algorithms. ACM Trans. Algorithms 3(2): 22 (2007) - 2006
- [j11]Leah Epstein, Lene M. Favrholdt
Separating online scheduling algorithms with the relative worst order ratio. J. Comb. Optim. 12(4): 363-386 (2006) - [j10]Joan Boyar
The maximum resource bin packing problem. Theor. Comput. Sci. 362(1-3): 127-139 (2006) - 2005
- [j9]Leah Epstein, Lene M. Favrholdt
Optimal non-preemptive semi-online scheduling on two related machines. J. Algorithms 57(1): 49-73 (2005) - [j8]Susanne Albers, Lene M. Favrholdt
On paging with locality of reference. J. Comput. Syst. Sci. 70(2): 145-175 (2005) - 2003
- [j7]Joan Boyar
Extending the accommodating function. Acta Informatica 40(1): 3-35 (2003) - [j6]Leah Epstein, Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. Acta Cybern. 16(1): 57-66 (2003) - [j5]Lene M. Favrholdt
On-Line Edge-Coloring with a Fixed Number of Colors. Algorithmica 35(2): 176-191 (2003) - [j4]Eric Bach, Joan Boyar
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. J. Sched. 6(2): 131-147 (2003) - 2002
- [j3]Yossi Azar
Fair versus Unrestricted Bin Packing. Algorithmica 34(2): 181-196 (2002) - [j2]Leah Epstein, Lene M. Favrholdt
Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Oper. Res. Lett. 30(4): 269-275 (2002) - 2001
- [j1]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences. Nord. J. Comput. 8(4): 463-472 (2001)
Conference and Workshop Papers
- 2023
- [c26]Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon:
Paging with Succinct Predictions. ICML 2023: 952-968 - [c25]Magnus Berg
Online Minimum Spanning Trees with Weight Predictions. WADS 2023: 136-148 - [c24]Joan Boyar
Online Interval Scheduling with Predictions. WADS 2023: 193-207 - 2022
- [c23]Joan Boyar
Online Unit Profit Knapsack with Untrusted Predictions. SWAT 2022: 20:1-20:17 - 2019
- [c22]Joan Boyar
Online Bin Covering with Advice. WADS 2019: 225-238 - 2018
- [c21]Joan Boyar
Relative Worst-Order Analysis: A Survey. Adventures Between Lower Bounds and Higher Altitudes 2018: 216-230 - 2017
- [c20]Joan Boyar
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS 2017: 217-228 - 2016
- [c19]Joan Boyar
Online Bounded Analysis. CSR 2016: 131-145 - [c18]Joan Boyar
Weighted Online Problems with Advice. IWOCA 2016: 179-190 - [c17]Joan Boyar
Online Dominating Set. SWAT 2016: 21:1-21:15 - [c16]Joan Boyar
Batch Coloring of Graphs. WAOA 2016: 52-64 - 2015
- [c15]Joan Boyar
Advice Complexity for a Class of Online Problems. STACS 2015: 116-129 - 2014
- [c14]Marie G. Christ
Online Multi-Coloring with Advice. WAOA 2014: 83-94 - [c13]Lene M. Favrholdt
Online Dual Edge Coloring of Paths and Trees. WAOA 2014: 181-192 - 2013
- [c12]Marie G. Christ
Online Bin Covering: Expectations vs. Guarantees. COCOA 2013: 226-237 - 2008
- [c11]Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai:
Comparing First-Fit and Next-Fit for Online Edge Coloring. ISAAC 2008: 89-99 - 2006
- [c10]Joan Boyar
Scheduling Jobs on Grid Processors. SWAT 2006: 17-28 - 2005
- [c9]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk:
The Maximum Resource Bin Packing Problem. FCT 2005: 397-408 - [c8]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
The relative worst order ratio applied to paging. SODA 2005: 718-727 - 2003
- [c7]Joan Boyar, Lene M. Favrholdt:
The Relative Worst Order Ratio for On-Line Algorithms. CIAC 2003: 58-69 - 2002
- [c6]Joan Boyar
Extending the Accommodating Function. COCOON 2002: 87-96 - [c5]Leah Epstein, Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. COCOON 2002: 467-475 - [c4]Leah Epstein, Lene M. Favrholdt:
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. MFCS 2002: 245-256 - [c3]Susanne Albers, Lene M. Favrholdt
On paging with locality of reference. STOC 2002: 258-267 - 2000
- [c2]Lene M. Favrholdt
On-Line Edge-Coloring with a Fixed Number of Colors. FSTTCS 2000: 106-116 - [c1]Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213
Informal and Other Publications
- 2024
- [i16]Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Complexity Classes for Online Problems with and without Predictions. CoRR abs/2406.18265 (2024) - 2023
- [i15]Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Minimum Spanning Trees with Weight Predictions. CoRR abs/2302.12029 (2023) - [i14]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Interval Scheduling with Predictions. CoRR abs/2302.13701 (2023) - 2022
- [i13]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Unit Profit Knapsack with Untrusted Predictions. CoRR abs/2203.00285 (2022) - [i12]Antonios Antoniadis, Joan Boyar, Marek Eliás
Paging with Succinct Predictions. CoRR abs/2210.02775 (2022) - 2019
- [i11]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. CoRR abs/1905.00066 (2019) - 2018
- [i10]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Relative Worst-Order Analysis: A Survey. CoRR abs/1802.07080 (2018) - 2017
- [i9]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. CoRR abs/1704.08835 (2017) - 2016
- [i8]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CoRR abs/1602.06708 (2016) - [i7]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. CoRR abs/1604.05172 (2016) - [i6]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
Weighted Online Problems with Advice. CoRR abs/1606.05210 (2016) - [i5]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. CoRR abs/1610.02997 (2016) - 2014
- [i4]Lene M. Favrholdt, Jesper W. Mikkelsen:
Online Max-Edge-Coloring of Paths and Trees. CoRR abs/1405.3817 (2014) - [i3]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
The Advice Complexity of a Class of Hard Online Problems. CoRR abs/1408.7033 (2014) - [i2]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online Multi-Coloring with Advice. CoRR abs/1409.1722 (2014) - 2013
- [i1]Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen:
Online Bin Covering: Expectations vs. Guarantees. CoRR abs/1309.6477 (2013)
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-10-07 21:25 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: