Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

66
(FIVE YEARS 0)

H-INDEX

9
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540424949, 9783540446798
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Weakly Computable Real Numbers and Total Computable Real Functions

2010 ◽  
pp. 586-595 ◽  
Author(s):  
Robert Rettinger ◽  
Xizhong Zheng ◽  
Romain Gengler ◽  
Burchard Braunmühl
Keyword(s):  
Real Numbers ◽  
Real Functions

PC-Trees vs. PQ-Trees

2001 ◽  
pp. 207-217 ◽  
Author(s):  
Wen-Lian Hsu

Counting H-Colorings of Partial k-Trees

2001 ◽  
pp. 298-307 ◽  
Author(s):  
Josep Díaz ◽  
Maria Serna ◽  
Dimitrios M. Thilikos

Enhanced Sequence Reconstruction with DNA Microarray Application

2001 ◽  
pp. 64-74 ◽  
Author(s):  
Samuel A. Heath ◽  
Franco P. Preparata
Keyword(s):  
Dna Microarray ◽  
Sequence Reconstruction

Parametric Scheduling for Network Constraints

2001 ◽  
pp. 550-560 ◽  
Author(s):  
K. Subramani
Keyword(s):  
Network Constraints

Decidable Approximations on Generalized and Parameterized Discrete Timed Automata

2001 ◽  
pp. 529-539 ◽  
Author(s):  
Zhe Dang ◽  
Oscar H. Ibarra ◽  
Richard A. Kemmerer
Keyword(s):  
Timed Automata

AnFPTAS forWeight-Constrained SteinerTrees in Series-Parallel Graphs

2001 ◽  
pp. 519-528 ◽  
Author(s):  
Guangting Chen ◽  
Guoliang Xue
Keyword(s):  
In Series

On-Line Deadline Scheduling on Multiple Resources

2001 ◽  
pp. 443-452 ◽  
Author(s):  
Jae-Hoon Kim ◽  
Kyung-Yong Chwa
Keyword(s):  
Multiple Resources ◽  
On Line ◽  
Deadline Scheduling

A Highly Efficient Algorithm to Determine Bicritical Graphs

2001 ◽  
pp. 349-356 ◽  
Author(s):  
Dingjun Lou ◽  
Ning Zhong
Keyword(s):  
Efficient Algorithm ◽  
Highly Efficient

How Good Is Sink Insertion?

2001 ◽  
pp. 181-190
Author(s):  
Xiang-Yang Li ◽  
Yu Wang
Load More ...
Sign in / Sign up

Export Citation Format

Share Document