Author of the publication

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition.

, and . EC, page 152-161. ACM, (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.

 

Other publications of authors with the same name

Mächtigkeit von Logikprogrammierung über Datenbanken., and . Künstliche Intell., 10 (3): 32-39 (1996)Reasoning with parsimonious and moderately grounded expansions., and . Fundam. Informaticae, 17 (1-2): 31-53 (1992)Investigations on Armstrong relations, dependency inference, and excluded functional dependencies., and . Acta Cybern., 9 (4): 385-402 (1990)Closed World Databases Opened Through Null Values., and . VLDB, page 50-61. Morgan Kaufmann, (1988)From Carnap's Modal Logic to Autoepistemic Logic.. JELIA, volume 838 of Lecture Notes in Computer Science, page 1-18. Springer, (1994)On the Complexity of Theory Curbing., and . LPAR, volume 1955 of Lecture Notes in Computer Science, page 1-19. Springer, (2000)The Lixto Systems Applications in Business Intelligence and Semantic Web., , and . ESWC, volume 4519 of Lecture Notes in Computer Science, page 16-26. Springer, (2007)HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings., , , and . CoRR, (2018)Multiagent Compromises, Joint Fixpoints, and Stable Models., and . Computational Logic: Logic Programming and Beyond, volume 2407 of Lecture Notes in Computer Science, page 561-585. Springer, (2002)Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width., and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 708-719. Springer, (2001)