X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Algorithms and computation : 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings (2010)
    Berlin [u.a.] :Springer,
    Details
    UID:
    almahu_BV035988460
    Format: XIII, 304 S. : , graph. Darst. ; , 24 cm.
    ISBN: 978-3-642-11439-7
    Series Statement: Lecture notes in computer science 5942
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Algorithmus ; Algorithmische Geometrie ; Graphenzeichnen ; Graph ; Algorithmus ; Berechnungskomplexität ; Konferenzschrift ; Kongress ; Konferenzschrift ; Konferenzschrift
    URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018881232&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
    URL: http://d-nb.info/99895571X/04
    URL: Inhaltsverzeichnis
    Author information: Rahman, Md. Saidur, 1966-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    HU Berlin get availability status
    Berlin VÖBB/ZLB get availability status
    TU Berlin get availability status
  • 2
    Online Resource
    Online Resource
    WALCOM: Algorithms and Computation : 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings (2010)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947364263902882
    Format: XIII, 305 p. 72 illus. , online resource.
    ISBN: 9783642114403
    Series Statement: Lecture Notes in Computer Science, 5942
    Note: Invited Talks -- Crossings between Curves with Many Tangencies -- Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon -- Approximation Algorithms for Art Gallery Problems in Polygons and Terrains -- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing -- Graph Drawing -- Small Grid Drawings of Planar Graphs with Balanced Bipartition -- Switch-Regular Upward Planar Embeddings of Trees -- A Global k-Level Crossing Reduction Algorithm -- Computational Geometry -- Computation of Non-dominated Points Using Compact Voronoi Diagrams -- Cutting a Convex Polyhedron Out of a Sphere -- A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion -- Graph Algorithms I -- Acyclically 3-Colorable Planar Graphs -- Reconstruction Algorithm for Permutation Graphs -- Harmonious Coloring on Subclasses of Colinear Graphs -- Computational Biology and Strings -- Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions -- The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time -- Parallel Algorithms for Encoding and Decoding Blob Code -- Combinatorial Optimization -- A Rooted-Forest Partition with Uniform Vertex Demand -- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique -- Graph Algorithms II -- On Some Simple Widths -- A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques -- Approximation Algorithms -- The Covert Set-Cover Problem with Application to Network Discovery -- Variants of Spreading Messages -- On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost -- Real Root Isolation of Multi-Exponential Polynomials with Application -- Parameterized Complexity -- FPT Algorithms for Connected Feedback Vertex Set -- A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs -- Pathwidth and Searching in Parameterized Threshold Graphs.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783642114397
    Language: English
    DOI: 10.1007/978-3-642-11440-3
    URL: http://dx.doi.org/10.1007/978-3-642-11440-3
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 3
    Online Resource
    Online Resource
    WALCOM: algorithms and computation : 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings (2010)
    Berlin [u.a.] : Springer
    Details
    UID:
    gbv_624774252
    Format: Online-Ressource (XIII, 304 S.)
    Edition: Online-Ausg. 2010 Springer eBook collection. Computer science Electronic reproduction; Available via World Wide Web
    ISBN: 9783642114403
    Series Statement: Lecture notes in computer science 5942
    Note: Literaturangaben , ""Title Page""; ""Preface""; ""Organization""; ""Table of Contents""; ""Invited Talks""; ""Crossings between Curves with Many Tangencies""; ""Introduction""; ""Levels � Proof of Theorem 1""; ""Constructive Upper Bound � Proof of Theorem 2""; ""Concluding Remarks""; ""References""; ""Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon""; ""Introduction""; ""Finding a Simple Path on a Tree Using Eulerian Tours""; ""Shortest Paths in Polygons""; ""A Shortest-Path Algorithm Using a Dual Graph""; ""A Shortest-Path Algorithm Using Point Location""; ""Concluding Remarks"" , ""References""""Approximation Algorithms for Art Gallery Problems in Polygons and Terrains""; ""Problems and Results""; ""Approximation Algorithms in Polygons""; ""Approximation Algorithms on Terrains""; ""References""; ""The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing""; ""Introduction""; ""Hamiltonian Augmentations and Point-Set Embeddings""; ""Point-Set Embeddings with Mapping""; ""Point-Set Embeddings without Mapping""; ""Point-Set Embedding without Mapping: Optimal Curve Complexity and Polynomial Area""; ""Flat Division Vertices"" , ""Monotone Topological Book Embeddings""""Point-Set Embeddings with Curve Complexity 1""; ""Colored Hamiltonicity and Colored Point-Set Embeddability""; ""Colored Hamiltonicity""; ""Colored Point-Set Embeddings""; ""More Points Than Vertices""; ""Other Applications of Hamiltonicity to Graph Drawing""; ""Simultaneous Embeddings""; ""Radially Layered Drawings""; ""References""; ""Graph Drawing""; ""Small Grid Drawings of Planar Graphs with Balanced Bipartition""; ""Introduction""; ""Planar Graph""; ""Series-Parallel Graph""; ""Conclusions""; ""References"" , ""Switch-Regular Upward Planar Embeddings of Trees""""Introduction""; ""Basic Definitions""; ""3-Hooks and Red-Blue Decompositions""; ""Red-Blue Decompositions and Switch-Regularity""; ""Characterization and Test""; ""Conclusions and Open Problems ""; ""References""; ""A Global k-Level Crossing Reduction Algorithm""; ""Introduction""; ""Preliminaries""; ""Global Sifting""; ""Building the Block List""; ""Initialization of a Sifting Step""; ""Sifting Step""; ""Sifting Swap""; ""Time Complexity""; ""Simple Global Crossing Reductions""; ""Experimental Results"" , ""Applications of the Global Crossing Reduction""""Summary""; ""References""; ""Computational Geometry""; ""Computation of Non-dominated Points Using Compact Voronoi Diagrams""; ""Introduction""; ""Formal Definition""; ""Prior Work""; ""Our Work""; ""Reduction to a Voronoi Diagram""; ""Dominated Points and the Cone""; ""Relation of Lower Envelope of Cones to Additively Weighted Voronoi Diagrams of a Convex Distance Function""; ""Reduction of Lower Envelope of Cones to Additively Weighted Voronoi Diagrams of a Convex Distance Function""; ""Computing Non-dominance in the Plane"" , ""Geometric Preliminaries"" , Electronic reproduction; Available via World Wide Web
    Additional Edition: ISBN 3642114393
    Additional Edition: ISBN 9783642114397
    Additional Edition: Erscheint auch als Druck-Ausgabe WALCOM: algorithms and computation Berlin : Springer, 2010 ISBN 3642114393
    Additional Edition: ISBN 9783642114397
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Algorithmus ; Algorithmische Geometrie ; Graphenzeichnen ; Graph ; Algorithmus ; Berechnungskomplexität ; Konferenzschrift
    DOI: 10.1007/978-3-642-11440-3
    URL: Volltext  (lizenzpflichtig)
    URL: Inhaltsverzeichnis
    URL: Inhaltstext
    Author information: Rahman, Md. Saidur 1966-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
  • 4
    Online Resource
    Online Resource
    Algorithms and computation : 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings (2010)
    Berlin [u.a.] : Springer
    Details
    UID:
    b3kat_BV036032752
    Format: 1 Online-Ressource (XIII, 304 S.) , graph. Darst.
    ISBN: 9783642114397
    Series Statement: Lecture notes in computer science 5942
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Algorithmus ; Algorithmische Geometrie ; Graphenzeichnen ; Graph ; Algorithmus ; Berechnungskomplexität ; Konferenzschrift
    DOI: 10.1007/978-3-642-11440-3
    URL: Volltext
    Author information: Rahman, Md. Saidur 1966-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    BTU Cottbus
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9783641214937?
Did you mean 9783642110399?
Did you mean 9783642110597?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages