Rosamond: Computer Science Research and EducationInstitute for Informatikk

University of BergenPostboks 7803

5020 Bergen, Norway

Tel (47)55 58 42 00Tel (47)55 58 41 73

Fax (47)55 58 41 99home (47)48 15 49 05

Email: frances.rosamond@uib.no

Citizenship: Australia, USA

Ph. D. Cornell University, Ithaca, NY. Mathematics Education, 1981.M. A. Louisiana State University, Baton Rouge. Mathematics Education. NSF Foundation Fellow.B. S. Aquinas College, Grand Rapids, Michigan. Mathematics Major with Honors, Physics Minor, Single Subject Professional Clear Credential, Schornstein Scholarship.

Rosamond: Computer Science Research and Education 2016 – presentInstitute for InformatikkThe University of Bergen, 5020 Bergen, Norway

Researcher, Computer Science 2006 – 2010Parameterized Complexity Research Unit, Office of the DVC of ResearchThe University of Newcastle, NSW 2308 Australia

Associate Investigator 2004 - 2009ARC Centre in Bioinformatics, University of Queensland

Senior Lecturer 2006 - 2006Faculty of Engineering and Information TechnologyGriffith University, Brisbane, Australia.

Senior Lecturer 2001 – 2006Electrical Engineering and Computer Science from 2003Shared appointment EECS and Design and Multimedia 2001-2003University of Newcastle, NSW 2308 Australia

Senior Lecturer 1999 – 2001School of Mathematical and Computing SciencesVictoria University of Wellington, New Zealand

Full Professor and Department Chair 1986 - 1999Mathematics and Natural Sciences National University, La Jolla, CA.

Assistant Professor 1984 – 1986

APPOINTMENTS1

EDUCATION1

Frances Rosamond

Mathematics and Computer Science, University of San Diego, San Diego, CA.

Acting Discipline Leader for Computer Science and Software Engineering, School of Electrical Engineering and Computer Science, Faculty of Engineering, Mr-July 2002. Representative to the Faculty Senate for the School 2003-2004, University of Newcastle.

Director of the Computer Science Mentorship Program and Coordinator of Let’s Talk Science, the University of Victoria section of a Canadian national school outreach program. Dean of Engineering Office. Univ. of Victoria, British Columbia, Canada. Jan–May 2001 (while on leave from VUW).

New Zealand Accreditation Board Panel Member, 2000.

California Post-secondary Education Commission, Eisenhower Committee. Establish criteria, Review proposals, recommend funding, conduct site visits for projects to improve opportunities for educationally disadvantaged in elementary and high schools in California, 1997 - 2000.

President of ISEM: Institute for Studies in Educational Mathematics. Developer of SciMath, distance learning program for Minnesota teachers (http://www.augsburg.edu/math/MATtours/index.html). National University. Founding Chair of the Mathematics and Natural Sciences Department. Responsible for leadership, curriculum development. Developed Secondary and Elementary/Middle School Teacher Preparation Programs approved by the California Commission on Teacher Credentialing. Designed Portfolios, Assessments, Internships, Field Experiences, Outreach Activities.

• Served as the professional educational leader of the department in formulating and articulating the mission and strategic plan. The department comprises five full time and over 200 adjunct faculty teaching about 25 courses per month at 14 learning centers throughout California and Nevada. Average student age is 34, with 35.6% minority and 3.4% international.

• Maintained quality across the dispersed learning sites. Administrate the operating plan, annual review and assessment, professional development, and budget. Recruit and mentor faculty.

• Wrote grant proposals, served on committees and task forces for the school and university, including a proposal for a Doctoral Program and development of an online Global Studies B.A. Degree. Reported to the President and Council of Deans on General Education, University Transformation, Intensive Learning Format and online courses.

Sonia Kovalevsky Mathematics Day for Girls and Their Teachers. Produced program to introduce young women to role models and to careers using mathematics. Involved the Girl Scouts, City and County Schools, area businesses and government. Obtained grants from the Association for Women in Mathematics, the National Security Agency, and the community. 1996, 1997, 1998.

Centers for Assistance and Learning in Mathematics (CALM). Developed model learning centers based on research on adult learning, educationally disadvantaged, mathematics anxiety and avoidance. Secure funding, provide training, establish protocols, coordinate with classroom and distance programs.

• Cornell University. Special features are the Math Open-House Nights where math faculty demonstrate their research to the public through hands-on mini-workshops, Art Museum Math where faculty explain the math of certain exhibitions, and other interdisciplinary presentations. Established in 1981, the Center is ongoing.

Curriculum Vitae of FRANCES A. ROSAMOND Page 2

EXPERIENCE AND LEADERSHIP1

• Eisenhower College. Special features include opportunities for faculty peer review. Established in 1982, the center merged with Rochester Institute of Technology and is ongoing.

• Peninsula Technikon, South Africa. Consultant to establish a math center. • National University. Special features include procedures for student transfer between classroom and

on-line courses with no academic penalty.

Educational Change Support Group: Co-leader of monthly meetings of school teachers and university professors with goals of promoting equity and leadership in education. (1995-2000).

Cornell University: Developed a program for adult women returning to mathematics after a hiatus. Program moved most participants at least two stages on Perry's Scheme of Intellectual and Ethical Development, 1982, 1983.

Consulting:Whoola.com, a computer game edutainment development company.

Cadmasters Corporation, Walnut Creek. Consultant for Quality Teaching in Industry.

Neurology Institute of Washington, D.C. Brain Gym, Equity in Learning Workshops.

Mathematics Anxiety Workshops. Developed audio tapes to enhance learning.

Claremont High School Academies: Business and Mathematics, Science, Medicine and Fine Arts and to help Claremont become a Charter School.

Annual Quality Math/Quality Writing Assessment Program, Vista Unified School District.

National Board for Professional Teaching Standards, to create a system for certifying experienced teachers, establishing high standards for accomplished practitioners.

Textbook Reviewer: Scott, Foresman, Addison-Wesley and other publishing companies.

My research has recently evolved from mathematics education to computer science and computer education. My specific area in theoretical computer science is establishing reduction rules for parameterized problems. In education, I am investigating computer games. Research involves designing a method of systematically generating game puzzles by applying NP-complete problems.

My teaching experience includes honours courses in computer games design, computer graphics, concurrent programming, beginning C++, undergraduate mathematics and large size beginning computing courses, •teacher preparation courses. •Experienced in high school and elementary school teaching. •Taught with a signer and note-takers at the National Technical Institute for the Deaf (Rochester Institute of Technology). •Taught Test Preparation courses for CBEST, LSAT, GRE, GMAT, SAT, NTE. •Designed History of Mathematics Web Site Mathematical Journey Through Time (http://www.nu.edu/soas/math/frames.html.) •Developed Senior Capstone Project for mathematics majors at National University, which involves student research in the community. •Supervise the Mathematical Modeling Course. • Develop internships for National University mathematics majors at various corporations and centers. •Receive outstanding teaching evaluations. Recipient of the President’s Distinguished Teacher of the Year Award at National University.

Co-supervisor of three Ph.D. students: Elena Prieto and Peter Shaw in computer science, Ma’moon Mubarak in mathematics education.

Curriculum Vitae of FRANCES A. ROSAMOND Page 3

RESEARCH AND TEACHING1

Australian Council of Deans of ICT (ACDICT), 2013 ACDICT Learning and Teaching Academy (ALTA) Engagement Award ($10,000) to communicate foundations and frontiers of ICT to Indigenous children, 2013-2014. This was the only Engagement Award given in 2013.

First International Conference on Creative Mathematical Sciences Communication (www.cdu.edu.au/conference/csmaths) August 2013. I directed the conference and won sponsorship from Google, AU ($50,000), CDU Vice Chancellor ($20,000), CDU Dean of Engineering, Health, Science and IT ($20,000), Australian Mathematical Sciences Institute (AMSI) ($3,000), Kikdigital Productions and local sponsors, 2013.

Algorithmic Engineering and Complexity Analysis of Protocols for Consensus, Australian Research council Discovery Project DP110101792. Three CIs. 2011—2013. (AUD) 210,000 for three years.

An Investigation into Increasing the Number of Women in Computer Science. $23,000. University of Newcastle Higher Education Equity Programme Award, 2003--2004.

A Software Workbench of Input Reduction and Simplification Rules for Large Problem Datasets in Bio-Informatics. ARC2004 submitted. Single author.

A Novel Genetic Algorithm Based on Internet Game-Play to Generate Small Hard Instances of Combinatorial Problems for Heuristics Testing. ARC 2003 submitted. Single author.

Computer Simulations and Games for Learning and Development and University Enrichment. Two PI’s. $1,000,000 over three years. Institutional Strategic Initiative 2003 (proposed and considered).

Computer Games: Learning and Edutainment, Applications in Computer Science. University of Newcastle New Staff Grant, (AUD) 13,000. 2002.

Comparison of Canada and New Zealand IT in Schools. New Zealand Ministry of Research, Science and Technology International Travel Grant. Single author. (NZD) 5000. 1999.

Computer Games: Interdisciplinary and Inter-institutional Collaboration for Applications in Science, Medicine and Education—A Leveraged Starting Point Towards a Multimedia Design Institute. Four authors. (NZD) 36,000. Victoria University of Wellington, 1999.

The Mathematical Foundations of Computing and Information Technology for the Early Grades and for the General Public. Victoria University of Wellington.Two authors. (NZD) 36,000. 1999.

Girl Power: Increasing Ability and Motivation in Mathematics and Science. United States National Science Foundation. Sweetwater High School District. Four authors. (USD) 750,000. 1999-2001.

Jerry C. Lee Presidential Distinguished Teacher of the Year (unanimously voted by my peers) 1998.

Grants from the Association for Women in Mathematics and the National Security Agency to present Sonia Kovalevsky Mathematics Days. (USD) 10,000. 1997, 1998.

Grants from the Ohio State University to present Graphing Calculator Workshops 1996, 1998.

Teaching Adult Learning: National University Improvement of Teaching Effectiveness video, 1998.

CD-ROM on Mathematics in the World of Work, National University Presidential Award 1996.

Curriculum Vitae of FRANCES A. ROSAMOND Page 4

PROFESSIONAL HONORS, AWARDS, GRANTS, AND RESEARCH SUPPORT1

American Association of Higher Education: Faculty Roles and Policies, NU Presidential Grant 1996. Conference on Teaching Statistics: NSF funded research conference with Jon Cryer and Robin Lock, University of the Pacific, June 1996.

Grant from the Eurasia Foundation and Sister Cities International to establish Junior Achievement advanced economics "GLOBE" between Claremont High School and two schools in Vladivostok. Provided opportunity for exchange visits between teachers. 1995-1996.

American Council of Education Washington D.C. Fellows Program Candidate, 1996.

National University Outstanding Teaching Award, School of Arts and Sciences, 1995.

Project PROMPT Professors Rethinking Options in Mathematics for Pre-Service Teachers: NSF funded workshop to examine content preparation of pre-service teachers. Humboldt State U, July 1995.

Innovations in Pre-Calculus Curriculum. Addison-Wesley funded workshop to investigate issues in the curriculum. (led by Sheldon and Florence Gordon, Ben Fusaro). January 1995.

Interactive Mathematics Texts in the Classroom using MathKit for Windows with Mathematical toolbook. NSF, IBM, Waterloo Maple, Wolfram Research, MathSoft and Eduquest research workshop (James White, University of North Carolina, Chapel Hill.) Los Angeles Pierce College, July 1993.

Travel Award from Sister Cities International to Japan, 1994. This coincided with my Sabbatical Leave Award enabling me to meet with planning groups for the United Nations Fourth World Conference on Women in Japan, Taiwan, Kenya and Germany and with environmentalists, scholars and politicians. Visited Mathematical Sciences at the Open University in England.

Member of the first American Women in Mathematics Delegation to the People's Republic of China, 1990.Travel Award from the Richard Lounsbery Foundation, Inc. to participate in the first American Women in Mathematics Delegation to the People's Republic of China, 1989.

Mina Shaughnessy Scholars Award: U.S. Department of Education and Carnegie Foundation, 1983.

Sloan Foundation award to establish the Cornell Mathematics Support Center, 1981.

National Science Foundation award for Graduate education, 1981.

Google Scholar Citation Indices as of February 2014 Total citations: 2413, with 1240 since 2012 H-index: 20.

BOOKS

A. Day, M. Fellows, N. Greenberg, B. Khoussainov, A. Melnikov, F. Rosamond. Computability and Complexity – Essays Dedicated to Rodney G. Downey on the Occasion of His 60 th Birthday. Lecture Notes in Computer Science 10010, Springer 2017.

M. Fellows and F. Rosamond. Deconstructing NP-Completeness: A Multicomplexity Analysis Problem Book, accepted for publication by Charles Darwin University Press, 2012.

Curriculum Vitae of FRANCES A. ROSAMOND Page 5

PUBLICATIONS1

M. Fellows and F. Rosamond. When Hard Problems Must Be Solved: Extremal Structure Theory and Effective Algorithm Design, has been accepted for the Cambridge University Press Series in Computational Mathematics.

F. Rosamond and L. Copes, Eds. Educational Transformations: The Influences of Stephen I. Brown, (580 pages). AuthorHouse Publishing (Bloomington, Indiana), ISBN: 978-1-42080-690-8, 2006.

BOOK CHAPTERS

Frances Rosamond. “A Century of Women's Participation in the Mathematical Association of America and Other Mathematics Organizations.” (Invited chapter in honour of the 100 th anniversary of the MAA). Winning Women into Mathematics (P. Kenschaft, Ed.), The Mathematical Association of America, 31 – 53, 1992. Chosen as a feature of the MAA Centennial 2014.

Tim Bell, Frances Rosamond and Nancy Casey. “Computer Science Unplugged and Related Projects in Math and Computer Science Popularization”. The Multivariate Algorithmic Revolution and Beyond, Festschrift in Honor of Michal Ralph Fellows,” LNCS, 7370/2012, 398-456.

Frances A. Rosamond, “Passion Plays: Melodramas about Mathematics”. The Multivariate Algorithmic Revolution and Beyond, Festschrift in Honor of Michal Ralph Fellows, LNCS, 7370/2012, 80-87.

Frances Rosamond. “Statistics of the Field,” Computer Science: The Hardware, Software and Heart of It (E.K. Blum and A.V. Aho., Eds.), Springer, (ISBN 9781-4614-1167-3) 421—466, 2011.

Michael Fellows, Serge Gaspers, and Frances Rosamond. “Multivariate Complexity Theory,” Computer Science: The Hardware, Software and Heart of It, (E. K. Blum and A. V. Aho, Eds.), Springer, (ISBN 9781-4614-1167-3) 269—294, 2011.

Frances Rosamond. “Max Leaf Spanning Tree,” Encyclopedia of Algorithms (Ming-Yang Kao, Ed), Springer, pp 297-305. ISBN: 978-0-387-30770-1 (Print) 978-0-387-30162-4 (Online), 2008.

Frances Rosamond. “On-line and Off-line computer games and mathematical sciences popularization,” Educational Transformation: The Influences of Stephen I. Brown, (F. Rosamond and L. Copes, Eds.), AuthorHouse Publications, (Bloomington, Indiana), 407-426, 2006.

V. Estivill-Castro, M. Fellows, M. Langston, and F. Rosamond. “FPT is P-Time Extremal Structure I,” Algorithms and Complexity in Durham 2005, (H. Broersma, M. Johnson and S. Szeider, Eds.), King's College Publications, Texts in Algorithmics 4, 1—41, 2005.

Frances Rosamond. “Our Voices: Using Skits on Equity and Diversity for Initiating Institutional and Personal Change,” Social Justice and Mathematics Education: Gender, Class, Ethnicity and the Politics of Schooling (C. Keitel, Ed.) International Organization of Women in Mathematics Education, Freie Universitat Berlin, 1999.

Frances Rosamond. “The Role of Emotion: Expert and Novice Mathematical Problem-Solving,” Research Issues in Undergraduate Mathematics Learning (J. Kaput and E. Dubinsky, Eds.), MAA Notes #33, 79 – 94, 1994.

Frances Rosamond. “Micro-Inequities Skit Kit: Are We There Yet?” Encouraging Women in Mathematics (P. Kenschaft, Ed.), The Mathematical Association of America, 1994.

Refereed Journal Publications

Curriculum Vitae of FRANCES A. ROSAMOND Page 6

1. Michael R. Fellows , Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:Tractable Parameterizations for the Minimum Linear Arrangement Problem. TOCT 8(2): 6:1-6:12 (2016)

2. Faisal N. Abu-Khzam , Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:On the parameterized complexity of dynamic problems. Theor. Comput. Sci. 607: 426-434 (2015).

3. René van Bevern , Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: Myhill-Nerode Methods for Hypergraphs. Algorithmica 73(4): 696-729 (2015).

4. Frances Rosamond, Liming Cai, and Iyad Kanj (Special Guest Editors): Foreword to the Special Issue on Parameterized Complexity, Tsinghua Journal of Science and Technology, 19(4): (2014) 323–324.

5. Uéverton dos Santos Souza , Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva: The Flood-It game parameterized by the vertex cover number. Electronic Notes in Discrete Mathematics 50: 35-40 (2015).

6. Rodney G. Downey, Judith Egan, Michael R. Fellows, Frances A. Rosamond, and Peter Shaw: Dynamic Dominating Set and Turbo-Charging Greedy Heuristics. Tsinghua Journal of Science and Technology, 19(4): (2014) 329–337.

7. Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai: Tractable Parameterizations for the Minimum Linear Arrangement Problem. Accepted to ACM Transactions on Computation Theory (TOCT) (2014).

8. R. Crowston, M. Fellows, G. Gutin, M. Jones, E.J. Kim, F. Rosamond, I.Z. Ruzsa, S. Thomassé, A. Yeo: Satisfying more than half of a system of linear equations over GF(2): A multivariate approach, Journal of Computer and System Sciences, Available online 24 October 2013, ISSN 0022-0000, http://dx.doi.org/10.1016/j.jcss.2013.10.002.

9. Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond: Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. European Journal Combinatorics 34(3): (2013) 541-566.

10. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Distortion is Fixed Parameter Tractable. ACM Transactions on Computation Theory (TOCT) 5(4): 16 (2013).

11. Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond: Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theoretical Computer Science 472: 81-89 (2013).

12. M. Dom, M. R. Fellows, F. A. Rosamond, S. Sikdar: The Parameterized Complexity of Stabbing Rectangles. Algorithmica 62 (1-2): (2012) 564-594.

13. M. R. Fellows, D. Hermelin, F. A. Rosamond: Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64 (1): (2012) 3-18.

Curriculum Vitae of FRANCES A. ROSAMOND Page 7

14. M. R. Fellows, S. Gaspers, F. A. Rosamond: Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): (2012) 675-693.

15. M. R. Fellows, F. V. Fomin, D. Lokshtanov, F. Rosamond, S. Saurabh and Y. Villanger. Local Search: Is Brute-Force Avoidable? Journal of Computer and System Sciences 7 (2012) 707-719.

16. H. Bodlaender, M. Fellows, M. Langston, M. Ragan, F. Rosamond and M. Weyer. Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica 61 (2011), 362–378.

17. Frances A. Rosamond, Roswitha Bardohl, Stephan Diehl, Uwe Geisler, Gordon Bolduan, Annette Lessmöllmann, Andreas Schwill, Ulrike Stege. Reaching out to the media: become a computer science ambassador. Communications of the ACM 54(3): (2011) 113-116.

18. Frances A. Rosamond. A three-hour tour of some modern mathematics. In Mathematics: Traditions and [new] practices,” (J. Clark, B. Kissane, J. Mousley, T. Spencer & S. Thornton, Eds.) Adelaide: AAMT & MERGA. (2011) 1038 – 1046.

19. M. Fellows, F. Fomin, D. Lokshtanov, F. Rosamond, S. Saurabh, S. Szeider and C. Thomassen. On the Complexity of Some Colorful Problems Parameterized by Treewidth. Information and Computation 209 (2011), 143–153.

20. M. Fellows, D. Hermelin, G. Landau, F. Rosamond and L. Tzvika. Haplotype Inference Constrained by Plausible Haplotype Information. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8 (2011), 1692--1699.

21. H. Bodlaender, M. Fellows, P. Heggernes, F. Mancini, C. Papadopoulos and F. Rosamond. Clustering with Partial Information. Theoretical Computer Science 411 (7-9) (2010) 1202--1211.

22. M. Fellows, J. Flum, D. Hermelin, M. Mueller, and F. Rosamond. W-Hierarchies Defined by Symmetric Gates. Theory of Computing Systems 46 (2) (2010), 311-339.

23. N. Betzler, M. Fellows, J. Guo, R. Niedermeier and F. Rosamond. Fixed-parameter algorithms for Kemeny rankings. Theoretical Computer Science 410 (45) (2009), 4554-4570.

24. M. Fellows, F. Rosamond, U. Rotics and S. Szeider. Cliquewidth Minimization is NP-complete. SIAM Journal on Discrete Mathematics 23 (2) (2009) 909--939.

25. M. Fellows, D. Lokshtanov, N. Misra, M. Mnich, F. Rosamond and S. Saurabh. The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory of Computing Systems 45 (4) (2009), 822-848.

26. M. Fellows, D. Hermelin, F. Rosamond and S. Vialette. On the Fixed-Parameter Complexity of Multiple-Interval Graph Problems. Theoretical Computer Science 410 (1) (2009), 53-61.

27. L. Cai, X. Huang, C. Liu, F. Rosamond, and Y. Song. Parameterized Complexity and Biopolymer Sequence Comparison. Survey article in The Computer Journal 51 (3) (2008) 270-291.

28. M. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. Thilikos, and S. Whitesides. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52 (2) (2008) 167—176.

29. V. Dujmovic, M. Fellows, M., Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F.Rosamond, S. Whitesides, and D. R. Wood. On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52 (2) (2008) 267-292.

Curriculum Vitae of FRANCES A. ROSAMOND Page 8

30. R. Downey, Fellows, M. McCartin, C., and F. Rosamond. Parameterized Approximation of Dominating Set Problems. Information Processing Letters 109 (2008) 68-70.

31. F. Dehne, M. Fellows, M. Langston, F. Rosamond and K. Stevens. An O(2 O(k)n^3 ) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory of Computing Systems, 41 (2007) 479—492.

32. L. Cai, M. Fellows, D. Juedes and F. Rosamond. On the Effciency of Polynomial Time Approximation. Theory of Computing Systems, 41 (2007) 459—477.

33. R. Christian, M. Fellows, F. Rosamond and A. Slinko. On the Complexity of Lobbying in Multiple Referenda. Review of Economic Design, 11 (2007) 217—224.

34. V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides and D. R. Wood. A Fixed-Parameter Approach to Two-Layer Planarization. Algorithmica 45 (2006) 159—182.

35. S. Chalup. D. Mellor and F. Rosamond. The Machine Intelligence Hex Project. Journal of Computer Science Education, Vol. 15, No. 4, December (2006) 245 – 273.

36. J. Alber, H. Fan, M. Fellows, H. Fernau, R. Niedermeier and U. Stege. Refined Search Tree Technique for Dominating Sets on Planar Graphs. Journal of Computer and Systems Science 71 (2005), 385–405.

37. R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto-Rodriguez and F. Rosamond. Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electronic Notes in Theoretical Computer Science 78 (2003), 205–218.

38. F. Rosamond. “South China Normal University, Report #2.” Journal of the Citizen Ambassador Program, 1991.

39. F. Rosamond. “Listening to our Students.” For the Learning of Mathematics Journal (David Wheeler, Editor) 1982.

Refereed Journal Publications: Accepted and in Queue for Publication

M. Fellows, D. Hermelin, F. Rosamond, H. Sachnai.Tractable Parameterizations for the Minimum Linear Arrangement Problem, ACM Transactions on Computation Theory.

M. Fellows, P. Giannopoulos, C. Knauer, C. Paul, F. Rosamond, S. Whitesides and N. Yu. On the Parameterized Complexity of the Discrete Milling Problem with Turn Costs. Journal of Discrete Algorithms.

Refereed Conference Proceedings

1. Holger Dell , Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond: The First Parameterized Algorithms and Computational Experiments Challenge. IPEC 2016: 30:1-30:9.

2. Frances Rosamond: Max Leaf Spanning Tree. Encyclopedia of Algorithms 2016: 1211-1215, 2016.

Curriculum Vitae of FRANCES A. ROSAMOND Page 9

3. Faisal Abukhzam, Peter Shaw, Michael Fellows, Frances Rosamond, Judith Egan: On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints, COCOA 2014: Vol 8881, LNCS 2014, 625-636.

4. Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai: Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA 2013: 457-468.

5. René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond: Myhill-Nerode Methods for Hypergraphs. ISAAC 2013: 372-382

6. Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai. “Parameterized Approximation via Fidelity Preserving Transformations,” ( ICALP (1) 2012) Automata, Languages, and Programming. LNCS, 2012, Volume 7391/2012, 351-362.

7. M. Fellows, A. Pfandler, F. Rosamond and S. Ruemmele, “The Parameterized Complexity of Abduction,” Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (AAAI 2012) (http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/5048).

8. Tim Bell, Mike Fellows, Fran Rosamond, Judith Bell, Daniela Marghitu. “Unplugging Educations: Removing Barriers to Engaging with New Disciplines. Proceedings of Transdisciplinary Conference on Integrated Systems, Design, and Process Science (SDPS) Berlin, Germany, June 10-14, 2012.

9. Leo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler and Frances Rosamond. “Train Marshalling Is Fixed Parameter Tractable,” (6th International Conference Fun with Algorithms 2012), Lecture Notes in Computer Science, 2012, Volume 7288, 51-56.

10. Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo: Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011: 229-240.

11. M. Fellows, T. Friedrich, D. Hermelin, N. Narodytska and F. Rosamond. “Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable,” Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011) 522–527.

12. M. Fellows, S. Gaspers and F. Rosamond. “Parameterizing by the Number of Numbers,” Proceedings International Symposium on Parameterized and Exact Computation (IPEC 2010), Springer-Verlag, Lecture Notes in Computer Science 6478 (2010), 123–134.

13. M. R. Fellows, B. M. P. Jansen, D.Lokshtanov, F. A. Rosamond, S. Saurabh. “Determining the Winner of a Dodgson Election is Hard,” Proceedings of Foundations of Software Technology and Theoretical Computer Science 55 (FSTTCS 2010) 459-468.

14. M. Fellows, P. Giannopoulos, C. Knauer, C. Paul, F. Rosamond, S. Whitesides, N. Yu. “Milling a Graph with Turn Costs,” Proceedings of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG), Crete, July 2010.

15. N. Betzler, M. Fellows, J. Guo, R. Niedermeier and F. Rosamond. “How Similarity Helps to Efficiently Compute Kemeny Rankings,” Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary. Volume 1 (2009) 657--664.

Curriculum Vitae of FRANCES A. ROSAMOND Page 10

16. M. Dom, M. Fellows and F. Rosamond. “Parameterized Complexity of Stabbing Rectangles and Squares in the Plane,” Proceedings of the Third International Workshop on Algorithms and Computation (WALCOM 2009), Kolkata, India. Springer-Verlag, Lecture Notes in Computer Science 5431 (2009), 298--309.

