On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Packing triangles in bounded degree graphs
Information Processing Letters
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Polyhedral Approach to Surface Reconstruction from Planar Contours
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Approximation Algorithms for NMR Spectral Peak Assignment
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
A New Measure of Edit Distance between Labeled Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Using Nondeterminism to Design Deterministic Algorithms
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On the Approximability of the Minimum Test Collection Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs
Theoretical Computer Science - Mathematical foundations of computer science
Approximation algorithms for NMR spectral peak assignment
Theoretical Computer Science
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Journal of Computer and System Sciences
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Windows scheduling as a restricted version of Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating connectivity augmentation problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Designing optimally multiplexed SNP genotyping assays
Journal of Computer and System Sciences - Special issue on bioinformatics II
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
On the complexity of approximating k-set packing
Computational Complexity
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
Windows scheduling as a restricted version of bin packing
ACM Transactions on Algorithms (TALG)
Matroid representation of clique complexes
Discrete Applied Mathematics
Discrete Applied Mathematics
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
AAIM '08 Proceedings of the 4th 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
Approximability of Average Completion Time Scheduling on Unrelated Machines
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the minimum common integer partition problem
ACM Transactions on Algorithms (TALG)
Exact algorithms for the matrix bid auction
Computers and Operations Research
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
Note: An improved randomized approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Hardness and approximation of traffic grooming
Theoretical Computer Science
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
Complexity issues in color-preserving graph embeddings
Theoretical Computer Science
Approximability of Edge Matching Puzzles
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Real-time scheduling with a budget
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Exact algorithms for the matrix bid auction
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Hardness and approximation of traffic grooming
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Hardness of k-Vertex-Connected Subgraph Augmentation Problem
Journal of Combinatorial Optimization
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Resolving the complexity of some data privacy problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Shortest path and maximum flow problems in networks with additive losses and gains
Theoretical Computer Science
Partition into triangles on bounded degree graphs
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Improved MAX SNP-hard results for finding an edit distance between unordered trees
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Minimum interval cover and its application to genome sequencing
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Scheduling algorithms for multicarrier wireless data systems
IEEE/ACM Transactions on Networking (TON)
Assignment problems in rental markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Inapproximability results for orthogonal rectangle packing problems with rotations
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the minimum common integer partition problem
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Between a rock and a hard place: the two-to-one assignment problem
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Better approximations for the minimum common integer partition problem
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
Mechanisms and allocations with positive network externalities
Proceedings of the 13th ACM Conference on Electronic Commerce
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry
A (1-1/e)-approximation algorithm for the generalized assignment problem
Operations Research Letters
Inapproximability results for no-wait job shop scheduling
Operations Research Letters
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
A 6/5-approximation algorithm for the maximum 3-cover problem
Journal of Combinatorial Optimization
Computing the differential of a graph: Hardness, approximability and exact algorithms
Discrete Applied Mathematics
| Hi-index | 0.90 |