| Publication | Date of Publication | Type |
|---|
| An AFPTAS for bin packing with partition matroid via a new method for LP rounding | 2025-01-14 | Paper |
| Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs | 2025-01-06 | Paper |
| Improved approximation for two-dimensional vector multiple knapsack | 2024-11-15 | Paper |
| An EPTAS for budgeted matching and budgeted matroid intersection via representative sets | 2024-11-14 | Paper |
| An FPTAS for budgeted laminar matroid independent set | 2024-06-17 | Paper |
| The preemptive resource allocation problem | 2024-05-30 | Paper |
| An EPTAS for budgeted matroid independent set | 2024-05-14 | Paper |
| Approximating Bin Packing with Conflict Graphs via Maximization Techniques | 2024-05-03 | Paper |
| Maximizing Throughput in Flow Shop Real-Time Scheduling | 2023-10-31 | Paper |
| Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping | 2023-09-20 | Paper |
| A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875660 | 2023-02-03 | Paper |
| Fast Distributed Approximation for Max-Cut | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075815 | 2022-05-11 | Paper |
| An APTAS for bin packing with clique-graph conflicts | 2022-03-25 | Paper |
| An almost optimal approximation algorithm for monotone submodular multiple knapsack | 2022-01-31 | Paper |
| A refined analysis of submodular greedy | 2021-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009517 | 2021-08-04 | Paper |
| On Lagrangian relaxation for constrained maximization and reoptimization problems | 2021-04-20 | Paper |
| The Euclidean k-Supplier Problem | 2020-04-30 | Paper |
| Constrained submodular maximization via greedy local search | 2020-02-10 | Paper |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem | 2019-12-06 | Paper |
| Real-Time k-bounded Preemptive Scheduling | 2019-09-12 | Paper |
| Improved parameterized algorithms for network query problems | 2019-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633865 | 2019-05-06 | Paper |
| Flexible bandwidth assignment with application to optical networks | 2018-11-07 | Paper |
| Improved bounds for scheduling conflicting jobs with minsum criteria | 2018-11-05 | Paper |
| All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns | 2018-11-05 | Paper |
| Throughput maximization of real-time scheduling with batching | 2018-11-05 | Paper |
| Complexity and inapproximability results for the power edge set problem | 2018-04-13 | Paper |
| A theory and algorithms for combinatorial reoptimization | 2018-04-06 | Paper |
| Parameterized approximation via fidelity preserving transformations | 2017-12-21 | Paper |
| Parameterized algorithms for graph partitioning problems | 2017-10-12 | Paper |
| Optimizing bandwidth allocation in elastic optical networks with application to scheduling | 2017-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365054 | 2017-09-29 | Paper |
| A multivariate framework for weighted FPT algorithms | 2017-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351914 | 2017-08-31 | Paper |
| Packing Resizable Items with Application to Video Delivery over Wireless Networks | 2016-12-19 | Paper |
| Deterministic parameterized algorithms for the graph motif problem | 2016-09-12 | Paper |
| Constructing minimum changeover cost arborescenses in bounded treewidth graphs | 2016-02-26 | Paper |
| Real-time scheduling to minimize machine busy times | 2016-01-22 | Paper |
| Representative families: a unified tradeoff-based approach | 2015-12-30 | Paper |
| A Multivariate Approach for Weighted FPT Algorithms | 2015-11-19 | Paper |
| Improved Parameterized Algorithms for Network Query Problems | 2015-09-15 | Paper |
| Parameterized algorithms for graph partitioning problems | 2015-09-09 | Paper |
| Improved results for data migration and open shop scheduling | 2015-09-02 | Paper |
| Partial information network queries | 2015-03-24 | Paper |
| Transactional contention management as a non-clairvoyant scheduling problem | 2015-03-10 | Paper |
| Partial information spreading with application to distributed maximum coverage | 2015-03-02 | Paper |
| Corrigendum | 2014-12-05 | Paper |
| Deterministic Parameterized Algorithms for the Graph Motif Problem | 2014-10-14 | Paper |
| Flexible Bandwidth Assignment with Application to Optical Networks | 2014-10-14 | Paper |
| Representative Families: A Unified Tradeoff-Based Approach | 2014-10-08 | Paper |
| Packing resizable items with application to video delivery over wireless networks | 2014-09-18 | Paper |
| Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints | 2014-07-11 | Paper |
| Online selection of intervals and \(t\)-intervals | 2014-01-10 | Paper |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem | 2013-09-17 | Paper |
| Parameterized Approximation via Fidelity Preserving Transformations | 2013-08-12 | Paper |
| The Euclidean k-Supplier Problem | 2013-03-19 | Paper |
| All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns | 2013-03-19 | Paper |
| Fast Information Spreading in Graphs with Large Weak Conductance | 2013-03-19 | Paper |
| Minimal cost reconfiguration of data placement in a storage area network | 2012-11-27 | Paper |
| Minimizing busy time in multiple machine real-time scheduling | 2012-08-29 | Paper |
| A Theory and Algorithms for Combinatorial Reoptimization | 2012-06-29 | Paper |
| Approximation schemes for generalized two-dimensional vector packing with application to data placement | 2012-05-11 | Paper |
| There is no EPTAS for two-dimensional knapsack | 2012-03-19 | Paper |
| Approximation schemes for deal splitting and covering integer programs with multiplicity constraints | 2012-01-04 | Paper |
| Minimizing total busy time in parallel scheduling with application to optical networks | 2010-10-11 | Paper |
| A note on generalized rank aggregation | 2010-08-20 | Paper |
| Online Selection of Intervals and t-Intervals | 2010-06-22 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Minimal Cost Reconfiguration of Data Placement in Storage Area Network | 2010-05-11 | Paper |
| Transactional contention management as a Non-clairvoyant scheduling problem | 2010-03-04 | Paper |
| Periodic scheduling with obligatory vacations | 2009-11-06 | Paper |
| Weighted sum coloring in batch scheduling of conflicting jobs | 2009-10-23 | Paper |
| Strongly competitive algorithms for caching with pipelined prefetching | 2009-07-21 | Paper |
| On Lagrangian Relaxation and Subset Selection Problems | 2009-02-12 | Paper |
| Exact algorithms for the master ring problem | 2008-10-08 | Paper |
| Batch Coloring Flat Graphs and Thin | 2008-07-15 | Paper |
| Approximation schemes for packing with item fragmentation | 2008-06-06 | Paper |
| Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs | 2008-02-26 | Paper |
| Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs | 2007-08-28 | Paper |
| Real-time scheduling with a budget | 2007-04-26 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| The Application of Restricted Counter Schemes to Three Models of Linear Search | 2007-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485320 | 2006-08-29 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Scheduling Split Intervals | 2006-06-01 | Paper |
| Minimizing makespan and preemption costs on a system of uniform machines | 2006-03-21 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Finding Large Independent Sets in Graphs and Hypergraphs | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829009 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829010 | 2004-11-29 | Paper |
| Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044356 | 2004-08-11 | Paper |
| Tight bounds for online class-constrained packing | 2004-08-10 | Paper |
| Tight bounds for FEC-based reliable multicast | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449246 | 2004-02-08 | Paper |
| Multicoloring trees. | 2003-08-19 | Paper |
| Polynomial time approximation schemes for class-constrained packing problems | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411417 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796166 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780787 | 2002-11-21 | Paper |
| Multiresource malleable task scheduling to minimize response time | 2002-07-25 | Paper |
| The passport control problem or how to keep a dynamic service system load balanced? | 2002-07-15 | Paper |
| Scheduling memory accesses through a shared bus | 2002-07-14 | Paper |
| Multiprocessor scheduling with machine allotment and parallelism constraints | 2002-05-21 | Paper |
| Efficient reorganization of binary search trees | 2002-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753744 | 2001-11-11 | Paper |
| On two class-constrained versions of the multiple knapsack problem | 2001-07-03 | Paper |
| Sum Multicoloring of Graphs | 2000-12-19 | Paper |
| On G-network and resource allocation in multimedia systems | 2000-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942227 | 2000-09-18 | Paper |
| Local Labeling and Resource Allocation Using Preprocessing | 1999-10-28 | Paper |
| The list update problem: Improved bounds for the counter scheme | 1999-02-02 | Paper |
| On chromatic sums and distributed resource allocation | 1998-09-27 | Paper |
| Adaptive Source Routing in High-Speed Networks | 1996-09-05 | Paper |
| On the limited utility of auxiliary information in the list update problem | 1993-04-01 | Paper |
| Self-organizing lists and independent references: A statistical synergy | 1992-06-28 | Paper |
| On the optimality of the counter-scheme for dynamic linear lists | 1991-01-01 | Paper |
