From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “fixed-parameter tractable algorithms” 15

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Alexis de Colnet, Floris Geerts, Rihan Hai, Alfons Laarman, Joon Hyung Lee, Guillermo A. Pérez

0

citations
Data and source-code artifact for Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Alexis de Colnet, Floris Geerts, Rihan Hai, Alfons Laarman, J. Lee, Guillermo A. Pérez

0

citations
On the Parameterized Complexity of Learning First-Order Logic
2021 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Martin Ritzert

0

citations
Isomorphism Testing Parameterized by Genus and Beyond
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Daniel Neuen

4

citations
The Complexity of Homomorphism Reconstructibility
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

1

citations
The Complexity of Homomorphism Reconstructibility
2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

0

citations
Precedence constraints in combinatorial optimization
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Corinna Mathwieser

0

citations
An Improved Isomorphism Test for Bounded-tree-width Graphs
2020 ACM Transactions on Algorithms article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking

14

citations
On the Impact of Stability and the Helly Property on the Dominating Set Problem
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Che Cheng, Daniel Mock, Peter Rossmanith

0

citations
Isomorphism for Tournaments of Small Twin Width
2026 TheoretiCS article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

0

citations
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Tim Seppelt

1

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2023 HAL (Le Centre pour la Communication Scientifique Directe) conference-paper Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Nina Runde

0

citations
Recognizing Proper Tree-Graphs
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dušan Knop

2

citations
Recognizing Proper Tree-Graphs
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Graph Theory Research Open access

Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dušan Knop

1

citations

15 results