| Publication | Date of Publication | Type |
|---|
Algorithms for the thief orienteering problem on directed acyclic graphs
Theoretical Computer Science | 2024-12-12 | Paper |
A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Makespan minimization on unrelated parallel machines with a few bags
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
High multiplicity strip packing with three rectangle types
Lecture Notes in Computer Science | 2023-08-03 | Paper |
A local search approximation algorithm for the multiway cut problem
Discrete Applied Mathematics | 2023-08-02 | Paper |
Experimental evaluation of a local search approximation algorithm for the multiway cut problem
| 2022-03-24 | Paper |
Structural parameters for scheduling with assignment restrictions
Theoretical Computer Science | 2020-10-21 | Paper |
Makespan minimization on unrelated parallel machines with a few bags
Theoretical Computer Science | 2020-04-22 | Paper |
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
Theoretical Computer Science | 2020-01-29 | Paper |
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
Combinatorial Optimization and Applications | 2019-10-11 | Paper |
Approximation algorithms for the graph balancing problem with two speeds and two job lengths
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
A 3/2-approximation algorithm for the graph balancing problem with two weights
Algorithms | 2019-03-26 | Paper |
scientific article; zbMATH DE number 6940804 (Why is no real title available?)
| 2018-09-20 | Paper |
Labeling Mycielski graphs with a condition at distance two.
| 2018-09-20 | Paper |
Structural parameters for scheduling with assignment restrictions
Lecture Notes in Computer Science | 2017-07-21 | Paper |
A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
Algorithmica | 2017-03-03 | Paper |
\(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
Discrete Applied Mathematics | 2017-02-27 | Paper |
A new characterization of disk graphs and its application.
Ars Combinatoria | 2016-10-26 | Paper |
On some results for the \(L(2,1)\)-labeling on Cartesian sum graphs.
Ars Combinatoria | 2016-10-26 | Paper |
Makespan minimization in job shops: a polynomial time approximation scheme
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Analysis of a local search algorithm for the \(k\)-facility location problem
RAIRO - Theoretical Informatics and Applications | 2016-08-12 | Paper |
scientific article; zbMATH DE number 6472643 (Why is no real title available?)
| 2015-08-14 | Paper |
\(L(2,1)\)-labelings on the modular product of two graphs
Theoretical Computer Science | 2013-12-11 | Paper |
On packing rectangles with resource augmentation: maximizing the profit
Algorithmic Operations Research | 2013-12-11 | Paper |
A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
Information Processing Letters | 2013-03-28 | Paper |
Packing squares with profits
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
Mathematics of Operations Research | 2012-05-24 | Paper |
An asymptotic approximation algorithm for 3D-strip packing
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
\(L(2,1)\)-labelings on the composition of \(n\) graphs
Theoretical Computer Science | 2010-08-11 | Paper |
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Approximation schemes for scheduling jobs with chain precedence constraints
International Journal of Foundations of Computer Science | 2010-03-09 | Paper |
Rectangle packing with one-dimensional resource augmentation
Discrete Optimization | 2009-08-19 | Paper |
New Approximability Results for 2-Dimensional Packing Problems
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
A Polynomial Time Approximation Scheme for the Square Packing Problem
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Gene Assembly Algorithms for Ciliates
DNA Computing | 2008-04-04 | Paper |
Approximation Algorithms for the k-Median Problem
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Efficient algorithms for robustness in resource allocation and scheduling problems
Theoretical Computer Science | 2006-03-24 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
International Journal of Foundations of Computer Science | 2005-09-12 | Paper |
Approximation schemes for job shop scheduling problems with controllable processing times
European Journal of Operational Research | 2005-08-04 | Paper |
An asymptotic fully polynomial time approximation scheme for bin covering.
Theoretical Computer Science | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2044496 (Why is no real title available?)
| 2004-02-18 | Paper |
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
scientific article; zbMATH DE number 1982192 (Why is no real title available?)
| 2003-09-16 | Paper |
scientific article; zbMATH DE number 1979497 (Why is no real title available?)
| 2003-09-14 | Paper |
How helpers hasten \(h\)-relations
Journal of Algorithms | 2002-08-01 | Paper |
scientific article; zbMATH DE number 1670676 (Why is no real title available?)
| 2001-11-11 | Paper |
Approximation algorithms for bounded facility location problems
Journal of Combinatorial Optimization | 2001-09-19 | Paper |
scientific article; zbMATH DE number 1560345 (Why is no real title available?)
| 2001-02-01 | Paper |
scientific article; zbMATH DE number 1512677 (Why is no real title available?)
| 2000-10-03 | Paper |
scientific article; zbMATH DE number 1418275 (Why is no real title available?)
| 2000-03-19 | Paper |
Increasing the Weight of Minimum Spanning Trees
Journal of Algorithms | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1305098 (Why is no real title available?)
| 2000-03-13 | Paper |
Algorithms for measuring perturbality in matroid optimization
Combinatorica | 1999-09-14 | Paper |
scientific article; zbMATH DE number 871953 (Why is no real title available?)
| 1996-04-28 | Paper |
