Journal of Experimental Algorithmics (JEA)
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Approximation algorithms for routing and call scheduling in all-optical chains and rings
Theoretical Computer Science
Bandwidth allocation in WDM tree networks
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
Fractional Path Coloring with Applications to WDM Networks
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
WAE '00 Proceedings of the 4th 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
Wide-Sense Nonblocking WDM Cross-Connects
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
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
The permutation-path coloring problem on trees
Theoretical Computer Science - Latin American theoretical informatics
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
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Journal of Algorithms
Journal of Experimental Algorithmics (JEA)
Minimizing ADMs on WDM directed fiber trees
Journal of Computer Science and Technology
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
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
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
Minimizing maximum fiber requirement in optical networks
Journal of Computer and System Sciences
Wavelength management in WDM rings to maximize the number of connections
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Selfish routing and path coloring in all-optical networks
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Routing and wavelength assignment in generalized WDM tree networks of bounded degree
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
Parameterized maximum path coloring
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized maximum path coloring
Theoretical Computer Science
| Hi-index | 5.23 |