From

Institution

Field

Type

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

Reset

Papers matching “parameterized complexity” 85

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics
2023 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Advanced Graph Theory Research

Christian Komusiewicz, Jannis Schramek, Frank O. Sommer

1

citations
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
2022 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research

V. Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan

0

citations
On the Parameterized Complexity of Learning First-Order Logic
2022 ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) conference-paper Computer Science Advanced Graph Theory Research

Steffen van Bergerem, Martin Grohe, Martin Ritzert

3

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 Leibniz international proceedings in informatics article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Nina Runde

0

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
On the complexity of singly connected vertex deletion
2022 Theoretical Computer Science article Computer Science Advanced Graph Theory Research

Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh

2

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
Computational Complexity of the Weisfeiler-Leman Dimension
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

citations
Reoptimization of parameterized problems
2022 Acta Informatica article Computer Science Advanced Graph Theory Research Open access

Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith

9

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2026 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

citations
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 Journal of Computer and System Sciences article Computer Science Advanced Graph Theory Research Open access

Hans L. Bodlaender, Matthew Johnson, Barnaby D. Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, +2 more

0

citations
The Complexity of Reachability in Parametric Markov Decision Processes
2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler

10

citations
How to find expressible and trainable parameterized quantum circuits?
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Peter Röseler, Dennis Willsch, Kristel F. L. Michielsen

0

citations
Parameter synthesis in Markov models
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Formal Methods in Verification Open access

Sebastian Junges

27

citations
Parameter Synthesis in Markov Models: A Gentle Survey
2022 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Nils Jansen, Sebastian Junges, Joost-Pieter Katoen

0

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
Computational complexity of graph orientation, bilevel and robust optimization problems
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Komal Muluk

0

citations
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Daniel Wiebking

8

citations
An Extended Model Including Target Turnover, Ligand–Target Complex Kinetics, and Binding Properties to Describe Drug–Receptor Interactions
2021 Methods in molecular biology book-chapter Computer Science Computational Drug Discovery Methods

Lambertus A. Peletier

3

citations
Continuous facility location on graphs
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

6

citations