Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial approximation algorithms for generalized flow problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Job Shop Scheduling Problems with Controllable Processing Times
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximation Algorithms for Fractional Covering and Packing Problems, and Applications
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An asymptotic fully polynomial time approximation scheme for bin covering
Theoretical Computer Science
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
On routing in VLSI design and communication networks
Discrete Applied Mathematics
Scientific contributions of Leo Khachiyan (a short overview)
Discrete Applied Mathematics
Implementation of approximation algorithms for the max-min resource sharing problem
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On routing in VLSI design and communication networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms for mixed fractional packing and covering problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
An approximation algorithm for the general mixed packing and covering problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
BonnRoute: Algorithms and data structures for fast and good VLSI routing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |