Plane triangulations are 6-partitionable
Discrete Mathematics
Convex Grid Drwaings of Four-Connected Plane Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Partitioning Trees of Supply and Demand
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Rectangle-of-influence drawings of four-connected plane graphs: extended abstract
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Algorithms for computing a parameterized st-orientation
Theoretical Computer Science
NP-Completeness of st-orientations for plane graphs
Theoretical Computer Science
Parameterized st-orientations of graphs: algorithms and experiments
GD'06 Proceedings of the 14th international conference on Graph drawing
NP-completeness of st-orientations for plane graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Decomposing trees with large diameter
Theoretical Computer Science
A plane graph representation of triconnected graphs
Theoretical Computer Science
Convex grid drawings of plane graphs with rectangular contours
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On minimal arbitrarily partitionable graphs
Information Processing Letters
Max-min weight balanced connected partition
Journal of Global Optimization
Note: Partitioning powers of traceable or hamiltonian graphs
Theoretical Computer Science
| Hi-index | 0.90 |