Prof. Dr. Heinz Schmitz

Items are sorted by the most recent entry per subject.

• [Journal] Britta Herres, Heinz Schmitz. Decomposition of University Course Timetabling - A Systematic Study of Subproblems and their Complexities. Annals of Operations Research, S.I.: PATAT 2018, Springer 2019. link 
  [Conference Proceedings] Britta Herres, Heinz Schmitz. Decomposition of University Course Timetabling - A Systematic Study of Subproblems and their Complexities. 12th International Conference on the Practice and Theory of Automated Timetabling (PATAT), Vienna, 2018. link  
  [Technical Report] Britta Herres, Heinz Schmitz. Uniform Decomposition of University Course Timetabling. Technical Report 2018-1, Department of Computer Science, University of Trier. link 
• [Talk] INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft, Kassel, Germany, 2019. link
  [Invited Talk] Journals Track at ACM CHI, Montreal, Canada, 2018. link
  [Journal] Heinz Schmitz, Ioanna Lykourentzou. Online Sequencing of Non-Decomposable Macrotasks in Expert Crowdsourcing. Transactions on Social Computing, volume 1, #1, pages 1-33, ACM 2018. link 
  [Conference Poster] Heinz Schmitz, Ioanna Lykourentzou. An Online Approach to Task Assignment and Sequencing in Expert Crowdsourcing. Conference on Human Computation & Crowdsourcing (HCOMP), San Diego, California, 2015. link 
  [Technical Report] Heinz Schmitz, Ioanna Lykourentzou. It's about time: Online Macrotask Sequencing in Expert Crowdsourcing. Computing Research Repository CoRR, arXiv:1601.04038 [cs.SI], 2016 (also appears as Computer Science Report 2016-1, Hochschule Trier). link
• [Teaching Report] Heinz Schmitz. Teaching Theoretical Computer Science with Python. GI Theorietag 2017 - Automaten und Formale Sprachen. Technical Report 2017-2, Department of Computer Science, University of Trier (also appears as Computer Science Report 2017-2, Hochschule Trier). link
• [Journal] Maria Dostert, Andreas Politz, Heinz Schmitz. A Complexity Analysis and an Algorithmic Approach to Student Sectioning in Existing Timetables. Journal of Scheduling, volume 19, #3, pages 285-293, Springer 2016. link 
  [Conference Proceedings] Maria Dostert, Andreas Politz, Heinz Schmitz. Algorithms and Complexity of Student Sectioning for Existing Timetables. 6th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Gent, 2013. link 
  [Technical Report] Maria Dostert, Andreas Politz, Heinz Schmitz. Student Sectioning for Fixed Timetables. Computer Science Report 2013-1, Hochschule Trier. link 
• [Journal] Christian Glaßer, Heinz Schmitz, Victor Selivanov. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Theoretical Computer Science, volume 646, pages 86-108, Elsevier 2016. link 
  [Conference Proceedings] Christian Glaßer, Heinz Schmitz, Victor Selivanov. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Symposium on Theoretical Aspects of Computer Science (STACS), Bordeaux, France, 2008. link 
  [Technical Report] Christian Glaßer, Heinz Schmitz, Victor Selivanov. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Computing Research Repository CoRR, arXiv:0802.2868 [cs.CC], February 2008 (also appears as Technical Report TR429, University of Würzburg, 2007, and Computer Science Report 2007-1, Hochschule Trier, 2007). link 
• [Conference Proceedings] Heinz Schmitz, Christian Heimfarth. Cross-Curriculum Scheduling with Themis: A Course-Timetabling System for Lectures and Sub-Events. 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT), Belfast, 2010. link 
  [Technical Report] Heinz Schmitz, Christian Heimfarth. Cross-Curriculum Scheduling with Themis: A Course-Timetabling System for Lectures and Sub-Events. Computer Science Report 2010-2, Hochschule Trier. link 
• [Conference Proceedings] Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek. Approximability and Hardness in Multi-Objective Optimization. Computability in Europe (CiE), Ponta Delgada (Azores), Portugal, 2010. Lecture Notes in Computer Science 6158, pages 180-189, Springer-Verlag, 2010. link 
  [Technical Report] Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek. Hardness and Approximability in Multi-Objective Optimization. ECCC Electronic Colloquium on Computational Complexity, Report TR10-031, March 2010 (also appears as Computer Science Report 2010-3, Hochschule Trier, 2010). link
• [Book Chapter] Heinz Schmitz, Sebastian Niemann. A Bicriteria Traveling Salesman Problem with Sequence Priorities. Lecture Notes in Economics and Mathematical Systems, volume 624, pages 1-14, Springer 2009. link 
  [Workshop Proceedings] Heinz Schmitz, Sebastian Niemann. First Come, First Served - Tour Scheduling with Priorities. 8th EU/MEeting on Metaheuristics in the Service Industry , Stuttgart, Germany, 2007, ISBN 978-3-00-022976-3.
  [Technical Report] Heinz Schmitz, Sebastian Niemann. First Come, First Served - Tour Scheduling with Priorities. Computer Science Report 2007-4, Hochschule Trier. link
• [Conference Proceedings] Christian Glaßer, Christian Reitwießner, Heinz Schmitz. Multiobjective Disk Cover Admits a PTAS. International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, 2008. Lecture Notes in Computer Science 5369, pages 40-51, Springer 2008. link 
  [Technical Report] Christian Glaßer, Christian Reitwießner, Heinz Schmitz. Multiobjective Disk Cover Admits a PTAS. Computer Science Report 2008-3, Hochschule Trier (also appears as Technical Report TR443, University of Würzburg, 2008). link
