Information Processing Letters logo Elsevier logo

Publisher: Elsevier

Related content
Volume 84, Number 4, 30 November 2002

< previous issue | all issues | next issue >

Board of Editors
pp. CO2-CO2(1)

Packing triangles in bounded degree graphs
pp. 175-180(6)
Authors: Caprara A.; Rizzi R.

Complexity of weak acceptance conditions in tree automata
pp. 181-187(7)
Authors: Neumann J.; Szepietowski A.; Walukiewicz I.

A simple matching algorithm for regular bipartite graphs
pp. 189-193(5)
Authors: Makino K.; Takabatake T.; Fujishige S.

The on-line first-fit algorithm for radio frequency assignment problems
pp. 195-199(5)
Authors: Tsai Y.-T.; Lin Y.-L.; Hsu F.R.

Hierarchical termination revisited
pp. 207-214(8)
Author: Ohlebusch E.

The General Steiner Tree-Star problem
pp. 215-220(6)
Authors: Khuller S.; Zhu A.

< previous issue | all issues | next issue >

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page