Effective Communication in Organisations Increases their Competitiveness

Stacho, Zdenko; Stachová, Katarína; Papula, Ján; Papulová, Zuzana; Kohnová, Lucia

doi:10.17512/pjms.2019.19.1.30

Cited by 37 publications

(37 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Their reliability that gains more and more strategic meaning because it influences reaching the goals of every organization is influenced by various factors (Kubaľa & Vetráková, 2018). Recent research in the field (Stacho et al, 2019;Kucharčíková et al, 2015) point out that one of them is education, that increases the productivity of an organization and it also flourishes every career move of individuals. The result of education and development is the expected positive contribution in accordance with what company expects (Krišťák et al, 2014).…”

Section: Theoretical Developmentsmentioning

confidence: 99%

Education as a Key in Career Building

Hitka

Štarchoň

Lorincová

et al. 2021

Journal of Business Economics and Management

View full text Add to dashboard Cite

Human resources in companies are gaining increasingly more strategic meaning by its ability to influence reaching company goals. The task of a manager is to understand the fact that every employee is different, has different needs, goals, and ambitions, is motivated by something else in every stage of career ladder. The aim of the paper is to define the influence of education in building the employee’s career. The presumption if the level of education has influence on the career motivation factors is verified on the sample of 3,720 respondents. The results of the research have confirmed that the employee’s career is influenced by the level of education significantly. Motivation factors education and personal growth, applying own skills, self-fulfillment, and autonomous decision-making are perceived differently in terms of importance and gender. Therefore, it is recommended the company managers to include into leading of employee’s career also the level of education in the context of gender that influences employee’s needs and interests.

show abstract

Section: Theoretical Developmentsmentioning

confidence: 99%

Education as a Key in Career Building

Hitka

Štarchoň

Lorincová

et al. 2021

Journal of Business Economics and Management

View full text Add to dashboard Cite

show abstract

“…This is gaining importance with the oncoming of the Fourth Industrial Revolution, as competitive technology or its financial strategy can be imitated much easier than imitating the soft aspects of management and development within an organization. Human potential can be perceived as the only and unique, living and reviving, dynamic and dynamizing power of an enterprise (Cagáňová et al 2019;Stacho et al 2019;Stacho et al, 2017;Vojtech et al 2019;Papula et al 2018;Hitka et al 2017). Identifying, exploiting, motivating, and developing constructive human potential involves meaningful and systematic effort that is nowadays perceived as the management and development of human potential (Blašková, 2003).…”

Section: Introductionmentioning

confidence: 99%

Human resource management trends in Slovakia

Stachová¹,

Stacho²,

Raišienė³

et al. 2020

Journal of International Studies

Self Cite

View full text Add to dashboard Cite

Human potential introduces an enormous range of knowledge, skills, predictable and unpredictable responses, ways of perception, experience, and behaviour. The human potential in the corporate environment, i.e. people and their complex positive and negative abilities are mostly constructive, but sometimes destructive creators of new values and new knowledge. The need to implement changes in management systems is a challenge and a condition for future competitiveness these days. In this paper, the authors focus on the culturalhistorical development of human resource management from the time when people were only a secondary component of production to the present when they are a key element in maintaining competitiveness. A survey conducted between 2010 and 2019 analyses how human resource management in Slovak organizations has changed over the past decade. The survey revealed several

show abstract

“…In this paper, we study a new graph parameter, LexCycle, which measures the maximum length of a cycle of LexBFS + sweeps. It was conjectured in [19] that LexCycle(G) ≤ an(G), ∀G, we disproved the conjecture by giving a construction that grows LexCycle(G) faster than an(G). We still believe however, and conjecture, that LexCycle(G) = 2 for G AT-free.…”

Section: Discussionmentioning

confidence: 83%

“…Due to the nature of the + rule, LexCycle(G) ≥ 2. At first glance we know that LexCycle(G) ≤ n!, and more precisely LexCycle(G) is bounded by the number of LexBFS orderings of G. But there is no evidence for another general bound, say poly(n) for instance In fact it was conjectured in [19] that LexCycle(G) ≤ an(G). Unfortunately we can disprove this conjecture below.…”

Section: Algorithm 1 Lexbfsmentioning

confidence: 99%

A New Graph Parameter to Measure Linearity

Charbit¹,

Habib²,

Mouatadid³

et al. 2017

Combinatorial Optimization and Applications

View full text Add to dashboard Cite

Since its introduction to recognize chordal graphs by Rose, Tarjan, and Lueker, Lexicographic Breadth First Search (LexBFS) has been used to come up with simple, often linear time, algorithms on various classes of graphs. These algorithms, called multi-sweep algorithms, compute a number of LexBFS orderings σ1, . . . , σ k , where σi is used to break ties for σi+1, we write LexBFS + (σi) = σi+1. For instance, Corneil et al. gave a linear time multi-sweep algorithm to recognize interval graphs [SODA 1998], Kratsch et al. gave a certifying recognition algorithm for interval and permutation graphs [SODA 2003]. Since the number of LexBFS orderings for a graph is finite, after some fixed number of + sweeps, we will eventually loop in a sequence of σ1, . . . , σ k vertex orderings such that σi+1 = LexBFS + (σi) mod k. We study this new graph invariant, LexCycle(G), defined as the maximum length of a cycle of vertex orderings obtained via a sequence of LexBFS + . In this work, we focus on graph classes with small LexCycle. We give evidence that a small LexCycle often leads to linear structure that has been exploited algorithmically on a number of graph classes. In particular, we show that for proper interval, interval, co-bipartite, domino-free cocomparability graphs, as well as trees, there exists two orderings σ and τ such that σ = LexBFS + (τ ) and τ = LexBFS + (σ). One of the consequences of these results is the simplest algorithm to compute a transitive orientation for these graph classes. It was conjectured by Stacho [2015] that LexCycle is at most the asteroidal number of the graph class, we disprove this conjecture by giving a construction for which LexCycle(G) > an(G), the asteroidal number of G.

show abstract

Effective Communication in Organisations Increases their Competitiveness

Cited by 37 publications

References 0 publications

Education as a Key in Career Building

Education as a Key in Career Building

Human resource management trends in Slovakia

A New Graph Parameter to Measure Linearity

Contact Info

Product

Resources

About