Coverart for item
The Resource WALCOM, algorithms and computation : third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 : proceedings, Sandip Das, Ryuhei Uehara (eds.)

WALCOM, algorithms and computation : third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 : proceedings, Sandip Das, Ryuhei Uehara (eds.)

Label
WALCOM, algorithms and computation : third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 : proceedings
Title
WALCOM, algorithms and computation
Title remainder
third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 : proceedings
Statement of responsibility
Sandip Das, Ryuhei Uehara (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms
Member of
Cataloging source
GW5XE
Dewey number
005.1
Illustrations
illustrations
Index
index present
LC call number
QA76.9.A43
LC item number
W35 2009
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2009
http://bibfra.me/vocab/lite/meetingName
WALCOM (Workshop)
Nature of contents
  • dictionaries
  • bibliography
NLM call number
QA 76.9.A43
http://library.link/vocab/relatedWorkOrContributorName
  • Das, Sandip
  • Uehara, Ryuhei
Series statement
Lecture notes in computer science,
Series volume
5431
http://library.link/vocab/subjectName
  • Computer algorithms
  • Computer science
  • Algorithms
  • Database Management Systems
  • Graduiertenakademie Pädagogische Hochschulen
  • Informatique
  • Computer algorithms
  • Computer science
  • Algorithmische Geometrie
  • Algorithmus
  • Berechnungskomplexität
  • Graphenzeichnen
  • Graph
  • Graph
Label
WALCOM, algorithms and computation : third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 : proceedings, Sandip Das, Ryuhei Uehara (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited Talks -- A Separator Theorem for String Graphs and Its Applications -- Foundations of Exact Rounding -- Approximating Shortest Paths in Graphs -- Line Transversals and Pinning Numbers -- Computational Geometry -- Algorithms for Computing Diffuse Reflection Paths in Polygons -- Shortest Gently Descending Paths -- All Farthest Neighbors in the Presence of Highways and Obstacles -- Improved Algorithm for a Widest 1-Corner Corridor -- Maximum Neighbour Voronoi Games -- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem -- Graph Algorithms -- Colinear Coloring on Graphs -- Recursive Generation of 5-Regular Planar Graphs -- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) -- Generating All Triangulations of Plane Graphs (Extended Abstract) -- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) -- Random Generation and Enumeration of Proper Interval Graphs -- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs -- Minmax Tree Cover in the Euclidean Space -- Network Design with Weighted Degree Constraints -- Minimum Cuts of Simple Graphs in Almost Always Linear Time -- The Generalized Stable Allocation Problem -- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings -- Core and Conditional Core Path of Specified Length in Special Classes of Graphs -- Complexity -- The Planar k-Means Problem is NP-Hard -- On the Computational Complexity of Monotone Constraint Satisfaction Problems -- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane -- Graph Drawing -- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) -- Matched Drawability of Graph Pairs and of Graph Triples -- An Improved Upward Planarity Testing Algorithm and Related Applications -- Spherical-Rectangular Drawings -- Approximation Algorithms -- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated -- The Minimal Manhattan Network Problem in Three Dimensions -- Randomized Algorithms -- Shape Matching by Random Sampling -- Object Caching for Queries and Updates
Control code
318545525
Dimensions
unknown
Extent
1 online resource (xiii, 408 pages)
Form of item
online
Isbn
9783642002021
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 10.1007/978-3-642-00202-1
  • 9786612006753
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-00201-4
Specific material designation
remote
System control number
(OCoLC)318545525
Label
WALCOM, algorithms and computation : third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 : proceedings, Sandip Das, Ryuhei Uehara (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited Talks -- A Separator Theorem for String Graphs and Its Applications -- Foundations of Exact Rounding -- Approximating Shortest Paths in Graphs -- Line Transversals and Pinning Numbers -- Computational Geometry -- Algorithms for Computing Diffuse Reflection Paths in Polygons -- Shortest Gently Descending Paths -- All Farthest Neighbors in the Presence of Highways and Obstacles -- Improved Algorithm for a Widest 1-Corner Corridor -- Maximum Neighbour Voronoi Games -- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem -- Graph Algorithms -- Colinear Coloring on Graphs -- Recursive Generation of 5-Regular Planar Graphs -- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) -- Generating All Triangulations of Plane Graphs (Extended Abstract) -- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) -- Random Generation and Enumeration of Proper Interval Graphs -- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs -- Minmax Tree Cover in the Euclidean Space -- Network Design with Weighted Degree Constraints -- Minimum Cuts of Simple Graphs in Almost Always Linear Time -- The Generalized Stable Allocation Problem -- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings -- Core and Conditional Core Path of Specified Length in Special Classes of Graphs -- Complexity -- The Planar k-Means Problem is NP-Hard -- On the Computational Complexity of Monotone Constraint Satisfaction Problems -- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane -- Graph Drawing -- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) -- Matched Drawability of Graph Pairs and of Graph Triples -- An Improved Upward Planarity Testing Algorithm and Related Applications -- Spherical-Rectangular Drawings -- Approximation Algorithms -- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated -- The Minimal Manhattan Network Problem in Three Dimensions -- Randomized Algorithms -- Shape Matching by Random Sampling -- Object Caching for Queries and Updates
Control code
318545525
Dimensions
unknown
Extent
1 online resource (xiii, 408 pages)
Form of item
online
Isbn
9783642002021
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 10.1007/978-3-642-00202-1
  • 9786612006753
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-00201-4
Specific material designation
remote
System control number
(OCoLC)318545525

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...