Scholar
Sebastian Ordyniak
Google Scholar ID: CkB7r4MAAAAJ
University of Leeds
parameterized complexity
AI
Logic
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
1,801
H-index
24
i10-index
58
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
6 items
On the Parameterized Complexity of Min-Sum-Radii
2026
Cited
0
Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
2026
Cited
0
Backdoors for Quantified Boolean Formulas
2026
Cited
0
Optimal FPT-Approximability for Modular Linear Equations
2026
Cited
0
Explaining Decisions in ML Models: a Parameterized Complexity Analysis (Part I)
2025
Cited
0
Parameterized Approximability for Modular Linear Equations
2025
Cited
0
Resume (English only)
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