default search action
Heinz Schmitz
Person information
- affiliation: Trier University of Applied Sciences, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j8]Britta Herres
, Heinz Schmitz
Decomposition of university course timetabling. Ann. Oper. Res. 302(2): 405-423 (2021)
2010 – 2019
- 2019
- [c8]Heinz Schmitz, Ioanna Lykourentzou
Online Sequencing of Non-Decomposable Macrotasks in Expert Crowdsourcing. GI-Jahrestagung 2019: 95-96 - 2018
- [j7]Heinz Schmitz, Ioanna Lykourentzou:
Online Sequencing of Non-Decomposable Macrotasks in Expert Crowdsourcing. ACM Trans. Soc. Comput. 1(1): 1:1-1:33 (2018) - 2016
- [j6]Maria Dostert
A complexity analysis and an algorithmic approach to student sectioning in existing timetables. J. Sched. 19(3): 285-293 (2016) - [j5]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient algorithms for membership in boolean hierarchies of regular languages. Theor. Comput. Sci. 646: 86-108 (2016) - [i5]Heinz Schmitz, Ioanna Lykourentzou:
It's about time: Online Macrotask Sequencing in Expert Crowdsourcing. CoRR abs/1601.04038 (2016) - 2010
- [c7]Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek:
Approximability and Hardness in Multi-objective Optimization. CiE 2010: 180-189 - [i4]Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek:
Hardness and Approximability in Multi-Objective Optimization. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2008
- [j4]Christian Glaßer, Heinz Schmitz:
Languages of Dot-Depth 3/2. Theory Comput. Syst. 42(2): 256-286 (2008) - [c6]Christian Glaßer, Christian Reitwießner, Heinz Schmitz:
Multiobjective Disk Cover Admits a PTAS. ISAAC 2008: 40-51 - [c5]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. STACS 2008: 337-348 - [i3]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. CoRR abs/0802.2868 (2008) - 2007
- [i2]Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Electron. Colloquium Comput. Complex. TR07 (2007) - 2001
- [j3]Christian Glaßer, Heinz Schmitz:
The Boolean Structure of Dot-Depth One. J. Autom. Lang. Comb. 6(4): 437-452 (2001) - [c4]Christian Glaßer, Heinz Schmitz:
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. Developments in Language Theory 2001: 251-261 - 2000
- [b1]Heinz Schmitz:
The forbidden pattern approach to concatenation hierarchies. Julius Maximilians University Würzburg, Germany, 2000, pp. 1-171 - [j2]Sven Kosub
Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000) - [j1]Heinz Schmitz:
Restricted Temporal Logic and Deterministic Languages. J. Autom. Lang. Comb. 5(3): 325-341 (2000) - [c3]Christian Glaßer, Heinz Schmitz:
Decidable Hierarchies of Starfree Languages. FSTTCS 2000: 503-515 - [c2]Christian Glaßer, Heinz Schmitz:
Languages of Dot-Depth 3/2. STACS 2000: 555-566
1990 – 1999
- 1998
- [c1]Sven Kosub
Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617 - [i1]Heinz Schmitz, Klaus W. Wagner:
The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy. CoRR cs.CC/9809118 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: