Uwe Leck

Nishita Balamuralikrishna

Proc. VLDB Endow., 2019

Possibilistic keys.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2019

Entity Integrity, Referential Integrity, and Query Optimization with Embedded Uniqueness Constraints.

[BibT_eX]

[DOI]

Ziheng Wei

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018

Extremal Combinatorics of SQL Keys.

[BibT_eX]

Proceedings of the Models: Concepts, Theory, Logic, Reasoning and Semantics, 2018

2017

Full and maximal squashed flat antichains of minimum weight.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Possible and certain keys for SQL.

[BibT_eX]

[DOI]

VLDB J., 2016

Minimizing the regularity of maximal regular antichains of 2- and 3-sets.

[BibT_eX]

[DOI]

Australas. J Comb., 2016

2015

Constructing Armstrong tables for general cardinality constraints and not-null constraints.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2015

2014

Inequalities for cross-unions of collections of finite sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Logical Foundations of Possibilistic Keys.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

2013

Maximal Antichains of Minimum Size.

[BibT_eX]

[DOI]

Thomas Kalinowski

Electron. J. Comb., 2013

On Data Recovery in Distributed Databases.

[BibT_eX]

[DOI]

Sergei L. Bezrukov

Victor P. Piotrowski

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Minimizing the weight of the union-closure of families of two-sets.

[BibT_eX]

[DOI]

Jamie Simpson

Australas. J Comb., 2012

2011

Minimizing the weight of the union-closure of uniform families of sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

On Codd Families of Keys over Incomplete Relations.

[BibT_eX]

[DOI]

Comput. J., 2011

2009

A Simple Proof of the Karakhanyan--Riordan Theorem on the Even Discrete Torus.

[BibT_eX]

[DOI]

Sergei L. Bezrukov

SIAM J. Discret. Math., 2009

Maximal Flat Antichains of Minimum Weight.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

On Matrix Representations of Participation Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Conceptual Modeling - Challenging Perspectives, 2009

2008

More orthogonal double covers of complete graphs by Hamiltonian paths.

[BibT_eX]

[DOI]

Volker Leck

Discret. Math., 2008

2006

Orthogonal double covers of complete graphs by fat catepillars.

[BibT_eX]

[DOI]

Dalibor Froncek

Discuss. Math. Graph Theory, 2006

A Conjecture in Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005

Self-orthogonal decompositions of graphs into matchings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders.

[BibT_eX]

[DOI]

Comb., 2004

2003

On the orthogonal product of simplices and direct products of truncated Boolean lattices.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Another Generalization of Lindström's Theorem on Subcubes of a Cube.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2002

A Class of 2-Colorable Orthogonal Double Covers of Complete Graphs by Hamiltonian Paths.

[BibT_eX]

[DOI]

Hans-Dietrich O. F. Gronau

Graphs Comb., 2002

On the average size of sets in intersecting Sperner families.

[BibT_eX]

[DOI]

Discret. Math., 2002

On Orthogonal Double Covers of Graphs.

[BibT_eX]

Des. Codes Cryptogr., 2002

2001

Optimal shadows and ideals in submatrix orders.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

A property of colored complexes and their duals.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter.

[BibT_eX]

[DOI]