Allt med:
Peter Jonsson

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian och Osipov, George, Algorithms and complexity of difference logic, Journal of computer and system sciences (Print), 2026, 159

Rossi, Matteo, Hey Tow, Kenny, Pereira, Joao, Soriano-Amat, Miguel, Van Dert Berg, Harald, Sandsten, Maria, Jonsson, Peter och Vignoli, Giulio, Vibration Monitoring And Passive Seismic Exploration Of Rock Mass Via Fibre Optic Sensing [Elektronisk resurs], 2025, Stiftelsen Bergteknisk Forskning, Stockholm

Jonsson, Peter, Starka kvinnor : 50 enkla och effektiva övningar för alla miljöer, 2024, Första upplagan, Stevali fakta, Kalmar

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian och Osipov, George, Solving infinite-domain CSPs using the patchwork property [Elektronisk resurs], Artificial Intelligence, 2023, 317

Grundelius, Anki, Törnqvist, Desirée, Wendelin, Eva, Silfwerbrand, Fredrik, Norberg, Håkan, Nilsson, Jörgen, Kittendorff, Matilda, Boman, Marlene, Fröling, Mia, Jonsson, Peter och Reinholdsson, Stefan, Rapport 2022–17 Att genomföra en satsning på naturnära jobb för personer som står långt från arbetsmarknaden [Elektronisk resurs], 2023, Ryding, Tina

Grundelius, Anki, Törnqvist, Desirée, Wendelin, Eva, Silfwerbrand, Fredrik, Norberg, Håkan, Nilsson, Jörgen, Kittendorff, Matilda, Boman, Marlene, Fröling, Mia, Jonsson, Peter, Reinholdsson, Stefan och Ryding, Tina, Rapport 2022 17 Att genomföra en satsning på naturnära jobb för personer som står långt från arbetsmarknaden [Elektronisk resurs], 2023, Skogsstyrelsen

Jonsson, Peter och Lagerkvist, Victor, General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs [Elektronisk resurs], Algorithmica, 2023, 85 nr 1, 188–215

Bäckström, Christer och Jonsson, Peter, A framework for analysing state-abstraction methods [Elektronisk resurs], Artificial Intelligence, 2022, 302

Jonsson, Peter, Lagerkvist, Victor och Ordyniak, Sebastian, Computational Short Cuts in Infinite Domain Constraint Satisfaction [Elektronisk resurs], The journal of artificial intelligence research, 2022, 75, 793–831

Olausson, Bettina, Törnqvist, Desirée, Wendelin, Eva, Granath, Fredrik, Norberg, Håkan, Nilsson, Jörgen, Boman, Marlene, Kittendorff, Matilda, Fröling, Mia, Jonsson, Peter, Reinholdsson, Stefan och Ryding, Tina, Delrapport _ Att genomföra en satsning på naturnära jobb för personer som står långt ifrån arbetsmarknaden – Rapport 2022 02 [Elektronisk resurs], 2022, Silfwerbrand, Fredrik

Johansson, Niklas, A resource for quantum computation, 2021, Department of Electrical Engineering, Linköping University, Linköping

Jonsson, Peter, Lagerkvist, Victor och Osipov, George, Acyclic orders, partition schemes and CSPs [Elektronisk resurs] Unified hardness proofs and improved algorithms, Artificial Intelligence, 2021, 296

Jonsson, Peter, Lagerkvist, Victor och Roy, Biman, Fine-Grained Time Complexity of Constraint Satisfaction Problems [Elektronisk resurs], ACM Transactions on Computation Theory, 2021, 13 nr 1

Jonsson, Peter, Lagerkvist, Victor, Schmidt, Johannes och Uppman, Hannes, The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems [Elektronisk resurs], Theoretical Computer Science, 2021, 892

Kimenga, Bemvindo, Nilsson, Jörgen, Jonsson, Peter, Granath, Fredrik, Ingvald, Erika, Wendelin, Eva, Silfwerbrand, Fredrik, Kittendorff, Matilda, Boman, Marlene, Törnqvist, Desirée och Reinholdsson, Stefan, Naturnära jobb-att genomföra en satsning på naturnära jobb för personer som står långt från arbetsmarknaden-delrapport – Rapport 2021 02 [Elektronisk resurs], 2021

Shleyfman, Alexander och Jonsson, Peter, Computational Complexity of Computing Symmetries in Finite-Domain Planning [Elektronisk resurs], The journal of artificial intelligence research, 2021, 70, 1183–1221

Biman, Roy, Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems, 2020, Department of Computer Science and Information Science, Linköping University, Linköping

Lantisar, 2020, Majeng Media, Borås

Berthet, Théo, Eriksson, Christian, Gunnarsson, Fredrik, Jonsson, Peter, Kittendorff, Matilda, Nilsson, Jörgen, Sjö, Maria, Sollander, Erik, Styffe, Stefan, Tedegren, Robert och Telhammer, Andreas, Tillvarata jobbpotentialen i de gröna näringarna – Naturnära jobb – Rapport 2019 05 [Elektronisk resurs], 2019

Lantisar [Elektronisk resurs], 2019, Backa Studios

Lantisar, 2019, Backa Studios

Carlsson, Viveka, Nilsson, Jörgen, Jonsson, Peter, Sjö, Maria, Byström, Charlotte, Ingvald, Erika, Telhammer, Andreas, Sollander, Erik, Sollander, Erik, Gunnarsson, Fredrik, Kittendorff, Matilda, Eriksson, Christian och Larsson, Jonas, Tillvarata jobbpotentialen i de gröna näringarna – Naturnära jobb – Rapport 2018 08 [Elektronisk resurs], 2018

Kuhlmann, Marco, Satta, Giorgio och Jonsson, Peter, On the Complexity of CCG Parsing [Elektronisk resurs], Computational linguistics – Association for Computational Linguistics (Print), 2018, 44 nr 3, 447–482

Tedegren, Robert, Nilsson, Jörgen, Jonsson, Peter, Sjö, Maria, Johansson, Kerstin, Ingvald, Erika, Sollander, Erik, Gunnarsson, Fredrik, Kittendorff, Matilda och Eriksson, Christian, Tillvarata jobbpotentialen i de gröna näringarna – Naturnära jobb – Rapport 2018 14 [Elektronisk resurs], 2018

Aghighi, Meysam, Computational Complexity of some Optimization Problems in Planning [Elektronisk resurs], 2017, Department of Computer and Information Science, Linköping University, Linköping

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian och Osipov, George, Algorithms and complexity of difference logic, Journal of computer and system sciences (Print), 2026, 159, : ACADEMIC PRESS INC ELSEVIER SCIENCE

Dabrowski, Konrad k., Jonsson, Peter, Ordyniak, Sebastian, Osipov, George och Wahlstrom, Magnus, Almost Consistent Systems of Linear Equations, ACM Transactions on Algorithms, 2025, 21 nr 4, : ASSOC COMPUTING MACHINERY

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian, Osipov, George och Wahlström, Magnus, Parameterized Approximability for Modular Linear Equations, Proc. 33rd Annual European Symposium on Algorithms (ESA-2025), 2025, : Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Dahlin, Torleif, Hedblom, Per, Prayag, Ankita, Abu Jaish, Yaman, Jonsson, Peter, Rossi, Matteo, Hägg, Kristofer och Martin, Tina, DCIP monitoring installation at Vomb MAR, 2025

Prayag, Ankita, Dahlin, Torleif, Hedblom, Per, Abu Jaish, Yaman, Jonsson, Peter, Rossi, Matteo, Hägg, Kristofer och Martin, Tina, Geophysical Monitoring of Infiltration Processes in a Managed Artificial Recharge Pond – Part A, 2025

