Algorithmic aspects of three dimensional MCM routing
DAC '94 Proceedings of the 31st annual Design Automation Conference
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs
Computational Optimization and Applications
Maximizing the Number of Connections in Optical Tree Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Minimizing Average Completion of Dedicated Tasks and Interval Graphs
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
New upper bounds on feedback vertex numbers in butterflies
Information Processing Letters
Information Sciences: an International Journal
On the complexity of spill everywhere under SSA form
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Interference graphs for procedures in static single information form are interval graphs
SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum weight feedback vertex sets in circle graphs
Information Processing Letters
Register allocation by puzzle solving
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
The 0-1 inverse maximum stable set problem
Discrete Applied Mathematics
Approximating maximum weight K-colorable subgraphs in chordal graphs
Information Processing Letters
Live-range unsplitting for faster optimal coalescing
Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Minimum Entropy Combinatorial Optimization Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An efficient multiuser scheduling scheme for MIMO-CDMA wireless systems
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
"Rent-or-buy" scheduling and cost coloring problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Journal of Computer and System Sciences
Efficient algorithms for the double traveling salesman problem with multiple stacks
Computers and Operations Research
Studying optimal spilling in the light of SSA
CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
Register allocation via coloring of chordal graphs
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
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
ACM Transactions on Algorithms (TALG)
Batch scheduling algorithms for optical burst switching 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
Weighted sum coloring in batch scheduling of conflicting jobs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
ACM Transactions on Embedded Computing Systems (TECS)
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Optimal register allocation in polynomial time
CC'13 Proceedings of the 22nd international conference on Compiler Construction
Contracting chordal graphs and bipartite graphs to paths and trees
Discrete Applied Mathematics
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.89 |