# Manuel Bodirsky

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from

**publisher and metadata sources**).A constraint satisfaction problem (CSP) is a computational problem where the input consists of a finite set of variables and a finite set of constraints, and where the task is to decide whether there… Continue Reading

A temporal constraint language is a set of relations that has a first-order definition in (b Q,<), the dense linear order of the rational numbers. We present a complete complexity classification of… Continue Reading

We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that count all such graphs with n… Continue Reading

We show that the number g"n of labelled series-parallel graphs on n vertices is asymptotically g"[email protected]?n^-^5^/^[email protected]^nn!, where @c and g are explicit computable constants. We… Continue Reading

Many constraint satisfaction problems have a natural formulation as a homomorphism problem. For a fixed relational structure Gamma we consider the following computational problem: Given a structure S… Continue Reading

We show that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem Lan… Continue Reading

We relate the expressive power of Datalog and constraint satisfaction with infinite templates. The relationship is twofold: On the one hand, we prove that every non-empty problem that is closed under… Continue Reading

This paper investigates drawings (totally ordered forests) as models of syntactic structure. It oers a new model-based perspective on lexicalised Tree Adjoining Grammar by characterising a class of… Continue Reading

For a fixed countably infinite structure Γ with finite relational signature τ , we study the following computational problem: input are quantifier-free τ -formulas ϕ 0 , ϕ 1 , …, ϕ n that define… Continue Reading