Associate Professor, Department of Mathematics and Computer Science
“I’m excited to be involved in a program that focuses on cutting-edge data analytics techniques. We built this program by carefully thinking about the skills and knowledge graduates will need in the field, and, based on that, developed a rigorous program that offers a well-balanced mix of mathematics, computer science, practical experience, ethical considerations, and professional preparedness. It’s a comprehensive education for someone who wants to enter the profession or who is already involved in it but wants a more thorough and thoughtful foundation.”
Ewa Misiolek’s main focus as an educator is to provide dedicated, one-on-one attention to her students and help them grow in their knowledge and professional skills. In addition to teaching, she has published numerous works on topics ranging from efficient algorithm development and path optimization, among others.
PhD, University of Notre Dame
MSCSE, University of Notre Dame
MA, Stony Brook University (SUNY)
Area of Expertise
Algorithm design and analysis
Computer aided manufacturing
Mathematics and computer science education
Graduate Courses Taught
CPSC 529: Database Systems
DSCI 501: Data Mining
- Association for Computing Machinery
- ACM Special Interest Group on Knowledge Discovery in Data
- ACM Special Interest Group on Management of Data
- ACM Special Interest Group on Computer Science Education
- Pi Mu Epsilon (mathematics honor society)
- Upsilon Pi Epsilon (computer science honor society)
“Development of Four-Square Fiducial Markers for Analysis of Paper Analytical Devices,” with J. Wilson, T. Ricketts, I. Bentley, American Journal of Undergraduate Research, 13(2):15-28, 2016.
“Algorithms for Interval Structures with Applications,” with D.Z. Chen, Theoretical Computer Science, 508:41-53, 2013.
“Computing Toolpaths for 5-Axis Machines”, with D.Z. Chen, Theoretical Computer Science, 447(17):13-25, 2012.
“Flattening Topologically Spherical Surface,” with D.Z. Chen, Journal of Combinatorial Optimization, 23(3):309–321, 2012.
“Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing,” PhD Dissertation, Department of Computer Science and Engineering, University of Notre Dame, 2011.
“Free-Form Surface Partition in 3-D,” with D.Z. Chen, International Journal of Computational Geometry and Applications, 21(6):609–634, 2011.
“Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy,” with N. Bansal, D.Z. Chen, D. Coppersmith, X.S. Hu, S. Luan, B. Schieber, C. Wang, Algorithmica, 60(2):421–450, 2011.
“Algorithms for Interval Structures with Applications,” with D.Z. Chen, Proceedings of the 5th International Frontiers of Algorithmics Workshop (FAW '11), Lecture Notes in Computer Science, 6681:196–207, 2011.
“Computing Feasible Toolpaths for 5-Axis Machines,” with D.Z. Chen, Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA '10), Lecture Notes in Computer Science, 6508:270–284, Springer, 2010.
“Finding Many Optimal Paths without Growing Any Optimal Path Trees,” with D.Z. Chen, International Journal of Computational Geometry and Applications, 20(4):449–469, World Scientific, 2010.
“Free-Form Surface Partition in 3-D,” with D.Z. Chen, Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC '08), Lecture Notes in Computer Science, 5369:520–531, Springer, 2008.
“Stabbing Convex Polygons with a Segment or a Polygon,” with P.K. Agarwal, D.Z. Chen, S.K. Ganjugunte, M. Sharir, and K. Tang, Proceedings of the 16th Annual European Symposium on Algorithms (ESA '08), Lecture Notes in Computer Science, 5193:52–63, Springer, 2008.
"Stabbing Geometric Objects with a Short Stabber", with D.Z. Chen and K. Tang, 2006.