Filters
total: 621
Search results for: combinatorial thinking
-
Kamil Brodnicki dr inż.
PeopleKamil Brodnicki is an assistant at the Department of Applied Informatics in Management at the Faculty of Economics and Management at the Gdańsk University of Technology. From 2017, he is the head of the Customer Experience laboratory. Since 2011, he has been working in one of the Tri-City IT companies as an IT Systems Analyst, implementing projects in the financial sector. His research interests are focused on the following areas:...
-
Are creative users more apt in reusing and adopting Open Government Data (OGD)? Gender differences
PublicationOpen Government Data (OGD) has been considered as a potent instrument for value creation and innovation by a range of stakeholders. Given that individual ingenuity is a function of individual and environmental factors, it is important to understand how the OGD adoption and usage is a factor of creative performance behaviors (CPB), viz., Problem Identification (PI), Information Search (IS), Idea Generation (IG) and Idea Promotion...
-
Oznaczanie stężeń jonów fluorkowych w próbkach wody pitnej z terenu miasta Malborka = Determination of fluoride ions in drinking water samples collected from the area of the town of Malbork
PublicationW pracy przedstawiono badania próbek wody pitnej z terenu miasta Malborka. Próbki wody pobierano sześciokrotnie (w miesięcznych odstępach - październik 2008, listopad 2008, grudzień 2008, styczeń 2009, luty 2009 oraz marzec 2009) w siedmiu punktach leżących w głównych dzielnicach miasta Malborka. Pobrane próbki podano analizie w celu oznaczenia następujących parametrów: zawartość anionów: F-, Cl-, Br-, 2NO , 3NO , 34 PO , 24 SO...
-
European Chapter on Combinatorial Optimization
Conferences -
International Workshop on Combinatorial Algorithm
Conferences -
Australasian Workshop on Combinatorial Algorithms
Conferences -
Conference on Combinatorial Optimization and Applications
Conferences -
International Symposium on Combinatorial Optimisation
Conferences -
AKCE International Journal of Graphs and Combinatorics
Journals -
Practices of Linking Aspect Technology and Evolution
Conferences -
Parallel tabu search for graph coloring problem
PublicationTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Design thinking 2023/2024
e-Learning Courses -
Workshop on Combinatorial and Algorithmic Aspects of Networking
Conferences -
Conference on Integer Programming and Combinatorial Optimization
Conferences -
Do mistakes acceptance foster innovation? Polish and US cross-country study of tacit knowledge sharing in IT
PublicationAbstract Purpose – This study aims to understand and compare how the mechanism of innovative processes in the information technology (IT) industry – the most innovative industry worldwide – is shaped in Poland and the USA in terms of tacit knowledge awareness and sharing driven by a culture of knowledge and learning, composed of a learning climate and mistake acceptance. Design/methodology/approach – Study samples were drawn from...
-
Trends shaping innovations in the aerosol market
PublicationNew hygiene regimes and sustainability commitments are helping to shape the aerosol market. Norbert Piotrowski of Aerosol Service Poland explains the thinking behind the company’s latest hygiene innovations.
-
Design thinking 2021/2022 NSZ
e-Learning Courses -
Reducing the number of periodic points in the smooth homotopy class of a self-map of a simply-connected manifold with periodic sequence of Lefschetz numbers
PublicationLet f be a smooth self-map of an m-dimensional (m >3) closed connected and simply-connected manifold such that the sequence of the Lefschetz num- bers of its iterations is periodic. For a fixed natural r we wish to minimize, in the smooth homotopy class, the number of periodic points with periods less than or equal to r. The resulting number is given by a topological invariant J[f] which is defned in combinatorial terms and is...
-
The Sustainable Link - the Haze of the Past in the Future
PublicationThe aim of the topic is to explore the site by focusing on historical elements and life cycle thinking. The history and sustainability will thereby be the core approach and method during the ongoing design process. These themes will encourage the interdisciplinary and iterative design process.
-
Anna Zielińska dr
PeopleIn 2016, she started her work at the Faculty of Management and Economics of the Gdańsk University of Technology. Since 2018, a member of the board of the International Project Management Association Young Crew Polska. Author of numerous scientific publications in the field of crisis management, project and health program management, and improvement of business entities. Scientific and research interests include program and project...
-
On the connected and weakly convex domination numbers
PublicationIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Anna Lis dr hab. inż.
PeopleAnna Lis has been the head of the Department of Management in Industry, Faculty of Economics and Management GUT since 2019. In 2005 she obtained Ph.D. degree in the field of Economic Sciences, in the discipline Management Sciences, 2019 – the degree of habilitated doctor in the field of Social Sciences, in the discipline of Management and Quality Studies. In the years 2004-2009 she was employed at the Faculty of Production Engineering...
-
International Workshop on Algebraic and Combinatorial Coding Theory
Conferences -
European Conference on Evolutionary Computation in Combinatorial Optimisation
Conferences -
MSRI Combinatorial Game Theory Research Workshop
Conferences -
Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Conferences -
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
PublicationFor a given self-map f of M, a closed smooth connected and simply-connected manifold of dimension m 4, we provide an algorithm for estimating the values of the topological invariant D^m_r [f], which equals the minimal number of r-periodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing D^m_r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013),...
-
Zarządzanie informacyjnym środowiskiem pracy
PublicationCel. Niniejsza praca ma na celu wskazanie zależności pomiędzy zróżnicowanym poziomem zaangażowania projektantów w wykorzystanie Design Thinking w projektowaniu usług i kształtowaniu środowiska pracy projektantów a efektami ich pracy. Celem przeprowadzonych badań była identyfikacja czynników środowiskowych stymulujących efektywność pracy projektanta nowej usługi. Metoda/podejście. W środowisku akademickim w trzech grupach przyszłych projektantów...
-
International Conference on Computing and Combinatorics
Conferences -
Workshop on Analytic Algorithmics and Combinatorics
Conferences -
Workshop on Algorithms, Combinatorics, and Geometry
Conferences -
Sławomir Ostrowski dr inż.
PeopleSławomir Ostrowski is a research and didactic employee employed as an Assistant Professor in the Department of Informatics in Management at the Faculty of Management and Economics of the Gdańsk University of Technology. In 2018, he obtained a PhD in economic sciences in the discipline of management science. A graduate of uniform Master's-engineering studies in Management (specialization: IT Technology Management) at the Faculty...
-
Więcej niż odchudzanie. Istota koncepcji zarządzania Lean
PublicationArtykuł opisuje koncepcję Lean z punktu widzenia pracownika i metod zarządzania zasobami ludzkimi. Charakteryzuje tzw. Lean Thinking, czyli szczupłe myślenie towarzyszące technicznym zmianom związanym z wdrażaniem narzędzi wykorzystywanych przez koncepcję Lean.
-
Regenarative tourism – between theory and practice
PublicationPurpose: The aim of this article is to present a shift in thinking in terms of implementing the systems and practices needed to transition to a regenerative approach in tourism. The article aims to provide concrete ways to change thinking and move towards a regenerative paradigm in the tourism industry. Design/methodology/approach: This viewpoint paper defines regenerative tourism and explores its principles and the possibilities...
-
Management and Economics for GTM
e-Learning CoursesThe aim of this course is to make students acquainted with economic foundations, economic way of thinking and elements of own business management. Green Technologies and Monitoring 2nd semester
-
Bartosz Sawik
PeopleDr Bartosz Sawik is a Professor at the Department of Business Informatics and Engineering Management, AGH University of Science and Technology, Krakow, Poland and at the Institute of Smart Cities, GILT-OR Group, Department of Statistics, Computer Science and Mathematics, Public University of Navarre, Pamplona, Spain. He is a Visiting Researcher at the University of California, Berkeley, USA. He has a Ph.D. and a M.Sc. and Eng....
-
Eye-tracking Web Usability Research
PublicationIn this paper we present the results of a study that aims to evaluate the usability of three selected web services, based on eye–tracking and thinking aloud techniques. The gathered comments and observations, recapitulated and supported by particular measures, allow us to discover and describe typical user behavior pertaining to given tasks to solve.
-
Computations of the least number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds
PublicationLet $r$ be an odd natural number, $M$ a compact simply-connected smooth manifold, $\dim M\geq 4$, such that its boundary $\partial M$ is also simply-connected. We consider $f$, a $C^1$ self-maps of $M$, preserving $\partial M$. In [G. Graff and J. Jezierski, Geom. Dedicata 187 (2017), 241-258] the smooth Nielsen type periodic number $D_r(f;M,\partial M)$ was defined and proved to be equal to the minimal number of $r$-periodic points...
-
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Conferences -
International Workshop on Combinatorial Image Analysis: Theory and Applications
Conferences -
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
The complexity of list ranking of trees
PublicationUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...
-
Packing Three-Vertex Paths in 2-Connected Cubic Graphs
PublicationW pracy rozważano problem rozmieszczanie ścieżek P3 w 2-spójnych grafach 3-regularnych. Pokazano, że w 2-spójnym grafie 3-regularnym o n wierzchołkach można zawsze pokryć 9/11 n wierzchołków przez ścieżki P3; podano także odpowiednie oszacowania górne.
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublicationThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
On trees with double domination number equal to total domination number plus one
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
The hat problem on cycles on at least nine vertices
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Discrete Models: Combinatorics, Computation and Geometry
Conferences