PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Jonsson, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
The Maximum Solution Problem on Graphs.

, , and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 228-239. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Elke Peter University of Stuttgart

Univ. -Prof. Dr. Rene Peters University of Stuttgart

Bernd Peters University of Stuttgart

Alexander Peter University of Stuttgart

Schmid. Peter

 

Other publications of authors with the same name

A Nonapproximability Result for Finite Function Generation.. Inf. Process. Lett., 63 (3): 143-145 (1997)Computational complexity of auditing finite attributes in statistical databases., and . J. Comput. Syst. Sci., 74 (5): 898-909 (2008)Planning with Reduced Operator Sets., and . AIPS, page 150-158. AAAI, (2000)Disjunctive Temporal Reasoning in Partially Ordered Models of Time., and . AAAI/IAAI, page 464-469. AAAI Press / The MIT Press, (2000)An algorithm for counting maximum weighted independent sets and its applications., and . SODA, page 292-298. ACM/SIAM, (2002)Adding clauses to poor man's logic (without increasing the complexity).. Journal of Applied Non-Classical Logics, 15 (3): 341-357 (2005)Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights.. Theor. Comput. Sci., 244 (1-2): 189-203 (2000)Constructing NP-intermediate problems by blowing holes with parameters of various properties., , and . Theor. Comput. Sci., (2015)Upper and Lower Time and Space Bounds for Planning., and . ECAI, volume 285 of Frontiers in Artificial Intelligence and Applications, page 716-724. IOS Press, (2016)Refining complexity analyses in planning by exploiting the exponential time hypothesis., , , and . Ann. Math. Artif. Intell., 78 (2): 157-175 (2016)