受强制性开放获取政策约束的文章 - Asaf Levin了解详情
无法在其他位置公开访问的文章：5 篇
Reducibility bounds of objective functions over the integers
F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn
Operations Research Letters 51 (6), 595-598, 2023
强制性开放获取政策： Swiss National Science Foundation, German Research Foundation
Lower bounds for online bin covering-type problems
J Balogh, L Epstein, A Levin
Journal of Scheduling 22, 487-497, 2019
强制性开放获取政策： Federal Ministry of Education and Research, Germany
Online cardinality constrained scheduling
L Epstein, A Lassota, A Levin, M Maack, L Rohwedder
Operations Research Letters 51 (5), 533-539, 2023
强制性开放获取政策： Swiss National Science Foundation, German Research Foundation
Sparse Integer Programming Is Fixed-Parameter Tractable
F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn
Mathematics of Operations Research, 2024
强制性开放获取政策： Swiss National Science Foundation
Online Minimization of the Maximum Starting Time: Migration Helps
A Levin
Algorithmica 85 (8), 2238-2259, 2023
强制性开放获取政策： Federal Ministry of Education and Research, Germany
可在其他位置公开访问的文章：28 篇
Universal sequencing on an unreliable machine
L Epstein, A Levin, A Marchetti-Spaccamela, N Megow, J Mestre, ...
SIAM Journal on Computing 41 (3), 565-586, 2012
强制性开放获取政策： German Research Foundation
A new lower bound for classic online bin packing
J Balogh, J Békési, G Dósa, L Epstein, A Levin
Algorithmica 83, 2047-2062, 2021
强制性开放获取政策： Hungarian Scientific Research Fund, Federal Ministry of Education and …
Class constrained bin packing revisited
L Epstein, C Imreh, A Levin
Theoretical Computer Science 411 (34-36), 3073-3089, 2010
强制性开放获取政策： Hungarian Scientific Research Fund
Optimization over degree sequences
A Deza, A Levin, SM Meesum, S Onn
SIAM Journal on Discrete Mathematics 32 (3), 2067-2079, 2018
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada, Federal …
Online file caching with rejection penalties
L Epstein, C Imreh, A Levin, J Nagy-György
Algorithmica 71, 279-306, 2015
强制性开放获取政策： Magyar Tudományos Akadémia
Online clustering with variable sized clusters
J Csirik, L Epstein, C Imreh, A Levin
Algorithmica 65 (2), 251-274, 2013
强制性开放获取政策： Magyar Tudományos Akadémia
Online bin packing with cardinality constraints resolved
J Balogh, J Békési, G Dósa, L Epstein, A Levin
Journal of Computer and System Sciences 112, 34-49, 2020
强制性开放获取政策： National Office for Research, Development and Innovation, Hungary
Approximation schemes for packing splittable items with cardinality constraints
L Epstein, A Levin, R Van Stee
Algorithmica 62, 102-129, 2012
强制性开放获取政策： German Research Foundation
Lower bounds for several online variants of bin packing
J Balogh, J Békési, G Dósa, L Epstein, A Levin
Theory of Computing Systems 63, 1757-1780, 2019
强制性开放获取政策： Federal Ministry of Education and Research, Germany, National Office for …
A unified framework for designing EPTAS for load balancing on parallel machines
I Kones, A Levin
Algorithmica 81 (7), 3025-3046, 2019
强制性开放获取政策： Federal Ministry of Education and Research, Germany
Online unit clustering: Variations on a theme
L Epstein, A Levin, R van Stee
Theoretical Computer Science 407 (1-3), 85-96, 2008
强制性开放获取政策： German Research Foundation
Max-min online allocations with a reordering buffer
L Epstein, A Levin, R van Stee
SIAM Journal on Discrete Mathematics 25 (3), 1230-1250, 2011
强制性开放获取政策： German Research Foundation
Offline black and white bin packing
J Balogh, J Békési, G Dósa, L Epstein, H Kellerer, A Levin, Z Tuza
Theoretical Computer Science 596, 92-101, 2015
强制性开放获取政策： Hungarian Scientific Research Fund
Online bin covering with limited migration
S Berndt, L Epstein, K Jansen, A Levin, M Maack, L Rohwedder
arXiv preprint arXiv:1904.06543, 2019
强制性开放获取政策： German Research Foundation
High-multiplicity N-fold IP via configuration LP
D Knop, M Koutecký, A Levin, M Mnich, S Onn
Mathematical programming 200 (1), 199-227, 2023
强制性开放获取政策： German Research Foundation
出版信息和资助信息由计算机程序自动确定