DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Finding hidden Hamiltonian cycles
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Net partitions yield better module partitions
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphs
DAC '94 Proceedings of the 31st annual Design Automation Conference
Quantified suboptimality of VLSI layout heuristics
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks
IEEE Transactions on Computers - Special issue on mobile computing
A Hypergraph Framework for Optimal Model-Based Decomposition ofDesign Problems
Computational Optimization and Applications
Partitioning-based standard-cell global placement with an exact objective
Proceedings of the 1997 international symposium on Physical design
The ISPD98 circuit benchmark suite
ISPD '98 Proceedings of the 1998 international symposium on Physical design
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
A new approach to effective circuit clustering
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
Design and implementation of move-based heuristics for VLSI hypergraph partitioning
Journal of Experimental Algorithmics (JEA)
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Multilevel algorithms for generating coarse grids for multigrid methods
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Combinatorial Optimization by Dynamic Contraction
Journal of Heuristics
Scheduling for Reactive Real-Time Systems
IEEE Micro
A Fast and Robust Network Bisection Algorithm
IEEE Transactions on Computers
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
General partitioning on random graphs
Journal of Algorithms
Optimality, scalability and stability study of partitioning and placement algorithms
Proceedings of the 2003 international symposium on Physical design
Load balancing for unstructured mesh applications
Progress in computer research
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
New Spectral Lower Bounds on the Bisection Width of Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Linear Orderings of Random Geometric Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Iterative compaction: an improved approach to graph and circuit bisection
EURO-DAC '91 Proceedings of the conference on European design automation
Bounds on the max and min bisection of random cubic and random 4-regular graphs
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Lock-Gain Based Graph Partitioning
Journal of Heuristics
An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs
IEEE Transactions on Computers
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
Subproblem optimization by gene correlation with singular value decomposition
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Parallel and Distributed Systems
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Evolutionary Computation
Multi-attractor gene reordering for graph bisection
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Spectral techniques for graph bisection in genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Spectral clustering by recursive partitioning
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Bounds on the bisection width for random d -regular graphs
Theoretical Computer Science
A PROBE-Based Heuristic for Graph Partitioning
IEEE Transactions on Computers
Eigenvalues and graph bisection: An average-case analysis
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Single- and multi-objective evolutionary algorithms for graph bisectioning
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
On finding graph clusterings with maximum modularity
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Autonomous dynamic reconfiguration in multi-agent systems: improving the quality and efficiency of collaborative problem solving
Simple cuts are fast and good: optimum right-angled cuts in solid grids
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
On the NP-Completeness of some graph cluster measures
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
A simple message passing algorithm for graph partitioning problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computer Science Review
A new adaptive multi-start technique for combinatorial global optimizations
Operations Research Letters
Better bounds for graph bisection
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.02 |