Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Circular-arc graphs with clique cover number two
Journal of Combinatorial Theory Series A
Avoiding matrix multiplication
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
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
Recognition and Isomorphism of Two Dimensional Partial Orders
Proceedings of the 10th Colloquium on Automata, Languages and Programming
PQ-tree algorithms.
Disjoint paths in circular arc graphs
Nordic Journal of Computing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Graph Automorphisms with Maximal Projection Distances
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
BOB: improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence
Efficient construction of unit circular-arc models
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
On the structure of certain intersection graphs
Information Processing Letters
Discrete Applied Mathematics
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
Paired domination on interval and circular-arc graphs
Discrete Applied Mathematics
Combinatorial auctions with structured item graphs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Approximating bandwidth by mixing layouts of interval graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Algorithms for induced biclique optimization problems
Information Processing Letters
A simpler linear-time recognition of circular-arc graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |