Combinatorica
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Optical computer architectures: the application of optical concepts to next generation computers
Optical computer architectures: the application of optical concepts to next generation computers
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Rooted routing in linear lightwave networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Architectures for linear lightwave networks
Architectures for linear lightwave networks
A linear lightwave Benes network
IEEE/ACM Transactions on Networking (TON)
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient routing and scheduling algorithms for optical networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Online Load Balancing of Temporary Tasks
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Node-disjoint paths on the mesh and a new trade-off in VLSI layout
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Simple, efficient routing schemes for all-optical networks
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Multiwavelength optical networks with limited wavelength conversion
IEEE/ACM Transactions on Networking (TON)
All-to-all routing and coloring in weighted trees of rings
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
IEEE/ACM Transactions on Networking (TON)
Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Improved access to optical bandwidth in trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth 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
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks
IEEE Transactions on Parallel and Distributed Systems
Worst-case analysis of dynamic wavelength allocation in optical networks
IEEE/ACM Transactions on Networking (TON)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Journal of Experimental Algorithmics (JEA)
On the wavelength assignment problem in multifiber WDM star and ring networks
IEEE/ACM Transactions on Networking (TON)
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
Theoretical Computer Science
Wavelength routing in optical networks of diameter two
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
An efficient algorithm for reducing the number of add-drop Multiplexers in SONET/WDM rings
Journal of High Speed Networks
Approximation algorithms for routing and call scheduling in all-optical chains and rings
Theoretical Computer Science
Randomized path coloring on binary trees
Theoretical Computer Science
Wavelength assignment and generalized interval graph coloring
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Bandwidth allocation in WDM tree networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Traffic partition in WDM/SONET rings to minimize SONET ADMs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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
Maximizing the Number of Connections in Optical Tree Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Randomized path coloring on binary trees
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Randomized Lower Bounds for Online Path Coloring
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Approximating Call-Scheduling Makespan in All-Optical Networks
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Online Call Admission in Optical Networks with Larger Demands
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Multicasting in Optical Networks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Recent Advances in Wavelength Routing
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
The permutation-path coloring problem on trees
Theoretical Computer Science - Latin American theoretical informatics
On dynamic wavelength assignment in WDM optical networks
Optical networks
Satisfying a maximum number of pre-routed requests in all-optical rings
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Multiwavelength Optical Networks with Limited Wavelength Conversion
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
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
Minimizing ADMs on WDM directed fiber trees
Journal of Computer Science and Technology
Journal of Parallel and Distributed Computing
Journal of Scheduling - Special issue: On-line algorithm part I
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling - Special issue: On-line algorithm part I
Tight Bounds for Wavelength Assignment on Trees of Rings
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
Computer Networks: The International Journal of Computer and Telecommunications Networking
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms (TALG)
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Path decomposition under a new cost measure with applications to optical network design
ACM Transactions on Algorithms (TALG)
Inapproximability and approximability of minimal tree routing and coloring
Journal of Discrete Algorithms
The maximum edge-disjoint paths problem in complete graphs
Theoretical Computer Science
Forwarding and optical indices of a graph
Discrete Applied Mathematics
Efficient algorithms for wavelength assignment on trees of rings
Discrete Applied Mathematics
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Information Processing Letters
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
Computer Networks: The International Journal of Computer and Telecommunications Networking
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Minimizing maximum fiber requirement in optical networks
Journal of Computer and System Sciences
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Selfish routing and path coloring in all-optical networks
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Paths coloring algorithms in mesh networks
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A nature-inspired algorithm for the disjoint paths problem
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Routing and wavelength assignment in generalized WDM tree networks of bounded degree
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
On packing and coloring hyperedges in a cycle
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Nash equilibria in all-optical networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Optimal wavelength converter placement with guaranteed wavelength usage
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
On bounded load routings for modeling k-regular connection topologies
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complexity of minimal tree routing and coloring
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
An approximation algorithm for embedding a directed hypergraph on a ring
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Packet routing: complexity and algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
Randomized and approximation algorithms for blue-red matching
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Online capacitated interval coloring
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.01 |