Search the dblp DataBase
Hans-Christoph Wirth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
ICALP, 1997, pp:281-291 [Conf] - Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
Optimizing Cost Flows by Modifying Arc Costs and Capacities. [Citation Graph (0, 0)][DBLP]
WG, 2000, pp:116-126 [Conf] - Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
Multiple Hotlink Assignment. [Citation Graph (0, 0)][DBLP]
WG, 2001, pp:189-200 [Conf] - Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
Euler is Standing in Line. [Citation Graph (0, 0)][DBLP]
WG, 1999, pp:42-54 [Conf] - Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
Upgrading Bottleneck Constrained Forests. [Citation Graph (0, 0)][DBLP]
WG, 1998, pp:215-226 [Conf] - Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth
Budgeted Maximum Graph Coverage. [Citation Graph (0, 0)][DBLP]
WG, 2002, pp:321-332 [Conf] - Hans-Christoph Wirth, Jan Steffan
On Minimum Diameter Spanning Trees under Reload Costs. [Citation Graph (0, 0)][DBLP]
WG, 1999, pp:78-88 [Conf] - Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke
Network Design and Improvement. [Citation Graph (0, 0)][DBLP]
ACM Comput. Surv., 1999, v:31, n:3es, pp:2- [Journal] - Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
Euler is standing in line dial-a-ride problems with precedence-constraints. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2001, v:113, n:1, pp:87-107 [Journal] - Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
Upgrading bottleneck constrained forests. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:129-142 [Journal] - Hans-Christoph Wirth, Jan Steffan
Reload cost problems: minimum diameter spanning tree. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2001, v:113, n:1, pp:73-85 [Journal] - Sven Oliver Krumke, Hans-Christoph Wirth
On the Minimum Label Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1998, v:66, n:2, pp:81-85 [Journal] - Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Minimum Cost Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1999, v:33, n:1, pp:92-111 [Journal] - Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
Optimizing cost flows by edge cost and capacity upgrade. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2004, v:2, n:4, pp:407-423 [Journal] - Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1999, v:221, n:1-2, pp:139-155 [Journal] - Hartmut Noltemeier, J. Spoerhase, Hans-Christoph Wirth
Multiple voting location and single voting location on trees. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2007, v:181, n:2, pp:654-667 [Journal]
Relaxed voting and competitive location on trees under monotonous gain functions. [Citation Graph (, )][DBLP]
Approximating (r, p)-Centroid on a Path. [Citation Graph (, )][DBLP]
Relaxed voting and competitive location under monotonous gain functions on trees. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002