17. R. Enciso, M. Fellows, J. Guo, I. Kanj, F. Rosamond and A. Suchy. “What Makes Equitable Connected Partition Easy?” Proceedings International Workshop on Parameterized and Exact Computation (IWPEC 2009), Copenhagen, Denmark. Springer-Verlag, Lecture Notes in Computer Science 5917 (2009) 122--133.

18. M. Fellows, F. Fomin, D. Lokshtanov, F. Rosamond, S. Saurabh and Y. Villanger. “Local Search: Is Brute Force Avoidable?” Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, California, USA. (2009) 486--491.

19. M. Fellows, F. Fomin, D. Lokshtanov, E. Losievskaja, F. Rosamond and S. Saurabh. “Distortion Is Fixed-Parameter Tractable,” Proceedings Automata, Languages and Programming, 36th International Colloquium, Part I (ICALP 2009), Rhodes, Greece. Springer Lecture Notes in Computer Science 5555 (2009) 463--474.

20. M. Fellows, T. Hartman, D. Hermelin, G. Landau, L. Leventhal and F. Rosamond. “Haplotype Inference Constrained by Plausible Haplotype Data,” Proceedings Combinatorial Pattern Matching, 20th Annual Symposium (CPM 2009), Lille, France. Springer-Verlag, Lecture Notes in Computer Science 5577 (2009), 339--352.

