Outputs (3163)

Partitioning graphs into connected parts (2009)
Presentation / Conference Contribution
Hof, P. V. '., Paulusma, D., & Woeginger, G. (2009, August). Partitioning graphs into connected parts. Presented at Fourth International Computer Science Symposium in Russia (CSR 2009)., Novosibirsk, Russia

The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The Longest Pa... Read More about Partitioning graphs into connected parts.

Emerging Internet Technologies for E-Learning (2009)
Journal Article
Li, Q., Lau, R., Leung, E., Li, F., Lee, V., Wah, B. W., & Ashman, H. (2009). Emerging Internet Technologies for E-Learning. IEEE Internet Computing, 13(4), 11-17. https://doi.org/10.1109/mic.2009.83

As a flourishing field, e-learning at large (including distance learning, Web-based learning, and digital game-based learning) has attracted increasing attention from both industry and academic sectors. To facilitate the development of effective e-le... Read More about Emerging Internet Technologies for E-Learning.

A parameterized algorithm for the preemptive scheduling of equal-length jobs (2009)
Presentation / Conference Contribution
Mertzios, G., & Unger, W. (2009, July). A parameterized algorithm for the preemptive scheduling of equal-length jobs. Presented at International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS-09), Orlando, Florida

We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighted completion times n i=1 wiCi of the jobs. We propose for this problem... Read More about A parameterized algorithm for the preemptive scheduling of equal-length jobs.

Fast convergence of routing games with splittable flows (2009)
Presentation / Conference Contribution
Mertzios, G. (2009, July). Fast convergence of routing games with splittable flows. Presented at International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS- 09), Orlando, Florida

In this paper we investigate the splittable routing game in a series-parallel network with two selfish players. Every player wishes to route optimally, i.e. at minimum cost, an individual flow demand from the source to the destination, giving rise to... Read More about Fast convergence of routing games with splittable flows.

Sublinear-Time Algorithms for Tournament Graphs (2009)
Presentation / Conference Contribution
Dantchev, S., Friedetzky, T., & Nagel, L. (2009, July). Sublinear-Time Algorithms for Tournament Graphs. Presented at 15th Annual International Conference of Computing and Combinatorics (COCOON 2009), Niagara Falls, New York, USA

We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O (√n ∙ log n ∙ √log*n), that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result... Read More about Sublinear-Time Algorithms for Tournament Graphs.

Variational Bayesian noise estimation of point sets. (2009)
Journal Article
Yoon, M., Ivrissimtzis, I., & Lee, S. (2009). Variational Bayesian noise estimation of point sets. Computers and Graphics, 33(3), 226 - 234. https://doi.org/10.1016/j.cag.2009.03.019

Scanning devices acquire geometric information from the surface of an object in the form of a 3D point set. Such point sets, as any data obtained by means of physical measurement, contain some noise. To create an accurate model of the scanned object,... Read More about Variational Bayesian noise estimation of point sets..

A Coupling Tool for the Partitioned Simulation of Fluid-Structure Interactions (2009)
Presentation / Conference Contribution
Gatzhammer, B., Mehl, M., Weinzierl, T., Kvamsdal, T., Pettersen, B., Bergan, P., Onate, E., & Garcia, J. (2009, June). A Coupling Tool for the Partitioned Simulation of Fluid-Structure Interactions. Presented at Computational Methods in Marine Engineering International Center for Numerical Methods in Engineering (CIMNE), Trondheim

Distance Based Feature Detection on 3D Point Sets. (2009)
Presentation / Conference Contribution
Ahmad, R., & Ivrissimtzis, I. (2009, June). Distance Based Feature Detection on 3D Point Sets. Presented at 6th Theory and Practice of Computer Graphics Conference, Cardiff

Challenges and advances in using IP multicast for overlay data delivery - [Consumer communications and networking] (2009)
Journal Article
Jin, X., Tu, W., & Chan, S. H. (2009). Challenges and advances in using IP multicast for overlay data delivery - [Consumer communications and networking]. IEEE Communications Magazine, 47(6), 157-163. https://doi.org/10.1109/MCOM.2009.5116814

IP multicast and overlay multicast have been proposed for one-to-many data delivery over the Internet. Compared to overlay multicast, IP multicast is less deployed but can achieve higher delivery efficiency. Researchers hence study how to combine IP... Read More about Challenges and advances in using IP multicast for overlay data delivery - [Consumer communications and networking].

Partitioning graphs into connected parts (2009)
Journal Article
Hof, P. V. '., Paulusma, D., & Woeginger, G. J. (2009). Partitioning graphs into connected parts. Theoretical Computer Science, 410(47-49), 4834-4843. https://doi.org/10.1016/j.tcs.2009.06.028

The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The Longest Pat... Read More about Partitioning graphs into connected parts.