40 citations · 45 across the 4 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2021
On Algorithms Based on Finitely Many Homomorphism Counts
Yijia Chen, Jörg Flum, Mingjun Liu +1
It is well known [Lovász, 67] that up to isomorphism a graph~ is determined by the homomorphism counts , i.e., the number of homomorphisms from to , where …
cs.CC2005★ 40 cited
Model-Checking Problems as a Basis for Parameterized Intractability
Joerg Flum, Martin Grohe
Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For exa…
cs.CC1999
Fixed-parameter tractability, definability, and model checking
Joerg Flum, Martin Grohe
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized m…