Algorithms and computation: 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2010
|
Schriftenreihe: | Lecture notes in computer science
5942 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Literaturangaben |
Beschreibung: | XIII, 304 S. graph. Darst. 24 cm |
ISBN: | 9783642114397 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV035988460 | ||
003 | DE-604 | ||
005 | 20110413 | ||
007 | t| | ||
008 | 100201s2010 xx d||| |||| 10||| eng d | ||
015 | |a 10,A05 |2 dnb | ||
016 | 7 | |a 99895571X |2 DE-101 | |
020 | |a 9783642114397 |c kart. : EUR 57.78 (freier Pr.), sfr 84.00 (freier Pr.) |9 978-3-642-11439-7 | ||
024 | 3 | |a 9783642114397 | |
028 | 5 | 2 | |a 12836628 |
035 | |a (OCoLC)503457539 | ||
035 | |a (DE-599)DNB99895571X | ||
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 | ||
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 Algorithms and computation |b 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings |c Md. Saidur Rahman ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2010 | |
300 | |a XIII, 304 S. |b graph. Darst. |c 24 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 5942 | |
500 | |a Literaturangaben | ||
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 2010 |z Dhaka |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 Rahman, Md. Saidur |d 1966- |e Sonstige |0 (DE-588)140356304 |4 oth | |
711 | 2 | |a WALCOM |n 4 |d 2010 |c Dhaka |j Sonstige |0 (DE-588)16054233-9 |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 5942 |w (DE-604)BV000000607 |9 5942 | |
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=018881232&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-018881232 |
Datensatz im Suchindex
_version_ | 1820875197749657600 |
---|---|
adam_text |
TABLE OF CONTENTS INVITED TALKS CROSSINGS BETWEEN CURVES WITH MANY
TANGENCIES 1 JACOB FOX, FABRIZIO FRATI, JDNOS FACH, AND ROM PINCHASI
CONSTANT-WORK-SPACE ALGORITHM FOR A SHORTEST PATH IN A SIMPLE POLYGON 9
TETSUO ASANO. WOLF GANG MULZER, AND YAJUN WANG APPROXIMATION ALGORITHMS
FOR ART GALLERY PROBLEMS IN POLYGONS AND TERRAINS 21 SUBIR KURAAR GHOSH
THE HAMILTONIAN AUGMENTATION PROBLEM AND ITS APPLICATIONS TO GRAPH
DRAWING 35 EMILIO DI GIACOMO AND GIUSEPPE LIOTTA GRAPH DRAWING SMALL
GRID DRAWINGS OF PLANAR GRAPHS WITH BALANCED BIPARTITION 47 XIAO ZHOU,
TAKASHI HIKINO, AND TAKAO NISHIZEKI SWITCH-REGULAR UPWARD PLANAR
EMBEDDINGS OF TREES 58 CARLA BINUCCI, EMILIO DI GIACOMO, WALLER DIDIMO.
AND AIMAL REXTIN A GLOBAL FC-LEVEL CROSSING REDUCTION ALGORITHM 70
CHRISTIAN BACHMAIER, FRANZ J. BRANDENBURG, WOLFGANG BRUNNER, AND
FERDINAND HUEBNER COMPUTATIONAL GEOMETRY COMPUTATION OF NON-DOMINATED
POINTS USING COMPACT VORONOI DIAGRAMS 82 BINAY BHATTACHARYA, ARIJIT
BISHNU, OTFRIED CHEONG, SANDIP DAS, ARINDAM KARMAKAR, AND JACK SNOEYINK
CUTTING A CONVEX POLYHEDRON OUT OF A SPHERE 94 SYED ISHTIAQUE AHMED,
MASUD HASAN, AND MD. ARIFUL ISLAM A SIMPLE ALGORITHM FOR APPROXIMATE
PARTIAL POINT SET PATTERN MATCHIN BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/99895571X DIGITALISIERT DURCH GRAPH ALGORITHMS I
ACYCLICALLY 3-COLORABLE PLANAR GRAPHS 113 PATRIZIO ANGELINI AND FABRIZIO
FRATI RECONSTRUCTION ALGORITHM FOR PERMUTATION GRAPHS 125 MASASHI
KIYOMI, TOSHIKI SAITOH, AND RYUHEI UEHARA HARMONIOUS COLORING ON
SUBCLASSES OF COLINEAR GRAPHS 136 KYRIAKI LOANNIDOU AND STAVROS D.
NIKOLOPOULOS COMPUTATIONAL BIOLOGY AND STRINGS COMPARING RNA STRUCTURES
WITH BIOLOGICALLY RELEVANT OPERATIONS CANNOT BE DONE WITHOUT STRONG
COMBINATORIAL RESTRICTIONS 149 GUILLAUME BLIN, SYLVIE HAMEL, AND
STEPHANE VIALETTE THE 1.375 APPROXIMATION ALGORITHM FOR SORTING BY
TRANSPOSITIONS CAN RUN IN O(NLOGRI) TIME 161 JESUN S. FIROZ. MASUD
HASAN. ASHIK Z. KHAN, AND M. SOHEL RAHMAN PARALLEL ALGORITHMS FOR
ENCODING AND DECODING BLOB CODE 167 SAVERIO CAMINITI AND ROSSELLA
PETRESCHI COMBINATORIAL OPTIMIZATION A ROOTED-FOREST PARTITION WITH
UNIFORM VERTEX DEMAND 179 NAOKI KATOH AND SHIN-ICHI TANIGAWA A SIMPLE
AND FASTER BRANCH-AND-BOUND ALGORITHM FOR FINDING A MAXIMUM CLIQUE 191
ETSUJI TOMITA, YOICHI SUTANI, TAKANORI HIGASHI, SHINYA TAKAHASHI, AND
MITSUO WAKATSUKI GRAPH ALGORITHMS II ON SONAE SIMPLE WIDTHS 204 LING-JU
HUNG AND TON KLOKS A NEW MODEL FOR A SCALE-FREE HIERARCHICAL STRUCTURE
OF ISOLATED CLIQUES 216 TAKEYA VARIANTS OF SPREADING MESSAGES 240 T. V.
THIRUMALA REDDY, D. SAI KRISHNA, AND C. PANDU RANGAN ON FILIDING A
BETTER POSITION OF A CONVEX POLYGON INSIDE A CIRCLE TO MINIMIZE THE
CUTTING COST 252 SYED ISHTIAQUE AHMED, MD. MANSURUL ALAM BHUIYAN, MASUD
HASAN, AND ISHITA KAMAL KHAN REAL ROOT ISOLATION OF MULTI-EXPONENTIAL
POLYNOMIALS WITH APPLICATION 263 MING XU, LIANGYU CHEN. ZHENBING ZENG,
AND ZHI-BIN LI PARAMETERIZED COMPLEXITY FPT ALGORITHMS FOR CONNECTED
FEEDBACK VERTEX SET 269 NEELDHARA MISRA, GEEVARGHESE PHILIP, VENKATESH
RAMAN, SAKET SAURABH, AND SOMNATH SIKDAR A SIMPLE AND FAST ALGORITHM FOR
MAXIMUM TNDEPENDENT SET IN 3-DEGREE GRAPHS 281 MINGYU XIAO PATHWIDTH AND
SEARCHING IN PARAMETERIZED THRESHOLD GRAPHS 293 D. SAI KRISHNA. T. V.
THIRUMALA REDDY. B. SAI SHASHANK, AND C. PANDU RANGAN AUTHOR INDEX 305 |
any_adam_object | 1 |
author_GND | (DE-588)140356304 |
building | Verbundindex |
bvnumber | BV035988460 |
classification_rvk | SS 4800 |
classification_tum | DAT 530f |
ctrlnum | (OCoLC)503457539 (DE-599)DNB99895571X |
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">BV035988460</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110413</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">100201s2010 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,A05</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">99895571X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642114397</subfield><subfield code="c">kart. : EUR 57.78 (freier Pr.), sfr 84.00 (freier Pr.)</subfield><subfield code="9">978-3-642-11439-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642114397</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12836628</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)503457539</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB99895571X</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="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">Algorithms and computation</subfield><subfield code="b">4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings</subfield><subfield code="c">Md. Saidur Rahman ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 304 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</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">5942</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">2010</subfield><subfield code="z">Dhaka</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">Rahman, Md. Saidur</subfield><subfield code="d">1966-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)140356304</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">4</subfield><subfield code="d">2010</subfield><subfield code="c">Dhaka</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16054233-9</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">5942</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">5942</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=018881232&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-018881232</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2010 Dhaka gnd-content |
genre_facet | Konferenzschrift 2010 Dhaka |
id | DE-604.BV035988460 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:11:49Z |
institution | BVB |
institution_GND | (DE-588)16054233-9 |
isbn | 9783642114397 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018881232 |
oclc_num | 503457539 |
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, 304 S. graph. Darst. 24 cm |
publishDate | 2010 |
publishDateSearch | 2010 |
publishDateSort | 2010 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Algorithms and computation 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings Md. Saidur Rahman ... (eds.) Berlin [u.a.] Springer 2010 XIII, 304 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 5942 Literaturangaben 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 2010 Dhaka 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 Rahman, Md. Saidur 1966- Sonstige (DE-588)140356304 oth WALCOM 4 2010 Dhaka Sonstige (DE-588)16054233-9 oth Lecture notes in computer science 5942 (DE-604)BV000000607 5942 DNB Datenaustausch application/pdf 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 Inhaltsverzeichnis |
spellingShingle | Algorithms and computation 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings Lecture notes in computer science 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 | Algorithms and computation 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings |
title_auth | Algorithms and computation 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings |
title_exact_search | Algorithms and computation 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings |
title_full | Algorithms and computation 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings Md. Saidur Rahman ... (eds.) |
title_fullStr | Algorithms and computation 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings Md. Saidur Rahman ... (eds.) |
title_full_unstemmed | Algorithms and computation 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings Md. Saidur Rahman ... (eds.) |
title_short | Algorithms and computation |
title_sort | algorithms and computation 4th international workshop walcom 2010 dhaka bangladesh february 10 12 2010 proceedings |
title_sub | 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10 - 12, 2010 ; proceedings |
topic | 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 | Graph Algorithmische Geometrie Berechnungskomplexität Graphenzeichnen Algorithmus Konferenzschrift 2010 Dhaka |
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 |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT rahmanmdsaidur algorithmsandcomputation4thinternationalworkshopwalcom2010dhakabangladeshfebruary10122010proceedings AT walcomdhaka algorithmsandcomputation4thinternationalworkshopwalcom2010dhakabangladeshfebruary10122010proceedings |