A Simple Parallel Algorithm to Draw Cubic Graphs
IEEE Transactions on Parallel and Distributed Systems
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Computing Orthogonal Drawings in a Variable Embedding Setting
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Three Approaches to 3D-Orthogonal Box-Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planar Polyline Drawings with Good Angular Resolution
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
On the two-dimensional orthogonal drawing of series-parallel graphs
Discrete Applied Mathematics
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks
International Journal of Distributed Sensor Networks
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Drawing planar graphs of bounded degree with few slopes
GD'10 Proceedings of the 18th international conference on Graph drawing
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
On the computation of colored domino tilings of simple and non-simple orthogonal polygons
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Hexagonal grid drawings: algorithms and lower bounds
GD'04 Proceedings of the 12th international conference on Graph Drawing
Small drawings of series-parallel graphs and other subclasses of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Drawing trees in a streaming model
GD'09 Proceedings of the 17th international conference on Graph Drawing
Drawing trees in a streaming model
Information Processing Letters
GD'11 Proceedings of the 19th international conference on Graph Drawing
Overloaded orthogonal drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
The DFS-heuristic for orthogonal graph drawing
Computational Geometry: Theory and Applications
Complexity of minimum corridor guarding problems
Information Processing Letters
Optimal orthogonal graph drawing with convex bend costs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |