| Publication | Date of Publication | Type |
|---|
Approximation algorithms and a hardness result for the three-machine proportionate mixed shop
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
A 21/16-Approximation for the Minimum 3-Path Partition Problem
| 2023-02-03 | Paper |
A local search 4/3-approximation algorithm for the minimum 3-path partition problem
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
Open-shop scheduling for unit jobs under precedence constraints
Theoretical Computer Science | 2019-12-27 | Paper |
Approximation algorithms for the three-machine proportionate mixed shop scheduling
Theoretical Computer Science | 2019-12-27 | Paper |
Open-shop scheduling for unit jobs under precedence constraints
Combinatorial Optimization and Applications | 2019-10-11 | Paper |
A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
| 2019-10-11 | Paper |
Approximation algorithms for vertex happiness
Journal of the Operations Research Society of China | 2019-10-04 | Paper |
Rescheduling due to machine disruption to minimize the total weighted completion time
Journal of Scheduling | 2019-08-08 | Paper |
An improved approximation algorithm for the minimum 3-path partition problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
Frontiers in Algorithmics | 2019-04-26 | Paper |
Algorithms for communication scheduling in data gathering network with data compression
Algorithmica | 2019-01-11 | Paper |
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
| 2018-10-04 | Paper |
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
Theoretical Computer Science | 2018-06-05 | Paper |
Machine scheduling with a maintenance interval and job delivery coordination
Optimization Letters | 2017-03-28 | Paper |
Approximating the maximum multiple RNA interaction problem
Theoretical Computer Science | 2016-06-27 | Paper |
Smoothed heights of tries and patricia tries
Theoretical Computer Science | 2015-12-11 | Paper |
Machine scheduling with a maintenance interval and job delivery coordination
Frontiers in Algorithmics | 2015-11-12 | Paper |
A 0.5358-approximation for Bandpass-2
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
Approximating the minimum independent dominating set in perturbed graphs
Theoretical Computer Science | 2014-10-06 | Paper |
On the smoothed heights of trie and patricia index trees
Lecture Notes in Computer Science | 2014-09-26 | Paper |
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Theoretical Computer Science | 2014-08-26 | Paper |
Approximation algorithms for the maximum multiple RNA interaction problem
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Approximating the minimum independent dominating set in perturbed graphs
Lecture Notes in Computer Science | 2013-06-11 | Paper |
An improved approximation algorithm for the complementary maximal strip recovery problem
Journal of Computer and System Sciences | 2012-08-17 | Paper |
An improved approximation algorithm for the bandpass problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
An improved approximation algorithm for the complementary maximal strip recovery problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Strong equivalence of logic programs with abstract constraint atoms
Logic Programming and Nonmonotonic Reasoning | 2011-05-26 | Paper |
Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
Theoretical Computer Science | 2011-01-28 | Paper |
Speculative abductive reasoning for hierarchical agent systems
Lecture Notes in Computer Science | 2010-08-24 | Paper |
Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders
Acta Mathematicae Applicatae Sinica. English Series | 2009-11-13 | Paper |
Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
scientific article; zbMATH DE number 2088096 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 1755721 (Why is no real title available?)
| 2002-06-16 | Paper |
An abductive approach to disjunctive logic programming
The Journal of Logic Programming | 2001-03-25 | Paper |
scientific article; zbMATH DE number 1420809 (Why is no real title available?)
| 2000-08-28 | Paper |
scientific article; zbMATH DE number 1222411 (Why is no real title available?)
| 1999-05-18 | Paper |
scientific article; zbMATH DE number 1237865 (Why is no real title available?)
| 1999-01-11 | Paper |
The ECO family
Computers & Mathematics with Applications | 1993-04-19 | Paper |
scientific article; zbMATH DE number 67475 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 4106299 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 3984612 (Why is no real title available?)
| 1986-01-01 | Paper |
