Spill code minimization techniques for optimizing compliers
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
An O(n2) time algorithm for the 2-chain cover problem and related problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs
Computational Optimization and Applications
Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Pattern Matching Problems over 2-Interval Sets
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
On linear and circular structure of (claw, net)-free graphs
Discrete Applied Mathematics
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
Computational Optimization and Applications
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
Discrete Applied Mathematics
Tangent circle graphs and 'orders'
Discrete Applied Mathematics
Efficient algorithms for the minimum connected domination on trapezoid graphs
Information Sciences: an International Journal
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science
Approximating the 2-interval pattern problem
Theoretical Computer Science
An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Scheduling Additional Trains on Dense Corridors
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Counting the number of vertex covers in a trapezoid graph
Information Processing Letters
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Discrete Applied Mathematics
Approximation of RNA multiple structural alignment
Journal of Discrete Algorithms
Approximation of RNA multiple structural alignment
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Approximating the 2-interval pattern problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The recognition of triangle graphs
Theoretical Computer Science
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Efficient algorithm for the vertex connectivity of trapezoid graphs
Information Processing Letters
Max-min weight balanced connected partition
Journal of Global Optimization
| Hi-index | 0.05 |