21. M. Fellows, J. Hromkovic, F. Rosamond and M. Steinova. “Fixed-Parameter Tractability, Relative Kernelization and the Effectivization of Structural Connections,” Proceedings of Computation and Logic in the Real World, Conference on Computability in Europe (CiE 2009), Heidelberg, Germany.

22. D. Hermelin, M. Fellows and F. Rosamond. “Well-Quasi-Ordering Bounded Treewidth Graphs,” Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC 2009), Copenhagen, Denmark. Springer-Verlag, Lecture Notes in Computer Science 5917 (2009) 149--160.

23. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh. “Parameterized Low-distortion Embeddings - Graph metrics into lines and trees,” CoRR abs/0804.3028: (2008).

24. N. Betzler, M. Fellows, J. Guo, R. Niedermeier and F. Rosamond. “Fixed-Parameter Algorithms for Kemeny Scores,” Proceedings of Algorithmic Aspects in Information and Management (AAIM 2008), Fudan University, Shanghai. Springer-Verlag Lecture Notes in Computer Science 5034 (2008) 60-71. Invited for submission to a special issue of Theoretical Computer Science.

25. N. Betzler, M. Fellows, J. Guo, R. Niedermeier and F. Rosamond. “Computing Kemeny Rankings, Parameterized by the Average K-T Distance,” Proceedings of the 2nd International Workshop on Computational Social Choice (COMSOC 2008), Liverpool, UK.

26. H. Bodlaender, M. Fellows, P. Heggernes, F. Mancini, C. Papadopoulos and F. Rosamond. “Clustering with Partial Information,” Proceedings of 33rd International Symposium, Mathematical Foundations of Computer Science (MFCS 2008), Torun, Poland. Springer-Verlag Lecture Notes in Computer Science 5162 (2008) 144--155.

27. M. Fellows, D. Hermelin, M. Muller and F. Rosamond. “A Purely Democratic Characterization of W[1],” Proceedings of the International Workshop on Exact and Parameterized Computation (IWPEC 2008), Victoria, BC, Canada. Springer Lecture Notes in Computer Science 5018 (2008), 103--114.

Curriculum Vitae of FRANCES A. ROSAMOND Page 11

28. M. Fellows, D. Lokshtanov, N. Misra, F. Rosamond and S. Saurabh. “Graph Layout problems Parameterized by Vertex Cover,” Proceedings of the International Symposium on Automata, Algorithms and Computation (ISAAC 2008), Gold Coast, Queensland, Australia). (S-H Hong, H. Nagamochi and T. Fukunaga, Eds.), Springer-Verlag Lecture Notes in Computer Science 5369 (2008), 294--305.

29. M. Fellows, D. Meister, F. Rosamond, R. Sritharan and J.A. Telle. “Leaf Powers and Their Properties: Using the Trees,” Proceedings of the International Symposium on Automata, Algorithms and Computation (ISAAC 2008), Gold Coast, Queensland, Australia. (S-H Hong, H. Nagamochi and T. Fukunaga, Eds.), Springer-Verlag Lecture Notes in Computer Science 5369 (2008), 402--413.

30. E. Mujuni and F. Rosamond. “Parameterized Complexity of the Clique Partition Problem.” Proceedings of The Australasian Theory Symposium (CATS2008), Wollongong, NSW, Australia. (James Harland and Prabhu Manyem, Eds.) Conferences in Research and Practice in Information Technology (CRPIT), Vol. 77 (2008) 75-78.

31. H. Bodlaender, M. Fellows, M. Langston, M. Ragan, F. Rosamond and M.Weyer. “Quadratic Kernelization for Convex Recoloring of Trees,” Proceedings of the International Conference on Computing and Combinatorics (COCOON 2007), Banf, Alberta, Canada. Springer-Verlag Lecture Notes in Computer Science 4598 (2007) 86--96.

32. B. Chor, M. Fellows, M. Ragan, I. Razgon, F. Rosamond and S. Snir. “Connected Coloring Completion for General Graphs: Algorithms and Complexity,” Proceedings of the International Conference on Computing and Combinatorics (COCOON 2007), Banf, Alberta, Canada. Springer-Verlag Lecture Notes in Computer Science 4598 (2007) 75--85.

33. M. Fellows, F. Fomin, D. Lokshtanov, F. Rosamond, S. Saurabh, S. Szeider and C. Thomassen. “On the Complexity of Some Colorful Problems Parameterized by Treewidth,” Proceedings of the Conference on Combinatorial Optimization and Applications (COCOA 2007), Xi'an, China. Springer-Verlag, Lecture Notes in Computer Science 4616 (2007) 366-377.

34. M. Fellows, M. Langston, F. Rosamond and P. Shaw. “Efficient Parameterized Preprocessing for Cluster Editing,” Proceedings of the International Symposium on Fundamentals of Computation Theory (FCT 2007), Hungarian Academy of Sciences and University of Szeged, Budapest, Hungary. Springer-Verlag, Lecture Notes in Computer Science 4639 (2007) 312-321.

35. M. Fellows and F. Rosamond. “The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number,” Proceedings of Computation and Logic in the Real World, Third Conference on Computability in Europe (CiE 2007), Siena, Italy. Springer-Verlag Lecture Notes in Computer Science 4497 (2007) 268--277.

36. M. Fellows and F. Rosamond. “Why Is P Not Equal to NP?” Proceedings of Computation and Logic in the Real World, Third Conference on Computability in Europe (CiE 2007), Siena, Italy. Local Proceedings (Technical Report 487, Dipartimento di Scienze Mathematiche ed Informatiche, Universita Degli Studi Di Siena), (2007) 151--160.

37. H. Bodlaender, M. Fellows, M. Langston, M. Ragan, F. Rosamond and M. Weyer. “Kernelization for Convex Recoloring of Trees,” Proceedings of Algorithms and Complexity in Durham (ACiD 2006), Durham, UK. King's College Publications, Texts in Algorithmics 7 (2006) 23-36.

38. K. Burrage, V. Estivill-Castro, M. Fellows, M. Langston, S. Mac and F. Rosamond. “The Undirected Feedback Vertex Set Problem has Polynomial Kernel Size,” Proceedings of the

Curriculum Vitae of FRANCES A. ROSAMOND Page 12

International Workshop on Parameterized and Exact Computation (IWPEC 2006), Zurich, Switzerland. Springer-Verlag Lecture Notes in Computer Science 4169 (2006) 192--202.

39. R. Christian, M. Fellows, F. Rosamond and A. Slinko. “On the Complexity of Lobbying in Multiple Referenda,” Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC 2006), Amsterdam, the Netherlands. Ulle Ednriss and Jerome Lang (Eds.), (2006) 87-96.

40. R. Christian, M. Fellows, F. Rosamond and A. Slinko. “On the Complexity of Lobbying in Multiple Referenda,” Cahier, 13, Centre for Interview Research on Qualitative Economics (CIREQ), Montreal, Canada (2006) 1-7.

41. F. Dehne, M. Fellows, H. Fernau, E. Prieto and F. Rosamond. “Nonblocker: Parameterized Algorithmics for Minimum Dominating Set,” Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2006), Czech Republic. Springer-Verlag Lecture Notes in Computer Science 3831 (2006) 237--245.

42. M. Fellows, F. Rosamond, U. Rotics and S. Szeider. “Clique-width Minimization is NP-hard,” Proceedings of the 38th ACM Symposium on Theory of Computing (STOC 2006), Seattle, Washington, USA. ACM Press (2006) 354-362.

43. V. Estivill-Castro, M. Fellows, M. Langston and F. Rosamond. “Fixed-Parameter Tractability is Polynomial-Time Extremal Structure Theory I: The Case of Max Leaf,” Proceedings of Algorithms and Complexity in Durham (ACiD 2005), Durham, UK. Kings College London Publications, Texts in Algorithmics 4 (2005), 1--41.

44. M. Fellows, M. Langston, F. Rosamond and K. Stevens. “An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem,” Proceedings of the International Conference on Computing and Combinatorics (COCOON 2005), Kunming, China. Springer-Verlag Lecture Notes in Computer Science 3595 (2005) 859-869.

45. M. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. Thilikos and S. Whitesides. “Faster fixed-parameter tractable algorithms for matching and packing problems,” Proceedings of the European Symposium on Algorithms (ESA) (2004), Springer-Verlag, Lecture Notes in Computer Science 3162 (2004) 311-322.

46. M. Fellows, P. Heggernes, F. Rosamond, C. Sloper and J-A.Telle. “Exact algorithms for finding k disjoint triangles in an arbitrary graph,” Proceedings WG-30th Workshop on Graph Theoretic Concepts in Computer Science(2004), Springer-Verlag, Lecture Notes in Computer Science 3353 (2004) 235-244.

47. F. Dehne, M. Fellows, F. Rosamond, and P. Shaw. “Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved FPT Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover,” Proceedings of International Workshop on Parameterized and Exact Computation (IWPEC), Springer Verlag, Lecture Notes in Computer Science 3162 (2004) 223-234.

48. F. Dehne, M. Fellows, and F. Rosamond. “An FPT Algorithm for Set Splitting,” Proceedings WG-29th Workshop on Graph Theoretic Concepts in Computer Science(2003), Springer-Verlag, Lecture Notes in Computer Science 2880 (2003) 180-191.

