Wissenschaftliche Publikationen

Veröffentlichungen der HSWT

Die chronologische Liste zeigt aktuelle Veröffentlichungen aus dem Forschungsbetrieb der Hochschule Weihenstephan-Triesdorf. Zuständig ist das Zentrum für Forschung und Wissenstransfer (ZFW).

Suchbegriff

von

bis

Peer reviewed

Open access

8 Ergebnisse

Prof. Dr. Clemens Thielen, Stephan Westphal
Berechtigungen: Open Access

Berechtigungen: Peer Reviewed
Complexity of the Traveling Tournament Problem (2011) Theoretical Computer Science 412 (4-5), S. 345-351. DOI: 10.1016/j.tcs.2010.10.001
Prof. Dr. Clemens Thielen, Stephan Westphal
Berechtigungen: Peer Reviewed
Approximating the Traveling Tournament Problem with Maximum Tour Length 2 (2010) Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC) 6507 , S. 303-314. DOI: 10.1007/978-3-642-17514-5_26
Prof. Dr. Clemens Thielen, Stephan Westphal
Berechtigungen: Peer Reviewed
A combinatorial algorithm for strong implementation of social choice functions (2010) Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC) 2010 , S. 331-341.
Prof. Dr. Clemens Thielen, Sven Krumke
Berechtigungen: Peer Reviewed
Strong implementation of social choice function in dominant strategies (2010) Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC) 2010 , S. 319–330.
Prof. Dr. Clemens Thielen, Sven Krumke
Berechtigungen: Peer Reviewed
Truthful mechanisms for selfish routing and two-parameter agents (2010) Theory of Computing Systems 49 (1), S. 196–223. DOI: 10.1007/s00224-010-9281-8
Prof. Dr. Clemens Thielen, Sven Krumke
Berechtigungen: Peer Reviewed
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents (2009) Konferenzbeitrag für Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT) 5814 , S. 36-47. DOI: 10.1007/978-3-642-04645-2_5
Prof. Dr. Clemens Thielen, Sven Krumke
Berechtigungen: Open Access

Berechtigungen: Peer Reviewed
Complexity of Strong Implementability (2009) Konferenzbeitrag für Proceedings of the 4th Athens Colloquium on Algorithms and Complexity (ACAC) 2009 (4), S. 1-12. DOI: 10.4204/EPTCS.4.1
Prof. Dr. Clemens Thielen
Berechtigungen: Peer Reviewed
Generalized truthful mechanisms for scheduling verifiable related machines (2009) Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP) 2009 , S. 198-200.

Veröffentlichungen der HSWT

Complexity of the Traveling Tournament Problem (2011) Theoretical Computer Science 412 (4-5), S. 345-351. DOI: 10.1016/j.tcs.2010.10.001

Approximating the Traveling Tournament Problem with Maximum Tour Length 2 (2010) Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC) 6507 , S. 303-314. DOI: 10.1007/978-3-642-17514-5_26

A combinatorial algorithm for strong implementation of social choice functions (2010) Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC) 2010 , S. 331-341.

Strong implementation of social choice function in dominant strategies (2010) Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC) 2010 , S. 319–330.

Truthful mechanisms for selfish routing and two-parameter agents (2010) Theory of Computing Systems 49 (1), S. 196–223. DOI: 10.1007/s00224-010-9281-8

Truthful Mechanisms for Selfish Routing and Two-Parameter Agents (2009) Konferenzbeitrag für Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT) 5814 , S. 36-47. DOI: 10.1007/978-3-642-04645-2_5

Complexity of Strong Implementability (2009) Konferenzbeitrag für Proceedings of the 4th Athens Colloquium on Algorithms and Complexity (ACAC) 2009 (4), S. 1-12. DOI: 10.4204/EPTCS.4.1

Generalized truthful mechanisms for scheduling verifiable related machines (2009) Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP) 2009 , S. 198-200.

Betreuung der Publikationsseiten

Gerhard Radlmayr

Semiha Savas

Kontakt