PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Berger, André"

Author of the publication

copydeleteadd this publication to your clipboard
Characterizing Incentive Compatibility for Convex Valuations.

, , and . SAGT, volume 5814 of Lecture Notes in Computer Science, page 24-35. Springer, (2009)

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.

André Jaquemod University of Stuttgart

Univ. -Prof. Dr. rer. nat. André Thess University of Stuttgart

Dr. -Ing. André Buchau University of Stuttgart

André Weiß University of Stuttgart

André Loescher University of Stuttgart

 

Other publications of authors with the same name

An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions., , and . Comp. Opt. and Appl., 68 (3): 661-669 (2017)A PTAS for the Cluster Editing Problem on Planar Graphs., , and . WAOA, volume 10138 of Lecture Notes in Computer Science, page 27-39. Springer, (2016)Online railway delay management: Hardness, simulation and computation., , , and . Simulation, 87 (7): 616-629 (2011)Characterizing implementable allocation rules in multi-dimensional environments., , and . Social Choice and Welfare, 48 (2): 367-383 (2017)Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs., and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 90-101. Springer, (2007)Location, Pricing and the Problem of Apollonius., , , and . DOOR, volume 9869 of Lecture Notes in Computer Science, page 563-569. Springer, (2016)On Time-Optimal Trajectories in Non-Uniform Mediums., , , and . J. Optimization Theory and Applications, 165 (2): 586-626 (2015)Characterizing Incentive Compatibility for Convex Valuations., , and . SAGT, volume 5814 of Lecture Notes in Computer Science, page 24-35. Springer, (2009)Budgeted matching and budgeted matroid intersection via the gasoline puzzle., , , and . Math. Program., 128 (1-2): 355-372 (2011)Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs., , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 472-483. Springer, (2005)