Łukasz Jeż

Cited by

	All	Since 2019
Citations	490	270
h-index	13	10
i10-index	15	11

20092010201120122013201420152016201720182019202020212022202320246 7 5 15 13 15 18 25 48 57 35 38 63 45 46 40

Public access

View all

14 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Jiri SgallComputer Science Institute of Charles UniversityVerified email at iuuk.mff.cuni.cz
Marek ChrobakUniversity of California at RiversideVerified email at cs.ucr.edu
Marcin BienkowskiUniversity of WroclawVerified email at cs.uni.wroc.pl
Christoph DürrCNRS, Sorbonne University, LIP6Verified email at lip6.fr
Jarek ByrkaUniversity of WroclawVerified email at cs.uni.wroc.pl
Pavel VeselýComputer Science Institute of Charles University, Prague, Czech RepublicVerified email at iuuk.mff.cuni.cz
Martin BöhmAssistant professor, University of Wrocław, PolandVerified email at cs.uni.wroc.pl
Grzegorz Stachowiakuniwersytet wrocławskiVerified email at cs.uni.wroc.pl
Amos FiatProfessor of Computer Science, Tel Aviv UniversityVerified email at tau.ac.il
Paweł GawrychowskiUniversity of WrocławVerified email at cs.uni.wroc.pl
Fei LiAssociate Professor of Computer Science, George Mason UniversityVerified email at cs.gmu.edu
Nikhil BansalUniversity of MichiganVerified email at umich.edu
Clifford SteinProfessor of IEOR and CS, Columbia UniversityVerified email at ieor.columbia.edu
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Rob van SteeDepartment of Mathematics, University of Siegen, GermanyVerified email at uni-siegen.de
Kirk PruhsProfessor of Computer Science, University of PittsburghVerified email at cs.pitt.edu
Yishay MansourTel Aviv UniversityVerified email at tauex.tau.ac.il

Łukasz Jeż

Assistant Professor of Computer Science, University of Wrocław

Verified email at cs.uni.wroc.pl - Homepage

online algorithms combinatorial optimization


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Better approximation bounds for the joint replenishment problem M Bienkowski, J Byrka, M Chrobak, Ł Jeż, D Nogneng, J Sgall Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014	52	2014
Online knapsack revisited M Cygan, Ł Jeż, J Sgall Theory of Computing Systems 58, 153-190, 2016	51	2016
Online scheduling of packets with agreeable deadlines Ł Jeż, F Li, J Sethuraman, C Stein ACM Transactions on Algorithms (TALG) 9 (1), 1-11, 2012	41*	2012
Online algorithms for multi-level aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarczný, Ł Jeż, ... arXiv preprint arXiv:1507.02378, 2015	35	2015
Validating the Knuth-Morris-Pratt failure function, fast and online P Gawrychowski, A Jeż, Ł Jeż International Computer Science Symposium in Russia, 132-143, 2010	35*	2010
Pricing online decisions: Beyond auctions IR Cohen, A Eden, A Fiat, Ł Jeż Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete …, 2014	32	2014
A universal randomized packet scheduling algorithm Ł Jeż Algorithmica 67, 498-515, 2013	26*	2013
Collecting weighted items from a dynamic queue M Bienkowski, M Chrobak, C Dürr, M Hurand, A Jeż, Ł Jeż, G Stachowiak Algorithmica 65 (1), 60-94, 2013	21	2013
Online control message aggregation in chain networks M Bienkowski, J Byrka, M Chrobak, Ł Jeż, J Sgall, G Stachowiak Workshop on Algorithms and Data Structures, 133-145, 2013	19	2013
The (h,k)-Server Problem on Bounded Depth Trees N Bansal, M Eliéš, Ł Jeż, G Koumoutsos ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019	17	2019
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption C Dürr, Ł Jeż, OC Vásquez Discrete Applied Mathematics 196, 20-27, 2015	17	2015
A -Competitive Algorithm for Scheduling Packets with Deadlines P Veselý, M Chrobak, Ł Jeż, J Sgall SIAM Journal on Computing 51 (5), 1626-1691, 2022	16	2022
Online scheduling of jobs with fixed start times on related machines L Epstein, Ł Jeż, J Sgall, R Van Stee Algorithmica 74 (1), 156-176, 2016	16*	2016
Online packet scheduling with bounded delay and lookahead M Böhm, M Chrobak, Ł Jeż, F Li, J Sgall, P Veselý Theoretical Computer Science 776, 95-113, 2019	13	2019
Tight bounds for double coverage against weak adversaries N Bansal, M Eliáš, Ł Jeż, G Koumoutsos, K Pruhs Theory of Computing Systems 62, 349-365, 2018	12	2018
Online scheduling of bounded length jobs to maximize throughput C Dürr, Ł Jeż, KT Nguyen Approximation and Online Algorithms: 7th International Workshop, WAOA 2009 …, 2010	9	2010
Slaying hydrae: Improved bounds for generalized k-server in uniform metrics M Bienkowski, Ł Jeż, P Schmidt arXiv preprint arXiv:1810.00580, 2018	8	2018
Lower bounds for online makespan minimization on a small number of related machines Ł Jeż, J Schwartz, J Sgall, J Békési Journal of Scheduling 16, 539-547, 2013	8	2013
Unbounded lower bound for k-server against weak adversaries M Bienkowski, J Byrka, C Coester, Ł Jeż Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020	7	2020
Online scheduling of bounded length jobs to maximize throughput C Dürr, Ł Jeż, NK Thang Journal of Scheduling 15, 653-664, 2012	7	2012

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors