| Publication | Date of Publication | Type |
|---|
A primal-dual approximation algorithm for \textsc{minsat}
Discrete Applied Mathematics | 2022-08-04 | Paper |
| On the minimum satisfiability problem | 2020-07-21 | Paper |
| Consistent subset problem with two labels | 2018-06-05 | Paper |
Mulling over shapes, rules and numbers
Nexus Network Journal | 2017-06-30 | Paper |
Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
| PTAS for ordered instances of resource allocation problems | 2017-02-21 | Paper |
The cyclical scheduling problem
Theoretical Computer Science | 2014-10-06 | Paper |
The cyclical scheduling problem
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
An approximation algorithm for max k-uncut with capacity constraints
Optimization | 2012-03-15 | Paper |
Conflict resolution in the scheduling of television commercials
Operations Research | 2011-11-24 | Paper |
Erratum to: The capacitated max k-cut problem
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
Information Processing Letters | 2009-03-23 | Paper |
Self-duality of bounded monotone Boolean functions and related problems
Discrete Applied Mathematics | 2008-09-10 | Paper |
The capacitated max \(k\)-cut problem
Mathematical Programming. Series A. Series B | 2008-06-30 | Paper |
Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2007-07-19 | Paper |
Berge's theorem for the maximum charge problem
Discrete Optimization | 2006-10-10 | Paper |
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics | 2006-04-28 | Paper |
The multiple TSP with time windows: vehicle bounds based on precedence graphs
Operations Research Letters | 2006-01-18 | Paper |
| scientific article; zbMATH DE number 2080451 (Why is no real title available?) | 2004-08-04 | Paper |
Average performance of greedy heuristics for the integer knapsack problem.
European Journal of Operational Research | 2004-02-02 | Paper |
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theoretical Computer Science | 2003-08-17 | Paper |
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
Journal of Algorithms | 2002-09-30 | Paper |
An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1670660 (Why is no real title available?) | 2001-11-11 | Paper |
Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability
Journal of Combinatorial Optimization | 2001-09-19 | Paper |
| scientific article; zbMATH DE number 1522920 (Why is no real title available?) | 2001-02-13 | Paper |
| scientific article; zbMATH DE number 922838 (Why is no real title available?) | 1996-11-20 | Paper |
An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
SIAM Journal on Discrete Mathematics | 1996-09-15 | Paper |
| scientific article; zbMATH DE number 549925 (Why is no real title available?) | 1995-03-01 | Paper |
The Minimum Satisfiability Problem
SIAM Journal on Discrete Mathematics | 1995-02-13 | Paper |
Joint performance of greedy heuristics for the integer knapsack problem
Discrete Applied Mathematics | 1995-02-01 | Paper |
An efficient heuristic scheme for dynamic remapping of parallel computations
Parallel Computing | 1994-10-31 | Paper |
A total-value greedy heuristic for the integer knapsack problem
Operations Research Letters | 1993-01-16 | Paper |
Optimal product design using conjoint analysis: Computational complexity and algorithms
European Journal of Operational Research | 1989-01-01 | Paper |
Average Performance of Heuristics for Satisfiability
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
