Sciweavers

CIAC
2010
Springer
278views Algorithms» more  CIAC 2010»
14 years 5 months ago
Maximizing PageRank with new Backlinks
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
Martin Olsen
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
14 years 5 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
CIAC
2010
Springer
197views Algorithms» more  CIAC 2010»
14 years 5 months ago
Strategic Coloring of a Graph
Bruno Escoffier, Laurent Gourves, Jerome Monnot
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 9 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
14 years 9 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...
CIAC
2010
Springer
258views Algorithms» more  CIAC 2010»
14 years 9 months ago
A Planar Linear Arboricity Conjecture
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
Marek Cygan, Lukasz Kowalik, Borut Luzar
CIAC
2010
Springer
275views Algorithms» more  CIAC 2010»
14 years 9 months ago
Online Cooperative Cost Sharing
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, mos...
Janina Brenner and Guido Schaefer
CIAC
2010
Springer
260views Algorithms» more  CIAC 2010»
14 years 9 months ago
Popular matchings in the Marriage and Roommates problems
Peter Biro, Rob Irving, David Manlove
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 9 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...