@conference {17098,
	title = {Dynamic layout management in a multimedia bulletin board},
	booktitle = {IEEE 2002 Symposia on Human Centric Computing Languages and Environments, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {51 - 53},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper proposes a novel user interface to manage the dynamic layout of multimedia objects in the Multimedia Bulletin Board (MBB) system. The MBB has been designed and implemented as a prototype of an asynchronous communication system that enables rich communication and collaboration among users of multimedia objects such as text, image, moving picture, sound, voice, Web, office document, and other files. The layout properties of the multimedia objects on a board (e.g. x-y position, size, z-order, explicit and implicit links, etc.) show important and useful information on the user dynamics occurring within a board. However, a fixed layout created and edited by multiple users may prevent users from recognizing and identifying other information. This paper resolves this problem with a novel user-controlled layout strategy made visible with dynamic layout templates (DLT). Users can reorganize the objects to extract meaningful information related to time, source, geographic location, or topic.},
	keywords = {Asynchronous communication, asynchronous communication system, Collaboration, data mining, dynamic layout management, dynamic layout templates, groupware, Human computer interaction, image, Information services, Laboratories, moving picture, Multimedia Bulletin Board system, multimedia computing, Multimedia databases, multimedia objects, multimedia systems, office document, Prototypes, sound, text, user interface, User interfaces, user-controlled layout strategy, voice, Web, Web pages},
	isbn = {0-7695-1644-0},
	doi = {10.1109/HCC.2002.1046344},
	author = {Kang,Hyunmo and Shneiderman, Ben and Wolff,G. J}
}
@conference {14576,
	title = {A distributed algorithm for ear decomposition},
	booktitle = {, Fifth International Conference on Computing and Information, 1993. Proceedings ICCI {\textquoteright}93},
	year = {1993},
	month = {1993/05/27/29},
	pages = {180 - 184},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A distributed algorithm for finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented. At the completion of the algorithm either the ears are correctly labeled or the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messages. We also present two other algorithms, one which is time-optimal and the other which is message-optimal to determine the actual ears and their corresponding numbers after determining the existence of an ear decomposition},
	keywords = {Asynchronous communication, asynchronous communication network, Automata, Communication networks, computational complexity, Computer networks, Computer science, decomposition graph, distributed algorithm, distributed algorithms, Distributed computing, Ear, ear decomposition, graph theory, message-optimal, network decomposition, sorting, Testing, time-optimal},
	isbn = {0-8186-4212-2},
	doi = {10.1109/ICCI.1993.315382},
	author = {Hannenhalli, Sridhar and Perumalla,K. and Chandrasekharan,N. and Sridhar,R.}
}
