Heather M. Guarnera

Assistant Professor of Computer Science
Department of Mathematical & Computational Sciences
The College of Wooster
Wooster, Ohio 44691
Office: Taylor Hall 303
Email: hguarnera@wooster.edu

Curriculum Vitae

Fall 2020 Teaching Schedule

CS 222 Programming Languages TBA TBA TBA
CS 100 Scientific Computing TBA TBA TBA
CS 100 Scientific Computing TBA TBA TBA

Previous Classes

Summer 2020: CS 4/56101 Design and Analysis of Algorithms 12:00 - 2:30 pm WF REMOTE
Fall 2019: CS 4/56101 Design and Analysis of Algorithms 3:45 - 5:00 pm TR SMH 108
Summer 2019: CS 4/56101 Design and Analysis of Algorithms 12:00 - 2:30 pm WF MSB 106
Spring 2019: CS 4/56101 Design and Analysis of Algorithms 12:30 - 1:45 pm MW MSB 109
Fall 2018: CS 4/56101 Design and Analysis of Algorithms 3:45 - 5:00 pm TR SMH 111
Summer 2018: CS 4/56101 Design and Analysis of Algorithms 12:00 - 2:30 pm WF MSB 106
Spring 2018: CS 10001 Computer Literacy 12:05 - 1:00 pm MWF MSB 243
Fall 2017: CS 4/56101 Design and Analysis of Algorithms 3:45 - 5:00 pm TR SMH 110
Spring 2017: CS 23022-001 Discrete Structures for CS 9:15 - 10:30 am MW SMH 110
Fall 2016: CS 23022-001 Discrete Structures for CS 3:45 - 5:00 pm TR SMH 111
Spring 2016: CS 23022-001 Discrete Structures for CS 9:15 - 10:30 am MW LCM 101

Useful Links, Software, and Libraries

  • Upcoming and past conferences in Algorithms
  • Sage is open source software for algebra and geometry experimentation. It has a library of graph algorithms for graph generation, shortest paths, coloring, centrality, asteroidal triples, comparability and permutation graphs, weakly chordal graphs, and hyperbolicity, among others.
  • GraphTea is a WYSIWYG for graph generation and visualization. It allows for creating a graph by point-click.
  • yEd is a WYSIWYG for graph generation and visualization. It allows for creating a graph by point-click, and supports a wide range of customization (fonts, colors, etc).
  • NetworkX is a Python library for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. It has a library of a variety of graph algorithms and supports reading/writing many different graph formats.
  • NetworKit is a Python library toolkit for large-scale network analysis, in the size range from thousands to billions of edges. It implements graph algorithms with a focus on parallelism and scalability.
  • D3.js is a JavaScript library for manipulating objects based on data. It has the capability of producing beautiful data driven graphs.
  • tikZ/PGF is a TeX package for generating graphics. It can create high-quality, high-precision graphs with a number of defined TeX commands that draw graphics.