Prayag, Ankita, Dahlin, Torleif, Hedblom, Per, Abu Jaish, Yaman, Jonsson, Peter, Rossi, Matteo, Hägg, Kristofer och Martin, Tina, Geophysical Monitoring of Infiltration Processes in a Managed Artificial Recharge Pond – Part B, 2025

Bodirsky, Manuel, Jonsson, Peter, Martin, Barnaby, Mottet, Antoine och Semanišinová, Žaneta, Complexity Classification Transfer for CSPs via Algebraic Products, SIAM journal on computing (Print), 2024, 53 nr 5, s. 1293–1353, : Society for Industrial & Applied Mathematics (SIAM)

Jonsson, Peter, Lagerkvist, Victor och Osipov, George, CSPs with Few Alien Constraints, 30TH INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2024, 2024, : SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS

Osipov, George, On Infinite-Domain CSPs Parameterized by Solution Cost, 2024, Linköping University Electronic Press, Linköping

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian, Osipov, George och Wahlström, Magnus, Almost Consistent Systems of Linear Equations, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023,, s. 3179–3217, Philadelphia, PA : Society for Industrial and Applied Mathematics

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian, Osipov, George, Pilipczuk, Marcin och Sharma, Roohani, Parameterized Complexity Classification for Interval Constraints, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023,, s. 11 nr 1–11 nr 19, Saarbrücken/Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian och Osipov, George, Solving infinite-domain CSPs using the patchwork property, Artificial Intelligence, 2023, 317, : ELSEVIER

Fornasier, Marco, Wennmalm, Stefan, Andersson, Alexandra, Sparr, Emma och Jonsson, Peter, Effect of the negative lipid fraction on alpha-synuclein cooperativity and binding, European Biophysics Journal, 2023, 52 nr SUPPL 1, s. S81-S81, : SPRINGER

Gnad, Daniel, Helmert, Malte, Jonsson, Peter och Shleyfman, Alexander, Planning over Integers: Compilations and Undecidability, Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023,, s. 148–152, Cambridge, MA : AAAI Press

Jonsson, Peter och Lagerkvist, Victor, General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs, Algorithmica, 2023, 85 nr 1, s. 188–215, : Springer

Martin, Tina och Jonsson, Peter, Preventing the brownification of water, 2023

Shleyfman, Alexander, Gnad, Daniel och Jonsson, Peter, Structurally Restricted Fragments of Numeric Planning – a Complexity Analysis, THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 10, 2023,, s. 12112–12119, : ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE

Bäckström, Christer och Jonsson, Peter, A framework for analysing state-abstraction methods, Artificial Intelligence, 2022, 302, : Elsevier

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian och Osipov, George, Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach, THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022,, s. 3724–3732, : ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE

Jonsson, Peter, Lagerkvist, Victor och Ordyniak, Sebastian, Computational Short Cuts in Infinite Domain Constraint Satisfaction, The journal of artificial intelligence research, 2022, 75, s. 793–831, : AI ACCESS FOUNDATION

Bäckström, Christer, Jonsson, Peter och Ordyniak, Sebastian, Cost-Optimal Planning, Delete Relaxation, Approximability, and Heuristics, The journal of artificial intelligence research, 2021, 70, s. 169–204, : AI ACCESS FOUNDATION

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian och Osipov, George, Disjunctive Temporal Problems under Structural Restrictions, THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021,, s. 3724–3732, : ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE

Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian och Osipov, George, Solving Infinite-Domain CSPs Using the Patchwork Property, THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021,, s. 3715–3723, : ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE

Johansson, Niklas, A Resource for Quantum Computation, 2021, Linköping University Electronic Press, Linköping

Jonsson, Peter, Lagerkvist, Victor och Osipov, George, Acyclic orders, partition schemes and CSPs : Unified hardness proofs and improved algorithms, Artificial Intelligence, 2021, 296, : Elsevier

Kommittén (Fö 2008:01) En förändrad totalförsvarsplikt [ Avslutad 2009 ] [ Ledamot ]

Källa : Sveriges riksdag