Heinz Schmitz

According to our database, Heinz Schmitz authored at least 17 papers between 1998 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Decomposition of university course timetabling.

Britta Herres, Heinz Schmitz

Ann. Oper. Res., 2021

2018

Online Sequencing of Non-Decomposable Macrotasks in Expert Crowdsourcing.

Heinz Schmitz, Ioanna Lykourentzou

ACM Trans. Soc. Comput., 2018

2016

Efficient algorithms for membership in boolean hierarchies of regular languages.

Christian Glaßer, Heinz Schmitz, Victor L. Selivanov

Theor. Comput. Sci., 2016

A complexity analysis and an algorithmic approach to student sectioning in existing timetables.

Maria Dostert, A. Politz, Heinz Schmitz

J. Sched., 2016

It's about time: Online Macrotask Sequencing in Expert Crowdsourcing.

Heinz Schmitz, Ioanna Lykourentzou

CoRR, 2016

2010

Hardness and Approximability in Multi-Objective Optimization.

Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek

Electron. Colloquium Comput. Complex., 2010

Approximability and Hardness in Multi-objective Optimization.

Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2008

Languages of Dot-Depth 3/2.

Christian Glaßer, Heinz Schmitz

Theory Comput. Syst., 2008

Multiobjective Disk Cover Admits a PTAS.

Christian Glaßer, Christian Reitwießner, Heinz Schmitz

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2001

The Boolean Structure of Dot-Depth One.

Christian Glaßer, Heinz Schmitz

J. Autom. Lang. Comb., 2001

Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets.

Christian Glaßer, Heinz Schmitz

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

The forbidden pattern approach to concatenation hierarchies.

Heinz Schmitz

PhD thesis, 2000

Restricted Temporal Logic and Deterministic Languages.

Heinz Schmitz

J. Autom. Lang. Comb., 2000

Uniform Characterizations of Complexity Classes of Functions.

Sven Kosub, Heinz Schmitz, Heribert Vollmer

Int. J. Found. Comput. Sci., 2000

Decidable Hierarchies of Starfree Languages.

Christian Glaßer, Heinz Schmitz

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1998

The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy

Heinz Schmitz, Klaus W. Wagner

CoRR, 1998

Uniformly Defining Complexity Classes of Functions.

Sven Kosub, Heinz Schmitz, Heribert Vollmer

Proceedings of the STACS 98, 1998