49. J. Alber, H. Fan, M. Fellows, H. Fernau, R. Niedermeier F. Rosamond and U. Stege. “Refined Search Tree Techniques for the Planar Dominating Set Problem,” Proceedings 26th International Symposium on Mathematical Foundations of Computer Science (MFCS)(2001), Springer-Verlag, Lecture Notes in Computer Science 2136 (2001) 111-122.

Curriculum Vitae of FRANCES A. ROSAMOND Page 13

50. V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D.R. Wood. “On the Parameterized Complexity of Layered Graph Drawing,” Algorithms - ESA 2001, In: Lecture Notes in Computer Science, ISSN 0302-9743, Volume 2161 (2001) 488-499.

51. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, Giuseppe Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, David R. Wood. “A Fixed-Parameter Approach to Two-Layer Planarization,” Graph Drawing : 9th International Symposium, GD 2001 Vienna, Austria, In: Lecture Notes in Computer Science, ISSN 0302-9743, Volume 2265 (2002) 1-15.

52. M. Fellows, C. McCartin, F. Rosamond and U. Stege. “Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems,” Proceedings FST-TCS (2000), Springer Lecture Notes in Computer Science 1974 (2000) 240-251.

53. M. Fellows, C. McCartin, F. Rosamond and U. Stege. “Coordinatized Kernels and Catalytic Reductions: A New Parameterized Algorithm for Max Leaf Spanning Tree,” Proceedings 11th Australasian Workshop on Combinatorial Algorithms (AWOCA), Newcastle, Australia, (2000).

54. F. Rosamond. “We Must All Work: Promoting Women in Science,” Proceedings of the International Conference on Women in Science, Anna University, Chennai, India, (2000).

55. F. Rosamond. “The Sophia Teaching Ideology: A Mathematical Journey Through Time Website as Part of a History of Mathematics Course,” Proceedings of the International Conference on Teaching of Mathematics, John Wiley & Sons, (1998).

56. F. Rosamond. “The Guangzhou Women's Federation.” Proceedings of the First American Women in Mathematics Delegation to the PRC (A. Schaefer, Editor) MAA, January 1991.

57. F. Rosamond. “Mathematics Teaching and Affect,” with J. Poland. Proceedings of the Canadian Mathematics Education Study Group, 1986.

Other Academic Output

Editor of the Parameterized Complexity community newsletter since 2005, FPT News: The Parameterized Complexity Newsletter. Archived at www.fpt.wikidot.com

Creator and Moderator of the Parameterized Complexity wiki since 2005, located at www.fpt.wikidot.com

Simultaneously Satisfying Linear Equations Over F[2]: MaxLin2 and Max-r-Lin2 Parameterized Above Average, R. Crowson, M. Fellows, G. Gutin, M. Jones, F. Rosamond, S. Thomasse and A. Yeo. arXiv:1104.1135 (2011).

Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. “Proving NP-hardness for clique-width I: non-approximability of sequential clique-width.” Electronic Colloquium on Computational Complexity (ECCC)(080), (2005).

M. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. “Proving NP-hardness for clique-width II: non-approximability of clique-width.” Electronic Colloquium on Computational Complexity (ECCC)(081), (2005).

Curriculum Vitae of FRANCES A. ROSAMOND Page 14

M. Fellows and F. Rosamond. “Chocolate Covered Broccoli: Design Issues in Educational Games,” with M. Fellows. Unpublished document (2002).

P. Kenschaft and F. Rosamond. “Audience Asserts Differential Grading Persists,” FOCUS: Newsletter of the Mathematical Association of America, 8 - 9, Spring (1996).

National University Journal of Student Mathematical Modeling (F. Rosamond, Editor) 1995—1998.

S. Lenhart and F. Rosamond. “Discrete, Continuous and Stochastic Models for Population Growth,” UMAP Module, West Point Academy, (1994).

F. Rosamond. “Computer Science Library Recommendations.” Library Recommendations for Undergraduate Mathematics (S. Cunningham, Editor), MAA publication, (1991).

F. Rosamond. “People-to-People: The First American Women in Mathematics Delegation to the People's Republic of China.” Association for Women in Mathematics Newsletter, Jan-Feb 1991.

F. Rosamond. “How to Break Into Print in Mathematics,” FOCUS: Newsletter of the Mathematical Association of America, 7—10, March-April (1989).

F. Rosamond. “Humanistic Elements in Problem-Solving.” Humanistic Mathematics Network Newsletter (A. White, Editor) Harvey Mudd College, 1988.

F. Rosamond. Listening to Students in the Cornell Mathematics Support Center. Ph.D. Dissertation, Cornell University, Ithaca, New York, 1981. Dissertation Abstracts.

Open Days, School Student Visits, Robot Cup, Leggo Robots, Computer Games Seminar Series, The Science and Engineering Challenge, Computer Science Unplugged! and other activities in relation to outreach for the University of Newcastle (2001-2004).

Workshops on Kid-Krypto and Computer Science Unplugged! Many places in the world including Australia, Canada, Germany, India, Norway, Switzerland, USA. Lets Talk Science, University of Victoria, British Columbia. Girl Power Program, San Diego. Beratungsstelle fuer Informatik, Aarau, Switzerland. Vancouver School District workshops for elementary school children, 2000-2001.

Developing Children's Mathematical Power Discussion LeaderWPG2. International Congress of Mathematics Education, Tokyo, August 2000.

Mathematics Is Women’s Work! Women in Mathematics Education panel, National Council of Teachers of Mathematics 77th Annual Meeting, San Francisco, April 1999.

Practices of Outstanding Teachers. Workshops at the Greater San Diego Math Conference, 1999.

Informal Mathematics and Science Learning. Workshop at the American Association of the Advancement of Science national meeting, January, 1999.

Mathematics Anxiety. Boston and Arizona radio program MATH MEDLEY, host P. Kenschaft.

Informal Mathematics and Science Learning. San Diego Radio Community Program.

Curriculum Vitae of FRANCES A. ROSAMOND Page 15

WORKSHOPS AND OTHER OUTREACH ACTIVITIES1

Neurological Implications for Adult Learning: Body, Cognition and Emotion. National Conference on Non-Traditional Learners, San Diego, October 1998.

A Successful Technology for Discussing Equity Issues (Gender, Race, Age) in Your Institution: A Program from the Mathematical Association of America: 10th Annual International Conference on Women in Higher Education, January 1997.

Equity in Mathematics Teaching and Learning. San Diego Radio program THESE DAYS, 1997.

