Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

50

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642322402, 9783642322419

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Restricted Max-Min Fair Allocations with Inclusion-Free Intervals

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_9 ◽

2012 ◽

pp. 98-108 ◽

Author(s):

Monaldo Mastrolilli ◽

Georgios Stamoulis

Download Full-text

Online Knapsack Problem with Removal Cost

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_6 ◽

2012 ◽

pp. 61-73 ◽

Author(s):

Xin Han ◽

Yasushi Kawase ◽

Kazuhisa Makino

Keyword(s):

Knapsack Problem

Download Full-text

Speed Scaling for Maximum Lateness

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_3 ◽

2012 ◽

pp. 25-36 ◽

Author(s):

Evripidis Bampis ◽

Dimitrios Letsios ◽

Ioannis Milis ◽

Georgios Zois

Keyword(s):

Maximum Lateness ◽

Download Full-text

The Cost of Bounded Curvature

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_22 ◽

2012 ◽

pp. 252-263

Author(s):

Hyo-Sil Kim ◽

Otfried Cheong

Keyword(s):

Bounded Curvature ◽

Download Full-text

Ramsey Numbers for Line Graphs and Perfect Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_18 ◽

2012 ◽

pp. 204-215 ◽

Author(s):

Rémy Belmonte ◽

Pinar Heggernes ◽

Pim van ’t Hof ◽

Reza Saei

Keyword(s):

Perfect Graphs ◽

Line Graphs ◽

Download Full-text

A Local Algorithm for Finding Dense Bipartite-Like Subgraphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_13 ◽

2012 ◽

pp. 145-156 ◽

Author(s):

Pan Peng

Keyword(s):

Local Algorithm

Download Full-text

External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_31 ◽

2012 ◽

pp. 360-371 ◽

Author(s):

Alka Bhushan ◽

Sajith Gopalan

Keyword(s):

Priority Queue ◽

External Memory

Download Full-text

Multilevel Drawings of Clustered Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_27 ◽

2012 ◽

pp. 311-322

Author(s):

Fabrizio Frati

Download Full-text

An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_10 ◽

2012 ◽

pp. 109-120

Author(s):

Maxim A. Babenko ◽

Kamil Salikhov ◽

Stepan Artamonov

Keyword(s):

Improved Algorithm

Download Full-text

Partially Specified Nearest Neighbor Search

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-32241-9_32 ◽

2012 ◽

pp. 372-383 ◽

Author(s):

Tomas Hruz ◽

Marcel Schöngens

Keyword(s):

Nearest Neighbor ◽

Nearest Neighbor Search ◽

Neighbor Search

Download Full-text