Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

52

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642028816, 9783642028823

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_9 ◽

2009 ◽

pp. 76-85 ◽

Author(s):

Tamara Mchedlidze ◽

Antonios Symvonis

Download Full-text

Coordinate Assignment for Cyclic Level Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_8 ◽

2009 ◽

pp. 66-75 ◽

Author(s):

Christian Bachmaier ◽

Franz J. Brandenburg ◽

Wolfgang Brunner ◽

Raymund Fülöp

Keyword(s):

Coordinate Assignment

Download Full-text

Separating NE from Some Nonuniform Nondeterministic Complexity Classes

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_48 ◽

2009 ◽

pp. 486-495 ◽

Author(s):

Bin Fu ◽

Angsheng Li ◽

Liyu Zhang

Keyword(s):

Complexity Classes

Download Full-text

A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_33 ◽

2009 ◽

pp. 328-337

Author(s):

M. Yamamoto ◽

S. Kijima ◽

Y. Matsui

Keyword(s):

Polynomial Time

Download Full-text

Computing Bond Types in Molecule Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_30 ◽

2009 ◽

pp. 297-306 ◽

Author(s):

Sebastian Böcker ◽

Quang B. A. Bui ◽

Patrick Seeber ◽

Anke Truss

Download Full-text

Inferring Peptide Composition from Molecular Formulas

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_28 ◽

2009 ◽

pp. 277-286

Author(s):

Sebastian Böcker ◽

Anton Pervukhin

Keyword(s):

Peptide Composition

Download Full-text

Graph-Based Data Clustering with Overlaps

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_51 ◽

2009 ◽

pp. 516-526 ◽

Author(s):

Michael R. Fellows ◽

Jiong Guo ◽

Christian Komusiewicz ◽

Rolf Niedermeier ◽

Johannes Uhlmann

Keyword(s):

Data Clustering

Download Full-text

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_7 ◽

2009 ◽

pp. 56-65

Author(s):

Tomoko Izumi ◽

Taisuke Izumi ◽

Hirotaka Ono ◽

Koichi Wada

Download Full-text

An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_24 ◽

2009 ◽

pp. 238-248 ◽

Author(s):

George Karakostas ◽

Stavros G. Kolliopoulos ◽

Jing Wang

Keyword(s):

Fixed Number ◽

Total Weighted Tardiness ◽

Due Dates ◽

Weighted Tardiness

Download Full-text

Multiple Round Random Ball Placement: Power of Second Chance

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-02882-3_44 ◽

2009 ◽

pp. 439-448 ◽

Author(s):

Xiang-Yang Li ◽

Yajun Wang ◽

Wangsen Feng

Keyword(s):

Multiple Round ◽

Download Full-text