Research Advisory Session: Reflection on Practice, NCTM, San Diego, 1996.

Student Problem Posing: Mathematics Using Periodicals. NCTM, San Diego, 1996.

Micro-inequity Skit Program. This highly successful program has been presented at the annual winter and summerfest joint MAA/AMS Mathematics meetings since 1990 and at the International Congress on Mathematics Education, Quebec. I narrate, act, help direct and script the program.

Mathematics: Success with Minority Populations. Multicultural Leadership Alliance annual Diversity Conference, San Diego, 1996.

Assessment in Pre-Service Mathematics Courses. Orlando, MAA/AMS Joint Meetings, January 1996.

Discussant and organizer of sessions held at sectional and Joint MAA meetings, such as Scholarship of Humanistic Mathematics: Use of Small Groups in Beginning and Intermediate Algebra, presented at the Joint Mathematics Meetings, January 1996.

Project PROMPT: Professors Rethinking Options in Mathematics for Prospective Teachers. Attended NSF-funded workshop in June 1995 and subsequent working reunions during the Joint Meetings and made presentations, for example: - Critical Thinking: A Comparison of a Writing and a Mathematics Class, Humboldt, June 1995. - Using Proportions to `Eyeball' Distant Heights, Humboldt State University, June 1995.

How to Succeed in College. Invited Graduation Address to the English as a Second Language Program Graduation, National University, Spring 1997 and Ecology: The Time is Now. Spring 1995.

Assessment of Prerequisite Mathematics Vocabulary Terms for Intermediate and College Algebra: Ageism in the Classroom. (Research jointly with C. Miller, Georgia State University) Presented at Special Session on Research in Undergraduate Mathematics. Joint Mathematical Meetings, 1993.

Experts and Novices in Mathematics Problem-Solving: Preliminary Study. Presented to the Center for Science and Mathematics Education at Utrecht University, Netherlands, 1991.

Engagement in Mathematics Problem-Solving. MAA/AMS Joint Meetings San Francisco, 1991.

Using Research to Influence Teaching. MAA/AMS Joint Meetings, Columbus 1990.

First International Conference on Creative Mathematical Sciences, Director and fund raiser. CDU, Darwin, Australia 2013.. Program Committee for the 2013 FAW/AAIM Conference, Dalian, China.Organizer 2012AMS Special Session: Parameterized Complexity and Incrementalization, San Diego.Program Chair for the 2011 Not-About-Graphs International Workshop, Darwin, Australia.Program Committee for the 2010 Workshop on Computational Social Choice, Dusseldorf, Germany.

Publicity Chair for International Symposium of Parameterized and Exact Computation (IPEC) ongoing. Editor of the parameterized community newsletter. Originator and moderator of the wiki.

Curriculum Vitae of FRANCES A. ROSAMOND Page 16

Reviewer for conferences, professional journals, and grant proposals including Theoretical Computer Science, Journal for Research in Mathematics Education, Journal of Mathematics and Computer Education, MAA/Tensor Grant proposals, and others.

Associate Editor for the Journal for Humanistic Mathematics 1995 - 2002.

The Mathematical Association of America:• Committee on Mathematics and the Environment.• Committee on Under-represented Minorities.• Committee on the Teaching of Undergraduate Mathematics (CTUM).• Co-chaired CTUM panel on the role of department chairs.• Co-chaired MAA/AMS Session on the Orientation and Supervision of Part-Time Instructors.• Committee on the Participation of Women. Micro-Inequity Skit Program.• Chair of the Task Force on Data Collection and Policy Issues• Representative to the JOINT-AMS-AWM-ASA-IMS-MAA-NCTM-SIAM Committee on Women

in the Mathematical Sciences. Charged with requesting MAA Board of Governors to collect and publish data on proportions of women in various activities in the association. The Board passed the motion.

• Basic Library List Review Team Leader Computer Science. National Council of Teachers of Mathematics. Local Host Committee, Technology Committee.United Nations Fourth World Conference on Women in Beijing: Repository of the UN Banner: "Mathematics Empowers Women." The Banner is displayed at conferences worldwide. Arranged for the 35,000 member Mathematical Association of America to be an official NGO of the UN Conference. Worked with local UN Association to raise funds for disadvantaged to attend.

Women in Mathematics Education: • Board of Directors, Secretary, Nominations and Elections Committee, Research Network Coordinator.

Association for Women in Mathematics. American Educational Research Association.Greater San Diego Mathematics Council. California Mathematics Council.

Peace and Justice Commission, Christ the King Church, National City, California.San Diego Science Alliance and BE-WISE Committee.Judge for the Greater San Diego Science and Engineering Fair, 1996, 1997, 1998, 1999.Families Against Drugs. Volunteer teacher for high school students in recovery. Board Member.San Diego - Vladivostok Russia Sister City Society : Founding member of this society inspired by Lowell Strombeck and James Hubbel. The society was founded during the turbulent Soviet dissolution in Fall, 1991 and now works closely with the International Affairs Board for the City of San Diego and the World Trade Center. I was on the original Steering Council and Chaired the first Committee on Higher Education and the Committee on Research in Science and Technology.

• Eurasia Foundation and Sister Cities International grant to establish Junior Achievement advanced economics "GLOBE" between Claremont High School and two schools in Vladivostok. Included opportunities for exchange visits between high school teachers. 1995-1996.

• Aboard the USS Cleveland, LSD Navy ship personally escorted medical and dental supplies collected in San Diego to Russian ships in Pearl Harbor for transport to Vladivostok. Held press conference in Pearl Harbor to thank Russian and US Navies during Commemoration of the Seas 1995.

• Organized the first Pacific Rim Business and Trade Conference, "How to do Business With the Russians" held at National University, September 1991, and a second conference in 1994.

Curriculum Vitae of FRANCES A. ROSAMOND Page 17

CIVIC AND COMMUNITY ACTIVITIES1

• Arranged Delegation visit headed by Dr. Khrapaty, Rector of the Far East Russian Academy of Sciences to National University and to Scripts Institute, 1991.

• Arranged National University’s first full scholarship--for a student from Vladivostok, presented at the United Nations Day SpaceBridge, January 1992.

San Diego United Nations Organization. Helped organize grass roots involvement in UN Fourth World Conference on Women. Designed UN Mathematics Empowers Women T-shirts to raise scholarships and awareness.

Curriculum Vitae of FRANCES A. ROSAMOND Page 18