default search action
Radu Curticapean
Person information
- affiliation: IT University of Copenhagen, Denmark
- affiliation (former): Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Radu Curticapean:
Count on CFI graphs for #P-hardness. SODA 2024: 1854-1871 - [i22]Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt:
Chromatic number in 1.9999n time? Fast deterministic set partitioning under the asymptotic rank conjecture. CoRR abs/2404.04987 (2024) - [i21]Radu Curticapean, Daniel Neuen:
Counting Small Induced Subgraphs: Hardness via Fourier Analysis. CoRR abs/2407.07051 (2024) - [i20]Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang:
Can You Link Up With Treewidth? CoRR abs/2410.02606 (2024) - 2023
- [i19]Radu Curticapean:
Count on CFI graphs for #P-hardness. CoRR abs/2305.04767 (2023) - 2022
- [c24]Radu Curticapean:
Determinants from Homomorphisms. ESA 2022: 38:1-38:7 - [c23]Radu Curticapean, Nutan Limaye, Srikanth Srinivasan
:
On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS 2022: 16:1-16:14 - [c22]Radu Curticapean, Mingji Xia:
Parameterizing the Permanent: Hardness for fixed excluded minors. SOSA 2022: 297-307 - [i18]Radu Curticapean:
Determinants from homomorphisms. CoRR abs/2204.10718 (2022) - [i17]Radu Curticapean, Nutan Limaye, Srikanth Srinivasan:
On the VNP-hardness of Some Monomial Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c21]Radu Curticapean, Holger Dell, Thore Husfeldt:
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA 2021: 34:1-34:17 - [c20]Radu Curticapean
A full complexity dichotomy for immanant families. STOC 2021: 1770-1783 - [i16]Radu Curticapean:
A full complexity dichotomy for immanant families. CoRR abs/2102.04340 (2021) - [i15]Radu Curticapean, Holger Dell, Thore Husfeldt:
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. CoRR abs/2107.00629 (2021) - [i14]Radu Curticapean, Mingji Xia:
Parameterizing the Permanent: Hardness for K8-minor-free graphs. CoRR abs/2108.12879 (2021)
2010 – 2019
- 2019
- [j7]Radu Curticapean, Holger Dell, Fedor V. Fomin
A Fixed-Parameter Perspective on #BIS. Algorithmica 81(10): 3844-3864 (2019) - [j6]Radu Curticapean, Holger Dell, Marc Roth
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. Theory Comput. Syst. 63(5): 987-1026 (2019) - [j5]Ivona Bezáková, Radu Curticapean, Holger Dell
Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33(4): 2326-2345 (2019) - [c19]Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS 2019: 8:1-8:20 - [c18]Hubie Chen, Radu Curticapean, Holger Dell:
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. WG 2019: 364-378 - 2018
- [j4]Radu Curticapean:
Block interpolation: A framework for tight exponential-time counting complexity. Inf. Comput. 261: 265-280 (2018) - [c17]Radu Curticapean:
Counting Problems in Parameterized Complexity. IPEC 2018: 1:1-1:18 - [c16]Radu Curticapean, Nathan Lindzey, Jesper Nederlof
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. SODA 2018: 1080-1099 - 2017
- [c15]Ivona Bezáková, Radu Curticapean, Holger Dell
Finding Detours is Fixed-Parameter Tractable. ICALP 2017: 54:1-54:14 - [c14]Radu Curticapean, Holger Dell, Fedor V. Fomin
A Fixed-Parameter Perspective on #BIS. IPEC 2017: 13:1-13:13 - [c13]Radu Curticapean, Holger Dell
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. STACS 2017: 25:1-25:15 - [c12]Radu Curticapean, Holger Dell
Homomorphisms are a good basis for counting small subgraphs. STOC 2017: 210-223 - [i13]Radu Curticapean, Holger Dell, Marc Roth:
Counting edge-injective homomorphisms and matchings on restricted graph classes. CoRR abs/1702.05447 (2017) - [i12]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. CoRR abs/1702.05543 (2017) - [i11]Radu Curticapean, Holger Dell, Dániel Marx:
Homomorphisms Are a Good Basis for Counting Small Subgraphs. CoRR abs/1705.01595 (2017) - [i10]Radu Curticapean, Nathan Lindzey, Jesper Nederlof:
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. CoRR abs/1709.02311 (2017) - 2016
- [j3]Radu Curticapean:
The simple, little and slow things count: on parameterized counting complexity. Bull. EATCS 120 (2016) - [c11]Radu Curticapean:
Counting Matchings with k Unmatched Vertices in Planar Graphs. ESA 2016: 33:1-33:17 - [c10]Radu Curticapean:
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. ICALP 2016: 47:1-47:14 - [c9]Radu Curticapean, Dániel Marx:
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. SODA 2016: 1650-1669 - [i9]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-parameter Tractable. CoRR abs/1607.07737 (2016) - [i8]Radu Curticapean:
Counting matchings with k unmatched vertices in planar graphs. CoRR abs/1607.08192 (2016) - 2015
- [b1]Radu Curticapean:
The simple, little and slow things count: on parameterized counting complexity. Saarland University, 2015 - [j2]Radu Curticapean, Marvin Künnemann:
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. Algorithmica 73(3): 483-510 (2015) - [j1]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting Triangulations and Other Crossing-Free Structures via Onion Layers. Discret. Comput. Geom. 53(4): 675-690 (2015) - [c8]Radu Curticapean, Mingji Xia:
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k. FOCS 2015: 994-1009 - [c7]Radu Curticapean:
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity. ICALP (1) 2015: 380-392 - [p1]Radu Curticapean:
Die einfachen, kleinen und langsamen Dinge zählen: Über die parametrisierte Komplexität von Zählproblemen. Ausgezeichnete Informatikdissertationen 2015: 71-80 - [i7]Radu Curticapean, Mingji Xia:
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k. CoRR abs/1511.02321 (2015) - [i6]Radu Curticapean:
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity. CoRR abs/1511.02910 (2015) - [i5]Radu Curticapean:
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. CoRR abs/1511.07480 (2015) - 2014
- [c6]Radu Curticapean, Dániel Marx:
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. FOCS 2014: 130-139 - [i4]Radu Curticapean:
Counting perfect matchings in graphs that exclude a single-crossing minor. CoRR abs/1406.4056 (2014) - [i3]Radu Curticapean, Dániel Marx:
Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts. CoRR abs/1407.2929 (2014) - 2013
- [c5]Radu Curticapean, Marvin Künnemann:
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. ESA 2013: 349-360 - [c4]Radu Curticapean:
Counting Matchings of Size k Is W[1]-Hard. ICALP (1) 2013: 352-363 - [i2]Radu Curticapean, Marvin Künnemann:
A quantization framework for smoothed analysis on Euclidean optimization problems. CTW 2013: 71-74 - [i1]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting Triangulations and other Crossing-free Structures via Onion Layers. CoRR abs/1312.4628 (2013) - 2012
- [c3]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting crossing-free structures. SCG 2012: 61-68 - [c2]Markus Bläser, Radu Curticapean:
Weighted Counting of k-Matchings Is #W[1]-Hard. IPEC 2012: 171-181 - 2011
- [c1]Markus Bläser, Radu Curticapean:
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. MFCS 2011: 96-107
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: