Skip to content

Author

Peter Jonsson

We have 1 of 11 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference Jul 2026

Maximum Satisfiability of Simple Temporal Problems

The results suggest that MaxSTP is often computationally harder than optimizing qualitative CSPs - it is verified that many such problems are FPT when parameterized by n or tw, and it is demonstrated that FPT algorithms for MaxSTP are indeed possible but with other parameters such as k + vc.

J. Fichte, Johanna Groven, Peter Jonsson et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.