Gerhard Woeginger - Selected publications#
Journal article: (20 citations at Google Scholar)
Marek Chrobak, Kazuhisa Makino, Gerhard Woeginger, Haifeng Xu. Caching is hard-even in the fault model. Algorithmica 63, 2012, 781-794.
Proceedings article: (34 citations at Google Scholar; IJCAI 2011 Distinguished Paper Award)
Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger. Unweighted coalitional manipulation under the Borda rule is NP-hard. Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI'2011), 2011, 55-60.
Journal article: (116 citations at Google Scholar)
Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger. Getting the best response for your Erg. ACM Transactions on Algorithms 4, 2008, Article No 38.
Journal article: (106 citations at Google Scholar)
Gerhard J. Woeginger. An axiomatic characterization of the Hirsch-index. Mathematical Social Sciences 56, 2008, 224-232.
Journal article: (90 citations at Google Scholar)
Alexander Barvinok, Sandor Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe. The geometric maximum travelling salesman problem. Journal of the ACM 50, 2003, 641-664.
Proceedings article: (432 citations at Google Scholar)
Gerhard J. Woeginger. Exact algorithms for NP-hard problems. In: Combinatorial Optimization-Eureka, you shrink!, M. Juenger, G. Reinelt, and G. Rinaldi (eds.), LNCS 2570, Springer Verlag, 2003, 185-207.
Journal article: (120 citations at Google Scholar)
Gerhard J. Woeginger. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing 12, 2000, 57-74.
Journal article: (130 citations at Google Scholar)
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAM Journal on Computing 28, 1999, 1155-1166.
Book: (1300 citations at Google Scholar)
Amos Fiat and Gerhard Woeginger. "On-line Algorithms: The State of the Art", Lecture Notes in Computer Science 1442, Springer Verlag, 1998.
