A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
The node capacitated graph partitioning problem: a computational study
Mathematical Programming: Series A and B - Special issue on computational integer programming
Multilevel k-way hypergraph partitioning
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Mesh partitioning and load balancing for distributed memory parallel architectures
Parallel and distributed processing for computational mechanics
Hi-index | 0.00 |
On their route to the electronic era, organisations release on the web more and more complex form-based services, which require users to enter numerous data items interrelated by business rules. In such a context, it is crucial to provide optimal form layouts, in order to present the service users with interfaces that facilitate their work. This paper presents an integrated environment, which exploits data item interrelations manifested by the business rules (or validation checks), to optimise the layout of the web forms comprising a complex service. The approach is validated through its application on a tax return form e-service.