Martha Osegueda

C.S. Ph.D. Student
at UC Irvine

mosegued (at)

About Me

I am a second year Computer Science Ph.D. Student in the Center for Algorithms and Theory Group at the University of California, Irvine. I received my Bachelors in Computer Science from the University of Texas at El Paso in 2017.
Recently, I've been worked on problems in Graph Drawing concerning minimum width drawings of phylogenetic trees and minimizing crossings in knight tours. I also worked on the visualization team of JAAM , which visualizes Java byte-code to find vulnerabilities.

Research Interests

My main research interests include graph algorithms, graph drawing and computational geometry.


  • Poster presented at Graph Drawing 2018: Juan Jose Besa, Timothy Johnson, Nil Mamano, Martha Osegueda."Taming the Knight's Tour: Minimizing Turns and Crossings".
Undergraduate Work:
  • Presented: Kosheleva, O., Kreinovich, K., Osegueda, M. , & Kato, K. "Towards the Most Robust Way of Assigning Numerical Degrees to Ordered Labels, With Possible Applications to Dark Matter and Dark Energy", 2016 Annual Conference of the North American Fuzzy Information Processing Society, El Paso, Texas, 2016.
  • Osegueda, M., Kreinovich, V., "How to Compute von Neumann-Morgenstern Solutions". Mathematical Structures and Modeling, 2016.

Teaching Experience

  • TA CompSci 161 - Design and Analysis of Algorithms (Summer10wk,Fall 2018)
  • Reader CompSci 260P - Data Structures (Spring 2018)
  • Reader CompSci 161 - Design and Analysis of Algorithms (Fall 2017, Winter 2018)
  • Undergraduate TA CS1401- Intro to CS (Spring and Fall 2016, Spring 2017) at UTEP
  • Peer-Leader CS1401 - Intro to CS (Fall 2014) and CS2401 - Intro to Data Struct. and Algs. (Spring 2015) at UTEP