STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for fault-tolerant routing in circuit switched networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Algorithms for Restoration Planning in a Telecommunications Network
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Approximation Algorithms for the Unsplittable Flow Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for Restoration Capacity Planning
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On the k-Splittable Flow Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Journal of Experimental Algorithmics (JEA)
A note on the greedy algorithm for the unsplittable flow problem
Information Processing Letters
Journal of Computer and System Sciences
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Graph decomposition and a greedy algorithm for edge-disjoint paths
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Minimum-cost single-source 2-splittable flow
Information Processing Letters
Traffic engineering of management flows by link augmentations on confluent trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
New hardness results for congestion minimization and machine scheduling
Journal of the ACM (JACM)
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM (JACM)
Improved bounds for the unsplittable flow problem
Journal of Algorithms
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
Journal of Discrete Algorithms
Complexity and approximability of k-splittable flows
Theoretical Computer Science
Hardness of routing with congestion in directed graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
Scheduling bulk file transfers with start and end times
Computer Networks: The International Journal of Computer and Telecommunications Networking
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
On the approximation of the single source k-splittable flow problem
Journal of Discrete Algorithms
Inapproximability and approximability of minimal tree routing and coloring
Journal of Discrete Algorithms
Flows with Unit Path Capacities and Related Packing and Covering Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Paths and trails in edge-colored graphs
Theoretical Computer Science
A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Approximation algorithms for time-constrained scheduling on line networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Disjoint paths in sparse graphs
Discrete Applied Mathematics
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Minimum-cost single-source 2-splittable flow
Information Processing Letters
A practical RWA algorithm based on lookup table for edge disjoint paths
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Convex combinations of single source unsplittable flows
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximability of packing disjoint cycles
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Paths and trails in edge-colored graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
ACM Transactions on Algorithms (TALG)
A nature-inspired algorithm for the disjoint paths problem
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
SIAM Journal on Discrete Mathematics
A biased random-key genetic algorithm for routing and wavelength assignment
Journal of Global Optimization
Finding multiple induced disjoint paths in general graphs
Information Processing Letters
Approximation and complexity of k–splittable flows
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
New algorithms for the unsplittable flow problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Unsplittable anycast flow problem: formulation and algorithms
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Randomized rounding for routing and covering problems: experiments and improvements
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
RWA on scheduled lightpath demands in WDM optical transport networks with time disjoint paths
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Application-aware deadlock-free oblivious routing based on extended turn-model
Proceedings of the International Conference on Computer-Aided Design
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Greedy approximation via duality for packing, combinatorial auctions and routing
MFCS'05 Proceedings of the 30th 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
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
Operations Research Letters
The maximum integer multiterminal flow problem in directed graphs
Operations Research Letters
Single-source k-splittable min-cost flows
Operations Research Letters
Optical Switching and Networking
A Branch and Price algorithm for the k-splittable maximum flow problem
Discrete Optimization
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
The 2-valued case of makespan minimization with assignment constraints
Information Processing Letters
On the complexity and approximation of the min-sum and min-max disjoint paths problems
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
FinIS: improved in silico finishing using an exact quadratic programming formulation
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science
Greener networking in a network virtualization environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
A new virtual network static embedding strategy within the Cloud's private backbone network
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |