AMS Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:09:21
Program 
Deadlines 
Inquiries: meet@ams.org
1995 Burlington Mathfest
Burlington, VT, August 68, 1995
Meeting #902
Associate secretaries:
Robert J Daverman, AMS
daverman@math.utk.edu
Donovan H Van Osdol, MAA
dv@christa.unh.edu
AMS Special Session on Algorithms for Graphs and Matroids

Sunday August 6, 1995, 1:40 p.m.5:15 p.m.
AMS Special Session on Algorithms for Graphs and Matroids, I
Organizers:
Olivia M. Carducci, Lafayette College
Gary P. Gordon, Lafayette College

1:40 p.m.
Algorithms and interval based graphs.
Garth T. Isaak*, Lehigh University
(9020590)

2:10 p.m.
Algorithmic problems arising from generalizations of interval graphs and interval orders.
Kenneth P. Bogart*, Dartmouth College
(90205105)

2:40 p.m.
Wheels, fans, and a recurrence relation.
Anthony C. Nance*, Ohio State University, Columbus
(9020568)

3:10 p.m.
Enumerating Hamiltonian paths in rectangular grids.
Karen L. Collins*, Wesleyan University
Lucia Beth Krompart, Rochester, Michigan
(9020540)

3:40 p.m.
Decomposing graphs into trees.
Ruth Haas*, Smith College
(9020587)

4:10 p.m.
Algorithms for cases of the common covector problem for oriented matroid pairs.
Seth D. Chaiken*, State University of New York, Albany
(9020688)

4:40 p.m.
Problem Session

Monday August 7, 1995, 1:00 p.m.5:20 p.m.
AMS Special Session on Algorithms for Graphs and Matroids, II
Organizers:
Olivia M. Carducci, Lafayette College
Gary P. Gordon, Lafayette College

1:00 p.m.
Clutters and circuits.
Lorenzo Traldi*, Lafayette College
(9020519)

1:30 p.m.
Bounds on Hvectors of graphs and matroids.
Charles J. Colbourn*, University of Waterloo
(9020571)

2:00 p.m.
Decomposition schemes for computing the independence polynomial of a graph.
Robert E. Jamison, II*, Clemson University
(9020592)

2:30 p.m.
Deletion, contraction and computation trees for Greedoids.
Gary Peter Gordon*, Lafayette College
Elizabeth W. McMahon, Lafayette College
(90205149)

3:00 p.m.
An algorithm for the Tutte polynomial based on computation trees.
Gary Peter Gordon, Lafayette College
Elizabeth W. McMahon*, Lafayette College
(90205163)

3:30 p.m.
How floppy is it? A graphdecomposition algorithm to compute degrees of freedom for a class of ``molecular" frames.
D. S. Franzblau*, Rutgers University, New Brunswick
(9020589)

4:00 p.m.
Tree decomposition algorithms on rigidity matroids.
Brigitte Servatius*, Worcester Polytechnic Institute
(9020586)

4:30 p.m.
Symmetry and antisymmetry in bracket polynomials.
Neil L. White*, University of Florida
(90205153)

5:00 p.m.
A longest cycle version of Tutte's wheels theorem.
Talmage James Reid*, University of Mississippi
Haidong Wu, Louisiana State University, Baton Rouge
(9020506)
AMS Sectional Meetings

AMS National Meetings

AMS International Meetings

Inquiries: meet@ams.org