( en | de | ru )

 

Disambiguation of "Wirth, Hans-Christoph"

Author of the publication

copydeleteadd this publication to your clipboard
Upgrading Bottleneck Constrained Forests.

, , , , and . WG, volume 1517 of Lecture Notes in Computer Science, page 215-226. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hans-Christoph Wirth

Christoph Wirth

Hans Wirth

Hans Wirth

Hans Wirth

 

Other publications of authors with the same name

Security Score, Plurality Solution, and Nash Equilibrium in Multiple Location Problems, and . 20th European Chapter on Combinatorial Optimization (ECCO'07), (2007)Approximating (r,p)-centroid on a path, and . Proc. 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'08), (2008)On Minimum Diameter Spanning Trees under Reload Costs., and . WG, volume 1665 of Lecture Notes in Computer Science, page 78-88. Springer, (1999)Multiple Hotlink Assignment., , and . WG, volume 2204 of Lecture Notes in Computer Science, page 189-200. Springer, (2001)Relaxed Voting and Competitive Location on Trees under Monotonuous Gain Functions, and . 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'07), (2007)On the flow cost lowering problem., , and . Eur. J. Oper. Res., 137 (2): 265-271 (2002)Optimizing Cost Flows by Modifying Arc Costs and Capacities., , and . WG, volume 1928 of Lecture Notes in Computer Science, page 116-126. Springer, (2000)Euler is Standing in Line., , , and . WG, volume 1665 of Lecture Notes in Computer Science, page 42-54. Springer, (1999)Relaxed voting and competitive location on trees under monotonous gain functions., and . CTW, page 137-140. University of Twente, (2007)Reload cost problems: minimum diameter spanning tree., and . Discret. Appl. Math., 113 (1): 73-85 (2001)