The table layout problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The table layout problem

Full text

Pdf (1.15 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the fifteenth annual symposium on Computational geometry table of contents

Miami Beach, Florida, United States

Pages: 115 - 123

Year of Publication: 1999

ISBN:1-58113-068-6

Authors

Richard J. Anderson	Department of Computer and Engineering, Box 352350, University of Washington, Seattle WA
Sumeet Sobti	Department of Computer and Engineering, Box 352350, University of Washington, Seattle WA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 28, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/304893.304937 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Ach81	James O. Achugbue, On the line breaking problem in text formatting, Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation, p.117-122, June 08-10, 1981, Portland, Oregon, United States
	AS93	R.j. Anderson and J. C. Setubal. Goldberg's algorithm for maximum flow in perspective: a computational study, volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1-17. American Mathematical Society, 1993.
	Bea85	Richard John Beach, Setting tables and illustrations with style, 1985
	BLM97	Alan Borning , Richard Lin , Kim Marriott, Constraints for the web, Proceedings of the fifth ACM international conference on Multimedia, p.173-182, November 09-13, 1997, Seattle, Washington, United States [doi>10.1145/266180.266361]
	BMSX97	Alan Borning, Kim Marriott, Peter Stuckey, and Yi Xiao. Solving linear arithmetic constraints for user interface applications: Algorithm details. Technical Report 97-06-01, Dept. of Computer Science and Engineering, University of Washington, Seattle, WA, July 1997.
	CM92	Edith Cohen , Nimrod Megiddo, New algorithms for generalized network flows, Symposium proceedings on Theory of computing and systems, p.103-114, June 1992, Haifa, Israel
	F91	Greg N. Frederickson, Optimal algorithms for tree partitioning, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.168-177, January 28-30, 1991, San Francisco, California, United States
	GGT89	G. Gallo , M. D. Grigoriadis , R. E. Tarjan, A fast parametric maximum flow algorithm and applications, SIAM Journal on Computing, v.18 n.1, p.30-55, Feb. 1989 [doi>10.1137/0218003]
	Gos81	James Gosling, A redisplay algorithm, Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation, p.123-129, June 08-10, 1981, Portland, Oregon, United States
	Gus88	Dan Gusfield, A graph theoretic approach to statistical data security, SIAM Journal on Computing, v.17 n.3, p.552-571, June 1988 [doi>10.1137/0217034]
	Knu84	Donald E. Knuth, The TEXbook, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987
	KP81	D.E. Knuth and M. F. Plass. Breaking paragraphs into lines. Software Practice and Experience, 11(11):1119-1184, 1981.
	KvW89	B.W. Kernighan and C. van Wyk. Page makeup by postprocessing text formatter output. Computing Systems, 2(2):103-132, 1989.
	LK78	J.K. Lenstra and A. H. G. Rinnooy Kan. Complexity of scheduling under precedence constraints. OR, 26:22-35, 1978.
	Ber	Michel Berkelaar. Mixed Integer Linear Program Solver 'lp_solve'. The code is available at ftp: / / ft p. es.ele, tue. nl / pub/lp_sol ve.
	Rad93	T. Radzik. Faster algorithms for the generalized network flow problem. In 34th Symposium on Foundations of Computer Science, pages 438- 448, 1993.
	Wan96	Xinxin Wang , Derick Wood, Tabular abstraction, editing, and formatting, 1996
	WW93	X. Wang and D. Wood. Tabular formatting problems. TUGboat, The communications of the TeX Users Group, 14(3):231-237, 1993.
	WW96	Xinxin Wang , Derick Wood, Tabular Formatting Problems, Proceedings of the Third International Workshop on Principles of Document Processing, p.171-181, September 23, 1996

CITED BY 7

	Christof Lutteroth , Gerald Weber, User interface layout with ordinal and linear constraints, Proceedings of the 7th Australasian User interface conference, p.53-60, January 16-19, 2006, Hobart, Australia
	Nathan Hurst , Kim Marriott , David Albrecht, Solving the simple continuous table layout problem, Proceedings of the 2006 ACM symposium on Document engineering, October 10-13, 2006, Amsterdam, The Netherlands
	Christof Lutteroth , Robert Strandh , Gerald Weber, Domain Specific High-Level Constraints for User Interface Layout, Constraints, v.13 n.3, p.307-342, September 2008
	Nathan Hurst , Kim Marriott , Peter Moulder, Toward tighter tables, Proceedings of the 2005 ACM symposium on Document engineering, November 02-04, 2005, Bristol, United Kingdom
	Nathan Hurst , Kim Marriott , Peter Moulder, Minimum sized text containment shapes, Proceedings of the 2006 ACM symposium on Document engineering, October 10-13, 2006, Amsterdam, The Netherlands
	Mattias Andersson , Joachim Gudmundsson , Christos Levcopoulos, Chips on wafers, or packing rectangles into grids, Computational Geometry: Theory and Applications, v.30 n.2, p.95-111, February 2005
	Charles Jacobs , Wilmot Li , Evan Schrier , David Bargeron , David Salesin, Adaptive grid-based document layout, ACM Transactions on Graphics (TOG), v.22 n.3, July 2003