• [Workshop Proceedings] Sebastian Niemann, Heinz Schmitz. A Local-Search Approach for Solving a Bin-Packing Problem with Secondary Objectives. 5th ESICUP Meeting, EURO Special Interest Group on Cutting and Packing, L'Aquila, Italy, 2008.
  [Technical Report] Sebastian Niemann, Heinz Schmitz. A Local-Search Approach for Solving a Bin-Packing Problem with Secondary Objectives. Computer Science Report 2008-1, Hochschule Trier. link
• [Journal] Christian Glaßer, Heinz Schmitz. Languages of Dot-Depth 3/2. Theory of Computing Systems, volume 42, #2, pages 256-286, Springer 2008. link 
  [Conference Proceedings] Christian Glaßer, Heinz Schmitz. Languages of Dot-Depth 3/2. Symposium on Theoretical Aspects of Computer Science (STACS), Lille, France, 2000. Lecture Notes in Computer Science 1770, pages 555-566, Springer 2000. link 
  [Technical Report] Christian Glaßer, Heinz Schmitz. Languages of Dot-Depth 3/2. Technical Report TR243, University of Würzburg, 1999. link
• [Technical Report] Hermann Schloß, Heinz Schmitz. Entwicklung eines Systems zur effizienten Lösung von Least-Squares-Problemen mit Nebenbedingungen für die Parameteroptimierung in TSK-Fuzzy-Systemen. Computer Science Report 2006-1, Hochschule Trier. link
• [Conference Proceedings] Christian Glaßer, Heinz Schmitz. Level 5/2 of the Straubing-Thérien Hierarchy for two-letter Alphabets. Conference on Developments in Language Theory (DLT), Vienna, Austria, 2001. Lecture Notes in Computer Science 2295, pages 251-261, Springer 2002. link 
  [Technical Report] Christian Glaßer, Heinz Schmitz. Concatenation Hierarchies and Forbidden Patterns. Technical Report TR256, University of Würzburg, 2000. link
• [Journal] Christian Glaßer, Heinz Schmitz. The Boolean Structure of Dot-Depth One. Journal of Automata, Languages and Combinatorics, volume 6, #4, pages 437-452, 2001. link 
  [Workshop Proceedings] Christian Glaßer, Heinz Schmitz. The Boolean Structure of Dot-Depth One. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS), London, Ontario, 2000.
  [Technical Report] Heinz Schmitz. Boolean Hierarchies inside Dot-Depth One. Technical Report TR240, University of Würzburg, 1999. link
• [Conference Proceedings] Christian Glaßer, Heinz Schmitz. Decidable Hierarchies of Starfree Languages. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), New Delhi, India, 2000.
  [Technical Report] Christian Glaßer, Heinz Schmitz. Concatenation Hierarchies and Forbidden Patterns. Technical Report TR256, University of Würzburg, 2000. link
• [Journal] Sven Kosub, Heinz Schmitz, Heribert Vollmer. Uniform Characterizations of Complexity Classes of Functions. International Journal of Foundations of Computer Science, volume 11, #4, pages 525-551, 2000. link 
  [Conference Proceedings] Sven Kosub, Heinz Schmitz, Heribert Vollmer. Uniformly Defining Complexity Classes of Functions. Symposium on Theoretical Aspects of Computer Science (STACS), Paris, France, 1998. Lecture Notes in Computer Science 1373, pages 607-617, Springer 1998. link 
  [Technical Report] Sven Kosub, Heinz Schmitz, Heribert Vollmer. Uniformly Defining Complexity Classes of Functions. Technical Report TR183, University of Würzburg, 1997. link
• [Doctoral Thesis] Heinz Schmitz. The Forbidden Pattern Approach to Concatenation Hierarchies. University of Würzburg, Germany, 2000. link
• [Journal] Heinz Schmitz. Restricted Temporal Logic and Deterministic Languages. Journal of Automata, Languages and Combinatorics, volume 5, #3, pages 325-342, 2000. link 
  [Workshop Proceedings] Heinz Schmitz. Generalized Deterministic Languages and their Automata: A Characterization of Restricted Temporal Logic. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS), Magdeburg, Germany, 1999.
  [Technical Report] Heinz Schmitz. Generalized Deterministic Languages and their Automata: A Characterization of Restricted Temporal Logic. Technical Report TR226, University of Würzburg, 1999. link
  [Technical Report] Heinz Schmitz. Some Forbidden Patterns in Automata for Dot-Depth One Languages. Technical Report TR220, University of Würzburg, 1999. link
• [Technical Report] Heinz Schmitz, Klaus W. Wagner. The Boolean Hierarchy over Level 1/2 of the Straubing-Thérien Hierarchy. Computing Research Repository CoRR, arXiv:cs/9809118v1 [cs.CC], 1998 (also appears as Technical Report TR201, University of Würzburg, 1998). link
• [Book Chapter] Heinz Schmitz. Nichtdeterministische Funktionsberechnungen. In H. Vollmer (ed.), Komplexitätstheorie: Maschinen und Operatoren, pages 55-70. ISBN 3-89588-821-4, Cuvillier Verlag, Göttingen, Germany, 1997.
• [Diploma Thesis] Heinz Schmitz. Nichtdeterministische Polynomialzeit-Berechnung von Funktionen. University of Würzburg, Germany, 1996.
• [Diploma Thesis] Heinz Schmitz. Objektorientierte Programmierung - Neue Konzepte, deren Anwendung und Auswirkungen. Berufsakademie Stuttgart, Germany, 1990.