WALCOM: algorithms and computation: third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2009
|
| Schriftenreihe: | Lecture notes in computer science
5431 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XIII, 408 S. graph. Darst. 235 mm x 155 mm |
| ISBN: | 3642002013 9783642002014 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035387878 | ||
| 003 | DE-604 | ||
| 005 | 20090508 | ||
| 007 | t| | ||
| 008 | 090324s2009 xx d||| |||| 10||| eng d | ||
| 015 | |a 09N070153 |2 dnb | ||
| 016 | 7 | |a 992291690 |2 DE-101 | |
| 020 | |a 3642002013 |c PB. : EUR 60.94 (freier Pr.), sfr 95.00 (freier Pr.) |9 3-642-00201-3 | ||
| 020 | |a 9783642002014 |c PB. : EUR 60.94 (freier Pr.), sfr 95.00 (freier Pr.) |9 978-3-642-00201-4 | ||
| 035 | |a (OCoLC)302315741 | ||
| 035 | |a (DE-599)DNB992291690 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-91G |a DE-83 |a DE-11 | ||
| 050 | 0 | |a QA76.9.D35 | |
| 082 | 0 | |a 004.015113 |2 22/ger | |
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a WALCOM: algorithms and computation |b third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings |c Sandip Das ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2009 | |
| 300 | |a XIII, 408 S. |b graph. Darst. |c 235 mm x 155 mm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 5431 | |
| 500 | |a Literaturangaben | ||
| 650 | 4 | |a Algorithmische Geometrie - Kongress - Kalkutta <2009> | |
| 650 | 4 | |a Algorithmus - Kongress - Kalkutta <2009> | |
| 650 | 4 | |a Berechnungskomplexität - Kongress - Kalkutta <2009> | |
| 650 | 4 | |a Graph - Algorithmus - Kongress - Kalkutta <2009> | |
| 650 | 4 | |a Graphenzeichnen - Kongress - Kalkutta <2009> | |
| 650 | 4 | |a Computer algorithms |v Congresses | |
| 650 | 4 | |a Data structures (Computer science) |v Congresses | |
| 650 | 4 | |a Graph theory |v Congresses | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphenzeichnen |0 (DE-588)4706480-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2009 |z Kalkutta |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 3 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 4 | |5 DE-604 | |
| 700 | 1 | |a Das, Sandip |e Sonstige |4 oth | |
| 711 | 2 | |a WALCOM |n 3 |d 2009 |c Kalkutta |j Sonstige |0 (DE-588)10372007-8 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 5431 |w (DE-604)BV000000607 |9 5431 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017308713&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017308713 | |
Datensatz im Suchindex
| _version_ | 1820875114632183808 |
|---|---|
| adam_text |
TABLE OF CONTENTS
INVITED TALKS
A
SEPARATOR THEOREM
FOR
STRING GRAPHS AND
ITS
APPLICATIONS
1
JACOB FOX AND JDNOS PACH
FOUNDATIONS
OF
EXACT ROUNDING
15
CHEE
K.
YAP AND JIHUN
YU
APPROXIMATING SHORTEST PATHS
IN
GRAPHS
32
SANDEEP
SEN
LINE TRANSVERSALS AND PINNING NUMBERS
44
OTFRIED CHEONG
COMPUTATIONAL GEOMETRY
ALGORITHMS
FOR
COMPUTING DIFFUSE REFLECTION PATHS
IN
POLYGONS
47
SUBIR
KUMAR GHOSH, PARTHA PRATIM GOSWAMI, ANIL MAHESHWARI,
SUBHAS
CHANDRA NANDY, SUDEBKUMAR PRASANT PAL,
AND
SWAMI SARVATTOMANANDA
SHORTEST GENTLY DESCENDING PATHS
59
MUSTAQ
AHMED,
ANNA LUBIW, AND ANIL MAHESHWARI
ALL FARTHEST NEIGHBORS
IN
THE PRESENCE
OF
HIGHWAYS AND OBSTACLES
71
SANG
WON BAE, MATIAS KORMAN,
AND
TAKESHI TOKUYAMA
IMPROVED ALGORITHM
FOR A
WIDEST
1-CORNER
CORRIDOR
83
GAUTAM
K.
DAS, DEBAPRIYAY MUKHOPADHYAY, AND SUBHAS C. NANDY
MAXIMUM NEIGHBOUR VORONOI GAMES
93
MD. MUHIBUR RASHEED, MASUD HASAN, AND M. SOHEL RAHMAN
ON EXACT SOLUTIONS
TO THE
EUCLIDEAN BOTTLENECK STEINER TREE
PROBLEM
105
SANG WON BAE, CHUNSEOK LEE, AND SUNGHEE CHOI
GRAPH ALGORITHMS
COLINEAR
COLORING ON GRAPHS
117
KYRIAKI IOANNIDOU AND STAVROS D. NIKOLOPOULOS
RECURSIVE GENERATION
OF
5-REGULAR PLANAR GRAPHS
129
MAHDIEH HASHEMINEZHAD, BRENDAN D. MCKAY, AND TRISTAN
REEVES
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/992291690
DIGITALISIERT DURCH
XII TABLE OF CONTENTS
EFFICIENT ENUMERATION OF ORDERED TREES WITH
K
LEAVES 141
KATSUHISA
YAMANAKA, YOTA OTACHI, AND SHIN-ICHI NAKANO
GENERATING ALL TRIANGULATIONS OF PLANE GRAPHS 151
MOHAMMAD TANVIR PARVEZ, MD. SAIDUR RAHMAN, AND
SHIN-ICHI
NAKANO
RECOGNITION OF UNIGRAPHS THROUGH SUPERPOSITION OF GRAPHS 165
ALESSANDRO
BORRI, TIZIANA CALAMONERI, AND ROSSELLA PETRESCHI
RANDOM GENERATION AND ENUMERATION OF PROPER INTERVAL GRAPHS 177
TOSHIKI
SAITOH, KATSUHISA YAMANAKA, MASASHI KIYOMI, AND
RYUHEI
UEHARA
A FULLY DYNAMIC GRAPH ALGORITHM FOR RECOGNIZING PROPER INTERVAL
GRAPHS
190
LOUIS IBARRA
MINMAX TREE COVER IN THE EUCLIDEAN SPACE 202
SEIGO KARAKAWA, EHAB MORSY, AND HIROSHI NAGAMOCHI
NETWORK DESIGN WITH WEIGHTED DEGREE CONSTRAINTS 214
TAKURO FUKUNAGA AND HIROSHI NAGAMOCHI
MINIMUM CUTS OF SIMPLE GRAPHS IN ALMOST ALWAYS LINEAR TIME 226
MICHAEL
BRINKMEIER
THE GENERALIZED STABLE ALLOCATION PROBLEM 238
BRIAN C. DEAN AND NAMRATA SWAR
CROSSING-OPTIMAL ACYCLIC HAMILTONIAN PATH COMPLETION AND ITS
APPLICATION
TO UPWARD TOPOLOGICAL BOOK EMBEDDINGS 250
TAMARA MCHEDLIDZE AND ANTONIOS SYMVONIS
CORE AND CONDITIONAL CORE PATH OF SPECIFIED LENGTH IN SPECIAL CLASSES
OF
GRAPHS 262
5.
BALASUBRAMANIAN, S. HARINI, AND C. PANDU RANGAN
COMPLEXITY
THE
PLANAR K-MEANS PROBLEM IS NP-HARD 274
MEENA MAHAJAN, PRAJAKTA NIMBHORKAR, AND KASTURI VARADARAJAN
ON THE COMPUTATIONAL COMPLEXITY OF MONOTONE CONSTRAINT SATISFACTION
PROBLEMS
286
MIKI HERMANN AND FLORIAN RICHOUX
PARAMETERIZED COMPLEXITY OF STABBING RECTANGLES AND SQUARES IN THE
PLANE
298
MICHAEL
DAM, MICHAEL R. FELLOWS, AND FRANCES A. ROSAMOND
TABLE OF CONTENTS XIII
GRAPH DRAWING
STRAIGHT-LINE GRID DRAWINGS OF LABEL-CONSTRAINED OUTERPLANAR GRAPHS
WITH
O(N
LOG
N)
AREA 310
MD. REZAUL KARIM, MD. JAWAHERUL ALAM, AND MD. SAIDUR RAHMAN
MATCHED DRAWABILITY OF GRAPH PAIRS AND OF GRAPH TRIPLES 322
LUCA GRILLI, SEOK-HEE HONG, GIUSEPPE LIOTTA, HENK MEIJER, AND
STEPHEN
K. WISMATH
AN IMPROVED UPWARD PLANARITY TESTING ALGORITHM AND RELATED
APPLICATIONS
334
SARMAD ABBASI, PATRICK HEALY, AND AIMAL REXTIN
SPHERICAL-RECTANGULAR DRAWINGS 345
MAHDIEH HASHEMINEZHAD, S. MEHDI HASHEMI, AND
BRENDAN
D. MCKAY
APPROXIMATION ALGORITHMS
THE
EXEMPLAR BREAKPOINT DISTANCE
FOR NON-TRIVIAL GENOMES
CANNOT
BE APPROXIMATED 357
GUILLAUME BLIN, GUILLAUME FERTIN, FLORIAN SIKORA, AND
STEPHANE
VIALETTE
THE MINIMAL MANHATTAN NETWORK PROBLEM IN THREE DIMENSIONS 369
XAVIER
MUNOZ, SEBASTIAN SEIBERT, AND WALTER UNGER
RANDOMIZED ALGORITHMS
SHAPE MATCHING BY RANDOM SAMPLING 381
HELMUT ALT AND LUDMILA SCHARF
OBJECT CACHING FOR QUERIES AND UPDATES 394
PHILIP LITTLE AND AMITABH CHAUDHARY
AUTHOR INDEX
407 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV035387878 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.D35 |
| callnumber-search | QA76.9.D35 |
| callnumber-sort | QA 276.9 D35 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)302315741 (DE-599)DNB992291690 |
| dewey-full | 004.015113 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015113 |
| dewey-search | 004.015113 |
| dewey-sort | 14.015113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV035387878</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090508</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">090324s2009 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09N070153</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">992291690</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642002013</subfield><subfield code="c">PB. : EUR 60.94 (freier Pr.), sfr 95.00 (freier Pr.)</subfield><subfield code="9">3-642-00201-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642002014</subfield><subfield code="c">PB. : EUR 60.94 (freier Pr.), sfr 95.00 (freier Pr.)</subfield><subfield code="9">978-3-642-00201-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)302315741</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB992291690</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D35</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015113</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">WALCOM: algorithms and computation</subfield><subfield code="b">third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings</subfield><subfield code="c">Sandip Das ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 408 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">235 mm x 155 mm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">5431</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmische Geometrie - Kongress - Kalkutta <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmus - Kongress - Kalkutta <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Berechnungskomplexität - Kongress - Kalkutta <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph - Algorithmus - Kongress - Kalkutta <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphenzeichnen - Kongress - Kalkutta <2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2009</subfield><subfield code="z">Kalkutta</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Das, Sandip</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">3</subfield><subfield code="d">2009</subfield><subfield code="c">Kalkutta</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10372007-8</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">5431</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">5431</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017308713&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017308713</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2009 Kalkutta gnd-content |
| genre_facet | Konferenzschrift 2009 Kalkutta |
| id | DE-604.BV035387878 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:10:28Z |
| institution | BVB |
| institution_GND | (DE-588)10372007-8 |
| isbn | 3642002013 9783642002014 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017308713 |
| oclc_num | 302315741 |
| open_access_boolean | |
| owner | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 |
| owner_facet | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 |
| physical | XIII, 408 S. graph. Darst. 235 mm x 155 mm |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | WALCOM: algorithms and computation third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings Sandip Das ... (eds.) Berlin [u.a.] Springer 2009 XIII, 408 S. graph. Darst. 235 mm x 155 mm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 5431 Literaturangaben Algorithmische Geometrie - Kongress - Kalkutta <2009> Algorithmus - Kongress - Kalkutta <2009> Berechnungskomplexität - Kongress - Kalkutta <2009> Graph - Algorithmus - Kongress - Kalkutta <2009> Graphenzeichnen - Kongress - Kalkutta <2009> Computer algorithms Congresses Data structures (Computer science) Congresses Graph theory Congresses Graph (DE-588)4021842-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2009 Kalkutta gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Algorithmische Geometrie (DE-588)4130267-9 s Graphenzeichnen (DE-588)4706480-8 s Graph (DE-588)4021842-9 s Berechnungskomplexität (DE-588)4134751-1 s Das, Sandip Sonstige oth WALCOM 3 2009 Kalkutta Sonstige (DE-588)10372007-8 oth Lecture notes in computer science 5431 (DE-604)BV000000607 5431 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017308713&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | WALCOM: algorithms and computation third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings Lecture notes in computer science Algorithmische Geometrie - Kongress - Kalkutta <2009> Algorithmus - Kongress - Kalkutta <2009> Berechnungskomplexität - Kongress - Kalkutta <2009> Graph - Algorithmus - Kongress - Kalkutta <2009> Graphenzeichnen - Kongress - Kalkutta <2009> Computer algorithms Congresses Data structures (Computer science) Congresses Graph theory Congresses Graph (DE-588)4021842-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4130267-9 (DE-588)4134751-1 (DE-588)4706480-8 (DE-588)4001183-5 (DE-588)1071861417 |
| title | WALCOM: algorithms and computation third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings |
| title_auth | WALCOM: algorithms and computation third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings |
| title_exact_search | WALCOM: algorithms and computation third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings |
| title_full | WALCOM: algorithms and computation third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings Sandip Das ... (eds.) |
| title_fullStr | WALCOM: algorithms and computation third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings Sandip Das ... (eds.) |
| title_full_unstemmed | WALCOM: algorithms and computation third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings Sandip Das ... (eds.) |
| title_short | WALCOM: algorithms and computation |
| title_sort | walcom algorithms and computation third international workshop walcom 2009 kolkata india february 18 20 2009 proceedings |
| title_sub | third international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 ; proceedings |
| topic | Algorithmische Geometrie - Kongress - Kalkutta <2009> Algorithmus - Kongress - Kalkutta <2009> Berechnungskomplexität - Kongress - Kalkutta <2009> Graph - Algorithmus - Kongress - Kalkutta <2009> Graphenzeichnen - Kongress - Kalkutta <2009> Computer algorithms Congresses Data structures (Computer science) Congresses Graph theory Congresses Graph (DE-588)4021842-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmische Geometrie - Kongress - Kalkutta <2009> Algorithmus - Kongress - Kalkutta <2009> Berechnungskomplexität - Kongress - Kalkutta <2009> Graph - Algorithmus - Kongress - Kalkutta <2009> Graphenzeichnen - Kongress - Kalkutta <2009> Computer algorithms Congresses Data structures (Computer science) Congresses Graph theory Congresses Graph Algorithmische Geometrie Berechnungskomplexität Graphenzeichnen Algorithmus Konferenzschrift 2009 Kalkutta |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017308713&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT dassandip walcomalgorithmsandcomputationthirdinternationalworkshopwalcom2009kolkataindiafebruary18202009proceedings AT walcomkalkutta walcomalgorithmsandcomputationthirdinternationalworkshopwalcom2009kolkataindiafebruary18202009proceedings |