Efficient global register allocation for minimizing energy consumption
ACM SIGPLAN Notices
Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Simple Algorithms for a Weighted Interval Selection Problem
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
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
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Journal of Scheduling
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
Some approximation algorithms for the clique partition problem in weighted interval graphs
Theoretical Computer Science
On packing and coloring hyperedges in a cycle
Discrete Applied Mathematics
Improved Randomized Results for That Interval Selection Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Approximating maximum weight K-colorable subgraphs in chordal graphs
Information Processing Letters
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Information Processing Letters
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
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
Improved randomized results for the interval selection problem
Theoretical Computer Science
Online splitting interval scheduling on m identical machines
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Interval scheduling on related machines
Computers and Operations Research
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
On-line simultaneous maximization of the size and the weight for degradable intervals schedules
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Minimum clique partition problem with constrained weight for interval graphs
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Wavelength assignment for satisfying maximal number of requests in all-optical networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
On-Line bicriteria interval scheduling
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Maximizing the number of connections in multifiber WDM chain, ring and star networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
The maximum k-colorable subgraph problem and orbitopes
Discrete Optimization
Layered interval codes for TCAM-based classification
Computer Networks: The International Journal of Computer and Telecommunications Networking
Randomized and approximation algorithms for blue-red matching
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Stitch-aware routing for multiple e-beam lithography
Proceedings of the 50th Annual Design Automation Conference
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
Hi-index | 0.05 |