| Publication | Date of Publication | Type |
|---|
Scheduling with cardinality dependent unavailability periods
European Journal of Operational Research | 2024-07-02 | Paper |
Online cardinality constrained scheduling
Operations Research Letters | 2024-06-17 | Paper |
Reducibility bounds of objective functions over the integers
Operations Research Letters | 2024-06-17 | Paper |
Cardinality constrained scheduling in online models
| 2024-04-23 | Paper |
Selecting intervals to optimize the design of observational studies subject to fine balance constraints
Journal of Combinatorial Optimization | 2024-04-10 | Paper |
Algorithms and Complexities of Matching Variants in Covariate Balancing
Operations Research | 2024-03-12 | Paper |
EPTAS for parallel identical machine scheduling with time restrictions
Journal of Combinatorial Optimization | 2024-03-04 | Paper |
scientific article; zbMATH DE number 7768353 (Why is no real title available?)
| 2023-11-20 | Paper |
EPTAS for the dual of splittable bin packing with cardinality constraint
Theoretical Computer Science | 2023-10-26 | Paper |
Online minimization of the maximum starting time: migration helps
Algorithmica | 2023-08-17 | Paper |
EPTAS for load balancing problem on parallel machines with a non-renewable resource
Discrete Optimization | 2023-06-30 | Paper |
High-multiplicity \(N\)-fold IP via configuration LP
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
Acta Informatica | 2023-05-16 | Paper |
Online bin covering with limited migration
Journal of Computer and System Sciences | 2023-03-10 | Paper |
Comparing the costs of any fit algorithms for bin packing
Operations Research Letters | 2022-12-12 | Paper |
EPTAS for load balancing problem on parallel machines with a non-renewable resource
| 2022-10-19 | Paper |
Approximate separable multichoice optimization over monotone systems
Discrete Optimization | 2022-06-09 | Paper |
Online Bin Covering with Limited Migration
| 2022-05-11 | Paper |
Lower bounds for batched bin packing
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
Approximation schemes for the generalized extensible bin packing problem
Algorithmica | 2022-03-25 | Paper |
Parameterized complexity of configuration integer programs
Operations Research Letters | 2022-03-11 | Paper |
The near exact bin covering problem
| 2022-02-22 | Paper |
More on ordered open end bin packing
Journal of Scheduling | 2022-01-14 | Paper |
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
Information Processing Letters | 2021-12-14 | Paper |
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
Operations Research Letters | 2021-12-13 | Paper |
Starting time minimization for the maximum job variant
Discrete Applied Mathematics | 2021-12-07 | Paper |
A new and improved algorithm for online bin packing
| 2021-08-04 | Paper |
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
| 2021-07-28 | Paper |
A new lower bound for classic online bin packing
Algorithmica | 2021-06-30 | Paper |
A note on a variant of the online open end bin packing problem
Operations Research Letters | 2021-04-07 | Paper |
A new lower bound for classic online bin packing
Approximation and Online Algorithms | 2020-08-24 | Paper |
Online bin packing with cardinality constraints resolved
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Online bin packing with cardinality constraints resolved
| 2020-05-27 | Paper |
Lower bounds for online bin covering-type problems
Journal of Scheduling | 2020-03-06 | Paper |
Hypergraphic degree sequences are hard
| 2020-01-13 | Paper |
Lower bounds for several online variants of bin packing
Theory of Computing Systems | 2019-12-19 | Paper |
Robust algorithms for total completion time
Discrete Optimization | 2019-11-28 | Paper |
The benefit of preemption with respect to the \(\ell_p\) norm
Operations Research Letters | 2019-06-11 | Paper |
A unified framework for designing EPTAS for load balancing on parallel machines
Algorithmica | 2019-05-21 | Paper |
Deadline TSP
Theoretical Computer Science | 2019-05-17 | Paper |
A unified approach to truthful scheduling on related machines
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
Operations Research Letters | 2019-01-15 | Paper |
Batch coloring of graphs
Algorithmica | 2019-01-11 | Paper |
On the performance guarantee of first fit for sum coloring
Journal of Computer and System Sciences | 2018-12-10 | Paper |
Online-bounded analysis
Journal of Scheduling | 2018-11-07 | Paper |
A unified framework for designing EPTAS's for load balancing on parallel machines
| 2018-09-06 | Paper |
Optimization over degree sequences
SIAM Journal on Discrete Mathematics | 2018-08-10 | Paper |
Min-sum bin packing
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
Deadline TSP
Approximation and Online Algorithms | 2018-06-22 | Paper |
Lower bounds for several online variants of bin packing
Lecture Notes in Computer Science | 2018-06-22 | Paper |
Weighted matching with pair restrictions
Optimization Letters | 2018-05-28 | Paper |
Min-max cover of a graph with a small number of parts
Discrete Optimization | 2018-05-24 | Paper |
Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
Journal of Combinatorial Optimization | 2018-04-13 | Paper |
Discounted reward TSP
Algorithmica | 2018-04-06 | Paper |
Improved bounds for randomized preemptive online matching
Information and Computation | 2018-03-21 | Paper |
Shifted matroid optimization
Operations Research Letters | 2018-02-06 | Paper |
Maximum coverage problem with group budget constraints
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
A new and improved algorithm for online bin packing
| 2017-07-06 | Paper |
Batch Coloring of Graphs
Approximation and Online Algorithms | 2017-04-04 | Paper |
On nonlinear multi-covering problems
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Improved bounds for online preemptive matching
| 2017-01-30 | Paper |
Power of preemption for minimizing total completion time on uniform parallel machines
SIAM Journal on Discrete Mathematics | 2017-01-27 | Paper |
An AFPTAS for variable sized bin packing with general activation costs
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Online bounded analysis
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Nonoblivious 2-opt heuristics for the traveling salesman problem
Networks | 2016-06-10 | Paper |
A unified approach to truthful scheduling on related machines
Mathematics of Operations Research | 2016-04-15 | Paper |
Vertex cover meets scheduling
Algorithmica | 2016-04-06 | Paper |
The minimum generalized vertex cover problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
The (weighted) metric dimension of graphs: hard and easy cases
Algorithmica | 2015-09-02 | Paper |
Offline black and white bin packing
Theoretical Computer Science | 2015-07-24 | Paper |
Online file caching with rejection penalties
Algorithmica | 2015-05-26 | Paper |
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
ACM Transactions on Algorithms | 2014-12-05 | Paper |
The benefit of adaptivity in stochastic packing problems with probing
Theoretical Computer Science | 2014-12-02 | Paper |
Robust algorithms for preemptive scheduling
Algorithmica | 2014-11-19 | Paper |
A generalized minimum cost \(k\)-clustering
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Approximating the minimum quadratic assignment problems
ACM Transactions on Algorithms | 2014-11-18 | Paper |
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
Bin covering with cardinality constraints
Discrete Applied Mathematics | 2014-04-22 | Paper |
The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
Discrete Optimization | 2014-04-15 | Paper |
Adaptivity in the stochastic blackjack knapsack problem
Theoretical Computer Science | 2013-12-13 | Paper |
Robust approximation schemes for cube packing
SIAM Journal on Optimization | 2013-09-25 | Paper |
Online clustering with variable sized clusters
Algorithmica | 2013-03-05 | Paper |
On the max coloring problem
Theoretical Computer Science | 2012-11-27 | Paper |
The (weighted) metric dimension of graphs: hard and easy cases
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Universal sequencing on an unreliable machine
SIAM Journal on Computing | 2012-09-12 | Paper |
Online variable-sized bin packing with conflicts
Discrete Optimization | 2012-06-20 | Paper |
Bin packing with general cost structures
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
On equilibria for ADM minimization games
Algorithmica | 2012-04-26 | Paper |
Approximation schemes for packing splittable items with cardinality constraints
Algorithmica | 2012-04-26 | Paper |
Selfish bin coloring
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
Improved approximation guarantees for weighted matching in the semi-streaming model
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Max-min online allocations with a reordering buffer
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Randomized algorithms for online bounded bidding
Information Processing Letters | 2012-03-12 | Paper |
IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL *
| 2012-01-23 | Paper |
Robust algorithms for preemptive scheduling
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On variants of file caching
Automata, Languages and Programming | 2011-07-06 | Paper |
Monotone covering problems with an additional covering constraint
Mathematics of Operations Research | 2011-04-27 | Paper |
Graph coloring with rejection
Journal of Computer and System Sciences | 2011-03-28 | Paper |
AFPTAS results for common variants of bin packing: a new method for handling the small items
SIAM Journal on Optimization | 2011-03-21 | Paper |
Uniform unweighted set cover: the power of non-oblivious local search
Theoretical Computer Science | 2011-03-14 | Paper |
How to allocate review tasks for robust ranking
Acta Informatica | 2010-10-08 | Paper |
Max-min online allocations with a reordering buffer
Automata, Languages and Programming | 2010-09-07 | Paper |
Online clustering with variable sized clusters
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
On the sum minimization version of the online bin covering problem
Discrete Applied Mathematics | 2010-08-13 | Paper |
Improved randomized results for the interval selection problem
Theoretical Computer Science | 2010-08-11 | Paper |
Class constrained bin packing revisited
Theoretical Computer Science | 2010-08-11 | Paper |
Universal sequencing on a single machine
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
Information Processing Letters | 2010-06-09 | Paper |
Tight results for next fit and worst fit with resource augmentation
Theoretical Computer Science | 2010-06-07 | Paper |
Online capacitated interval coloring
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Approximating the degree-bounded minimum diameter spanning tree problem
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Class constrained bin covering
Theory of Computing Systems | 2010-05-10 | Paper |
Minimization of SONET ADMs in ring networks revisited
Computing | 2010-04-12 | Paper |
The finite horizon investor problem with a budget constraint
Information Processing Letters | 2010-03-24 | Paper |
Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Real time scheduling with a budget: parametric-search is better than binary search
Information Processing Letters | 2010-01-29 | Paper |
The complexity of graph contractions.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
Theoretical Computer Science | 2009-12-01 | Paper |
On equilibria for ADM minimization games
Algorithmic Game Theory | 2009-12-01 | Paper |
Weighted sum coloring in batch scheduling of conflicting jobs
Algorithmica | 2009-10-23 | Paper |
On Bin Packing with Conflicts
SIAM Journal on Optimization | 2009-08-20 | Paper |
The multi‐integer set cover and the facility terminal cover problem
Networks | 2009-07-28 | Paper |
Variable sized online interval coloring with bandwidth
Algorithmica | 2009-06-17 | Paper |
The computational complexity of graph contractions II: Two tough polynomially solvable cases
Networks | 2009-06-16 | Paper |
Approximation algorithms for maximum latency and partial cycle cover
Discrete Optimization | 2009-05-07 | Paper |
A robust APTAS for the classical bin packing problem
Mathematical Programming. Series A. Series B | 2009-04-24 | Paper |
Scheduling a maintenance activity on parallel identical machines
Naval Research Logistics | 2009-04-22 | Paper |
An APTAS for Generalized Cost Variable-Sized Bin Packing
SIAM Journal on Computing | 2009-03-16 | Paper |
A Robust APTAS for the Classical Bin Packing Problem
Automata, Languages and Programming | 2009-03-12 | Paper |
Better bounds for minimizing SONET ADMs
Journal of Computer and System Sciences | 2009-03-11 | Paper |
Online Capacitated Interval Coloring
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Improved Randomized Results for That Interval Selection Problem
Algorithms - ESA 2008 | 2008-11-25 | Paper |
More on online bin packing with two item sizes
Discrete Optimization | 2008-11-19 | Paper |
Online unit clustering: Variations on a theme
Theoretical Computer Science | 2008-11-18 | Paper |
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
SIAM Journal on Computing | 2008-10-28 | Paper |
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
Networks | 2008-06-20 | Paper |
Two-dimensional packing with conflicts
Acta Informatica | 2008-06-17 | Paper |
A PTAS for delay minimization in establishing wireless conference calls
Discrete Optimization | 2008-05-16 | Paper |
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
Discrete Optimization | 2008-05-16 | Paper |
Graph Coloring with Rejection
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Multi-dimensional Packing with Conflicts
Fundamentals of Computation Theory | 2008-02-26 | Paper |
The k-Allocation Problem and Its Variants
Approximation and Online Algorithms | 2008-02-21 | Paper |
On Bin Packing with Conflicts
| 2008-02-21 | Paper |
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
Approximation and Online Algorithms | 2008-02-21 | Paper |
On the Max Coloring Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
Covering the Edges of Bipartite Graphs Using K 2,2 Graphs
Approximation and Online Algorithms | 2008-02-20 | Paper |
Minimum Weighted Sum Bin Packing
Approximation and Online Algorithms | 2008-02-20 | Paper |
SONET ADMs minimization with divisible paths
Algorithmica | 2007-11-28 | Paper |
Variable Sized Online Interval Coloring with Bandwidth
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Optimizing over Consecutive 1's and Circular 1's Constraints
SIAM Journal on Optimization | 2007-05-22 | Paper |
Flow trees for vertex-capacitated networks
Discrete Applied Mathematics | 2007-03-08 | Paper |
Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
Discrete Optimization | 2007-02-20 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Partial multicuts in trees
Theoretical Computer Science | 2007-01-09 | Paper |
Approximations for minimum and min-max vehicle routing problems
Journal of Algorithms | 2006-10-05 | Paper |
The conference call search problem in wireless networks
Theoretical Computer Science | 2006-09-14 | Paper |
The constrained minimum weighted sum of job completion times problem
Mathematical Programming. Series A. Series B | 2006-06-28 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
The chord version for SONET ADMs minimization
Theoretical Computer Science | 2006-03-20 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | 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 |
Synthesis of 2-Commodity Flow Networks
Mathematics of Operations Research | 2005-11-11 | Paper |
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
SIAM Journal on Computing | 2005-10-28 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
SIAM Journal on Computing | 2005-02-21 | Paper |
Approximation algorithms for quickest spanning tree problems
Algorithmica | 2005-02-21 | Paper |
Approximating the degree-bounded minimum diameter spanning tree problem
Algorithmica | 2005-02-21 | Paper |
A better approximation algorithm for the budget prize collecting tree problem.
Operations Research Letters | 2005-01-11 | Paper |
Strongly polynomial-time approximation for a class of bicriteria problems.
Operations Research Letters | 2005-01-11 | Paper |
Minimum restricted diameter spanning trees.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Minimum spanning tree with hop restrictions
Journal of Algorithms | 2004-03-14 | Paper |
Lexicographic local search and the \(p\)-center problem.
European Journal of Operational Research | 2003-10-14 | Paper |
scientific article; zbMATH DE number 1947056 (Why is no real title available?)
| 2003-07-07 | Paper |
The SONET edge‐partition problem
Networks | 2003-03-10 | Paper |
Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
Discrete Applied Mathematics | 2003-03-09 | Paper |
Approximation algorithms for constructing wavelength routing networks
Networks | 2002-12-17 | Paper |
scientific article; zbMATH DE number 1757958 (Why is no real title available?)
| 2002-06-20 | Paper |
