On the design of efficient ATM routing schemes
Theoretical Computer Science
A survey of graph layout problems
ACM Computing Surveys (CSUR)
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
Planar crossing numbers of genus g graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hi-index | 5.23 |