Jens Vygen: [English Homepage] [Deutsche Homepage] Publications [Projects] [Students] [Textbook] [Courses] [Lectures] [Committees]

Books: W.J. Cook, L. Lovász, J. Vygen (Eds.) : Research Trends in Combinatorial Optimization (Bonn 2008) Springer, Berlin 2009 More Information B. Korte, J. Vygen : Combinatorial Optimization: Theory and Algorithms Algorithms and Combinatorics 21 Springer-Verlag, Berlin Heidelberg New York Tokyo First Edition 2000 Second Edition 2002 Japanese Edition 2005 Third Edition 2006 Fourth Edition 2008 German Edition 2008 Second Japanese Edition 2009 French Edition 2010 Chinese Edition forthcoming Italian Edition in preparation More Information

Selected Recent Papers (newest first):

Please send me an e-mail if you are interested in any paper that you cannot find here.

• D. Müller, K. Radke, J. Vygen: Faster min-max resource sharing in theory and practice. Manuscript, in preparation
• J. Vygen: Splitting trees at vertices. Manuscript, 2010
• J. Vygen: Faster algorithm for optimum Steiner trees. Technical Report No. 091003, Research Institute for Discrete Mathematics, University of Bonn, 2009
• C. Bartoschek, S. Held, J. Maßberg, D. Rautenbach, J. Vygen: The repeater tree construction problem. Technical Report No. 09998, Research Institute for Discrete Mathematics, University of Bonn, 2009
• S. Held, B. Korte, D. Rautenbach, J. Vygen: Combinatorial optimization in VLSI design. In: "Combinatorial Optimization: Methods and Applications" (V. Chvátal, N. Sbihi, eds.), IOS Press, to appear
• S. Peyer, D. Rautenbach, J. Vygen: A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. Journal of Discrete Algorithms 7 (2009), 377-390
• C. Bartoschek, S. Held, D. Rautenbach, J. Vygen: Fast buffering for optimizing worst slack and resource consumption in repeater trees. Proceedings of the International Symposium on Physical Design (2009), 43-50
• U. Brenner, J. Vygen : Analytical methods in VLSI placement. In: ``Handbook of Algorithms for VLSI Physical Design Automation'', (C.J. Alpert, D.P. Mehta, S.S. Sapatnekar, eds.), Taylor and Francis, Boca Raton 2009, pp. 327-346
• B. Korte, J. Vygen: Combinatorial problems in chip design. In: Building Bridges Between Mathematics and Computer Science (M. Grötschel, G.O.H. Katona, eds.), Springer, Berlin 2008, pp. 333-368
• U. Brenner, M. Struzyna, J. Vygen: BonnPlace: Placement of leading-edge chips by advanced combinatorial algorithms. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27 (2008), 1607-1620
• J. Maßberg, J. Vygen: Approximation algorithms for a facility location problem with service capacities. ACM Transactions on Algorithms 4 (2008), Article 50. Preliminary version in APPROX 2005
• J. Vygen: From stars to comets: Improved local search for universal facility location. Operations Research Letters 35 (2007), 427-433
• B. Korte, D. Rautenbach, J. Vygen: BonnTools: Mathematical innovation for layout and timing closure of systems on a chip. Proceedings of the IEEE 95 (2007), 555-572
• J. Vygen : New theoretical results on quadratic placement. Integration, the VLSI Journal 40 (2007), 305-314
• C. Bartoschek, S. Held, D. Rautenbach, J. Vygen: Efficient generation of short and fast repeater tree topologies. Proceedings of the International Symposium on Physical Design (2006), 120-127
• J. Vygen : Slack in static timing analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25 (2006), 1876-1885
• J. Vygen: Approximation Algorithms for Facility Location Problems (Lecture Notes). Report No. 05950-OR, Research Institute for Discrete Mathematics, University of Bonn, 2005
• J. Vygen: Geometric quadrisection in linear time, with application to VLSI placement. Discrete Optimization 2 (2005), 362-390
• U. Brenner, A. Pauli, J. Vygen : Almost optimum placement legalization by minimum cost flow and dynamic programming. Proceedings of the International Symposium on Physical Design (2004), 2-9
• U. Brenner, J. Vygen : Legalizing a placement with minimum total movement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 23 (2004), 1597-1613
• J. Vygen : Near-optimum global routing with coupling, delay bounds, and power consumption. In: Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCO Conference; LNCS 3064 (G. Nemhauser, D. Bienstock, eds.), Springer, Berlin 2004, pp. 308-324
• S. Held, B. Korte, J. Maßberg, M. Ringe, J. Vygen: Clock scheduling and clocktree construction for high performance ASICs. Proceedings of the IEEE International Conference on Computer-Aided Design (2003), 232-239
• J. Vygen : A note on Schrijver's submodular function minimization algorithm. Journal of Combinatorial Theory B 88 (2003), 399-402
• C. Albrecht, B. Korte, J. Schietke, J. Vygen : Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discrete Applied Mathematics 123 (2002), 103-127
• J. Vygen : On dual minimum cost flow algorithms. Mathematical Methods of Operations Research 56 (2002), 101-126. Preliminary version in STOC 2000
• U. Brenner, J. Vygen : Worst-case ratios of networks in the rectilinear plane. Networks 38 (2001), 126-139
• T. Nishizeki, J. Vygen, X. Zhou : The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Mathematics 115 (2001), 177-186