|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Joan Boyar, Lene M. Favrholdt |
A new variable-sized bin packing problem.  |
J. Scheduling  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt |
Comparing online algorithms for bin packing problems.  |
J. Scheduling  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt, Asaf Levin |
Online variable-sized bin packing with conflicts.  |
Discrete Optimization  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai |
Comparing First-Fit and Next-Fit for online edge coloring.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt |
Scheduling Jobs on Grid Processors.  |
Algorithmica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai |
Comparing First-Fit and Next-Fit for Online Edge Coloring.  |
ISAAC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt |
The relative worst order ratio for online algorithms.  |
ACM Transactions on Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
dual bin packing, relative worst order ratio, Online, bin packing, quality measure |
| 1 | Joan Boyar, Lene M. Favrholdt, Kim S. Larsen |
The relative worst-order ratio applied to paging.  |
J. Comput. Syst. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt |
Separating online scheduling algorithms with the relative worst order ratio.  |
J. Comb. Optim.  |
2006 |
DBLP DOI BibTeX RDF |
Relative worst order ratio, Scheduling, Online algorithms |
| 1 | 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.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt |
Scheduling Jobs on Grid Processors.  |
SWAT  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt |
Optimal non-preemptive semi-online scheduling on two related machines.  |
J. Algorithms  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Lene M. Favrholdt, Oliver Giel |
On paging with locality of reference.  |
J. Comput. Syst. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt, Kim S. Larsen |
The relative worst order ratio applied to paging.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt |
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.  |
Acta Cybern.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen |
Extending the accommodating function.  |
Acta Inf.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lene M. Favrholdt, Morten N. Nielsen |
On-Line Edge-Coloring with a Fixed Number of Colors.  |
Algorithmica  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee |
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.  |
J. Scheduling  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt |
The Relative Worst Order Ratio for On-Line Algorithms.  |
CIAC  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt |
Optimal preemptive semi-online scheduling to minimize makespan on two related machines.  |
Oper. Res. Lett.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein |
Fair versus Unrestricted Bin Packing.  |
Algorithmica  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt |
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.  |
MFCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt |
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.  |
COCOON  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen |
Extending the Accommodating Function.  |
COCOON  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Lene M. Favrholdt, Oliver Giel |
On paging with locality of reference.  |
STOC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen |
Fair versus Unrestricted Bin Packing.  |
SWAT  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Lene M. Favrholdt, Morten N. Nielsen |
On-Line Edge-Coloring with a Fixed Number of Colors.  |
FSTTCS  |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|