Eintrag weiter verarbeiten
Online-Ressource

WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings

Gespeichert in:

Personen und Körperschaften: Rahman, Md. Saidur (VerfasserIn), Fujita, Satoshi (Sonstige)
Titel: WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings/ edited by Md. Saidur Rahman, Satoshi Fujita
Format: E-Book Konferenzbericht
Sprache: Englisch
veröffentlicht:
Berlin, Heidelberg Springer Berlin Heidelberg 2010
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 5942
Schlagwörter:
Computer software
Computational complexity
Algebra > Data processing
Computer Science
Computer science
Bioinformatics
Algorithms
Discrete mathematics.
Konferenzschrift > 2010 > Dhaka
Buchausg. u.d.T.: WALCOM: algorithms and computation, Berlin : Springer, 2010, XIII, 304 S.
Quelle: Verbunddaten SWB
Zugangsinformationen: Elektronischer Volltext - Campuslizenz
LEADER 07423cam a22013092 4500
001 0-1649073607
003 DE-627
005 20240122105326.0
007 cr uuu---uuuuu
008 100427s2010 gw |||||o 00| ||eng c
020 |a 9783642114403  |9 978-3-642-11440-3 
024 7 |a 10.1007/978-3-642-11440-3  |2 doi 
035 |a (DE-627)1649073607 
035 |a (DE-576)322304784 
035 |a (DE-599)BSZ322304784 
035 |a (OCoLC)699697048 
035 |a (OCoLC)845721384 
035 |a (ZBM)1181.68014 
035 |a (DE-He213)978-3-642-11440-3 
035 |a (EBP)040515192 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE 
050 0 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
084 |a SS 4800  |2 rvk  |0 (DE-625)rvk/143528: 
084 |a *68-06  |2 msc 
084 |a 68R10  |2 msc 
084 |a 68U05  |2 msc 
084 |a 68Wxx  |2 msc 
084 |a 00B25  |2 msc 
084 |a 54.51  |2 bkl 
084 |a 54.10  |2 bkl 
100 1 |a Rahman, Md. Saidur  |d 1966-  |0 (DE-588)140356304  |0 (DE-627)618249621  |0 (DE-576)316568465  |4 aut 
245 1 0 |a WALCOM: Algorithms and Computation  |b 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings  |c edited by Md. Saidur Rahman, Satoshi Fujita 
264 1 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2010 
300 |a Online-Ressource (XIII, 305p. 72 illus, digital) 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science  |v 5942 
490 0 |a SpringerLink  |a Bücher 
520 |a 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. 
650 0 |a Computer software 
650 0 |a Computational complexity 
650 0 |a Algebra  |x Data processing 
650 0 |a Computer Science 
650 0 |a Computer science 
650 0 |a Bioinformatics 
650 0 |a Algorithms 
650 0 |a Discrete mathematics. 
655 7 |a Konferenzschrift  |y 2010  |z Dhaka  |0 (DE-588)1071861417  |0 (DE-627)826484824  |0 (DE-576)433375485  |2 gnd-content 
689 0 0 |D s  |0 (DE-588)4001183-5  |0 (DE-627)106398164  |0 (DE-576)20884161X  |a Algorithmus  |2 gnd 
689 0 |5 DE-101 
689 1 0 |D s  |0 (DE-588)4130267-9  |0 (DE-627)105703842  |0 (DE-576)209617500  |a Algorithmische Geometrie  |2 gnd 
689 1 |5 DE-101 
689 2 0 |D s  |0 (DE-588)4706480-8  |0 (DE-627)356527883  |0 (DE-576)215422112  |a Graphenzeichnen  |2 gnd 
689 2 |5 DE-101 
689 3 0 |D s  |0 (DE-588)4021842-9  |0 (DE-627)106311921  |0 (DE-576)208940251  |a Graph  |2 gnd 
689 3 1 |D s  |0 (DE-588)4001183-5  |0 (DE-627)106398164  |0 (DE-576)20884161X  |a Algorithmus  |2 gnd 
689 3 |5 DE-101 
689 4 0 |D s  |0 (DE-588)4134751-1  |0 (DE-627)104105984  |0 (DE-576)209654945  |a Berechnungskomplexität  |2 gnd 
689 4 |5 DE-101 
700 1 |a Fujita, Satoshi  |4 oth 
776 1 |z 9783642114397 
776 0 8 |i Buchausg. u.d.T.  |t WALCOM: algorithms and computation  |d Berlin : Springer, 2010  |h XIII, 304 S.  |w (DE-627)616392583  |w (DE-576)316627755  |z 3642114393  |z 9783642114397 
830 0 |a Lecture notes in computer science  |v 5942  |9 5942  |w (DE-627)316228877  |w (DE-576)093890923  |w (DE-600)2018930-8  |x 1611-3349  |7 ns 
856 4 0 |u https://doi.org/10.1007/978-3-642-11440-3  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://swbplus.bsz-bw.de/bsz322304784cov.jpg  |m V:DE-576  |m X:springer  |q image/jpeg  |v 20150402155943  |3 Cover 
856 4 2 |u https://zbmath.org/?q=an:1181.68014  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC  |b 2010 
912 |a ZDB-2-SEB 
912 |a ZDB-2-SCS  |b 2010 
912 |a ZDB-2-SXCS  |b 2010 
912 |a ZDB-2-SEB  |b 2010 
936 r v |a SS 4800  |b Lecture notes in computer science  |k Informatik  |k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen  |k Schriftenreihen (indiv. Sign.)  |k Lecture notes in computer science  |0 (DE-627)1271461242  |0 (DE-625)rvk/143528:  |0 (DE-576)201461242 
936 b k |a 54.51  |j Programmiermethodik  |q SEPA  |0 (DE-627)106418122 
936 b k |a 54.10  |j Theoretische Informatik  |q SEPA  |0 (DE-627)106418815 
951 |a BO 
950 |a Computational complexity 
950 |a Berechenbarkeit 
950 |a Komplexität 
950 |a Komplexität von Berechnungen 
950 |a Polynomiale Komplexität 
950 |a Komplexitätstheorie 
950 |a Computergeometrie 
950 |a Computational geometry 
950 |a Berechenbare Geometrie 
950 |a Geometrie-Algorithmen 
950 |a Geometrie 
950 |a Algorithmus 
950 |a Geometrische Modellierung 
950 |a Geometrieverarbeitung 
950 |a Graphentheorie 
950 |a Algorithmen 
950 |a Алгоритм 
950 |a Graph Drawing 
950 |a Graphzeichnen 
950 |a Zeichnen 
951 |b XB-BD 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-11440-3  |9 DE-14 
852 |a DE-14  |z 2011-07-20T14:58:23Z  |x epn:3332218913 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-11440-3  |9 DE-15 
852 |a DE-15  |z 2011-05-16T16:34:28Z  |x epn:3332218980 
976 |h Elektronischer Volltext - Campuslizenz 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-11440-3  |z Zum Online-Dokument  |9 DE-Zi4 
852 |a DE-Zi4  |z 2011-01-26T14:28:34Z  |x epn:333221909X 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-11440-3  |9 DE-520 
852 |a DE-520  |z 2012-11-21T15:48:57Z  |x epn:3332219162 
980 |a 1649073607  |b 0  |k 1649073607  |o 322304784 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=WALCOM%3A+Algorithms+and+Computation%3A+4th+International+Workshop%2C+WALCOM+2010%2C+Dhaka%2C+Bangladesh%2C+February+10-12%2C+2010.+Proceedings&rft.date=2010&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=WALCOM%3A+Algorithms+and+Computation%3A+4th+International+Workshop%2C+WALCOM+2010%2C+Dhaka%2C+Bangladesh%2C+February+10-12%2C+2010.+Proceedings&rft.series=Lecture+notes+in+computer+science%2C+5942&rft.au=Rahman%2C+Md.+Saidur&rft.pub=Springer+Berlin+Heidelberg&rft.edition=&rft.isbn=3642114407
SOLR
_version_ 1789357343651135488
access_facet Electronic Resources
author Rahman, Md. Saidur
author2 Fujita, Satoshi
author2_role oth
author2_variant s f sf
author_facet Rahman, Md. Saidur, Fujita, Satoshi
author_role aut
author_sort Rahman, Md. Saidur 1966-
author_variant m s r ms msr
callnumber-first Q - Science
callnumber-label QA76
callnumber-raw QA76.9.A43
callnumber-search QA76.9.A43
callnumber-sort QA 276.9 A43
callnumber-subject QA - Mathematics
collection ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS
contents 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.
ctrlnum (DE-627)1649073607, (DE-576)322304784, (DE-599)BSZ322304784, (OCoLC)699697048, (OCoLC)845721384, (ZBM)1181.68014, (DE-He213)978-3-642-11440-3, (EBP)040515192
de15_date 2011-05-16T16:34:28Z
doi_str_mv 10.1007/978-3-642-11440-3
era_facet 2010
facet_912a ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS
facet_avail Online
facet_local_del330 Algorithmus, Algorithmische Geometrie, Graphenzeichnen, Graph, Berechnungskomplexität
finc_class_facet Informatik, Mathematik
finc_id_str 0000857910
fincclass_txtF_mv science-computerscience
format eBook, ConferenceProceedings
format_access_txtF_mv Book, E-Book
format_de105 Ebook
format_de14 Book, E-Book
format_de15 Book, E-Book
format_del152 Buch
format_detail_txtF_mv text-online-monograph-independent-conference
format_dezi4 e-Book
format_finc Book, E-Book
format_legacy ElectronicBook
format_legacy_nrw Book, E-Book
format_nrw Book, E-Book
format_strict_txtF_mv E-Book
genre Konferenzschrift 2010 Dhaka (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content
genre_facet Konferenzschrift
geogr_code not assigned
geogr_code_person Bangladesh
geographic_facet Dhaka
hierarchy_parent_id 0-316228877
hierarchy_parent_title Lecture notes in computer science
hierarchy_sequence 5942
hierarchy_top_id 0-316228877
hierarchy_top_title Lecture notes in computer science
id 0-1649073607
illustrated Not Illustrated
imprint Berlin, Heidelberg, Springer Berlin Heidelberg, 2010
imprint_str_mv Berlin, Heidelberg: Springer Berlin Heidelberg, 2010
institution DE-14, DE-Zi4, DE-520, DE-15
is_hierarchy_id 0-1649073607
is_hierarchy_title WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings
isbn 9783642114403
isbn_isn_mv 9783642114397, 3642114393
issn_isn_mv 1611-3349
kxp_id_str 1649073607
language English
last_indexed 2024-01-28T17:48:59.938Z
local_heading_facet_dezwi2 Computer software, Computational complexity, Algebra, Computer Science, Computer science, Bioinformatics, Algorithms, Discrete mathematics., Data processing, Algorithmus, Algorithmische Geometrie, Graphenzeichnen, Graph, Berechnungskomplexität
marc024a_ct_mv 10.1007/978-3-642-11440-3
match_str rahman2010walcomalgorithmsandcomputation4thinternationalworkshopwalcom2010dhakabangladeshfebruary10122010proceedings
mega_collection Verbunddaten SWB
multipart_link 093890923
multipart_part (093890923)5942
names_id_str_mv (DE-588)140356304, (DE-627)618249621, (DE-576)316568465
oclc_num 699697048, 845721384
physical Online-Ressource (XIII, 305p. 72 illus, digital)
publishDate 2010
publishDateSort 2010
publishPlace Berlin, Heidelberg
publisher Springer Berlin Heidelberg
record_format marcfinc
record_id 322304784
recordtype marcfinc
rsn_id_str_mv (DE-15)2459770
rvk_facet SS 4800
rvk_label Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science
rvk_path SS, SQ - SU, SS 4000 - SS 5999, SS 4800
rvk_path_str_mv SS, SQ - SU, SS 4000 - SS 5999, SS 4800
series Lecture notes in computer science, 5942
series2 Lecture Notes in Computer Science ; 5942, SpringerLink ; Bücher
source_id 0
spelling Rahman, Md. Saidur 1966- (DE-588)140356304 (DE-627)618249621 (DE-576)316568465 aut, WALCOM: Algorithms and Computation 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings edited by Md. Saidur Rahman, Satoshi Fujita, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (XIII, 305p. 72 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 5942, SpringerLink Bücher, 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., Computer software, Computational complexity, Algebra Data processing, Computer Science, Computer science, Bioinformatics, Algorithms, Discrete mathematics., Konferenzschrift 2010 Dhaka (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4001183-5 (DE-627)106398164 (DE-576)20884161X Algorithmus gnd, DE-101, s (DE-588)4130267-9 (DE-627)105703842 (DE-576)209617500 Algorithmische Geometrie gnd, s (DE-588)4706480-8 (DE-627)356527883 (DE-576)215422112 Graphenzeichnen gnd, s (DE-588)4021842-9 (DE-627)106311921 (DE-576)208940251 Graph gnd, s (DE-588)4134751-1 (DE-627)104105984 (DE-576)209654945 Berechnungskomplexität gnd, Fujita, Satoshi oth, 9783642114397, Buchausg. u.d.T. WALCOM: algorithms and computation Berlin : Springer, 2010 XIII, 304 S. (DE-627)616392583 (DE-576)316627755 3642114393 9783642114397, Lecture notes in computer science 5942 5942 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-11440-3 X:SPRINGER Verlag lizenzpflichtig Volltext, https://swbplus.bsz-bw.de/bsz322304784cov.jpg V:DE-576 X:springer image/jpeg 20150402155943 Cover, https://zbmath.org/?q=an:1181.68014 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-11440-3 DE-14, DE-14 2011-07-20T14:58:23Z epn:3332218913, http://dx.doi.org/10.1007/978-3-642-11440-3 DE-15, DE-15 2011-05-16T16:34:28Z epn:3332218980, http://dx.doi.org/10.1007/978-3-642-11440-3 Zum Online-Dokument DE-Zi4, DE-Zi4 2011-01-26T14:28:34Z epn:333221909X, http://dx.doi.org/10.1007/978-3-642-11440-3 DE-520, DE-520 2012-11-21T15:48:57Z epn:3332219162
spellingShingle Rahman, Md. Saidur, WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, Lecture notes in computer science, 5942, 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., Computer software, Computational complexity, Algebra Data processing, Computer Science, Computer science, Bioinformatics, Algorithms, Discrete mathematics., Konferenzschrift 2010 Dhaka, Algorithmus, Algorithmische Geometrie, Graphenzeichnen, Graph, Berechnungskomplexität
swb_id_str 322304784
title WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings
title_auth WALCOM: Algorithms and Computation 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings
title_full WALCOM: Algorithms and Computation 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings edited by Md. Saidur Rahman, Satoshi Fujita
title_fullStr WALCOM: Algorithms and Computation 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings edited by Md. Saidur Rahman, Satoshi Fujita
title_full_unstemmed WALCOM: Algorithms and Computation 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings edited by Md. Saidur Rahman, Satoshi Fujita
title_in_hierarchy 5942. WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings (2010)
title_short WALCOM: Algorithms and Computation
title_sort walcom 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
title_unstemmed WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings
topic Computer software, Computational complexity, Algebra Data processing, Computer Science, Computer science, Bioinformatics, Algorithms, Discrete mathematics., Konferenzschrift 2010 Dhaka, Algorithmus, Algorithmische Geometrie, Graphenzeichnen, Graph, Berechnungskomplexität
topic_facet Computer software, Computational complexity, Algebra, Computer Science, Computer science, Bioinformatics, Algorithms, Discrete mathematics., Data processing, Konferenzschrift, Algorithmus, Algorithmische Geometrie, Graphenzeichnen, Graph, Berechnungskomplexität
url https://doi.org/10.1007/978-3-642-11440-3, https://swbplus.bsz-bw.de/bsz322304784cov.jpg, https://zbmath.org/?q=an:1181.68014, http://dx.doi.org/10.1007/978-3-642-11440-3