Many intelligent user interfaces employ application and user models to determine the user's preferences, goals and likely future actions. Such models require application anal...
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...