In: Bioinformatics, 2018, vol. 34, no. 13, p. i574-i582
|
In: Numerische Mathematik, 2014, vol. 126, no. 4, p. 589-633
|
In: Numerische Mathematik, 2012, vol. 121, no. 3, p. 397-431
|
In: Lecture Notes in Computer Science, 2016, vol. 9843, p. 229-240
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard, but can be solved in polynomial time in some restricted graph classes, such as P4-free graphs or 2K2-free graphs. For classes defined by finitely many forbidden induced subgraphs, the boundary separating...
|
In: Business & Information Systems Engineering, 2015, vol. 57, no. 1, p. 3-13
|
In: Networks and Spatial Economics, 2015, vol. 15, no. 1, p. 117-147
|
In: Software Quality Journal, 2011, vol. 19, no. 4, p. 801-839
|
In: Mathematical Programming, 2015, vol. 149, no. 1-2, p. 361-390
|
In: Proceedings of 10th ACM Conference on Web Science (WebSci’18) Amsterdam, 27-30 May 2018
Enterprise crowdsourcing capitalises on the availability of employ-ees for in-house data processing. Gamification techniques can help aligning employees’ motivation to the crowdsourcing endeavour. Although hitherto, research efforts were able to unravel the wide arsenal of gamification techniques to construct engagement loops, little research has shed light into the social game dynamics...
|
In: Information Systems and e-Business Management, 2014, vol. 12, no. 1, p. 43-70
|
