Researcher Portfolio
Prof. Dr. Vöcking, Berthold
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons45673
External references
WorldCat
Search for Vöcking, Berthold
Google Scholar
Search for Vöcking, Berthold
Publications
(1 - 25 of 33)
: Beier, R., Röglin, H., Rösner, C., & Vöcking, B. (2023). The Smoothed Number of Pareto-optimal Solutions in Bicriteria Integer Optimization. Mathematical Programming / A, 200, 319-355. doi:10.1007/s10107-022-01885-6. [PubMan] : Azar, Y., Hoefer, M., Maor, I., Reiffenhäuser, R., & Vöcking, B. (2017). Truthful Mechanism Design via Correlated Tree Rounding. Mathematical Programming / A, 163(1-2), 445-469. doi:10.1007/s10107-016-1068-5. [PubMan] : Azar, Y., Hoefer, M., Maor, I., Reiffenhäuser, R., & Vöcking, B. (2015). Truthful Mechanism Design via Correlated Tree Rounding. In EC’15 (pp. 415-432). New York, NY: ACM. doi:10.1145/2764468.2764503. [PubMan] : Hoefer, M., Kesselheim, T., & Vöcking, B. (2014). Approximation Algorithms for Secondary Spectrum Auctions. ACM Transactions on Internet Technology, 14(2-3): 16, pp. 1-24. doi:10.1145/2663496. [PubMan] : Göbel, O., Hoefer, M., Kesselheim, T., Schleiden, T., & Vöcking, B. (2014). Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. In J. Esparza, P. Fraigniaud, T. Husfeldt, & E. Koutsoupias (Eds. ), Automata, Languages, and Programming (pp. 508-519). Berlin: Springer. doi:10.1007/978-3-662-43951-7_43. [PubMan] : Beier, R., & Vöcking, B. (2011). The Knapsack Problem. In B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, & D. Wagner (Eds. ), Algorithms Unplugged (pp. 375-381). Berlin: Springer. doi:10.1007/978-3-642-15328-0_39. [PubMan] : Feldmann, A., Fischer, S., Kammenhuber, N., & Vöcking, B. (2009). Management of Variable Data Streams in Networks. In J. Lerner, D. Wagner, & K. A. Zweig (Eds. ), Algorithmics of Large and Complex Networks (pp. 266-291). Berlin: Springer. doi:10.1007/978-3-642-02094-0_13. [PubMan] : Beier, R., Röglin, H., & Vöcking, B. (2007). The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. In M. Fischettim, & D. P. Williamson (Eds. ), Integer Programming and Combinatorial Optimization (pp. 53-67). Berlin: Springer. doi:10.1007/978-3-540-72792-7_5. [PubMan] : Beier, R., Czumaj, A., Krysta, P., & Vöcking, B. (2006). Computing Equilibria for a Service Provider Game with (Im)perfect Information. ACM Transactions on Algorithms, 2, 679-706. [PubMan] : Beier, R., & Vöcking, B. (2006). An Experimental Study of Random Knapsack Problems. Algorithmica, 45, 121-136. [PubMan] : Beier, R., & Vöcking, B. (2006). Typical Properties of Winners and Losers in Discrete Optimization. SIAM Journal on Computing, 35, 855-881. [PubMan] : Beier, R., & Vöcking, B. (2004). Typical Properties of Winners and Losers in Discrete Optimization. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04) (pp. 343-352). New York, USA: ACM. [PubMan] : Beier, R., & Vöcking, B. (2004). Random Knapsack in Expected Polynomial Tme. Journal of Computer and System Sciences, 69(3), 306-329. [PubMan] : Beier, R., Krysta, P., Czumaj, A., & Vöcking, B. (2004). Computing Equilibria for Congestion Games with (Im)perfect Information. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04) (pp. 739-748). New York, USA: ACM. [PubMan] : Beier, R., & Vöcking, B. (2004). Probabilistic Analysis of Knapsack Core Algorithms. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04) (pp. 461-470). New York, USA: ACM. [PubMan] : Krysta, P., Sanders, P., & Vöcking, B. (2003). Scheduling and Traffic Allocation for Tasks with Bounded Splittability. In Mathematical foundations of computer science 2003: 28th International Symposium, MFCS 2003 (pp. 500-510). Berlin, Germany: Springer. [PubMan] : Agarwal, A., Agarwal, T., Chopra, S., Feldmann, A., Kammenhuber, N., Krysta, P., & Vöcking, B. (2003). An Experimental Study of k-splittable Scheduling for DNS-based Traffic Allocation. In H. Kosch, L. Böszörményi, & H. Hellwagner (Eds. ), Euro-Par 2003 Parallel Processing (pp. 230-235). Berlin, Germany: Springer. [PubMan] : Beier, R., & Vöcking, B.(2003). Random knapsack in expected polynomial time (MPI-I-2003-1-003). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann, M. (2003). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of Computing Systems, 35, 217-245. [PubMan] : Adler, M., Räcke, H., Sivadasan, N., Sohler, C., & Vöcking, B. (2003). Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability and Computing, 12, 225-244. [PubMan] : Krysta, P., Czumaj, A., & Vöcking, B.(2003). Selfish traffic allocation for server farms (MPI-I-2003-1-011). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Sanders, P., & Vöcking, B. (2003). Tail bounds and expectations for random arc allocation and applications. Combinatorics, Probability and Computing, 12, 225-244. [PubMan] : Krysta, P., Sanders, P., & Vöcking, B.(2003). Scheduling and traffic allocation for tasks with bounded splittability (MPI-I-2003-1-002). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Beier, R., & Vöcking, B. (2003). Random Knapsack in Expected Polynomial Time. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03) (pp. 232-241). New York, USA: ACM. [PubMan] : Czumaj, A., Krysta, P., & Vöcking, B. (2002). Selfish Traffic Allocation for Server Farms. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02) (pp. 287-296). New York, USA: ACM. [PubMan]