Joint Mathematics Meetings Program by AMS Special Session

Current as of Saturday, January 23, 2010 00:39:21

Joint Mathematics Meetings
San Francisco, CA, January 13-16, 2010 (Wednesday - Saturday)
Meeting #1056

• Wednesday January 13, 2010, 8:00 a.m.-10:50 a.m.
  AMS Special Session on Applications of Graph Theory, I
  Room 3007, 3rd Floor, Moscone
  Organizers:
  Richard Low, San Jose State University low@math.sjsu.edu
  Ralucca M. Gera, Naval Postgraduate School
  

  • 8:00 a.m.
    The Link Graph: a Tool for Word Sense Disambiguation.
    Ralucca M. Gera*, Naval Postgraduate School
    Henry Escuadro, Juniata College
    Pranav Anand, Linguistics Department, University of California Santa Cruz
    Craig Martell, Computer Science Department, Naval Postgraduate School
    (1056-05-226)
  • 8:30 a.m.
    A Generalization of Kundu's k-Factor Theorem.
    Arthur H. Busch, University of Dayton
    Michael J. Ferrara, University of Colorado Denver
    Stephen G. Hartke*, University of Nebraska-Lincoln
    Michael S. Jacobson, University of Colorado Denver
    Hemanshu Kaul, Illinois Institute of Technology
    Douglas B. West, University of Illinois
    (1056-05-344)
  • 9:00 a.m.
    Graph invariants from self-assembling nanostructures.
    Joanna Anthony Ellis-Monaghan*, Saint Michael's College
    Greta Pangborn, Saint Michael's College
    (1056-05-287)
  • 9:30 a.m.
    On $k$-circuit distance in graphs.
    Ralucca Gera, Naval Postgraduate School
    Grady Bullington, University of Wisconsin Oshkosh
    Linda Eroh*, University of Wisconsin Oshkosh
    Steven J Winters, University of Wisconsin Oshkosh
    (1056-05-1731)
  • 10:00 a.m.
    Coding Sequences and Their Applications.
    Eunjeong Yi*, Texas A&M University at Galveston
    (1056-05-1075)
  • 10:30 a.m.
    Bonding Tree Models of RNA Structures.
    Teresa Haynes, East Tennessee State University
    Debra Knisley, East Tennessee State University
    Denise Koessler*, East Tennessee State University
    (1056-05-2014)
• Wednesday January 13, 2010, 2:15 p.m.-6:05 p.m.
  AMS Special Session on Applications of Graph Theory, II
  Room 3007, 3rd Floor, Moscone
  Organizers:
  Richard Low, San Jose State University low@math.sjsu.edu
  Ralucca M. Gera, Naval Postgraduate School
  

  • 2:15 p.m.
    An Effective Upperbound on Treewidth Using Partial Fill-in of Separators.
    Martin Charles Golumbic*, Caesarea Rothschild Institute and Department of Computer Science, University of Haifa
    Boi Faltings, Artificial Intelligence Laboratory (LIA), Ecole Polytechnique Fédérale de Lausanne (EPFL)
    (1056-05-576)
  • 2:45 p.m.
    A new proof of the four-color theorem.
    John Paul Steinberger*, Tsinghua University, Beijing
    (1056-05-253)
  • 3:15 p.m.
    On Graham's Tree Reconstruction Conjecture.
    Bill Kay*, University of South Carolina
    Joshua Cooper, University of South Carolina
    (1056-05-326)
  • 3:45 p.m.
    Non-existence of circulant expander family.
    Wasin So*, San Jose State University
    (1056-05-313)
  • 4:15 p.m.
    Detecting a Machine Failure in a Network: Vertex Identifying Codes.
    Daniel W Cranston*, Virginia Commonwealth University
    Gexin Yu, College of William & Mary
    (1056-05-281)
  • 4:45 p.m.
    Best Monotone Degree Conditions for the Integrity and Tenacity of Graphs.
    Michael Robert Yatauro*, Research Fellow/Stevens Institute of Technology
    (1056-00-1674)
  • 5:15 p.m.
    Toughness and Degree Sequence Conditions.
    Nathan Kahl*, Seton Hall University
    Douglas Bauer, Stevens Institute of Technology
    Hajo Broersma, Durham University
    Ed Schmeichel, San Jose State University
    Jan van den Heuvel, London School of Economics
    (1056-05-760)
  • 5:45 p.m.
    The $L(2,1)$ channel-assignment problem on trees.
    Patrick Bahls*, University of North Carolina, Asheville
    (1056-05-60)