piwik-script

English Intern
    Lehrstuhl für Informatik I - Algorithmen, Komplexität und wissensbasierte Systeme
    Bitte schreiben Sie mir eine e-Mail, um eine Kopie einer Veröffentlichung zu erhalten.
    Please do not hesitate to contact me via email to request a copy of a paper.

    • J. Spoerhase, H.-C. Wirth · (r,p)-Centroid Problems on Paths and Trees · Theoretical Computer Science 410, 2009, p. 5128-5137.
    • J. Spoerhase, H.-C. Wirth · Relaxed voting and competitive location on trees under monotonous gain functions · Discrete Applied Mathematics 158 (4), 2010, p. 361-373.
    • J. Spoerhase, H.-C. Wirth · Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree · Journal of Discrete Algorithms 7(2), 2009, p.256-266.
    • J. Spoerhase, H.-C. Wirth · An O(n(log n)^2/ log log n) algorithm for the single maximum coverage location problem on trees · Information Processing Letters 109(8), 2009, p. 391-394.
    • J. Spoerhase, H.-C. Wirth · Approximating (r,p)-Centroid on a Path · Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'08), 2008; http://ctw08.dti.unimi.it/CTW08-Proceedings.pdf .
    • J. Spoerhase, H.-C. Wirth · (r,p)-Centroid Problems on Paths and Trees · Tech. Report no. 441, University of Würzburg, Department of Computer Science, 2007, https://www.informatik.uni-wuerzburg.de/forschung/technical_reports/.
    • H.-C. Wirth · On the complexity of budgeted maximum path coverage on trees · Tech. Report no. 438, University of Würzburg, Department of Computer Science, 2007, https://www.informatik.uni-wuerzburg.de/forschung/technical_reports/.
    • J. Spoerhase, H.-C. Wirth · Relaxed voting and competitive location on trees under monotonous gain functions · Tech. Report no. 401, University of Würzburg, Department of Computer Science, 2007, https://www.informatik.uni-wuerzburg.de/forschung/technical_reports/.
    • H. Noltemeier, J. Spoerhase, H.-C. Wirth · Multiple voting location and single voting location on trees · European Journal of Operations Research 181 (2007), 654-667.
    • J. Spoerhase, H.-C. Wirth · A linear time algorithm for absolute optima under monotonous gain functions · Tech. Report no. 433, University of Würzburg, Department of Computer Science, 2007, https://www.informatik.uni-wuerzburg.de/forschung/technical_reports/.
    • I. Demgensky, H. Noltemeier, H.-C. Wirth · Optimizing cost flows by edge cost and capacity upgrade · Journal of Discrete Algorithms 2 (2004), no. 4, 407-423.
    • S. O. Krumke, H. Noltemeier, H.-C. Wirth, A. Ziegler · Budgeted maximum path coverage · Preproceedings of 21st IFIP TC 7 Conference on System Modeling and Optimization, Sophia Antipolis, France, 2003.
    • I. Demgensky, H. Noltemeier, H.-C. Wirth · On the flow cost lowering problem · European Journal of Operational Research 137 (2002), 265-271.
    • S. O. Krumke, M. V. Marathe, D. Poensgen, S. S. Ravi, and H.-C. Wirth · Budgeted maximum graph coverage · Proc. 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'02), Lecture Notes in Computer Science, vol. 2573, Springer, 2002, pp. 321-332.
    • S. Fuhrmann, S. O. Krumke, H.-C. Wirth · Multiple hotlink assignment · Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01), Lecture Notes in Computer Science, vol. 2204, Springer, 2001, pp. 189-200.
    • S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi, H.-C. Wirth · Upgrading bottleneck constrained forests · Discrete Applied Mathematics 108 (2001), 129-142.
    • J. Steffan, H.-C. Wirth · Reload cost problems: Minimum diameter spanning tree · Discrete Applied Mathematics 113 (2001), no. 1, 73-85.
    • D. Hauptmeier, S. O. Krumke, J. Rambau, H.-C. Wirth · Euler is standing in line. Dial a ride problems with precedence constraints · Discrete Applied Mathematics 113 (2001), 87-107.
    • H.-C. Wirth · Multicriteria approximation of network design and network upgrade problems · Ph.D. thesis, Institut für Informatik, Universität Würzburg, 2001, http://www.opus-bayern.de/uni-wuerzburg/volltexte/2002/284/.
    • I. Demgensky, H. Noltemeier, H.-C. Wirth · Optimizing cost flows by modifying arc costs and capacities · Proc. 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'00), Lecture Notes in Computer Science, vol. 1928, Springer, 2000, pp. 116-126.
    • S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth · Improving minimum cost spanning trees by upgrading nodes · Journal of Algorithms 33 (1999), no. 1, 92-111.
    • H. Noltemeier, H.-C. Wirth, S. O. Krumke · Network design and network improvement · ACM Computing Surveys 31 (1999), no. 3es.
    • S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth · Improving spanning trees by upgrading nodes · Theoretical Computer Science 221 (1999), no. 1-2, 139-156.
    • J. Steffan, H.-C. Wirth  · On minimum diameter spanning trees under reload costs · Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99), Lecture Notes in Computer Science, vol. 1665, Springer, 1999, pp. 78-88.
    • S. O. Krumke, H. Noltemeier, R. Ravi, S. Schwarz, H.-C. Wirth · Flow improvement and flows with fixed costs · Proceedings of the International Conference of Operations Research Zürich (OR'98), Operations Research Proceedings, Springer, 1999.
    • D. Hauptmeier, S. O. Krumke, J. Rambau, H.-C. Wirth · Euler is standing in line · Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99), Lecture Notes in Computer Science, vol. 1665, Springer, 1999, pp. 42-54.
    • S. O. Krumke, H.-C. Wirth · On the minimum label spanning tree problem · Information Processing Letters 66 (1998), no. 2, 81-85.
    • S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi, H.-C. Wirth · Upgrading bottleneck constrained forests · Proc. 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'98), Lecture Notes in Computer Science, vol. 1517, Springer, 1998, pp. 215-226.
    • J. Steffan, H.-C. Wirth · ANDI - Approximation Algorithms for Network Design and Network Improvement Problems · Tech. Report 202, University of Würzburg, Dept. of Mathematics and Computer Science, 1998.
    • S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth · Improving spanning trees by upgrading nodes · Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Lecture Notes in Computer Science, vol. 1256, 1997, pp. 281-291.
    • H.-C. Wirth · Modifikationen von Netzen bei mehreren Kriterien · Diplomarbeit, Institut für Informatik, Universität Würzburg, 1997.

    Hinweis zum Datenschutz

    Mit 'OK' verlassen Sie die Seiten der Universität Würzburg und werden zu Facebook weitergeleitet. Informationen zu den dort erfassten Daten und deren Verarbeitung finden Sie in deren Datenschutzerklärung.

    Hinweis zum Datenschutz

    Mit 'OK' verlassen Sie die Seiten der Universität Würzburg und werden zu Twitter weitergeleitet. Informationen zu den dort erfassten Daten und deren Verarbeitung finden Sie in deren Datenschutzerklärung.

    Kontakt

    Lehrstuhl für Informatik I (Effiziente Algorithmen und wissensbasierte Systeme)
    Am Hubland
    97074 Würzburg

    Tel.: +49 931 31-85054
    E-Mail

    Suche Ansprechpartner

    Hubland Süd, Geb. Z8
    Hubland Süd, Geb. Z8
    Hubland Süd, Geb. M2
    Hubland Süd, Geb. M2