# Claudio L. Lucchesi

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**Abstract An algorithm is presented that finds K , the set of all keys for a given set A of attribute names and a given set D [0] of functional dependencies, in time polynomial in | A |, | D [0]| and… Expand

This minimax equality was conjectured about a decade ago by one of the authors ([7; page 43], [8], [9]) and, independently, by Neil Robertson. It arose in the study of a problem posed several years… Expand

The construction of minimal acyclic deterministic partial finite automata to represent large natural language vocabularies is described. Applications of such automata include spelling checkers and… Expand

Abstract In (2001, J. Combin. Theory Ser. B ) we established the validity of the main theorem (1.1) for solid bricks. Here, we establish the existence of suitable separating cuts in nonsolid bricks… Expand

G different from and has at least Δ edge-disjoint removable ears, where Δ is the maximum degree of G. This shows that any matching covered graph G has at least Δ! different ear decompositions, and… Expand

In 1987, Lovasz conjectured that every brick G different from K4, C6, and the Petersen graph has an edge e such that G?e is a matching covered graph with exactly one brick. Lovasz and Vempala… Expand

Finite automata used to represent large vocabularies of natural languages are quite sparse in the following sense: for the vast majority of states, almost all transitions lead to the rejecting state.… Expand

Barrier cuts and 2-separation cuts are two familiar types of tight cuts in matching covered graphs, see Lovász ([6], 1987). We refer to these two types of tight cuts as ELP-cuts. A fundamental result… Expand