"capital accumulation channel" and the "total factor productivity (TFP) growth channel". This paper carries out the first …-induced" productivity improvement significantly enhance growth? And finally, what is the magnitude of the TFP growth channel compared to the … productivity. Most interestingly, our estimates suggest that this channel conveys the most important part of the growth …

growth. This paper analyses the innovation-productivity relationship at the industry-level for a sample of OECD manufacturing … sectors of the economy on the innovative process of manufacturing and its consequences on productivity. We test for a …

theoretical underpinnings for most debates on the origins of the particular economic growth and productivity gains that have taken … the evolution of two different forms of productivity (the productivity of labour and total factor productivity … be used to analyse the ongoing economic growth in the U.S. Until now, macroeconomic growth models have provided the …

This paper studies the effect of changes in the employment rate on labour productivity per hour, taking an empirical …

The paper focuses on the influence of upstream competition for productivity outcomes in downstream sectors. This …. Thus, lack of competition in upstream markets curbs incentives to improve productivity downstream, negatively affecting … productivity outcomes. We test this prediction by estimating an error correction model that differentiates the potential downstream …

complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs … saying that every Berge graph either is in a well understood basic class or has some kind of decomposition. Then, Chudnovsky …

balanced skew partition if it has one. It relies on a new decomposition theorem for Berge graphs, that is more precise than the … at an essential step one of the decomposition theorems of Chudnovsky. …

complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs … saying that every Berge graph either is in a well understood basic class or has some kind of decomposition. Then, Chudnovsky …

subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition …-joins. Our decomposition theorem actually gives a complete structure theorem for C, i.e. every graph in C can be built from …

We prove a decomposition theorem for graphs that do not contain a subdivision of the complete graph on four vertices as …