Siam activity group on Discrete Mathematics dm-net
Yüklə 91 Kb.
|
================================================================= SIAM Activity group on Discrete Mathematics DM-Net ----------------------------------------------------------------- April 02, 2010 (Number 2010.02) ----------------------------------------------------------------- Email contributions to: <dm-net@siam.org> Address changes to: <dm-mgr@siam.org> Archive URL: <http://orion.math.iastate.edu/rymartin/dm-net/dm-net.html> ================================================================= =================================================================
================================================================= 1. *** Editor's Note *** ------
The URL for the newsletter archive is http://orion.math.iastate.edu/rymartin/dm-net/dm-net.html A reminder of a previously-advertised conference:
-- Ryan Martin ================================================================= 2. *** SIAM Conference on Discrete Mathematics (DM10) -- June 14-17, 2010 -- Hyatt Regency, Austin TX *** ------
PLENARY SPEAKERS Imre Bárány, Hungarian Academy of Sciences, Hungary Jim Geelen, University of Waterloo, Canada Penny Haxell, University of Waterloo, Canada Anna Karlin, University of Washington Richard Stanley, Massachusetts Institute of Technology Madhu Sudan, Microsoft Research Terence Tao, University of California, Los Angeles Robin Thomas, Georgia Institute of Technology INVITED MINISYMPOSIA Algorithmic game theory, Jason Hartline and Nicole Immorlica Coding theory, Alex Samorodnitsky Combinatorial constructions for theoretical computer science, David Zuckerman Computational biology, Nancy Amato Design theory, Petteri Kaski and Patric Ostergard Discrete geometry, Karoly Bezdek and Igor Pak Enumerative combinatorics, Bruce Sagan Extremal graph theory, Jacques Verstraete Flows in graphs and matroids, Luis Goddyn Graph colouring, Daniel Kral Hopf algebras, Frank Sottile Matroid theory, James Oxley Paths and cycles in graphs, Xingxing Yu Probabilistic combinatorics, Michael Krivelevich Structural graph theory, Maria Chudnovsky Submodular functions, Satoru Iwata Topological graph theory, Bojan Mohar ORGANIZING COMMITTEE Michael Molloy (chair), University of Toronto, Canada Peter Cameron, University of London, UK Anne Condon, University of British Columbia, Canada Bertrand Guenin, University of Waterloo, Canada Ken-ichi Kawarabayashi, National Institute of Informatics, Japan Mohit Singh, Microsoft Research Frank Sottile, Texas A&M University Éva Tardos, Cornell University Stéphan Thomassé, University of Montpellier, France Van H. Vu, Rutgers University Peter Winkler, Dartmouth College ================================================================= 3. *** Network Informatics, Discrete Math, and Computer Science R&D Job Announcement – Sandia National Laboratories *** ------
Sandia National Laboratories seeks new researchers for long-term positions in the area of mathematics and computer science for understanding complex networks. Large-scale graphs might arise from the analysis of complex social and engineered networks, such as might be derived from human interactions or internet traffic. Data may be large-scale and complex and may require massively parallel computing platforms. Of particular interest are experts in computational topology, graph-feature identification (e.g. isomorphism), community detection, statistics, machine learning, and text analysis. A research challenge is to account for uncertainty in large-scale graphs. The successful applicants will be expected to conduct world-class research resulting in peer-reviewed publications and to collaborate with others to advance the broad program described in “Department description.” This includes taking an interest in informatics-based applications, interacting with consumers of information, and developing application-specific software solutions. Submissions: Apply online at http://www.sandia.gov/careers. Click on Job Search and then the Search for Openings button. Type in Job ID 64380 in the keywords box to find this posting. Register and apply online. Please include a letter of interest and CV. For questions or information, please contact Brett Bader (bwbader@sandia.gov). Submissions before April 3, 2010 will receive full consideration. Sandia National Laboratories is an Equal Opportunity Employer M/F/D/V. A pdf of the job announcement is at the following link: http://www.cs.sandia.gov/hpc-informatics/careers/index.htm ================================================================= 4. *** 10th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms – May 23-25, 2010 – Haifa, Israel *** ------
Graphs, Combinatorics and Algorithms In Memory of Uri Natan Peled 23-25 May 2010 Caesarea Rothschild Institute, University of Haifa, Israel
Invited Speakers Bill Cunningham (Univ. of Waterloo, Canada) Michael Elkin (Ben-Gurion Univ., Israel) Fedor Fomin (Univ. of Bergen, Norway) Seffi Naor (Technion, Israel) Zeev Nutov (Open University, Israel) Ronitt Rubinfeld (Tel-Aviv Univ., Israel) Bruno Simeone (Univ. of Rome, Italy) Gyorgy Turan (Univ. of Illinois/Chicago, USA) Alek Vainshtein (Univ. of Haifa, Israel) Call for Contributed Papers Please send abstracts (1-2 pages) by e-mail by April 14, 2010 to GraphWorkshop2010@gmail.com. Papers that have been accepted to recent international conferences are particularly welcome, and should be so indicated in the submission. A special Memorial Session for Uri N. Peled will be held on May 23. Submissions related to Uri's work on threshold graphs, Boolean functions and many other topics in graph theory and combinatorics would be especially welcome.
* Randomized Algorithms * Networking * Internet Congestion and Patterns * Computational Biology * Applied Combinatorics * Web Applications * Geometric Graphs and Computation * Optimization * Graph Theoretic Models Workshop Committee Martin Charles Golumbic (chair) Avivit Levy (program co-chair) Udi Rotics (program co-chair) Yonatan Aumann, Shlomi Dolev, Guy Even, Ron Holzman, Gil Kalai, Haim Kaplan, Ephraim Korach, Nissan Lev-Tov, Nati Linial, Oren Weimann, Raphy Yuster, Shmuel Zaks The workshop is partially supported by the Waterloo-Haifa academic exchange program through a grant from the Gerald Schwartz and Heather Reisman Foundation. Uri Peled received his doctorate from the University of Waterloo. Caesarea Rothschild Institute for Interdisciplinary Applications of Computer Science, University of Haifa, Mount Carmel, Haifa 31905, Phone: 972-4-8249837, Fax: 972-4-8288181 www.cri.haifa.ac.il
================================================================= DM-Net is a forum of the
discrete mathematics community. This includes personal news about our members, conferences, mathematical problems, education issues, job/fellowship information, research announcements, etc. The moderator is Ryan Martin ----------------------------------------------------------------- Send submissions to: <dm-net@siam.org> Send address changes to: <dm-mgr@siam.org> Info on joining SIAM and this activity group: <service@siam.org> Archive URL: <http://orion.math.iastate.edu/rymartin/dm-net/dm-net.html> ----------------------------------------------------------------- Jerrold Griggs University of South Carolina Chair Karen Collins Wesleyan University Vice Chair John Schmitt Middlebury College Secretary Kathie Cameron Wilfrid Laurier University Program Director Ryan Martin Iowa State University DM-Net Editor ================================================================= Yüklə 91 Kb. Dostları ilə paylaş:
|