Description We present a parameterized algorithm that, given a graph G on n vertices and an integer parameter k, decides whether G has an independent set of size at most k in time O(2^{2.1152k+0.1028n...
SpeakerCaroline Klivanshttp://people.cs.uchicago.edu/~klivans/ Description Degree sequences of graphs have been thoroughly studied. For example, there are many characterizations for those integer...
Description Finding a bipartite subgraph with maximum number of edges in a given graph is a classical problem in combinatorial optimization and extremal graph theory. It has been studied in computer...
Description This talk concentrates on the model-robust design problem for multiresponse model with possible bias. We assume that the fitted model for each response is first-degree or second-degree...
Event Topic Discrete Applied Math Seminar
Description Abstract: The most famous and useful characterization of k-connected graphs is Menger's Theorem, but there is another, very nice but little-known characterization of a wholly different...
Speaker Mihai AnitescuArgonne National Laboratory, Division of Mathematical and Computer Scienceshttp://www.mcs.anl.gov/~anitescu/ Description Complementarity constraints are a very versatile modeling...
SpeakerStephen Damelin IMA University of Minnesotahttp://www.ima.umn.edu/~damelin/ Description Many practical problems in elasticity, vibration, etc., when modeled mathematically, reduce to the matrix...
SpeakerMichael G RoecknerPurdue Universityhttp://www.stat.purdue.edu/people/faculty/roeckner Description We shall first review the connection between ordinary stochastic differential equations (SODE)...
