STACS 2002 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

53
(FIVE YEARS 0)

H-INDEX

12
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540432838, 9783540458418
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals Bi-Immunity Separates Strong NP-Completeness Notions

2002 ◽  
pp. 408-418 ◽  
Author(s):  
A. Pavan ◽  
Alan L. Selman
Keyword(s):  
Np Completeness

Labeling Schemes for Dynamic Tree Networks

2002 ◽  
pp. 76-87 ◽  
Author(s):  
Amos Korman ◽  
David Peleg ◽  
Yoav Rodeh
Keyword(s):  
Tree Networks ◽  
Labeling Schemes ◽  
Dynamic Tree

Axiomatising Tree-Interpretable Structures

2002 ◽  
pp. 596-607 ◽  
Author(s):  
Achim Blumensath

On the Enumerative Sequences of Regular Languages on k Symbols

2002 ◽  
pp. 547-558
Author(s):  
Béal Marie-Pierre ◽  
Dominique Perrin
Keyword(s):  
Regular Languages

Recognizable Sets of Message Sequence Charts

2002 ◽  
pp. 523-534 ◽  
Author(s):  
Rémi Morin
Keyword(s):  
Message Sequence Charts

A New Diagram from Disks in the Plane

2002 ◽  
pp. 238-249 ◽  
Author(s):  
Joachim Giesen ◽  
Matthias John

Complexity of Multi-dimensional Loop Alignment

2002 ◽  
pp. 179-191 ◽  
Author(s):  
Alain Darte ◽  
Guillaume Huard
Keyword(s):  
Loop Alignment

Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles

2002 ◽  
pp. 250-261 ◽  
Author(s):  
Stefan Langerman ◽  
Pat Morin ◽  
Michael Soss

A Space Lower Bound for Routing in Trees

2002 ◽  
pp. 65-75 ◽  
Author(s):  
Pierre Fraigniaud ◽  
Cyril Gavoille
Keyword(s):  
Lower Bound
Load More ...
Sign in / Sign up

Export Citation Format

Share Document