The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Shifting Algorithm for Min-Max Tree Partitioning
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Dynamic information and library processing
Dynamic information and library processing
Operating systems
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A Shifting Algorithm for Min-Max Tree Partitioning
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
A shifting algorithm for continuous tree partitioning
Theoretical Computer Science
Partitioning Trees of Supply and Demand
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Maintaining Materialized Views for Data Warehouses with Multiple Remote Sources
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Divider-based algorithms for hierarchical tree partitioning
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Continuous bottleneck tree partitioning problems
Discrete Applied Mathematics
On the uniform edge-partition of a tree
Discrete Applied Mathematics
Comparing and consolidating two heuristic metaschemas
Journal of Biomedical Informatics
Trie Partitioning in distributed PC based routers
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Discrete Applied Mathematics
A tight bound on the min-ratio edge-partitioning problem of a tree
Discrete Applied Mathematics
Partitioning a weighted graph to connected subgraphs of almost uniform size
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
A linear-time algorithm for finding an edge-partition with max-min ratio at most two
Discrete Applied Mathematics
Partitioning and ranking tagged data sources
Proceedings of the VLDB Endowment
Max-min weight balanced connected partition
Journal of Global Optimization
Journal of Combinatorial Optimization
| Hi-index | 0.01 |