dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Patrick Briest Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Martin Hoefer, Piotr Krysta: Stackelberg Network Pricing Games. Algorithmica 62(3-4): 733-753 (2012)
2011
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Christoph Raupach: The car sharing problem. SPAA 2011: 167-176
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Bastian Degener, Barbara Kempkes, Peter Kling, Peter Pietrzyk: A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model CoRR abs/1105.1248: (2011)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Piotr Krysta: Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM J. Comput. 40(6): 1554-1586 (2011)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Piotr Krysta, Berthold Vöcking: Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40(6): 1587-1622 (2011)
2010
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg: Pricing Randomized Allocations. SODA 2010: 585-597
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Heiko Röglin: The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. WAOA 2010: 47-58
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE 2010: 444-454
2009
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Martin Hoefer, Luciano Gualà, Carmine Ventre: On Stackelberg Pricing with Computationally Bounded Consumers. WINE 2009: 42-54
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Shuchi Chawla, Robert D. Kleinberg, S. Matthew Weinberg: Pricing Randomized Allocations CoRR abs/0904.2400: (2009)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Sanjeev Khanna: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing CoRR abs/0910.0110: (2009)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest: Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). it - Information Technology 51(1): 62-65 (2009)
2008
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest: Uniform Budgets and the Envy-Free Pricing Problem. ICALP (1) 2008: 808-819
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoshe Babaioff, Patrick Briest, Piotr Krysta: On the Approximability of Combinatorial Exchange Problems. SAGT 2008: 83-94
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Martin Hoefer, Piotr Krysta: Stackelberg Network Pricing Games. STACS 2008: 133-142
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Martin Hoefer, Piotr Krysta: Stackelberg Network Pricing Games CoRR abs/0802.2841: (2008)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Paul W. Goldberg, Heiko Röglin: Approximate Equilibria in Games with Few Players CoRR abs/0804.4524: (2008)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking: Who Should Pay for Forwarding Packets? Internet Mathematics 5(4): 459-475 (2008)
2007
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Piotr Krysta: Buying cheap is expensive: hardness of non-parametric multi-product pricing. SODA 2007: 716-725
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking: Who Should Pay for Forwarding Packets? WINE 2007: 208-219
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Martin Hoefer, Piotr Krysta: Stackelberg Network Pricing Games. Electronic Colloquium on Computational Complexity (ECCC) 14(101): (2007)
2006
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Christian Gunia: Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. ISAAC 2006: 670-679
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Piotr Krysta: Single-minded unlimited supply pricing on sparse instances. SODA 2006: 1093-1102
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Piotr Krysta: Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. Electronic Colloquium on Computational Complexity (ECCC) 13(068): (2006)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest: Towards Hardness of Envy-Free Pricing. Electronic Colloquium on Computational Complexity (ECCC) 13(150): (2006)
2005
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Piotr Krysta, Berthold Vöcking: Approximation techniques for utilitarian mechanism design. STOC 2005: 39-48
2004
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener: Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN 2004: 21-30
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener: The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN 2004: 31-40

Coauthor Index

1Heiner Ackermann [9] [11]
2Moshe Babaioff [15]
3Dimo Brockhoff [1] [2]
4Parinya Chalermsook [21]
5Shuchi Chawla [19] [23]
6Bastian Degener [1] [2] [26]
7Matthias Englert [1] [2]
8Alexander Fanghänel [9] [11]
9Paul W. Goldberg [12]
10Luciano Gualà [20]
11Christian Gunia [1] [2] [7]
12Oliver Heering [1] [2]
13Martin Hoefer [8] [13] [14] [20] [28]
14Thomas Jansen [1] [2]
15Barbara Kempkes [26]
16Sanjeev Khanna [18] [21]
17Robert D. Kleinberg (Robert Kleinberg) [19] [23]
18Peter Kling [26]
19Piotr Krysta [3] [5] [6] [8] [10] [13] [14] [15] [24] [25] [28]
20Bundit Laekhanukit [21]
21Michael Leifhelm [1] [2]
22Danupon Nanongkai [21]
23Peter Pietrzyk [26]
24Kai Plociennik [1] [2]
25Christoph Raupach [27]
26Heiko Röglin (Heiko Roeglin) [1] [2] [12] [22]
27Andrea Schweer [1] [2]
28Dirk Sudholt [1] [2]
29Stefan Tannenbaum [1] [2]
30Carmine Ventre [20]
31Berthold Vöcking [3] [9] [11] [24]
32Ingo Wegener [1] [2]
33S. Matthew Weinberg [19] [23]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page