-
1
-
-
0002981945
-
A partial fc-arboretum of graphs with bounded treewidth
-
Hans Leo Bodlaender. A partial fc-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209: 1-45, 1998.
-
(1998)
Theoretical Computer Science
, vol.209
, pp. 1-45
-
-
Bodlaender, H.L.1
-
3
-
-
33750077026
-
Graph Theory (second edition)
-
Springer, February
-
Reinhard Diestel. Graph Theory (second edition), volume 173 of Graduate Texts in Mathematics. Springer, February 2000.
-
(2000)
Graduate Texts in Mathematics
, vol.173
-
-
Diestel, R.1
-
4
-
-
0038099322
-
Diameter and treewidth in minor-closed graph families
-
David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27: 275-291, 2000.
-
(2000)
Algorithmica
, vol.27
, pp. 275-291
-
-
Eppstein, D.1
-
5
-
-
0033697987
-
On the dilation of interval routing
-
Cyril Gavoille. On the dilation of interval routing. The Computer Journal, 43(1): 1-7, 2000.
-
(2000)
The Computer Journal
, vol.43
, Issue.1
, pp. 1-7
-
-
Gavoille, C.1
-
6
-
-
0000783882
-
A survey on interval routing
-
Cyril Gavoille. A survey on interval routing. Theoretical Computer Science, 245(2): 217-253, 2000.
-
(2000)
Theoretical Computer Science
, vol.245
, Issue.2
, pp. 217-253
-
-
Gavoille, C.1
-
7
-
-
84945278107
-
Approximate distance labeling schemes
-
Springer, August, To appear
-
Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, and David Peleg. Approximate distance labeling schemes. In 9th Annual European Symposium on Algorithms (ESA), volume Lectures Notes in Computer Science. Springer, August 2001. To appear.
-
(2001)
9th Annual European Symposium on Algorithms (ESA), volume Lectures Notes in Computer Science
-
-
Gavoille, C.1
Katz, M.2
Katz, N.A.3
Paul, C.4
David, P.5
-
9
-
-
84945300168
-
Small k-dominating sets in planar graphs with applications
-
LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, May
-
Cyril Gavoille, David Peleg, André Raspaud, and Eric Sopena. Small k-dominating sets in planar graphs with applications. Research Report RR-1258-01, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, May 2001.
-
(2001)
Research Report RR-1258-01
-
-
Gavoille, C.1
Peleg, D.2
Raspaud, A.3
Sopena, E.4
-
10
-
-
0038419088
-
The complexity of shortest path and dilation bounded interval routing
-
Rastislav Kráľovič, Peter Ružička, and Daniel Štefankovič. The complexity of shortest path and dilation bounded interval routing. Theoretical Computer Science, 234(1-2): 85-107, 2000.
-
(2000)
Theoretical Computer Science
, vol.234
, Issue.1-2
, pp. 85-107
-
-
Kráľovič, R.1
Ružička, P.2
Štefankovič, D.3
-
11
-
-
0000203509
-
On the ratio of optimal integral and fractional covers
-
Laszlo Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13: 383-390, 1975.
-
(1975)
Discrete Mathematics
, vol.13
, pp. 383-390
-
-
Lovász, L.1
-
13
-
-
0000673493
-
Graph minors. II. Algorithmic aspects of tree-width
-
Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7: 309-322, 1986.
-
(1986)
Journal of Algorithms
, vol.7
, pp. 309-322
-
-
Robertson, N.1
Seymour Paul, D.2
-
14
-
-
0022013653
-
Labelling and implicit routing in networks
-
February
-
Nicola Santoro and Ramez Khatib. Labelling and implicit routing in networks. The Computer Journal, 28(1): 5-8, February 1985.
-
(1985)
The Computer Journal
, vol.28
, Issue.1
, pp. 5-8
-
-
Santoro, N.1
Khatib, R.2
|