Address
Department of Mathematics
Paderborn University
Warburger Str. 100
D-33098 Paderborn
Germany
eisen[at]math.paderborn.de
http://www2.math.uni-paderborn.de/ags/eisenbrand/people/friedrich-eisenbrand.html
Parameterized integer programming, part I (Tuesday 11.00 - 11.45)
Parameterized integer programming, part II (Wednesday 11.15 - 12.00)
Clich here for pdf file of the abstract of both lectures.
Click here for pdf file of both presentations.
Short Bio
Friedrich Eisenbrand received the Dr.-Ing. degree from the Saarland University in 2000, while being a researcher at the Max Planck Institute for Computer Science in Saarbrücken. He then worked as a postdoctoral researcher at the Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" in Rome and at the Technical University in Berlin and returned in 2002 to the Max Planck Institute for Computer Science as the head of the independent research group for Discrete Optimization.
In 2005 he became associate professor for theoretical computer science in Dortmund and since 2006 he is full professor of Mathematics at the University of Paderborn Germany. Friedrich Eisenbrand received the Otto-Hahn medal of the Max Planck society in 2001 and the Maier-Leibnitz award of the German research foundation in 2004.
| Back to home page | Program |
DAVID GAMARNIK
Address
MIT Sloan School of Management, E53-353
77 Massachusetts Avenue Cambridge
MA 02139
USA
gamarnik[at]mit.edu
http://www.mit.edu/~gamarnik/home.html
Lectures
Decidability issues in the theory of queueing networks (Tuesday 16.00 - 16.45)
Clich here for pdf file of the abstract.
Click here for pdf file of the presentation.
Large scale queueing systems in the Quality/Efficiency driven regime and applications (Wednesday 17.00 - 17.45)
Clich here for pdf file of the abstract.
Click here for pdf file of the presentation.
Short Bio
David Gamarnik is an associate professor of operations research in the Sloan School of Management of Massachusetts Institute of Technology. He received B.A. in mathematics from New York University in 1993 and Ph.D. in Operations Research from MIT in 1998. Since then he worked as a research staff member at the Department of Mathematical Sciences, IBM Research, before joining Operations Research Group in the Sloan School of Management in 2005.
His research interests include applied probability and stochastic processes with application to queueing theory, theory of random combinatorial structures and algorithms, combinatorial optimization and statistical learning theory. He is a recipient of Erlang Prize from INFORMS Applied Probability Society in 2004 and currently serves as a council member of Applied Probability Society of INFORMS. He as an associate editor of Annals of Applied Probability and Operations Research journals.
| Back to home page | Program |
ANUPAM GUPTA
Address
Department of Computer Science
Carnegie Mellon University
4109 Wean Hall
Pittsburgh PA 1521
USA
anupamg[at]cs.cmu.edu
http://www.cs.cmu.edu/~anupamg/
Lectures
Stochastic Combinatorial Optimization I: Two Stage Optimization with Recourse (Tuesday 17.00 - 17.45)
Clich here for pdf file of the abstract.
Clich here for pdf file of the presentation.
Stochastic Combinatorial Optimization II: Extensions and Online Problems (Wednesday 12.15 - 13.00)
Clich here for pdf file of the abstract.
Clich here for pdf file of the presentation.
Short Bio
Anupam Gupta received the B.Tech degree in Computer Science from Indian Institute of Technology, Kanpur in 1996, and the PhD degree in Computer Science from the University of California, Berkeley, in 2000. He was a postdoc at Cornell University, Lucent Bell Labs, Murray Hill, and subsequently joined Carnegie Mellon University in 2003, where he is currently an Assistant Professor in the Computer Science Department.
His research interests are in the area of theoretical Computer Science, primarily in developing approximation algorithms for NP-hard optimization problems, and understanding the algorithmic properties of metric spaces. He is the recepient of an Alfred P. Sloan Research Fellowship, and the NSF Career award.
| Back to home page | Program |
JONG-SHI PANG
Address
University of Illinois at Urbana-Champaign
117 Transportation Building MC-238
104 S. Mathews Ave.
Urbana IL 61801
USA
jspang[at]uiuc.edu
http://www.iese.uiuc.edu/research/faculty/pang.html
Lectures
The Variational/Complementarity Approach to Nash Equilibria, part I (Wednesday 09.00 - 09.45)
The Variational/Complementarity Approach to Nash Equilibria, part II (Wednesday 16.00 - 16.45)
Clich here for pdf file of the abstract of both lectures.
Click here for pdf file of both presentations.
Short Bio
Jong-Shi Pang obtained his Ph.D. degree in Operations Research from
Stanford University in 1976. He is presently the Caterpillar Professor
and Head of the Department of Industrial and Enterprise Systems
Engineering at the University of Illinois at Urbana-Champaign. Prior to
this position, he held the Margaret A. Darrin Distinguished Professor
in Applied Mathematics at Rensselaer Polytechnic Institute and taught
at the Johns Hopkins University, the University of Texas at Dallas, and
Carnegie-Mellon University.
Professor Pang was a winner of the 2003 George B. Dantzig Prize awarded
jointly by the Mathematical Programming Society and the Society for
Industrial and Applied Mathematics for his work on finite-dimensional
variational inequalities, and a co-winner of the 1994 Frederick W.
Lanchester Prize awarded by the Institute for Operations Research and
Management Science. Two of his publications have received best paper
awards. He is an ISI Highly Cited Researcher in the Mathematics
Category between 1980 - 1999; he has published 3 widely cited
monographs and more than 100 scholarly journals in top peer reviewed
journals.
| Back to home page | Program |
BALAJI PRABHAKAR
Address
Department of Electrical Engineering and Computer Science
Packard Building, Room 269
Stanford University
Stanford, CA 94305 - 9510
USA
balaji[at]stanford.edu
http://www.stanford.edu/~balaji/
Lectures
Randomized Network Algorithms: An Overview and Recent Results (Tuesday 12.00 - 12.45)
Clich here for pdf file of the abstract.
Click here for pdf file of the presentation.
Turbo-Counting: A New Architecture for Network Traffic Measurement (Wednesday 10.00 - 10.45)
Clich here for pdf file of the abstract.
Click here for pdf file of the presentation.
Short Bio
Balaji Prabhakar is an Associate Professor of Electrical Engineering and Computer Science at Stanford University. Balaji is interested in network algorithms, in scaleable methods for network performance monitoring and simulation, in wireless (imaging) sensor networks, stochastic network theory and information theory. He has designed algorithms for switching, routing, bandwidth partitioning, load balancing, and web caching. Balaji has been a Terman Fellow at Stanford University and a Fellow of the Alfred P. Sloan Foundation.
He has received the CAREER award from the National Science Foundation, the Erlang Prize from the INFORMS Applied Probability Society, and the Rollo Davidson Prize awarded to young scientists for their contributions to probability and its applications.
| Back to home page | Program |