Scholar
Úrsula Hébert-Johnson
Google Scholar ID: fXyE3FAAAAAJ
PhD candidate, University of California, Santa Barbara
graph algorithms
parameterized complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
580
H-index
2
i10-index
1
Publications
8
Co-authors
0
Contact
No contact links provided.
Publications
1 items
Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
2025
Cited
0
Resume (English only)
Education
PhD: Computer Science Department at UC Santa Barbara, advisor is Daniel Lokshtanov; Bachelor's degree: Mathematics at Stanford University.
Background
Research interests: designing parameterized algorithms for NP-hard graph problems, particularly when this involves algebraic techniques.
Co-authors
0 total
Co-authors: 0 (list not available)
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up