Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
AbstractEvolutionary Algorithms (EAs) have been used to achieve optimal feedforward control in a number of fedbatch fermentation processes. Typically, the optimization purpose is t...
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
In this paper, we propose a new linear programming based timing driven placement framework for high performance designs. Our LP framework is mainly net-based, but it takes advanta...