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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642002014, 9783642002021

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)

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

10.1007/978-3-642-00202-1_27 ◽

2009 ◽

pp. 310-321

Author(s):

Md. Rezaul Karim ◽

Md. Jawaherul Alam ◽

Md. Saidur Rahman

Keyword(s):

Outerplanar Graphs ◽

Straight Line

Download Full-text

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)

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

10.1007/978-3-642-00202-1_15 ◽

2009 ◽

pp. 165-176 ◽

Cited By ~ 1

Author(s):

Alessandro Borri ◽

Tiziana Calamoneri ◽

Rossella Petreschi

Download Full-text

A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs

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

10.1007/978-3-642-00202-1_17 ◽

2009 ◽

pp. 190-201 ◽

Cited By ~ 5

Author(s):

Louis Ibarra

Keyword(s):

Graph Algorithm ◽

Interval Graphs ◽

Dynamic Graph

Download Full-text

Network Design with Weighted Degree Constraints

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

10.1007/978-3-642-00202-1_19 ◽

2009 ◽

pp. 214-225 ◽

Cited By ~ 1

Author(s):

Takuro Fukunaga ◽

Hiroshi Nagamochi

Keyword(s):

Network Design ◽

Weighted Degree

Download Full-text

Colinear Coloring on Graphs

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

10.1007/978-3-642-00202-1_11 ◽

2009 ◽

pp. 117-128 ◽

Cited By ~ 1

Author(s):

Kyriaki Ioannidou ◽

Stavros D. Nikolopoulos

Download Full-text

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings

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

10.1007/978-3-642-00202-1_22 ◽

2009 ◽

pp. 250-261 ◽

Cited By ~ 6

Author(s):

Tamara Mchedlidze ◽

Antonios Symvonis

Keyword(s):

Hamiltonian Path ◽

Book Embeddings

Download Full-text

Object Caching for Queries and Updates

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

10.1007/978-3-642-00202-1_34 ◽

2009 ◽

pp. 394-405

Author(s):

Philip Little ◽

Amitabh Chaudhary

Download Full-text

Shape Matching by Random Sampling

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

10.1007/978-3-642-00202-1_33 ◽

2009 ◽

pp. 381-393 ◽

Cited By ~ 3

Author(s):

Helmut Alt ◽

Ludmila Scharf

Keyword(s):

Random Sampling ◽

Shape Matching

Download Full-text

An Improved Upward Planarity Testing Algorithm and Related Applications

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

10.1007/978-3-642-00202-1_29 ◽

2009 ◽

pp. 334-344 ◽

Cited By ~ 1

Author(s):

Sarmad Abbasi ◽

Patrick Healy ◽

Aimal Rextin

Keyword(s):

Upward Planarity ◽

Testing Algorithm

Download Full-text

Random Generation and Enumeration of Proper Interval Graphs

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

10.1007/978-3-642-00202-1_16 ◽

2009 ◽

pp. 177-189 ◽

Cited By ~ 2

Author(s):

Toshiki Saitoh ◽

Katsuhisa Yamanaka ◽

Masashi Kiyomi ◽

Ryuhei Uehara

Keyword(s):

Interval Graphs ◽

Random Generation

Download Full-text

WALCOM: Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)

Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)

A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs

Network Design with Weighted Degree Constraints

Colinear Coloring on Graphs

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings

Object Caching for Queries and Updates

Shape Matching by Random Sampling

An Improved Upward Planarity Testing Algorithm and Related Applications

Random Generation and Enumeration of Proper Interval Graphs

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