Selected Publications Research Area K

[K:HCS11] S. Held, W. Cook, and E. Sewell. Safe lower bounds for graph coloring. In Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 261–273. Springer, 2011.

[K:Kou11] S. Hougardy. On packing squares into a rectangle. Computational Geometry, 44:456–463, 2011.

[K:MRV11] D. Müller, K. Radke, and J. Vygen. Faster min-max resource sharing in theory and practice. Mathematical Programming Computation, 3:1–35, 2011.

[K:BHM+10] C. Bartoschek, S. Held, J. Maßberg, D. Rautenbach, and J. Vygen. The repeater tree construction problem. Information Processing Letters, 110:1079–1083, 2010.

[K:BKZ10] P. Berman, M. Karpinski, and A. Zelikovsky. A 3/2-approximation algorithm for generalized Steiner tree problems in graphs with edge length 1 and 2. In Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC), pages 15–24. Springer, 2010.

[K:CLV09] W. J. Cook, L. Lovász, and J. Vygen, editors. Research Trends in Combinatorial Optimization. Springer, 2009.

[K:PRV09] S. Peyer, D. Rautenbach, and J. Vygen. A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. Journal of Discrete Algorithms, 7:377–390, 2009.

[K:Bre08] U. Brenner. A faster polynomial algorithm for the unbalanced Hitchcock transportation problem. Operations Research Letters, 36:408–413, 2008.

[K:BSV08] U. Brenner, M. Struzyna, and J. Vygen. BonnPlace: Placement of leading-edge chips by advanced combinatorial algorithms. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27:1607–1620, 2008.

[K:KV08] B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms. Springer, fourth edition, 2008. (translations into German 2008, Japanese 2009, French 2010, Italian 2011, Chinese forthcoming, Russian forthcoming).

[K:K:MV08] J. Maßberg and J. Vygen. Approximation algorithms for a facility location problem with service capacities. ACM Transactions of Algorithms, 4, 2008. Article 50.

[K:KRV07] B. Korte, D. Rautenbach, and J. Vygen. BonnTools: Mathematical innovation for layout and timing closure of systems on a chip. Proceedings of the IEEE, 95:555–572, 2007.

[K:Vyg07] J. Vygen. From stars to comets: Improved local search for universal facility location. Operations Research Letters, 35:427–433, 2007.

[K:WRS07] J. Werber, D. Rautenbach, and C. Szegedy. Timing optimization by restructuring long combinatorial paths. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pages 536–543. IEEE, 2007.