Sven Hartmann

From MaRDI portal
Person:697629

Available identifiers

zbMath Open hartmann.svenMaRDI QIDQ697629

List of research outcomes





PublicationDate of PublicationType
Enhancing generalization in genetic programming hyper-heuristics through mini-batch sampling strategies for dynamic workflow scheduling2024-07-11Paper
Graph-theoretical methods to construct entity-relationship databases2024-02-28Paper
Minimum weight flat antichains of subsets2021-11-19Paper
Extremal combinatorics of SQL keys2020-11-10Paper
Minimum Weight Flat Antichains of Subsets2017-03-31Paper
On the implication problem for cardinality constraints and functional dependencies2015-06-17Paper
Constructing Armstrong tables for general cardinality constraints and not-null constraints2015-02-05Paper
Reasoning about functional and full hierarchical dependencies over partial relations2014-04-16Paper
A membership algorithm for functional and multi-valued dependencies in the presence of lists2013-08-30Paper
On functional dependencies in advanced data models2013-06-06Paper
Foundations for a fourth normal form over SQL-like databases2012-03-09Paper
The Boyce-Codd-Heath normal form for SQL2011-05-27Paper
Solving the implication problem for XML functional dependencies with properties2010-09-29Paper
On the role of the complementation rule for data dependencies over incomplete relations2010-09-29Paper
Numerical constraints on XML data2010-04-22Paper
Weak functional dependencies: full propositional expressiveness for the database practitioner2009-10-28Paper
Maximal flat antichains of minimum weight2009-07-08Paper
On Inferences ofWeak Multivalued Dependencies2009-06-30Paper
Foundations of Information and Knowledge Systems2009-05-14Paper
Foundations of Information and Knowledge Systems2009-05-14Paper
Axiomatizing functional dependencies in the higher-order entity-relationship model2009-04-28Paper
Numerical Constraints for XML2009-03-10Paper
Mandatory representation designs MRD(4\(,k;v\)) with \(k\equiv 2\) mod 32009-01-28Paper
On the Notion of an XML Key2009-01-22Paper
More orthogonal double covers of complete graphs by Hamiltonian paths2008-05-13Paper
Characterising nested database dependencies by fragments of propositional logic2008-03-28Paper
Pan-orientable block designs2008-03-11Paper
Full hierarchical dependencies in fixed and undetermined universes2007-10-12Paper
Self-orthogonal decompositions of graphs into matchings2007-05-29Paper
Orthogonal directed covers by flowers2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34339362007-04-23Paper
Foundations of Information and Knowledge Systems2007-02-12Paper
Foundations of Information and Knowledge Systems2007-02-12Paper
Deciding implication for functional dependencies in complex-value databases2007-01-09Paper
Functional and multivalued dependencies in nested databases generated by record and list constructor2006-09-12Paper
On a problem of Fagin concerning multivalued dependencies in relational databases2006-04-28Paper
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q56962032006-01-26Paper
Even bonds of prescribed directed parity2006-01-17Paper
https://portal.mardi4nfdi.de/entity/Q48257052004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q44722222004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44734762004-08-04Paper
Orthogonal double covers of general graphs.2004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44134452003-07-20Paper
Superpure digraph designs2002-09-29Paper
Orthogonal double covers by super-extendable cycles2002-09-29Paper
On orthogonal double covers of graphs2002-09-17Paper
Orthogonal decompositions of complete digraphs2002-07-29Paper
Decomposing relationship types by pivoting and schema equivalence2002-03-03Paper
Suborthogonal double covers of complete graphs2001-12-12Paper
https://portal.mardi4nfdi.de/entity/Q45086212001-08-16Paper
https://portal.mardi4nfdi.de/entity/Q49498242001-05-17Paper
https://portal.mardi4nfdi.de/entity/Q45040082000-09-14Paper
Asymptotic results on suborthogonal \(\overrightarrow{\mathfrak G}\)-decompositions of complete digraphs2000-01-02Paper

Research outcomes over time

This page was built for person: Sven Hartmann