WALCOM: Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

23

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642190933, 9783642190940

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Graceful Labelings of Trees

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_22 ◽

2011 ◽

pp. 214-220 ◽

Author(s):

Sourabh Aryabhatta ◽

Tonmoy Guha Roy ◽

Md. Mohsin Uddin ◽

Md. Saidur Rahman

Download Full-text

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_20 ◽

2011 ◽

pp. 191-201 ◽

Author(s):

Esha Ghosh ◽

N. S. Narayanaswamy ◽

C. Pandu Rangan

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Download Full-text

Range-Aggregate Queries Involving Geometric Aggregation Operations

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_14 ◽

2011 ◽

pp. 122-133 ◽

Author(s):

Saladi Rahul ◽

Ananda Swarup Das ◽

K. S. Rajan ◽

Kannan Srinathan

Keyword(s):

Aggregate Queries ◽

Aggregation Operations

Download Full-text

Counting Spanning Trees in Graphs Using Modular Decomposition

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_21 ◽

2011 ◽

pp. 202-213 ◽

Author(s):

Stavros D. Nikolopoulos ◽

Leonidas Palios ◽

Charis Papadopoulos

Keyword(s):

Spanning Trees ◽

Modular Decomposition

Download Full-text

The Physarum Computer

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_3 ◽

2011 ◽

pp. 8-8

Author(s):

Kurt Mehlhorn

Download Full-text

De Bruijn Sequences for the Binary Strings with Maximum Density

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_19 ◽

2011 ◽

pp. 182-190 ◽

Author(s):

Joe Sawada ◽

Brett Stevens ◽

Aaron Williams

Keyword(s):

Maximum Density ◽

De Bruijn Sequences ◽

De Bruijn ◽

Download Full-text

k-Level Crossing Minimization Is NP-Hard for Trees

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_9 ◽

2011 ◽

pp. 70-76

Author(s):

Martin Harrigan ◽

Patrick Healy

Keyword(s):

Np Hard ◽

Level Crossing ◽

Crossing Minimization

Download Full-text

The Complexity of Acyclic Subhypergraph Problems

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_7 ◽

2011 ◽

pp. 45-56

Author(s):

David Duris ◽

Yann Strozecki

Download Full-text

Inapproximability of b-Matching in k-Uniform Hypergraphs

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_8 ◽

2011 ◽

pp. 57-69 ◽

Author(s):

Mourad El Ouali ◽

Antje Fretwurst ◽

Anand Srivastav

Keyword(s):

Uniform Hypergraphs

Download Full-text

Efficient Top-k Queries for Orthogonal Ranges

WALCOM: Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19094-0_13 ◽

2011 ◽

pp. 110-121 ◽

Author(s):

Saladi Rahul ◽

Prosenjit Gupta ◽

Ravi Janardan ◽

K. S. Rajan

Download Full-text