Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for rectangle tiling and packing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Simple approximation algorithm for nonoverlapping local alignments
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Hardness of approximation for non-overlapping local alignments
Discrete Applied Mathematics
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Improved Parameterized Algorithms for Weighted 3-Set Packing
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
On restrictions of balanced 2-interval graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Theoretical Computer Science
On the parameterized complexity of some optimization problems related to multiple-interval graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Recognizing d-interval graphs and d-track interval graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
An experimental study of the misdirection algorithm for combinatorial auctions
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
Scheduling jobs with multiple non-uniform tasks
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |