Radu Curticapean

69 papers A* 11A 7B 7C 1Journal 34Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Beyond Bilinear Complexity: What Works and What Breaks with Many Modes? CoRR Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang
2026	J	`jnl`	Beyond Bilinear Complexity: What Works and What Breaks with Many Modes? Electron. Colloquium Comput. Complex. Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang
2026	—	`conf`	Faster Convolutions: Yates and Strassen Revisited. SOSA Cornelius Brand, Radu Curticapean, Baitian Li, Kevin Pratt
2025	A	`conf`	Can You Link Up With Treewidth? STACS Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang
2025	A*	`conf`	Counting Small Induced Subgraphs: Hardness via Fourier Analysis. SODA Radu Curticapean, Daniel Neuen
2025	A	`conf`	Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. ESA Radu Curticapean, Simon Döring, Daniel Neuen
2025	J	`jnl`	Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. CoRR Radu Curticapean, Simon Döring, Daniel Neuen
2025	A*	`conf`	Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. SODA Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt
2025	J	`jnl`	Faster Convolutions: Yates and Strassen Revisited. CoRR Cornelius Brand, Radu Curticapean, Baitian Li, Kevin Pratt
2025	B	`conf`	Monotone Bounded-Depth Complexity of Homomorphism Polynomials. MFCS C. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi
2025	J	`jnl`	Monotone Bounded-Depth Complexity of Homomorphism Polynomials. CoRR C. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi
2025	B	`conf`	Which Graph Motif Parameters Count? MFCS Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer
2025	J	`jnl`	Which graph motif parameters count? CoRR Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer
2024	J	`jnl`	Can You Link Up With Treewidth? CoRR Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang
2024	J	`jnl`	Chromatic number in 1.9999 CoRR Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt
2024	A*	`conf`	Count on CFI graphs for #P-hardness. SODA Radu Curticapean
2024	J	`jnl`	Counting Small Induced Subgraphs: Hardness via Fourier Analysis. CoRR Radu Curticapean, Daniel Neuen
2023	J	`jnl`	Count on CFI graphs for #P-hardness. CoRR Radu Curticapean
2022	A	`conf`	Determinants from Homomorphisms. ESA Radu Curticapean
2022	J	`jnl`	Determinants from homomorphisms. CoRR Radu Curticapean
2022	—	`conf`	On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
2022	J	`jnl`	On the VNP-hardness of Some Monomial Symmetric Polynomials. Electron. Colloquium Comput. Complex. Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
2022	—	`conf`	Parameterizing the Permanent: Hardness for fixed excluded minors. SOSA Radu Curticapean, Mingji Xia
2021	A*	`conf`	A full complexity dichotomy for immanant families. STOC Radu Curticapean
2021	J	`jnl`	A full complexity dichotomy for immanant families. CoRR Radu Curticapean
2021	A	`conf`	Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA Radu Curticapean, Holger Dell, Thore Husfeldt
2021	J	`jnl`	Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. CoRR Radu Curticapean, Holger Dell, Thore Husfeldt
2021	J	`jnl`	Parameterizing the Permanent: Hardness for K CoRR Radu Curticapean, Mingji Xia
2019	J	`jnl`	A Fixed-Parameter Perspective on #BIS. Algorithmica Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
2019	J	`jnl`	Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. Theory Comput. Syst. Radu Curticapean, Holger Dell, Marc Roth
2019	J	`jnl`	Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
2019	—	`conf`	Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
2019	B	`conf`	The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. WG Hubie Chen, Radu Curticapean, Holger Dell
2018	A*	`conf`	A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. SODA Radu Curticapean, Nathan Lindzey, Jesper Nederlof
2018	J	`jnl`	Block interpolation: A framework for tight exponential-time counting complexity. Inf. Comput. Radu Curticapean
2018	B	`conf`	Counting Problems in Parameterized Complexity. IPEC Radu Curticapean
2017	B	`conf`	A Fixed-Parameter Perspective on #BIS. IPEC Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
2017	J	`jnl`	A Fixed-Parameter Perspective on #BIS. CoRR Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
2017	J	`jnl`	A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. CoRR Radu Curticapean, Nathan Lindzey, Jesper Nederlof
2017	A	`conf`	Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. STACS Radu Curticapean, Holger Dell, Marc Roth
2017	J	`jnl`	Counting edge-injective homomorphisms and matchings on restricted graph classes. CoRR Radu Curticapean, Holger Dell, Marc Roth
2017	A*	`conf`	Finding Detours is Fixed-Parameter Tractable. ICALP Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
2017	J	`jnl`	Homomorphisms Are a Good Basis for Counting Small Subgraphs. CoRR Radu Curticapean, Holger Dell, Dániel Marx
2017	A*	`conf`	Homomorphisms are a good basis for counting small subgraphs. STOC Radu Curticapean, Holger Dell, Dániel Marx
2016	A	`conf`	Counting Matchings with k Unmatched Vertices in Planar Graphs. ESA Radu Curticapean
2016	J	`jnl`	Counting matchings with k unmatched vertices in planar graphs. CoRR Radu Curticapean
2016	J	`jnl`	Finding Detours is Fixed-parameter Tractable. CoRR Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
2016	A*	`conf`	Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. ICALP Radu Curticapean
2016	J	`jnl`	The simple, little and slow things count: on parameterized counting complexity. Bull. EATCS Radu Curticapean
2016	A*	`conf`	Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. SODA Radu Curticapean, Dániel Marx
2015	J	`jnl`	A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. Algorithmica Radu Curticapean, Marvin Künnemann
2015	—	`conf`	Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity. ICALP (1) Radu Curticapean
2015	J	`jnl`	Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity. CoRR Radu Curticapean
2015	J	`jnl`	Counting Triangulations and Other Crossing-Free Structures via Onion Layers. Discret. Comput. Geom. Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
2015	—	`ch.`	Die einfachen, kleinen und langsamen Dinge zählen: Über die parametrisierte Komplexität von Zählproblemen. Ausgezeichnete Informatikdissertationen Radu Curticapean
2015	A*	`conf`	Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k. FOCS Radu Curticapean, Mingji Xia
2015	J	`jnl`	Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k. CoRR Radu Curticapean, Mingji Xia
2015	J	`jnl`	Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. CoRR Radu Curticapean
2015	—	`—`	The simple, little and slow things count: on parameterized counting complexity. Radu Curticapean
2014	A*	`conf`	Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. FOCS Radu Curticapean, Dániel Marx
2014	J	`jnl`	Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts. CoRR Radu Curticapean, Dániel Marx
2014	J	`jnl`	Counting perfect matchings in graphs that exclude a single-crossing minor. CoRR Radu Curticapean
2013	A	`conf`	A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. ESA Radu Curticapean, Marvin Künnemann
2013	C	`conf`	A quantization framework for smoothed analysis on Euclidean optimization problems. CTW Radu Curticapean, Marvin Künnemann
2013	—	`conf`	Counting Matchings of Size k Is W[1]-Hard. ICALP (1) Radu Curticapean
2013	J	`jnl`	Counting Triangulations and other Crossing-free Structures via Onion Layers. CoRR Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
2012	—	`conf`	Counting crossing-free structures. SCG Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray
2012	B	`conf`	Weighted Counting of k-Matchings Is #W[1]-Hard. IPEC Markus Bläser, Radu Curticapean
2011	B	`conf`	The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. MFCS Markus Bläser, Radu Curticapean