Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: trees
Found
32 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A Near‐Linear Area Bound for Drawing Binary Trees
2002,
Chan
We present several simple methods to construct planar, strictly upward, strongly...
An Exact Exponential Time Algorithm for Power Dominating Set
2012,
Fernau Henning
The Power Dominating Set problem is an extension of the well‐known domination...
MPQ‐trees for the Orthogonal Packing Problem
2012,
Pcher Arnaud
Given a set of rectangular items of different sizes and a rectangular container, the...
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two
2001,
Bodlaender H L
In this paper a parallel algorithm is given that, given a graph G=(V,E) , decides...
Steiner Minimal Trees with One Polygonal Obstacle
2001,
MacGregor Smith J
In this paper we study the Steiner minimal tree T problem for a point set Z with...
Optimal Edge Ranking of Trees in Linear Time
2001,
Lam T W
Given a tree, finding an optimal node ranking and finding an optimal edge ranking are...
The Asymptotic Number of Leftist Trees
2001,
Drmota M
It is shown that the number of leftist trees of size n in a simply generated family of...
Sharp Separation and Applications to Exact and Parameterized Algorithms
2012,
Lokshtanov Daniel
Many divide‐and‐conquer algorithms employ the fact that the vertex set...
First Page
1
2
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers