Sciweavers

Share
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
6 years 11 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
COMPGEOM
2011
ACM
8 years 2 days ago
Integer representations of convex polygon intersection graphs
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
Tobias Müller, Erik Jan van Leeuwen, Jan van ...
DAM
2011
8 years 3 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
8 years 6 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
JGAA
2010
128views more  JGAA 2010»
8 years 7 months ago
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...
GD
2009
Springer
8 years 11 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
WG
2004
Springer
9 years 1 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
9 years 3 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded eļ¬ƒcient algorithms ...
Imran A. Pirwani
books