Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(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

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_65 ◽

2010 ◽

pp. 586-595 ◽

Cited By ~ 9

Author(s):

Robert Rettinger ◽

Xizhong Zheng ◽

Romain Gengler ◽

Burchard Braunmühl

Keyword(s):

Real Numbers ◽

Real Functions

Download Full-text

PC-Trees vs. PQ-Trees

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_23 ◽

2001 ◽

pp. 207-217 ◽

Cited By ~ 11

Author(s):

Wen-Lian Hsu

Download Full-text

Counting H-Colorings of Partial k-Trees

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_33 ◽

2001 ◽

pp. 298-307 ◽

Cited By ~ 1

Author(s):

Josep Díaz ◽

Maria Serna ◽

Dimitrios M. Thilikos

Download Full-text

Enhanced Sequence Reconstruction with DNA Microarray Application

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_8 ◽

2001 ◽

pp. 64-74 ◽

Cited By ~ 8

Author(s):

Samuel A. Heath ◽

Franco P. Preparata

Keyword(s):

Dna Microarray ◽

Sequence Reconstruction

Download Full-text

Parametric Scheduling for Network Constraints

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_61 ◽

2001 ◽

pp. 550-560 ◽

Cited By ~ 2

Author(s):

K. Subramani

Keyword(s):

Network Constraints

Download Full-text

Decidable Approximations on Generalized and Parameterized Discrete Timed Automata

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_59 ◽

2001 ◽

pp. 529-539 ◽

Cited By ~ 3

Author(s):

Zhe Dang ◽

Oscar H. Ibarra ◽

Richard A. Kemmerer

Keyword(s):

Timed Automata

Download Full-text

AnFPTAS forWeight-Constrained SteinerTrees in Series-Parallel Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_58 ◽

2001 ◽

pp. 519-528 ◽

Cited By ~ 1

Author(s):

Guangting Chen ◽

Guoliang Xue

Keyword(s):

In Series

Download Full-text

On-Line Deadline Scheduling on Multiple Resources

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_50 ◽

2001 ◽

pp. 443-452 ◽

Cited By ~ 2

Author(s):

Jae-Hoon Kim ◽

Kyung-Yong Chwa

Keyword(s):

Multiple Resources ◽

On Line ◽

Deadline Scheduling

Download Full-text

A Highly Efficient Algorithm to Determine Bicritical Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_38 ◽

2001 ◽

pp. 349-356 ◽

Cited By ~ 2

Author(s):

Dingjun Lou ◽

Ning Zhong

Keyword(s):

Efficient Algorithm ◽

Highly Efficient

Download Full-text

How Good Is Sink Insertion?

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_20 ◽

2001 ◽

pp. 181-190

Author(s):

Xiang-Yang Li ◽

Yu Wang

Download Full-text

Lecture Notes in Computer Science - Computing and CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Weakly Computable Real Numbers and Total Computable Real Functions

PC-Trees vs. PQ-Trees

Counting H-Colorings of Partial k-Trees

Enhanced Sequence Reconstruction with DNA Microarray Application

Parametric Scheduling for Network Constraints

Decidable Approximations on Generalized and Parameterized Discrete Timed Automata

AnFPTAS forWeight-Constrained SteinerTrees in Series-Parallel Graphs

On-Line Deadline Scheduling on Multiple Resources

A Highly Efficient Algorithm to Determine Bicritical Graphs

How Good Is Sink Insertion?

Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications