Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Packing triangles in bounded degree graphs
Information Processing Letters
Scheduling time-constrained multicast messages in circuit-switched tree networks
Information Processing Letters
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 d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
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
On the Approximability of the Minimum Test Collection Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Upper degree-constrained partial orientations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Critical chromatic number and the complexity of perfect packings in graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Theoretical Computer Science - Parameterized and exact computation
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)
On the complexity of approximating k-set packing
Computational Complexity
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Scheduling to minimize gaps and power consumption
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Stochastic packing-market planning
Proceedings of the 8th ACM conference on Electronic commerce
Algorithms for terminal Steiner trees
Theoretical Computer Science
A 10/7 + ε approximation for minimizing the number of ADMs in SONET rings
IEEE/ACM Transactions on Networking (TON)
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
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the minimum common integer partition problem
ACM Transactions on Algorithms (TALG)
Approximation algorithms and hardness results for the clique packing problem
Discrete Applied Mathematics
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
On approximating four covering and packing problems
Journal of Computer and System Sciences
Hardness and approximation of traffic grooming
Theoretical Computer Science
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Covering the edges of bipartite graphs using K2,2 graphs
Theoretical Computer Science
Complexity issues in color-preserving graph embeddings
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)
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Wavelength management in WDM rings to maximize the number of connections
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Covering the edges of bipartite graphs using K2,2gaphs
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An improved parameterized algorithm for a generalized matching problem
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithmics in intensity-modulated radiation therapy
Algorithms and theory of computation handbook
Improving integrality gaps via Chvátal-Gomory rounding
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Mathematics of Operations Research
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
Inapproximability of b-matching in k-uniform hypergraphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Matching and P2-packing: weighted versions
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Improved approximations for k-exchange systems
ESA'11 Proceedings of the 19th European conference on Algorithms
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Algorithms for terminal steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the minimum common integer partition problem
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Recognition of binding patterns common to a set of protein structures
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Minimizing setup and beam-on times in radiation therapy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Weighted sum coloring in batch scheduling of conflicting jobs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximating the unweighted k-set cover problem: greedy meets local search
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
On k-column sparse packing programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Packing-based approximation algorithm for the k-set cover problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Competitive router scheduling with structured data
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
Local search for the minimum label spanning tree problem with bounded color classes
Operations Research Letters
Price of Correlations in Stochastic Optimization
Operations Research
Overflow management with multipart packets
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A 6/5-approximation algorithm for the maximum 3-cover problem
Journal of Combinatorial Optimization
Scheduling to minimize gaps and power consumption
Journal of Scheduling
A New Local Search Algorithm for Binary Optimization
INFORMS Journal on Computing
Packing paths: Recycling saves time
Discrete Applied Mathematics
Tight approximation bounds for combinatorial frugal coverage algorithms
Journal of Combinatorial Optimization
GeoTruCrowd: trustworthy query answering with spatial crowdsourcing
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Large neighborhood local search for the maximum set packing problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Matching and Weighted P2-Packing: Algorithms and Kernels
Theoretical Computer Science
Complexity results for rainbow matchings
Theoretical Computer Science
| Hi-index | 0.01 |