- CSB - MetaPress - Google - Bing - Yahoo
 | 2003 | |
|---|---|---|
| j6 |      | David Applegate, William J. Cook, André Rohe: Chained Lin-Kernighan for Large Traveling Salesman Problems. INFORMS Journal on Computing 15(1): 82-92 (2003) |
| j5 | | Martin Zachariasen, André Rohe: Rectilinear group Steiner trees and applications in VLSI design. Math. Program. 94(2-3): 407-433 (2003) |
| j4 | | Ulrich Brenner, André Rohe: An effective congestion-driven placement framework. IEEE Trans. on CAD of Integrated Circuits and Systems 22(4): 387-394 (2003) |
| 2002 | ||
| j3 | | David Applegate, William J. Cook, Sanjeeb Dash, André Rohe: Solution of a Min-Max Vehicle Routing Problem. INFORMS Journal on Computing 14(2): 132-143 (2002) |
| j2 | | Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze: Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. ACM Journal of Experimental Algorithmics 7: 11 (2002) |
| c2 | | |
| i1 | | Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze: Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. CoRR cs.DS/0212044 (2002) |
| 2001 | ||
| c1 | | Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze: Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. ALENEX 2001: 1-16 |
| 1999 | ||
| j1 | | William Cook, André Rohe: Computing Minimum-Weight Perfect Matchings. INFORMS Journal on Computing 11(2): 138-148 (1999) |
| 1 | David Applegate | |
| 2 | Ulrich Brenner | |
| 3 | William Cook | |
| 4 | William J. Cook | |
| 5 | Sanjeeb Dash | |
| 6 | Sándor P. Fekete | |
| 7 | Henk Meijer | |
| 8 | Walter Tietze | |
| 9 | Martin Zachariasen |
Colors in the list of coauthors
Last update Thu May 23 13:21:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page