Universal circuits (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Graphs and Hypergraphs
Applications of a planar separator theorem
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The cube-connected-cycles: A versatile network for parallel computation
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Explicit constructions of linear size superconcentrators
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Time bounded random access machines
Journal of Computer and System Sciences
Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the two-dimensional orthogonal drawing of series-parallel graphs
Discrete Applied Mathematics
Journal of Discrete Algorithms
VLSI systolic arrays for band matrix multiplication
Integration, the VLSI Journal
Note: Constrained k-center and movement to independence
Discrete Applied Mathematics
On complexity of wireless gathering problems on unit-disk graphs
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Closest pair and the post office problem for stochastic points
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
GD'05 Proceedings of the 13th international conference on Graph Drawing
Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
Journal of Parallel and Distributed Computing
Minimum data-latency-bound k-sink placement problem in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
On sum coloring and sum multi-coloring for restricted families of graphs
Theoretical Computer Science
Drawing a tree as a minimum spanning tree approximation
Journal of Computer and System Sciences
Drawing unordered trees on k-grids
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
The planar k-means problem is NP-hard
Theoretical Computer Science
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The maximum clique problem in multiple interval graphs (extended abstract)
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Circle-Representations of simple 4-regular planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
GD'12 Proceedings of the 20th international conference on Graph Drawing
On bounding node-to-sink latency in wireless sensor networks with multiple sinks
International Journal of Sensor Networks
On the discovery of critical links and nodes for assessing network vulnerability
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for B 1-EPG graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences
Closest pair and the post office problem for stochastic points
Computational Geometry: Theory and Applications
| Hi-index | 14.98 |
The problem of embedding the interconnection pattern of a circuit into a two-dimensional surface of minimal area is discussed. Since even for some natural patterns graphs containing m connections may require Ω(m2) area, in order to achieve compact embeddings restricted classes of graphs have to be considered. For example, arbitrary trees (of bounded degree) can be embedded in linear area without edges crossing over. Planar graphs can be embedded efficiently only if crossovers are allowed in the embedding.