Radu Curticapean
Scholar

Radu Curticapean

Google Scholar ID: 5MeyUVQAAAAJ
University of Regensburg, IT University of Copenhagen
Counting ComplexityParameterized Complexity
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
511
 
H-index
11
 
i10-index
14
 
Publications
20
 
Co-authors
10
list available
Contact
No contact links provided.
Publications
6 items
Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
2026
Cited
0
Which graph motif parameters count?
2025
Cited
0
Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
2025
Cited
0
Faster Convolutions: Yates and Strassen Revisited
2025
Cited
0
Monotone Bounded-Depth Complexity of Homomorphism Polynomials
2025
Cited
0
Can You Link Up With Treewidth?
Symposium on Theoretical Aspects of Computer Science · 2024
Cited
0
Resume (English only)
Co-authors
10 total
Holger Dell
Holger Dell
IT University of Copenhagen
Dániel Marx
Dániel Marx
CISPA Helmholtz Center for Information Security
夏盟佶 Xia, Mingji
夏盟佶 Xia, Mingji
Institute of software
Fedor V. Fomin
Fedor V. Fomin
Professor of Computer Science, University of Bergen
Saurabh Ray
Saurabh Ray
NYU Abu Dhabi
Karl Bringmann
Karl Bringmann
Professor in Computer Science, Saarland University
Co-author 7
Co-author 7
Markus Bläser
Markus Bläser
Saarland University, Saarland Informatics Campus, Saarbrücken, Germany