Stavros S. Cosmandakis

Available identifiers

Publication	Date of Publication	Type
Resolution based algorithms for the transversal hypergraph generation problem	2020-04-06	Paper
Datalog programs and their persistency numbers	2017-07-12	Paper
Undecidability and intractability results concerning datalog programs and their persistency numbers	2015-09-17	Paper
https://portal.mardi4nfdi.de/entity/Q5714262	2005-12-28	Paper
https://portal.mardi4nfdi.de/entity/Q4473154	2004-08-04	Paper
Inherent complexity of recursive queries	2002-09-12	Paper
On the orthographic dimension of definable sets	2002-07-14	Paper
On datalog vs polynomial time	1995-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q3972839	1992-06-26	Paper
Polynomial-time implication problems for unary inclusion dependencies	1990-01-01	Paper
The word and generator problems for lattices	1988-01-01	Paper
The complexity of minimizing wire lengths in VLSI layouts	1987-01-01	Paper
The complexity of the travelling repairman problem	1986-01-01	Paper
Partition semantics for relations	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3696560	1985-01-01	Paper
The Traveling Salesman Problem with Many Visits to Few Cities	1984-01-01	Paper
Updates of Relational Views	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3341921	1983-01-01	Paper
The complexity of evaluating relational queries	1983-01-01	Paper

This page was built for person: Stavros S. Cosmandakis