default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGyörgy Dósa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j62]János Balogh, József Békési, Nóra Büki
, György Dósa, Zsolt Tuza:
Extremal behavior of the Greedy algorithm for a triangle scheduling problem. Comput. Oper. Res. 169: 106718 (2024)- [c22]Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza:
No Tiling of the 70 × 70 Square with Consecutive Squares. FUN 2024: 28:1-28:16 - 2023
- [j61]Gyula Abraham, Peter Auer, György Dósa, Tibor Dulai, Zsolt Tuza, Agnes Werner-Stark:
The bin covering with delivery problem, extended investigations for the online case. Central Eur. J. Oper. Res. 31(1): 21-47 (2023) - [j60]Gyula Abraham, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
The board packing problem. Eur. J. Oper. Res. 308(3): 1056-1073 (2023) - 2022
- [j59]József Békési, György Dósa, Gábor Galambos:
A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays. Eur. J. Oper. Res. 297(3): 844-852 (2022) - [j58]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower bounds for batched bin packing. J. Comb. Optim. 43(3): 613-629 (2022) - [j57]János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
Guillotine cutting is asymptotically optimal for packing consecutive squares. Optim. Lett. 16(9): 2775-2785 (2022) - [j56]Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss:
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. SIAM J. Discret. Math. 36(4): 2534-2552 (2022) - [c21]János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. IWOCA 2022: 101-113 - [i10]János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower bounds on the performance of online algorithms for relaxed packing problems. CoRR abs/2201.05999 (2022) - 2021
- [j55]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New Lower Bound for Classic Online Bin Packing. Algorithmica 83(7): 2047-2062 (2021) - [j54]Peter Auer, György Dósa, Tibor Dulai, Armin Fügenschuh, Peggy Näser, Ronald Ortner, Agnes Werner-Stark:
A new heuristic and an exact approach for a production planning problem. Central Eur. J. Oper. Res. 29(3): 1079-1113 (2021) - [j53]György Dósa, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin:
Coloring Properties of Mixed Cycloids. Symmetry 13(8): 1539 (2021) - [j52]György Dósa, Hans Kellerer, Tomas Olaj, Zsolt Tuza:
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time. Theor. Comput. Sci. 880: 69-81 (2021) - 2020
- [j51]György Dósa, Leah Epstein:
Quality of equilibria for selfish bin packing with cost sharing variants. Discret. Optim. 38: 100556 (2020) - [j50]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online bin packing with cardinality constraints resolved. J. Comput. Syst. Sci. 112: 34-49 (2020) - [c20]János Csirik, György Dósa, Dávid Kószó:
Online Scheduling with Machine Cost and a Quadratic Objective Function. SOFSEM 2020: 199-210
2010 – 2019
- 2019
- [j49]György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek:
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 27(4): 1107-1130 (2019) - [j48]György Dósa, Hans Kellerer, Zsolt Tuza:
Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278(1): 160-169 (2019) - [j47]György Dósa, Leah Epstein:
A new lower bound on the price of anarchy of selfish bin packing. Inf. Process. Lett. 150: 6-12 (2019) - [j46]György Dósa, Leah Epstein:
Pareto optimal equilibria for selfish bin packing with uniform cost sharing. J. Comb. Optim. 37(3): 827-847 (2019) - [j45]János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee:
The optimal absolute ratio for online bin packing. J. Comput. Syst. Sci. 102: 1-17 (2019) - [j44]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower Bounds for Several Online Variants of Bin Packing. Theory Comput. Syst. 63(8): 1757-1780 (2019) - [j43]György Dósa, Leah Epstein:
Quality of strong equilibria for selfish bin packing with uniform cost sharing. J. Sched. 22(4): 473-485 (2019) - [j42]György Dósa, Hans Kellerer, Zsolt Tuza:
Restricted assignment scheduling with resource constraints. Theor. Comput. Sci. 760: 72-87 (2019) - [c19]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New Lower Bound for Classic Online Bin Packing. WAOA 2019: 18-28 - 2018
- [j41]György Dósa, Leah Epstein:
The Convergence Time for Selfish Bin Packing. Acta Cybern. 23(3): 853-865 (2018) - [j40]Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý:
Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica 80(1): 155-184 (2018) - [j39]Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza:
A General Bin Packing Game: Interest Taken into Account. Algorithmica 80(5): 1534-1555 (2018) - [j38]György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek:
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 26(1): 161-180 (2018) - [j37]György Dósa, Zsolt Tuza:
Multiprofessor scheduling. Discret. Appl. Math. 234: 195-209 (2018) - [j36]György Dósa:
The Intermediate Price of Anarchy (IPoA) in bin packing games. Discret. Appl. Math. 242: 16-25 (2018) - [j35]György Dósa, Leah Epstein:
The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints. J. Comput. Syst. Sci. 96: 33-49 (2018) - [c18]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New and Improved Algorithm for Online Bin Packing. ESA 2018: 5:1-5:14 - [c17]György Dósa, Hans Kellerer, Zsolt Tuza:
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy. WAOA 2018: 204-217 - [p1]János Csirik, György Dósa:
Performance Guarantees for One Dimensional Bin Packing. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 491-517 - [i9]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A new lower bound for classic online bin packing. CoRR abs/1807.05554 (2018) - 2017
- [j34]György Dósa:
Batched bin packing revisited. J. Sched. 20(2): 199-209 (2017) - [c16]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online Bin Packing with Cardinality Constraints Resolved. ESA 2017: 10:1-10:14 - [c15]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower Bounds for Several Online Variants of Bin Packing. WAOA 2017: 102-117 - [i8]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A new and improved algorithm for online bin packing. CoRR abs/1707.01728 (2017) - [i7]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower bounds for several online variants of bin packing. CoRR abs/1708.03228 (2017) - 2016
- [j33]János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan:
Lower bound for 3-batched bin packing. Discret. Optim. 21: 14-24 (2016) - [j32]József Békési, György Dósa, Leah Epstein:
Bounds for online bin packing with cardinality constraints. Inf. Comput. 249: 190-204 (2016) - [j31]Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
New models of graph-bin packing. Theor. Comput. Sci. 640: 94-103 (2016) - [r1]György Dósa:
First Fit Algorithm for Bin Packing. Encyclopedia of Algorithms 2016: 753-755 - [i6]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online bin packing with cardinality constraints resolved. CoRR abs/1608.06415 (2016) - 2015
- [j30]Xin Chen, Ning Ding, György Dósa, Xin Han, He Jiang:
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs. Int. J. Comput. Math. 92(5): 873-881 (2015) - [j29]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza:
Online Results for Black and White Bin Packing. Theory Comput. Syst. 56(1): 137-155 (2015) - [j28]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza:
Offline black and white bin packing. Theor. Comput. Sci. 596: 92-101 (2015) - [j27]György Dósa:
The tight absolute bound of First Fit in the parameterized case. Theor. Comput. Sci. 596: 149-154 (2015) - [c14]Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza:
Bin Packing Game with an Interest Matrix. COCOON 2015: 57-69 - [c13]István Szalkai, György Dósa:
Online Algorithms for a Generalized Parallel Machine Scheduling Problem. MACRo 2015: 193-200 - [c12]János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee:
The optimal absolute ratio for online bin packing. SODA 2015: 1425-1438 - [i5]István Szalkai, György Dósa:
Online Algorithms for a Generalized Parallel Machine Scheduling Problem. CoRR abs/1502.02304 (2015) - 2014
- [j26]Ning Ding, Yan Lan, Xin Chen, György Dósa, He Guo, Xin Han:
Online Minimum makespan Scheduling with a Buffer. Int. J. Found. Comput. Sci. 25(5): 525-536 (2014) - [c11]György Dósa, Jirí Sgall:
Optimal Analysis of Best Fit Bin Packing. ICALP (1) 2014: 429-441 - [c10]György Dósa, Leah Epstein:
The Convergence Time for Selfish Bin Packing. SAGT 2014: 37-48 - [c9]György Dósa, Leah Epstein:
Colorful Bin Packing. SWAT 2014: 170-181 - [i4]György Dósa, Leah Epstein:
Online bin packing with cardinality constraints revisited. CoRR abs/1404.1056 (2014) - [i3]György Dósa, Leah Epstein:
Colorful bin packing. CoRR abs/1404.3990 (2014) - 2013
- [j25]Attila Benko, György Dósa, Zsolt Tuza:
Bin covering with a general profit function: approximability results. Central Eur. J. Oper. Res. 21(4): 805-816 (2013) - [j24]Xin Chen, Zhenzhen Xu, György Dósa, Xin Han, He Jiang:
Semi-online hierarchical scheduling problems with buffer or rearrangements. Inf. Process. Lett. 113(4): 127-131 (2013) - [j23]György Dósa, Zsolt Tuza, Deshi Ye:
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations. J. Comb. Optim. 26(3): 416-436 (2013) - [j22]Ruixin Ma, György Dósa, Xin Han, Hing-Fung Ting, Deshi Ye, Yong Zhang:
A note on a selfish bin packing problem. J. Glob. Optim. 56(4): 1457-1462 (2013) - [j21]Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benko:
2D knapsack: Packing squares. Theor. Comput. Sci. 508: 35-40 (2013) - [j20]György Dósa, Rongheng Li, Xin Han, Zsolt Tuza:
Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9. Theor. Comput. Sci. 510: 13-61 (2013) - [j19]György Dósa, Csanád Imreh:
The generalization of scheduling with machine cost. Theor. Comput. Sci. 510: 102-110 (2013) - [c8]György Dósa, Jirí Sgall:
First Fit bin packing: A tight analysis. STACS 2013: 538-549 - 2012
- [j18]Joan Boyar, György Dósa, Leah Epstein:
On the absolute approximation ratio for First Fit and related results. Discret. Appl. Math. 160(13-14): 1914-1923 (2012) - [j17]Yuxin Wang, Attila Benko, Xin Chen, György Dósa, He Guo, Xin Han, Cecilia Sik-Lányi:
Online scheduling with one rearrangement at the end: Revisited. Inf. Process. Lett. 112(16): 641-645 (2012) - [c7]Yan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han:
Online Minimum Makespan Scheduling with a Buffer. FAW-AAIM 2012: 161-171 - [c6]János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza:
Black and White Bin Packing. WAOA 2012: 131-144 - [i2]György Dósa, Leah Epstein:
Generalized selfish bin packing. CoRR abs/1202.4080 (2012) - [i1]György Dósa, Zsolt Tuza:
Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms. CoRR abs/1207.5672 (2012) - 2011
- [j16]Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
The Graph-Bin Packing Problem. Int. J. Found. Comput. Sci. 22(8): 1971-1993 (2011) - [j15]György Dósa, Maria Grazia Speranza, Zsolt Tuza:
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. J. Comb. Optim. 21(4): 458-480 (2011) - [j14]György Dósa, Leah Epstein:
Preemptive Online Scheduling with Reordering. SIAM J. Discret. Math. 25(1): 21-49 (2011) - [j13]György Dósa, Yuxin Wang, Xin Han, He Guo:
Online scheduling with rearrangement on two related machines. Theor. Comput. Sci. 412(8-10): 642-653 (2011) - [j12]Xin Chen, Yan Lan, Attila Benko, György Dósa, Xin Han:
Optimal algorithms for online scheduling with bounded rearrangement at the end. Theor. Comput. Sci. 412(45): 6269-6278 (2011) - [c5]Min Chen, György Dósa, Xin Han, Chenyang Zhou, Attila Benko:
2D Knapsack: Packing Squares. FAW-AAIM 2011: 176-184 - 2010
- [j11]György Dósa, Zhiyi Tan:
New upper and lower bounds for online scheduling with machine cost. Discret. Optim. 7(3): 125-135 (2010) - [j10]György Dósa, Leah Epstein:
Online scheduling with a buffer on related machines. J. Comb. Optim. 20(2): 161-179 (2010) - [c4]Attila Benko, György Dósa, Zsolt Tuza:
Bin Packing/Covering with Delivery, solved with the evolution of algorithms. BIC-TA 2010: 298-302
2000 – 2009
- 2009
- [c3]György Dósa, Leah Epstein:
Preemptive Online Scheduling with Reordering. ESA 2009: 456-467 - 2008
- [j9]György Dósa, Leah Epstein:
Preemptive scheduling on a small number of hierarchical machines. Inf. Comput. 206(5): 602-619 (2008) - 2007
- [j8]Yong He, György Dósa:
Extension of algorithm list scheduling for a semi-online scheduling problem. Central Eur. J. Oper. Res. 15(1): 97-104 (2007) - [j7]Weiya Zhong, György Dósa, Zhiyi Tan:
On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182(3): 1057-1072 (2007) - [c2]György Dósa:
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9. ESCAPE 2007: 1-11 - 2006
- [j6]György Dósa, Yong He:
Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines. Computing 76(1-2): 149-164 (2006) - [j5]György Dósa, Yong He:
Bin packing problems with rejection penalties and their dual problems. Inf. Comput. 204(5): 795-815 (2006) - [j4]György Dósa, Yong He:
Scheduling with machine cost and rejection. J. Comb. Optim. 12(4): 337-350 (2006) - 2005
- [j3]Yong He, György Dósa:
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. Discret. Appl. Math. 150(1-3): 140-159 (2005) - [c1]Yong He, György Dósa:
Bin Packing and Covering Problems with Rejection. COCOON 2005: 885-894 - 2004
- [j2]György Dósa, Yong He:
Semi-Online Algorithms for Parallel Machine Scheduling Problems. Computing 72(3-4): 355-363 (2004) - [j1]György Dósa, Yong He:
Better Online Algorithms for Scheduling with Machine Cost. SIAM J. Comput. 33(5): 1035-1051 (2004)
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 2025-01-20 22:56 CET 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:
