Isbn: 9783642114397 - walcom: algorithms and computation: 4th international workshop, walcom 2010, dhaka, bangladesh, february 10-12, 2010, proceedings (lecture notes in computer science and general issues): 5942 (12 resultados)

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (12)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Springer, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 57,26

    Envío por EUR 2,33 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New.

  • Idioma: Inglés

    Editorial: Springer 1/20/2010, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de AmericaBargainBookStores

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 59,67

     Gastos de envío gratis 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Paperback or Softback. Condición: New. WALCOM: Algorithms and Computation. Book.

  • Idioma: Inglés

    Editorial: Springer, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Como Nuevo

    EUR 63,24

    Envío por EUR 2,33 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: As New. Unread book in perfect condition.

  • Idioma: Inglés

    Editorial: Springer, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 68,54

    Envío por EUR 17,57 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New.

  • Idioma: Inglés

    Editorial: Springer, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Como Nuevo

    EUR 70,33

    Envío por EUR 17,57 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: As New. Unread book in perfect condition.

  • Idioma: Inglés

    Editorial: Springer, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 61,97

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - WALCOM 2010, the 4th International Workshop on Algorithms and Com- tation, held during February 10 12, 2010 in Dhaka, Bangladesh, covered the areas of approximation algorithms, combinatorial algorithms, combinatorial - timization, computational Biology, computational geometry, data structures, graph algorithms, graph drawing, parallel and distributed algorithms, par- eterized complexity, network optimization, online algorithms, randomized - gorithms and string algorithms. The workshop was organized jointly by the Bangladesh Academy of Sciences (BAS) and Bangladesh University of En- neering and Technology (BUET), and the quality of the workshop was ensured by a ProgramCommittee comprising 25 researchersof internationalrepute from Australia,Bangladesh,Canada,France,Germany,Greece,HongKong,Hungary, India, Italy, Japan, Switzerland, Taiwan, UK and USA. Thisvolumecontains23contributedpapersandfourinvitedpaperspresented atWALCOM2010.TheCallforPapersreceivedanenthusiasticresponse,resu- ing in 60 submissions from 21 countries. The Program Committee thoroughly reviewed each of the 60 submissions and accepted 23 of them for presentation in the workshop after elaborate discussions on review reports. The image of the workshopwas highly enhanced by the four invited talks of eminent and we- knownresearchersTetsuoAsanoofJAIST,Japan,SubirKumarGhoshofTIFR, India, Giuseppe Liotta of University of Perugia, Italy and J anos Pach of EPFL Lausanne, Switzerland and R enyi Institute Budapest, Hungary. …

  • Idioma: Inglés

    Editorial: Springer 2010-01-20, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: Chiron Media, Wallingford, Reino UnidoChiron Media

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 86,68

    Envío por EUR 18,14 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 10 disponibles

    Paperback. Condición: New.

  • Idioma: Inglés

    Editorial: Springer, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 98,78

    Envío por EUR 13,22 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New. In English.

  • Idioma: Inglés

    Editorial: Springer Spektrum, 2010

    3642114393 / 9783642114397

    • Tapa blanda

    Librería: Buchpark, Trebbin, AlemaniaBuchpark

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Excelente

    EUR 43,31

    Envío por EUR 105,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Condición: Sehr gut. Zustand: Sehr gut | Seiten: 320 | Sprache: Englisch | Produktart: Bücher | WALCOM 2010, the 4th International Workshop on Algorithms and Com- tation, held during February 10¿12, 2010 in Dhaka, Bangladesh, covered the areas of approximation algorithms, combinatorial algorithms, combinatorial - timization, computational Biology, computational geometry, data structures, graph algorithms, graph drawing, parallel and distributed algorithms, par- eterized complexity, network optimization, online algorithms, randomized - gorithms and string algorithms. The workshop was organized jointly by the Bangladesh Academy of Sciences (BAS) and Bangladesh University of En- neering and Technology (BUET), and the quality of the workshop was ensured by a ProgramCommittee comprising 25 researchersof internationalrepute from Australia,Bangladesh,Canada,France,Germany,Greece,HongKong,Hungary, India, Italy, Japan, Switzerland, Taiwan, UK and USA. Thisvolumecontains23contributedpapersandfourinvitedpaperspresented atWALCOM2010.TheCallforPapersreceivedanenthusiasticresponse,resu- ing in 60 submissions from 21 countries. The Program Committee thoroughly reviewed each of the 60 submissions and accepted 23 of them for presentation in the workshop after elaborate discussions on review reports. The image of the workshopwas highly enhanced by the four invited talks of eminent and we- knownresearchersTetsuoAsanoofJAIST,Japan,SubirKumarGhoshofTIFR, India, Giuseppe Liotta of University of Perugia, Italy and J¿ anos Pach of EPFL Lausanne, Switzerland and R¿ enyi Institute Budapest, Hungary. …

  • Idioma: Inglés

    Editorial: Springer Berlin Heidelberg Jan 2010, 2010

    3642114393 / 9783642114397

    • Tapa blanda
    • Impresión bajo demanda

    Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 53,49

    Envío por EUR 23,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -WALCOM 2010, the 4th International Workshop on Algorithms and Com- tation, held during February 10 12, 2010 in Dhaka, Bangladesh, covered the areas of approximation algorithms, combinatorial algorithms, combinatorial - timization, computational Biology, computational geometry, data structures, graph algorithms, graph drawing, parallel and distributed algorithms, par- eterized complexity, network optimization, online algorithms, randomized - gorithms and string algorithms. The workshop was organized jointly by the Bangladesh Academy of Sciences (BAS) and Bangladesh University of En- neering and Technology (BUET), and the quality of the workshop was ensured by a ProgramCommittee comprising 25 researchersof internationalrepute from Australia,Bangladesh,Canada,France,Germany,Greece,HongKong,Hungary, India, Italy, Japan, Switzerland, Taiwan, UK and USA. Thisvolumecontains23contributedpapersandfourinvitedpaperspresented atWALCOM2010.TheCallforPapersreceivedanenthusiasticresponse,resu- ing in 60 submissions from 21 countries. The Program Committee thoroughly reviewed each of the 60 submissions and accepted 23 of them for presentation in the workshop after elaborate discussions on review reports. The image of the workshopwas highly enhanced by the four invited talks of eminent and we- knownresearchersTetsuoAsanoofJAIST,Japan,SubirKumarGhoshofTIFR, India, Giuseppe Liotta of University of Perugia, Italy and J anos Pach of EPFL Lausanne, Switzerland and R enyi Institute Budapest, Hungary. 320 pp. Englisch. …

  • Idioma: Inglés

    Editorial: Springer Berlin Heidelberg, 2010

    3642114393 / 9783642114397

    • Tapa blanda
    • Impresión bajo demanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 48,37

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.…

  • Idioma: Inglés

    Editorial: Springer, Springer Jan 2010, 2010

    3642114393 / 9783642114397

    • Tapa blanda
    • Impresión bajo demanda

    Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 53,49

    Envío por EUR 60,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 320 pp. Englisch.…