Plane triangulations are 6-partitionable
Discrete Mathematics
Bisecting Two Subsets in 3-Connected Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Bisecting a 4-connected graph with three resource sets
Discrete Applied Mathematics
Decomposing trees with large diameter
Theoretical Computer Science
A plane graph representation of triconnected graphs
Theoretical Computer Science
Evacuation of rectilinear polygons
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Bisecting a four-connected graph with three resource sets
ISAAC'05 Proceedings of the 16th 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.89 |