| Publication | Date of Publication | Type |
|---|
| Lower bounds for matroid optimization problems with a linear constraint | 2026-01-14 | Paper |
| 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
Discrete Applied Mathematics | 2025-01-06 | Paper |
Improved approximation for two-dimensional vector multiple knapsack
Computational Geometry | 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
Operations Research Letters | 2024-06-17 | Paper |
The preemptive resource allocation problem
Journal of Scheduling | 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
(available as arXiv preprint) | 2023-09-20 | Paper |
| A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650323 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Fast Distributed Approximation for Max-Cut
Algorithms for Sensor Systems | 2022-12-09 | Paper |
scientific article; zbMATH DE number 7525506 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
An APTAS for bin packing with clique-graph conflicts
(available as arXiv preprint) | 2022-03-25 | Paper |
An almost optimal approximation algorithm for monotone submodular multiple knapsack
Journal of Computer and System Sciences | 2022-01-31 | Paper |
A refined analysis of submodular greedy
Operations Research Letters | 2021-12-13 | Paper |
| Generalized assignment of time-sensitive item groups | 2021-08-04 | Paper |
On Lagrangian relaxation for constrained maximization and reoptimization problems
Discrete Applied Mathematics | 2021-04-20 | Paper |
The Euclidean \(k\)-supplier problem
Mathematics of Operations Research | 2020-04-30 | Paper |
Constrained submodular maximization via greedy local search
Operations Research Letters | 2020-02-10 | Paper |
Tractable parameterizations for the minimum linear arrangement problem
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Real-time \(k\)-bounded preemptive scheduling
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Improved parameterized algorithms for network query problems
Algorithmica | 2019-05-17 | Paper |
| Maximizing submodular set functions subject to multiple linear constraints | 2019-05-06 | Paper |
Flexible bandwidth assignment with application to optical networks
Journal of Scheduling | 2018-11-07 | Paper |
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms | 2018-11-05 | Paper |
All-or-nothing generalized assignment with application to scheduling advertising campaigns
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Complexity and inapproximability results for the power edge set problem
Journal of Combinatorial Optimization | 2018-04-13 | Paper |
A theory and algorithms for combinatorial reoptimization
Algorithmica | 2018-04-06 | Paper |
Parameterized approximation via fidelity preserving transformations
Journal of Computer and System Sciences | 2017-12-21 | Paper |
Parameterized algorithms for graph partitioning problems
Theory of Computing Systems | 2017-10-12 | Paper |
Optimizing bandwidth allocation in elastic optical networks with application to scheduling
Journal of Discrete Algorithms | 2017-10-06 | Paper |
| Fast information spreading in graphs with large weak conductance | 2017-09-29 | Paper |
A multivariate framework for weighted FPT algorithms
Journal of Computer and System Sciences | 2017-09-07 | Paper |
| The container selection problem | 2017-08-31 | Paper |
Packing resizable items with application to video delivery over wireless networks
Algorithms for Sensor Systems | 2016-12-19 | Paper |
Deterministic parameterized algorithms for the graph motif problem
Discrete Applied Mathematics | 2016-09-12 | Paper |
Constructing minimum changeover cost arborescenses in bounded treewidth graphs
Theoretical Computer Science | 2016-02-26 | Paper |
Real-time scheduling to minimize machine busy times
Journal of Scheduling | 2016-01-22 | Paper |
Representative families: a unified tradeoff-based approach
Journal of Computer and System Sciences | 2015-12-30 | Paper |
A multivariate approach for weighted FPT algorithms
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Improved parameterized algorithms for network query problems
Parameterized and Exact Computation | 2015-09-15 | Paper |
Parameterized algorithms for graph partitioning problems
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Partial information network queries
Journal of Discrete Algorithms | 2015-03-24 | Paper |
Transactional contention management as a non-clairvoyant scheduling problem
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Corrigendum: ``Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Deterministic parameterized algorithms for the graph motif problem
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Flexible Bandwidth Assignment with Application to Optical Networks
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Representative families: a unified tradeoff-based approach
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Packing resizable items with application to video delivery over wireless networks
Theoretical Computer Science | 2014-09-18 | Paper |
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
Mathematics of Operations Research | 2014-07-11 | Paper |
Online selection of intervals and \(t\)-intervals
Information and Computation | 2014-01-10 | Paper |
Tractable parameterizations for the minimum linear arrangement problem
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Parameterized approximation via fidelity preserving transformations
Automata, Languages, and Programming | 2013-08-12 | Paper |
The Euclidean \(k\)-supplier problem
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
All-or-nothing generalized assignment with application to scheduling advertising campaigns
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Fast information spreading in graphs with large weak conductance
SIAM Journal on Computing | 2013-03-19 | Paper |
Minimal cost reconfiguration of data placement in a storage area network
Theoretical Computer Science | 2012-11-27 | Paper |
| Minimizing busy time in multiple machine real-time scheduling | 2012-08-29 | Paper |
A theory and algorithms for combinatorial reoptimization
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Approximation schemes for generalized two-dimensional vector packing with application to data placement
Journal of Discrete Algorithms | 2012-05-11 | Paper |
There is no EPTAS for two-dimensional knapsack
Information Processing Letters | 2012-03-19 | Paper |
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science | 2012-01-04 | Paper |
Minimizing total busy time in parallel scheduling with application to optical networks
Theoretical Computer Science | 2010-10-11 | Paper |
A note on generalized rank aggregation
Information Processing Letters | 2010-08-20 | Paper |
Online selection of intervals and \(t\)-intervals
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Minimal cost reconfiguration of data placement in storage area network
Approximation and Online Algorithms | 2010-05-11 | Paper |
Transactional contention management as a Non-clairvoyant scheduling problem
Algorithmica | 2010-03-04 | Paper |
Periodic scheduling with obligatory vacations
Theoretical Computer Science | 2009-11-06 | Paper |
Weighted sum coloring in batch scheduling of conflicting jobs
Algorithmica | 2009-10-23 | Paper |
Strongly competitive algorithms for caching with pipelined prefetching
Information Processing Letters | 2009-07-21 | Paper |
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms | 2009-02-12 | Paper |
Exact algorithms for the master ring problem
Networks | 2008-10-08 | Paper |
Batch Coloring Flat Graphs and Thin
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Approximation schemes for packing with item fragmentation
Theory of Computing Systems | 2008-06-06 | Paper |
Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Real-time scheduling with a budget
Algorithmica | 2007-04-26 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
The Application of Restricted Counter Schemes to Three Models of Linear Search
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
| The master ring problem | 2006-08-29 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Scheduling Split Intervals
SIAM Journal on Computing | 2006-06-01 | Paper |
Minimizing makespan and preemption costs on a system of uniform machines
Algorithmica | 2006-03-21 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Finding Large Independent Sets in Graphs and Hypergraphs
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2119734 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119735 (Why is no real title available?) | 2004-11-29 | Paper |
Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086257 (Why is no real title available?) | 2004-08-11 | Paper |
Tight bounds for online class-constrained packing
Theoretical Computer Science | 2004-08-10 | Paper |
Tight bounds for FEC-based reliable multicast
Information and Computation | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2038779 (Why is no real title available?) | 2004-02-08 | Paper |
Multicoloring trees.
Information and Computation | 2003-08-19 | Paper |
Polynomial time approximation schemes for class-constrained packing problems
Journal of Scheduling | 2003-07-27 | Paper |
| scientific article; zbMATH DE number 1947446 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1875407 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1833406 (Why is no real title available?) | 2002-11-21 | Paper |
Multiresource malleable task scheduling to minimize response time
Information Processing Letters | 2002-07-25 | Paper |
The passport control problem or how to keep a dynamic service system load balanced?
Theoretical Computer Science | 2002-07-15 | Paper |
Scheduling memory accesses through a shared bus
Performance Evaluation | 2002-07-14 | Paper |
Multiprocessor scheduling with machine allotment and parallelism constraints
Algorithmica | 2002-05-21 | Paper |
Efficient reorganization of binary search trees
Algorithmica | 2002-04-02 | Paper |
| scientific article; zbMATH DE number 1670546 (Why is no real title available?) | 2001-11-11 | Paper |
On two class-constrained versions of the multiple knapsack problem
Algorithmica | 2001-07-03 | Paper |
Sum Multicoloring of Graphs
Journal of Algorithms | 2000-12-19 | Paper |
On G-network and resource allocation in multimedia systems
European Journal of Operational Research | 2000-11-05 | Paper |
| scientific article; zbMATH DE number 1419210 (Why is no real title available?) | 2000-09-18 | Paper |
Local Labeling and Resource Allocation Using Preprocessing
SIAM Journal on Computing | 1999-10-28 | Paper |
The list update problem: Improved bounds for the counter scheme
Algorithmica | 1999-02-02 | Paper |
On chromatic sums and distributed resource allocation
Information and Computation | 1998-09-27 | Paper |
Adaptive Source Routing in High-Speed Networks
Journal of Algorithms | 1996-09-05 | Paper |
On the limited utility of auxiliary information in the list update problem
Communications in Statistics. Stochastic Models | 1993-04-01 | Paper |
Self-organizing lists and independent references: A statistical synergy
Journal of Algorithms | 1992-06-28 | Paper |
On the optimality of the counter-scheme for dynamic linear lists
Information Processing Letters | 1991-01-01 | Paper |
