STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Game theory, on-line prediction and boosting
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
K-medians, facility location, and the Chernoff-Wald bound
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for the partial latin square extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Reformulating Combinatorial Optimization as Constraint Satisfaction
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
The Oracular Constraints Method
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Dynamic Graph Algorithms with Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
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
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
ESA '02 Proceedings of the 10th 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
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Journal of Algorithms
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
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
Approximating metrics by tree metrics
ACM SIGACT News
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Solving fractional packing problems in Oast(1/ε) iterations
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Distributed approximation: a survey
ACM SIGACT News
Online client-server load balancing without global information
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
Cross-layer optimization in TCP/IP networks
IEEE/ACM Transactions on Networking (TON)
Source routing and scheduling in packet networks
Journal of the ACM (JACM)
Hitting sets when the VC-dimension is small
Information Processing Letters
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Pricing for fairness: distributed resource allocation for multiple objectives
Proceedings of the thirty-eighth 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
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Scheduling over nonstationary wireless channels with finite rate sets
IEEE/ACM Transactions on Networking (TON)
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Theoretical Computer Science
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum k-way cuts via deterministic greedy tree packing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On routing in VLSI design and communication networks
Discrete Applied Mathematics
Flows with Unit Path Capacities and Related Packing and Covering Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Rounding of convex sets and efficient gradient methods for linear programming problems
Optimization Methods & Software
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Parameterized approximation scheme for the multiple knapsack problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Algorithms for distributional and adversarial pipelined filter ordering problems
ACM Transactions on Algorithms (TALG)
A Fast and Simple Algorithm for Computing Market Equilibria
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Unconstrained Convex Minimization in Relative Scale
Mathematics of Operations Research
Monotone Covering Problems with an Additional Covering Constraint
Mathematics of Operations Research
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Brief announcement: Stateless distributed algorithms for generalized packing linear programs
Proceedings of the 28th ACM symposium on Principles of distributed computing
A parallelized DPPQN based Expert System method and implementation
Expert Systems with Applications: An International Journal
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Hitting sets when the VC-dimension is small
Information Processing Letters
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
Fast approximation of minimum multicast congestion: implementation versus theory
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
Stateless near optimal flow control with poly-logarithmic convergence
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Proceedings of the forty-second ACM symposium on Theory of computing
Constrained relay node placement in wireless sensor networks: formulation and approximations
IEEE/ACM Transactions on Networking (TON)
Polynomial-space approximation of no-signaling provers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Heuristic algorithms in computational molecular biology
Journal of Computer and System Sciences
SIAM Journal on Computing
Parameterized Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
Scheduling jobs on heterogeneous platforms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Approximating Semidefinite Packing Programs
SIAM Journal on Optimization
Implementation of approximation algorithms for the max-min resource sharing problem
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for mixed fractional packing and covering problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Bandwidth allocation in networks: a single dual update subroutine for multiple objectives
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Feasible and accurate algorithms for covering semidefinite programs
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Vector bin packing with multiple-choice
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Bin packing with fixed number of bins revisited
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
A first-orderε-approximation algorithm for linear programs and a second-order implementation
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Vector bin packing with multiple-choice
Discrete Applied Mathematics
The feedback arc set problem with triangle inequality is a vertex cover problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A sublinear-time randomized approximation algorithm for matrix games
Operations Research Letters
An improved approximation algorithm for the partial Latin square extension problem
Operations Research Letters
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Cost of not splitting in routing: characterization and estimation
IEEE/ACM Transactions on Networking (TON)
An improved approximation scheme for variable-sized bin packing
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms (TALG)
Bin packing with fixed number of bins revisited
Journal of Computer and System Sciences
BonnRoute: Algorithms and data structures for fast and good VLSI routing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Content placement via the exponential potential function method
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Optimal auctions via the multiplicative weight method
Proceedings of the fourteenth ACM conference on Electronic commerce
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |