Douglas B. West(魏达思)

作者:来源:发布时间:2017-04-14

个人简介

魏达思,男,1953年11月出生,美国人,现为浙江 师范大学数理与信息工程学院特聘教授、博士生导师。


学习经历

1971.9-1974.6  普林斯顿大学数学系获学士学位,数学专业 ;

1974.9-1978.6  麻省理工大学数学系获博士学位,数学专业。


工作简历

1978.9-1979.8  斯坦福大学计算机科学系访问研究助理;

1979.9-1982.8  普林斯顿大学数学系助理教授;

1982.9-2011.8  伊利诺伊大学数学系;

2011.9-至今  伊利诺伊大学数学系名誉教授;

2012.8-至今 浙江师范大学

助理教授(1979.9)/副教授(1985.9)/教授(1991.9) 已经指导毕业32名博士。


学术兼职

担任《美国数学月刊》副主编(1986-至今)

担任《Order》副主编(2005-至今)

担任专业期刊《离散数学》主编(2007-至今)

会议程序主席:IAM Meeting on Discrete Mathematics, 2005-2006

会议副主席: SIAM Activity Group on Discrete Mathematics,1997-1999.

美国数学评论评论员 自1991年起.


人才梯队、荣誉

国家外籍千人计划入选者(2012.8)。


研究领域及成果

魏达思教授从事数学研究工作已有三十多年,是国际著名图论与离散数学专家。在极值图论、图的结构分析和表示理论、半序集理论、Ramsey理论等方面做出了杰出的贡献,取得了一系列重大的研究成果。他共发表两百多篇论文,其中2008-2013年间发表六十多篇。他于2012年入选外籍千人计划,从美国的伊利诺伊大学来到浙江师范大学工作。他在许多著名国际会议作报告,担任著名国际会议(the 2006 SIAM Meeting on Discrete Mathematics)的程序主席,获得20多项研究项目资助,指导毕业32名博士,现为国际期刊 Discrete Mathematics 的主编,该期刊每年发表三千多页的研究论文。魏达思教授编著的《Introduction to Graph Theory》教科书是现代最流行的几本图论教科书之一,被世界各地大学采用。据MathSciNet统计,该教科书被引用900余次,其他研究论文被引用600余次。

魏达思教授研究领域包括图的染色及相关问题(发表23 篇论文), Ramsey 理论 (发表7 篇论文), 图的分解 (发表8 篇论文), 匹配与装填 (发表14 篇论文), intersection representations (发表34 篇论文), 距离与控制 (发表10 篇论文), pagenumber and bandwidth (发表8 篇论文), games on graphs (发表6 篇论文), 点度 (发表10 篇论文), 路和圈 (发表9 篇论文), chains and antichains in posets (发表16 篇论文), linear extensions and dimension of posets (发表9 篇论文), permutations and sorting (发表7 篇论文), applications in computer science (发表9 篇论文), 等等。 他的大部分文章都是与同行的合作研究,他的合作者有180多人.

代表性论文、论著
  1. Decomposition of sparse graphs into forests and a graph with bounded degree(with S.-. Kim, A.V. Kostochka, H. Wu, and X. Zhu). J. Graph Theory (published) DOI: 10.1002/jgt.21712.
  2. Visibility number of directed graphs (with M. Axenovich, A. Beveridge,and J.P. Hutchinson). SIAM J. Discrete Math. 27 (2013), 1429–1449.
  3. Cycle spectra of Hamiltonian graphs (with K.G. Milans, F. Pfender, D.
    Rautenbach, and F. Regen). J. Combin. Theory (B) 102 (2012), 869–874.
  4. Degree Ramsey numbers of graphs (with W.B. Kinnersley and K.G. Milans).
    Combinatorics, Probability, and Computing 21 (2012), 229–253.
  5. Packing of Steiner trees and S-connectors in graphs (with H. Wu). J. Combinatorial Theory (B) 102 (2012), 186–205.
  6. Revolutionaries and Spies: Spy-good and spy-bad graphs (with J.V. Butterfield,D.W. Cranston, G. Puleo, and R. Zamani) Theoretical Computer Science 463 (2012), 35–53.
  7. Longest cycles in k-connected graphs with given independence number(with S. O and H. Wu) J. Combin. Theory (B) 101 (2011), 480–485.
  8. A short proof of the Berge-Tutte Formula and Gallai-Edmonds Structure Theorem. European J. Combinatorics 32 (2011), 674-676.
  9. Introduction to Graph Theory. Prentice Hall (1996), 512 pages,  ISBN0-13-227828-6. Second edition Prentice Hall (2001), 558 pages, ISBN0-13-014400-2.
  10.  Mathematical Thinking: Problem-Solving and Proofs (w. John D’Angelo). Prentice Hall (1997), xviii+365 pages, ISBN 0-13-263393-0. Second edition Prentice Hall (2000), xx+412 pages, ISBN 0-13-014412-6.
代表性科研项目

获得美国国家科学基金、美国国防部海军部、美国国家安全局、伊利诺斯大学等机构的研究基金项目十多项。


成果获奖

西湖友谊奖,浙江省(2013.10)

Provost's Campus Award for Excellence in Undergraduate Teaching (2002.5)


学术报告

1. 2013.9.10-14: Graph Theory Conference, Tokyo University of Science,  Kagurazaka, Tokyo, Japan

2. 2013.3.04-08: 44th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, Florida (two one-hour lectures as one of five main invited speakers)

3. 2013.2.18-21: 18th (Canadian) Coast Combinatorics Conference, Kailua-Kona, Hawaii, US

4. 2012.10.08-12: 5th Workshop on GrAph Searching, Theory and Applications (GRASTA 2012), Banff Intl. Research Station, Banff, Alberta, Canada

5. 2012.9.17-21: 4th Polish Combinatorial Conference, Bedlewo, Poland

6. 2012.9.09-15: 21st Workshop on Cycles and Colourings in Graphs, plus 15th Workshop on Hereditary Graph Properties, Novy Smokovec, Slovakia (two invited lectures)

7. 2012.6.18-21: 16th SIAM Conference on Discrete Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada (two invited lectures)

8. 2011.11.05-06: Atlanta Lecture Series in Combinatorics and Graph Theory IV, Georgia State University, Atlanta, GA (plenary one-hour lecture)

9. 2010.9.05-10: 19th Workshop on Cycles and Colourings in Graphs, Tatranska Strba, Slovakia (invited lecture)

10. 2010.8.12-15: International Conference on Recent Trends in Graph theory and Combinatorics, Cochin, India, plus prior workshop in Tiruchirappalli (two plenary one-hour lectures)

11. 2010.6.14-17: 15th SIAM Conference on Discrete Mathematics, Austin, Texas

12. 2010.5.20-22: 23rd Cumberland Conference on Combinatorics, Graph Theory, and Computing, Univ. of Mississippi, Oxford, Mississippi, US (one-hour plenary lecture)


近三年教学情况

为本科生和研究生主讲课程有《极值图论》、《图的结构》、《图的染色及权转移方法》等课程,已培养博士研究生32名。


Profile

Douglas Brent West,Male,born in 1953.11, American.

Professor of College of Mathematics, Physics and Information Engineering at Zhejiang Normal University.


Education Background

1971.9-1974.6  A.B., Mathematics, Princeton University;

1974.9-1978.6  Ph.D., Mathematics, Massachusetts Institute of Technology.


Work Experiences

1978.9—1979.8  Department of Computer Science, Stanford University, 
Visiting Research Associate;

1979.9—1982.8  Department of Mathematics, Princeton University, 
Assistant Professor;

1982.9—1985.8  Department of Mathematics, University of Illinois—Urbana,
Assistant Professor;

1985.9—1991.8 Department of Mathematics, University of Illinois--Urbana,
Associate Professor;

1989.9—1990.8  computer Science Div., University of California--Berkeley,
Associate Professor;
1991.9—2011.8  Department of Mathematics, University of Illinois--Urbana,
Professor;

2011.9—now    Department of Mathematics, University of Illinois--Urbana,
Emeritus Professor;

2012.8—now    Department of Mathematics, Zhejiang Normal University,
Professor.


Other Academic Positions/Memberships

Editor-in Chief:  Discrete Mathematics, since 2007

Associate Editor: American Mathematical Monthly,since 1986 

Associate Editor: Order, since 2005

Program Chair:SIAM Meeting on Discrete Mathematics, 2005-2006

Vice Chair:SIAM Activity Group on Discrete Mathematics 1997-1999.

Reviewer: Mathematical Reviews, since 1991.


Honorable Titles and Awards:

Foreign One Thousand Experts of China (2012.8)

Associate, Center for Advanced Studies, University of Illinois (2007)

Beckman Assoc., Center for Advanced Studies, University of Illinois (1994)

Beckman Fellow, Center for Advanced Studies, University of Illinois (1985)

National Science Foundation Graduate Fellow (1974-1977)

List of teachers rated excellent by their students (more than 40 times)


Research Field and Achievements

Prof. West has produced a steady stream of mathematical research for more than 30 years. He has written more than 200 papers, of which 60 appeared during 2008-2013. He was recruited by the Chinese government under the 1000 Talents Plan and moved from the University of Illinois to Zhejiang Normal University in 2012. He has lectured at many international conferences, received 20 individual or joint research grants, advised 32 PhD students, served as the Program Chair for a large international meeting (the 2006 SIAM Meeting on Discrete Mathematics), and is the Editor-in-Chief of the international journal Discrete Mathematics (publishing about 3000 pages of research articles per year).

Prof. West's most well-known publication is his textbook on graph theory, which has received more than 900 citations and is used in courses around the world (his other papers have been cited more than 600 times in Math Reviews,now called MathSciNet). His research mostly concerns extremal and structural problems in graph theory and partially ordered sets. Extremal problems ask for the maximum or minimum value of some parameter over a class of structures.Structural problems often ask whether a structure with particular constraints exist. Applications of these problems arise when binary relations in nature, society, or computation are modeled using graphs or partial orders.

Topics Prof. West has studied extensively include graph coloring and its extensions (23 papers), Ramsey theory (7 papers), graph decomposition (8 papers), matching and packing (14 papers), intersection representations (34 papers), distance and domination (10 papers), pagenumber and bandwidth (8 papers), games on graphs (6 papers), vertex degrees (10 papers), paths and cycles (9 papers), chains and antichains in posets (16 papers), linear extensions and dimension of posets (9 papers), permutations and sorting (7 papers), applications in computer science (9 papers), etc. Most of West's results are with coauthors in collaborative research; he has more than 180 coauthors.

Among West's prominent early results are (1) an explicit symmetric chain decomposition of the poset known as L(4,n) and (2) a solution with Charles Goldberg of the necklace problem. The latter theorem states that k cuts always suffice for two thieves to fairly divide a necklace with beads of k colors; it has applications in VLSI circuit design.

An intersection representation of a graph assigns each vertex a set so that two vertices are adjacent if and only if their sets intersect. Graph parameters arise to measure the complexity of sets used in a representation. For example, the interval number of a graph is the minimum t such that the graph has a intersection representation using sets that are unions of t intervals along a line. West has solved many extremal problems about the complexity of intersection representations over various classes of graphs or partial orders.

Topics of West's recent research include list coloring (graph labeling when not all resources are available at all vertices), Ramsey theory (forced monochromatic configurations when pieces of a structure are colored with two colors), domination (covering the vertices with a small number of vertex neighborhoods), pebbling and acquisition (models of the movement of resources in a network), packing and covering using forests (extensions of Nash-Williams' classical results), cycles in graphs (solving the Fouquet-Jolivet conjecture on longest cycles in k-connected graphs with fixed independence number), and competitive acquisition (versions of graph parameters in which an opponent works against an optimizer).

Representative Works

1.Decomposition of sparse graphs into forests and a graph with bounded degree(with S.-J. Kim, A.V. Kostochka, H. Wu, and X. Zhu). J. Graph Theory (published) DOI: 10.1002/jgt.21712.

2.Visibility number of directed graphs (with M. Axenovich, A. Beveridge,and J.P. Hutchinson). SIAM J. Discrete Math. 27 (2013), 1429–1449.

3.Cycle spectra of Hamiltonian graphs (with K.G. Milans, F. Pfender, D. Rautenbach, and F. Regen). J. Combin. Theory (B) 102 (2012), 869–874.

4.Degree Ramsey numbers of graphs (with W.B. Kinnersley and K.G. Milans). Combinatorics, Probability, and Computing 21 (2012), 229–253.

5.Packing of Steiner trees and S-connectors in graphs (with H. Wu). J. Combinatorial Theory (B) 102 (2012), 186–205.

6.Revolutionaries and Spies: Spy-good and spy-bad graphs (with J.V. Butterfield,D.W. Cranston, G. Puleo, and R. Zamani) Theoretical Computer Science 463 (2012), 35–53.

7.Longest cycles in k-connected graphs with given independence number (with S. O and H. Wu) J. Combin. Theory (B) 101 (2011), 480–485.

8.A short proof of the Berge-Tutte Formula and Gallai-Edmonds Structure Theorem. European J. Combinatorics 32 (2011), 674-676.

9.Introduction to Graph Theory. Prentice Hall (1996), 512 pages,  ISBN0-13-227828-6. Second edition Prentice Hall (2001), 558 pages, ISBN0-13-014400-2.

10.Mathematical Thinking: Problem-Solving and Proofs (w. John D’Angelo). Prentice Hall (1997), xviii+365 pages, ISBN 0-13-263393-0. \Second edition Prentice Hall (2000), xx+412 pages, ISBN 0-13-014412-6.

Research Projects

Research grants from National Security Agency (4), National Research Council, Office of Naval Research (2), National Science Foundation, U. Illinois Research Board (9).


Awards

West Lake Friendship Award, Zhejiang Province (2013.10)

Provost's Campus Award for Excellence in Undergraduate Teaching (2002.5)


Reports

1.2013.9.10-14:Graph Theory Conference, Tokyo University of Science, Kagurazaka, Tokyo, Japan

2. 2013.3.04-08: 44th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, Florida (two one-hour lectures as one of five main invited speakers)

3. 2013.2.18-21: 18th (Canadian) Coast Combinatorics Conference, Kailua-Kona, Hawaii, US

4. 2012.10.08-12: 5th Workshop on GrAph Searching, Theory and Applications (GRASTA 2012), Banff Intl. Research Station, Banff, Alberta, Canada

5. 2012.9.17-21: 4th Polish Combinatorial Conference, Bedlewo, Poland

6. 2012.9.09-15: 21st Workshop on Cycles and Colourings in Graphs, plus 15thWorkshop on Hereditary Graph Properties, Novy Smokovec, Slovakia (two invited lectures)

7. 2012.6.18-21: 16th SIAM Conference on Discrete Mathematics,Dalhousie University, Halifax, Nova Scotia, Canada (two invited lectures)

8. 2011.11.05-06: Atlanta Lecture Series in Combinatorics and Graph Theory IV, Georgia State University, Atlanta, GA (plenary one-hour lecture)

9. 2010.9.05-10: 19th Workshop on Cycles and Colourings in Graphs, Tatranska Strba, Slovakia (invited lecture)

10. 2010.8.12-15: International Conference on Recent Trends in Graph theory and Combinatorics, Cochin, India, plus prior workshop in Tiruchirappalli (two plenary one-hour lectures)

11. 2010.6.14-17: 15th SIAM Conference on Discrete Mathematics, Austin, Texas

12. 2010.5.20-22: 23rd Cumberland Conference on Combinatorics, Graph Theory, and Computing, Univ. of Mississippi, Oxford, Mississippi, US (one-hour plenary lecture)


Teaching and Supervision during Last 3 Years

Spring 2011, Extremal Graph Theory, University of Illinois

Spring 2012, Structure of Graphs, University of Illinois

Fall 2013, Discharging Method and Graph Coloring, Zhejiang Normal Univ.