Radu Curticapean

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2022

On the VNP-hardness of Some Monomial Symmetric Polynomials.

[BibT_eX]

[DOI]

Nutan Limaye

Srikanth Srinivasan

Electron. Colloquium Comput. Complex., 2022

Parameterizing the Permanent: Hardness for fixed excluded minors.

[BibT_eX]

[DOI]

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Determinants from Homomorphisms.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Parameterizing the Permanent: Hardness for K<sub>8</sub>-minor-free graphs.

[BibT_eX]

[DOI]

CoRR, 2021

A full complexity dichotomy for immanant families.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths.

[BibT_eX]

[DOI]

Thore Husfeldt

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2019

Finding Detours is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes.

[BibT_eX]

[DOI]

Marc Roth

Theory Comput. Syst., 2019

A Fixed-Parameter Perspective on #BIS.

[BibT_eX]

[DOI]

Algorithmica, 2019

The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms.

[BibT_eX]

[DOI]

Hubie Chen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Parameterized Streaming Algorithms for Min-Ones d-SAT.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Block interpolation: A framework for tight exponential-time counting complexity.

[BibT_eX]

[DOI]

Inf. Comput., 2018

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.

[BibT_eX]

[DOI]

Nathan Lindzey

Jesper Nederlof

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Counting Problems in Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

2017

Homomorphisms are a good basis for counting small subgraphs.

[BibT_eX]

[DOI]

Dániel Marx

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

The simple, little and slow things count: on parameterized counting complexity.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus.

[BibT_eX]

[DOI]

Dániel Marx

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Parity Separation: A Scientifically Proven Method for Permanent Weight Loss.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Counting Matchings with k Unmatched Vertices in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

The simple, little and slow things count: on parameterized counting complexity.

[BibT_eX]

[DOI]

PhD thesis, 2015

Counting Triangulations and Other Crossing-Free Structures via Onion Layers.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k.

[BibT_eX]

[DOI]

CoRR, 2015

A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems.

[BibT_eX]

[DOI]

Marvin Künnemann

Algorithmica, 2015

Die einfachen, kleinen und langsamen Dinge zählen: Über die parametrisierte Komplexität von Zählproblemen.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2015, 2015

Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Counting perfect matchings in graphs that exclude a single-crossing minor.

[BibT_eX]

[DOI]

CoRR, 2014

Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts.

[BibT_eX]

[DOI]

Dániel Marx

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Counting Matchings of Size k Is W[1]-Hard.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Weighted Counting of k-Matchings Is #W[1]-Hard.

[BibT_eX]

[DOI]

Markus Bläser

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Counting crossing-free structures.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree.

[BibT_eX]

[DOI]

Markus Bläser