| Publication | Date of Publication | Type |
|---|
A necessary condition for the equality of the clique number and the convexity number of a graph
Discrete Applied Mathematics | 2022-04-20 | Paper |
Computing a metric basis of a bipartite distance-hereditary graph
Theoretical Computer Science | 2021-12-22 | Paper |
On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
Discrete Applied Mathematics | 2020-06-29 | Paper |
Computing a metric basis of a 2-connected bipartite distance-hereditary graph
Theoretical Computer Science | 2019-12-27 | Paper |
Two classes of graphs in which some problems related to convexity are efficiently solvable
Discrete Mathematics, Algorithms and Applications | 2018-11-14 | Paper |
The contour of a bridged graph is geodetic
Discrete Applied Mathematics | 2016-04-07 | Paper |
Decomposability of abstract and path-induced convexities in hypergraphs
Discussiones Mathematicae Graph Theory | 2015-08-04 | Paper |
On the geodeticity of the contour of a graph
Discrete Applied Mathematics | 2014-12-05 | Paper |
Computing simple-path convex hulls in hypergraphs
Information Processing Letters | 2013-04-04 | Paper |
Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
Discrete Mathematics, Algorithms and Applications | 2013-01-24 | Paper |
Equivalence between hypergraph convexities
ISRN Discrete Mathematics | 2012-04-03 | Paper |
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
Theoretical Computer Science | 2010-03-09 | Paper |
An analytical approach to the inference of summary data of additive type
Theoretical Computer Science | 2007-10-18 | Paper |
Minimal invariant sets in a vertex-weighted graph
Theoretical Computer Science | 2006-10-20 | Paper |
| scientific article; zbMATH DE number 1472189 (Why is no real title available?) | 2000-12-13 | Paper |
Decomposition of a hypergraph by partial-edge separators
Theoretical Computer Science | 2000-06-04 | Paper |
A fast algorithm for query optimization in universal-relation databases
Journal of Computer and System Sciences | 1998-11-10 | Paper |
Doubly chordal graphs, steiner trees, and connected domination
Networks | 1993-06-29 | Paper |
Dynamic query interpretation in relational databases
Information Systems | 1989-01-01 | Paper |
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
SIAM Journal on Computing | 1988-01-01 | Paper |
On hypergraph acyclicity and graph chordality
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060740 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4078860 (Why is no real title available?) | 1988-01-01 | Paper |
On the existence of acyclic views in a database scheme
Theoretical Computer Science | 1985-01-01 | Paper |
Inclusion and equivalence between relational database schemata
Theoretical Computer Science | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3876650 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3698433 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3548404 (Why is no real title available?) | 1976-01-01 | Paper |
