The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Jonsson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mathias Broxvall, Peter Jonsson
    Disjunctive Temporal Reasoning in Partially Ordered Models of Time. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:464-469 [Conf]
  2. Thomas Drakengren, Peter Jonsson
    Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:389-394 [Conf]
  3. Peter Jonsson, Christer Bäckström
    Tractable Planning with State Variables by Exploiting Structural Restrictions. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:998-1003 [Conf]
  4. Peter Jonsson, Christer Bäckström
    On the Size of Reactive Plans. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 2, 1996, pp:1182-1187 [Conf]
  5. Peter Jonsson, Christer Bäckström
    A Linear-Programming Approach to Temporal Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 2, 1996, pp:1235-1240 [Conf]
  6. Patrik Haslum, Peter Jonsson
    Planning with Reduced Operator Sets. [Citation Graph (0, 0)][DBLP]
    AIPS, 2000, pp:150-158 [Conf]
  7. Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
    Counting Satisfying Assignments in 2-SAT and 3-SAT. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:535-543 [Conf]
  8. Gustav Nordh, Peter Jonsson
    The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:370-379 [Conf]
  9. Ola Angelsmark, Peter Jonsson
    Some Observations on Durations, Scheduling and Allen's Algebra. [Citation Graph (0, 0)][DBLP]
    CP, 2000, pp:484-488 [Conf]
  10. Ola Angelsmark, Peter Jonsson
    Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:81-95 [Conf]
  11. Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper
    Determining the Number of Solutions to Binary CSP Instances. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:327-340 [Conf]
  12. Marcus Bjäreland, Peter Jonsson
    Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:118-128 [Conf]
  13. Mathias Broxvall, Peter Jonsson
    Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:129-143 [Conf]
  14. Mathias Broxvall, Peter Jonsson, Jochen Renz
    Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2000, pp:114-127 [Conf]
  15. Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
    Approximability of Integer Programming with Generalised Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:256-270 [Conf]
  16. Patrik Haslum, Peter Jonsson
    Some Results on the Complexity of Planning with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    ECP, 1999, pp:308-318 [Conf]
  17. Christer Bäckström, Peter Jonsson
    Planning with Abstraction Hierarchies can be Exponentially Less Efficient. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1599-1605 [Conf]
  18. Thomas Drakengren, Peter Jonsson
    Towards a Complete Classification of Tractability in Allen's Algebra. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1997, pp:1466-1475 [Conf]
  19. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:83-88 [Conf]
  20. Peter Jonsson, Thomas Drakengren, Christer Bäckström
    Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:352-363 [Conf]
  21. Gustav Nordh, Peter Jonsson
    An Algebraic Approach to the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:367-376 [Conf]
  22. Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson
    Finite Domain Constraint Satisfaction Using Quantum Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:93-103 [Conf]
  23. Peter Jonsson, Gustav Nordh
    Generalised Integer Programming Based on Logically Defined Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:549-560 [Conf]
  24. Vilhelm Dahllöf, Peter Jonsson
    An algorithm for counting maximum weighted independent sets and its applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:292-298 [Conf]
  25. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    The Complexity of Constraints on Intervals and Lengths. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:443-454 [Conf]
  26. Andrei A. Krokhin, Peter Jonsson
    Extending the Point Algebra into the Qualitative Algebra. [Citation Graph (0, 0)][DBLP]
    TIME, 2002, pp:28-35 [Conf]
  27. Inger Klein, Peter Jonsson, Christer Bäckström
    Efficient planning for a miniature assembly line. [Citation Graph (0, 0)][DBLP]
    AI in Engineering, 1999, v:13, n:1, pp:69-81 [Journal]
  28. Mathias Broxvall, Peter Jonsson
    Point algebras for temporal reasoning: Algorithms and complexity. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:149, n:2, pp:179-220 [Journal]
  29. Mathias Broxvall, Peter Jonsson, Jochen Renz
    Disjunctions, independence, refinements. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:140, n:1/2, pp:153-173 [Journal]
  30. Thomas Drakengren, Peter Jonsson
    Twenty-One Large Tractable Subclasses of Allen's Algebra. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:93, n:, pp:297-319 [Journal]
  31. Thomas Drakengren, Peter Jonsson
    A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1998, v:106, n:2, pp:205-219 [Journal]
  32. Peter Jonsson, Christer Bäckström
    State-Variable Planning Under Structural Restrictions: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1998, v:100, n:1-2, pp:125-176 [Journal]
  33. Peter Jonsson, Christer Bäckström
    A Unifying Approach to Temporal Constraint Reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1998, v:102, n:1, pp:143-155 [Journal]
  34. Peter Jonsson, Thomas Drakengren, Christer Bäckström
    Computational Complexity of Relating Time Points with Intervals. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:109, n:1-2, pp:273-295 [Journal]
  35. Peter Jonsson, Patrik Haslum, Christer Bäckström
    Towards efficient universal planning: A randomized approach. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:117, n:1, pp:1-29 [Journal]
  36. Peter Jonsson, Andrei A. Krokhin
    Complexity classification in qualitative temporal constraint reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:160, n:1-2, pp:35-51 [Journal]
  37. Peter Jonsson
    Strong bounds on the approximability of two Pspace-hard problems in propositional planning. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1999, v:26, n:1-4, pp:133-147 [Journal]
  38. Peter Jonsson, Christer Bäckström
    Tractable Plan Existence Does Not Imply Tractable Plan Generation. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:22, n:3-4, pp:281-296 [Journal]
  39. Peter Jonsson, Thomas Drakengren
    A Complete Classification of Tractability in RCC-5 [Citation Graph (0, 0)][DBLP]
    CoRR, 1997, v:0, n:, pp:- [Journal]
  40. Thomas Drakengren, Peter Jonsson
    Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time [Citation Graph (0, 0)][DBLP]
    CoRR, 1997, v:0, n:, pp:- [Journal]
  41. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    The complexity of constraints on intervals and lengths [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:077, pp:- [Journal]
  42. Andrei A. Krokhin, Peter Jonsson
    Recognizing Frozen Variables in Constraint Satisfaction Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:062, pp:- [Journal]
  43. Peter Jonsson
    A Nonapproximability Result for Finite Function Generation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:3, pp:143-145 [Journal]
  44. Peter Jonsson
    Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:5, pp:249-253 [Journal]
  45. David A. Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis
    Building tractable disjunctive constraints. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:5, pp:826-853 [Journal]
  46. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:5, pp:591-640 [Journal]
  47. Thomas Drakengren, Peter Jonsson
    Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1997, v:7, n:, pp:25-45 [Journal]
  48. Peter Jonsson, Thomas Drakengren
    A Complete Classification of Tractability in RCC-5. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1997, v:6, n:, pp:211-221 [Journal]
  49. Peter Jonsson
    Adding clauses to poor man's logic (without increasing the complexity). [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2005, v:15, n:3, pp:341-357 [Journal]
  50. Thomas Drakengren, Peter Jonsson
    Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1998, v:8, n:6, pp:855-875 [Journal]
  51. Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
    The Approximability of Three-valued MAX CSP. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1329-1349 [Journal]
  52. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    Constraint Satisfaction Problems on Intervals and Length. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:453-477 [Journal]
  53. Vilhelm Dahllöf, Peter Jonsson, Richard Beigel
    Algorithms for four variants of the exact satisfiability problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:373-394 [Journal]
  54. Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
    Counting models for 2SAT and 3SAT formulae. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:265-291 [Journal]
  55. Víctor Dalmau, Peter Jonsson
    The complexity of counting homomorphisms seen from the other side. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:329, n:1-3, pp:315-323 [Journal]
  56. Peter Jonsson
    Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:189-203 [Journal]
  57. Peter Jonsson, Andrei A. Krokhin
    Recognizing frozen variables in constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:329, n:1-3, pp:93-113 [Journal]
  58. Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
    Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:182-193 [Conf]
  59. Peter Jonsson, Gustav Nordh, Johan Thapper
    The Maximum Solution Problem on Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:228-239 [Conf]
  60. Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
    Approximability of Integer Programming with Generalised Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  61. Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
    The approximability of MAX CSP with fixed-value constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  62. Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
    The approximability of three-valued MAX CSP [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  63. Peter Jonsson, Andrei A. Krokhin
    Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:5, pp:691-702 [Journal]

  64. Approximability Distance in the Space of H-Colourability Problems. [Citation Graph (, )][DBLP]


  65. Approximability of the Maximum Solution Problem for Certain Families of Algebras. [Citation Graph (, )][DBLP]


  66. Introduction to the Maximum SolutionProblem. [Citation Graph (, )][DBLP]


  67. Semilinear Program Feasibility. [Citation Graph (, )][DBLP]


  68. Bounded Tree-Width and CSP-Related Problems. [Citation Graph (, )][DBLP]


  69. Hard constraint satisfaction problems have hard gaps at location 1 [Citation Graph (, )][DBLP]


  70. Approximability Distance in the Space of H-Colourability Problems [Citation Graph (, )][DBLP]


  71. Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts [Citation Graph (, )][DBLP]


  72. Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002