Ulrich M. Schwarz

Personal Info

Research Assistant
Research Group "Theory of Parallelism"
Office 1005, Christian-Albrechts-Platz 4
Phone: +49 431 880 7553
eMail: ums at informatik dot uni dash kiel dot de
personal homepage

CV

cv.pdf.gz (42KB)

Research

Research Interests

Off- and Online Scheduling Problems, User Interface Design, Markup Languages

My particular focus at the moment are scheduling problems where machine availability is not guaranteed. (This includes advance reservations as an offline case, but also online machine failure.) I have also worked on moldable task scheduling for quite a while.

Publications

G. Muratore, U. M. Schwarz and G. J. Woeginger. Parallel machine scheduling with nested job assignment restrictions. Operations Research Letters 38 (1): 47-50, 2010.
F. Diedrich, K. Jansen, U. M. Schwarz and D. Trystram. A Survey on Approximation Algorithms for Scheduling with Machine Unavailability. In J. Lerner, D. Wagner and K. A. Zweig, eds., Algorithmics of Large and Complex Networks, vol. 5515 of Lecture Notes in Computer Science, pp. 50-64. Springer, 2009.
U. M. Schwarz, K. Jansen and L. Prädel. A 2-approximation for 2D Bin Packing. In F. Dehne et al., eds., Proceedings of WADS, vol. 5664 of Lecture Notes in Computer Science, pp. 399-410. Springer, 2009.
U. M. Schwarz, K. Jansen and L. Prädel. A 2-approximation for 2D Bin Packing. Tech. Rep. 0904, Christian-Albrechts-Universität zu Kiel, 2009.
U. M. Schwarz. Online scheduling on semi-related machines. Information Processing Letters, 108 (1): 38-40, 2008.
U. M. Schwarz. Tightness Results for Malleable Task Scheduling Algorithms. In Proceedings of PPAM 2007, vol. 4967 of Lecture Notes in Computer Science. Springer, 2007.
U. M. Schwarz and F. Diedrich. A Framework for Scheduling with Online Availability. In A.-M. Kermarrec, L. Bougé and T. Priol, eds., Proceedings of EUROPAR 2007, vol. 4641 of Lecture Notes in Computer Science. Springer, 2007.
U. M. Schwarz. Design and Analysis of Approximation Algorithms for Certain Scheduling Problems. Diploma thesis, Christian-Albrechts-Universität zu Kiel, 2006.
U. M. Schwarz. Was hinten herauskommt zählt: Counter Aliasing in LaTeX. Die TeXnische Komödie, 18 (3): 6-11, 2006.

ums-publis.bib (3.3KB)

Teaching

Winter 09/10

Vorkurs

Again, I am charged with organizing the introduction course for freshpeople. You can subscribe to the preliminary schedule. HTML version for those three people without a calendar.

Efficient Algorithms

More information

A5.3.5/MSP0201 Practical course: Efficient Implementation of Knapsack Algorithms

Kick-off meeting: Oct. 21, 10:00am, room 1001

More information

Seminar: Recent development in combinatorial optimization

Kick-off meeting: Oct. 21, 10:30am, room 1001

More information

Other terms

Information about earlier terms is not kept here. Please check the corresponding lectures' web pages. If you want to prepare for your exams with old exercise sets, please see the archives

Notes

I regret to inform you that by order of Prof. Jansen, as a service to students attending the lectures, notes are not made available anymore, effective immediately, until futher notice. I apologize for the inconvenience.
Algorithmen und Datenstrukturen
Theoretische Grundlagen der Informatik
Effiziente Algorithmen (in need of proofreading)

LaTeX tutorial

All packages come with extensive documentation. Usually, the way to get it is to type texdoc packagename in a shell. Two exceptions: the scrartcl manual is called scrguide, the amsmath manual is called amsldoc.

Deutschsprachige Anwendervereinigung TeX e.V. is the German-language TeX User Group. It funds and/or supports various aspects of (La)TeX developments, including ProTeXt and TeXLive. Member fee: 20EUR for students per year, includes quarterly publication ``Die TeXnische Komödie'' and one copy of the TeXCollection DVD. One-year trial membership available for 15EUR.

l2kurz, a short introduction to LaTeX. A more extensive list of online ressources is in the de-tex-faq.

German-language FAQ, UK TeX FAQ, How to track down your LaTeX errors (de/en).