Link to COG weekly seminars here (Google Sheets).
Title: Capacity upper bounds for deletion-type channels Speaker: Dr Mahdi Cheraghchi Affiliation: Dept of Computing, Imperial College London Location: 218 Huxley Building Time: 16:00 - 17:00 Abstract. We develop a systematic... Read more »
Title: Model-based design of optimal experiments using exact confidence regions Speaker: Dr Radoslav Paulen Affiliation: Institute of Information Engineering, Automation and Mathematics, Slovak University of Technology Location: 218 Huxley Building Time:... Read more »
Title: Generalized maximum entropy estimation Speaker: Dr David Sutter Affiliation: Institute for Theoretical Physics, ETH Zurich Location: 217 Huxley Building Time: 14:00 - 15:00 Abstract. We consider the problem of estimating... Read more »
Title: Data-Driven Methods for Integrated Production Scheduling and Process Control Speaker: Calvin Tsay Affiliation: McKetta Dept of Chemical Engineering, University of Texas at Austin Location: 218 Huxley Building Time: 11:00 - 12:00... Read more »
Title: Exact and heuristic MIP methods for the solution of MINLP - Examples from gas transport optimization problems Speaker: Dr Lars Schewe Affiliation: Dept of Mathematics, FAU Erlangen-Nürnberg Location: 217 Huxley Building... Read more »
Title: Robust Discrete Optimization: Globalized Gamma Robustness and Radius of Robust Feasibility Speaker: Prof. Dr Frauke Liers Affiliation: Dept of Mathematics, FAU Erlangen-Nürnberg Location: 217 Huxley Building Time: 15:00 - 16:00 Abstract. In this... Read more »
Title: Extremal Cuts and Isoperimetry in Random Cubic Graphs Speaker: Prof. Gregory B. Sorkin Affiliation: Dept of Mathematics, The London School of Economics and Political Science (LSE) Location: LT139 Huxley... Read more »
Title: Chordal Completions - Semidefinite Programming and Minimum Completions Speaker: Dr Arvind Raghunathan Affiliation: Mitsubishi Electric Research Laboratories (MERL) Location: 217 Huxley Building Time: 14:00 - 15:00 Abstract. A graph... Read more »
Title: Largest Small n-Polygons: Numerical Results and Conjectured Optima Speaker: János D. Pintér Affiliation: Department of Industrial and Systems Engineering, Lehigh University Location: 218 Huxley Building Time: 14:00 - 15:00 Abstract. LSP(n), the... Read more »
The minimum bisection width of random cubic graphs is of interest because it is one of the simplest questions imaginable in extremal combinatorics, and also because the minimum bisection of... Read more »
