( en | de | ru )

 

Disambiguation of "Wirth, Christoph"

Author of the publication

copydeleteadd this publication to your clipboard
Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board.

, , , , , and . Hypertext/Hypermedia, volume 276 of Informatik-Fachberichte, page 174-180. Springer, (1991)

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.

Christoph Wirth

Hans-Christoph Wirth

Ralph Wirth

Best-Worst Choice-Based Conjoint-Analyse: eine neue Variante der wahlbasierten Conjoint-Analyse. Uni Erlangen-Nürnberg, (2009)

Gernot Wirth

Rolf Wirth

 

Other publications of authors with the same name

Overflow: CRASH! Mathematik und kombinatorisches Chaos prallen aufeinander., , , , , and . Inform. Spektrum, 22 (1): 45-48 (1999)3-5-Man Chess: Maximals and Mzugs., , , and . J. Int. Comput. Games Assoc., 24 (4): 225-230 (2001)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)Relaxed Voting and Competitive Location on Trees under Monotonuous Gain Functions, and . 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'07), (2007)Multiple Hotlink Assignment., , and . WG, volume 2204 of Lecture Notes in Computer Science, page 189-200. Springer, (2001)On Minimum Diameter Spanning Trees under Reload Costs., and . WG, volume 1665 of Lecture Notes in Computer Science, page 78-88. Springer, (1999)On the flow cost lowering problem., , and . Eur. J. Oper. Res., 137 (2): 265-271 (2002)Euler is Standing in Line., , , and . WG, volume 1665 of Lecture Notes in Computer Science, page 42-54. Springer, (1999)Optimizing Cost Flows by Modifying Arc Costs and Capacities., , and . WG, volume 1928 of Lecture Notes in Computer Science, page 116-126. Springer, (2000)