Verfügbarkeit: WALCOM: algorithms and computation

WALCOM: algorithms and computation: 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings

Gespeichert in:

Bibliographische Detailangaben
Körperschaft:	WALCOM Kharagpur (VerfasserIn)
Format:	Tagungsbericht Buch
Sprache:	English
Veröffentlicht:	Berlin [u.a.] Springer 2013
Schriftenreihe:	Lecture notes in computer science 7748
Schlagworte:	Graph Approximationsalgorithmus Komplexitätstheorie Algorithmische Geometrie Graphenzeichnen Berechnungskomplexität Algorithmus Konferenzschrift > 2013 > Kharagpur West Bengal
Online-Zugang:	Inhaltstext Inhaltsverzeichnis
Beschreibung:	XIII, 348 S. Ill., graph. Darst.
ISBN:	9783642360640

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV040802198
003	DE-604
005	20150216
007	t\|
008	130307s2013 xx ad\|\| \|\|\|\| 00\|\|\| eng d
016	7		\|a 1028990642 \|2 DE-101
020			\|a 9783642360640 \|9 978-3-642-36064-0
035			\|a (OCoLC)835369818
035			\|a (DE-599)DNB1028990642
040			\|a DE-604 \|b ger \|e aacr
041	0		\|a eng
049			\|a DE-11 \|a DE-83 \|a DE-91G
082	0		\|a 004.015113 \|2 22/ger
084			\|a DAT 530f \|2 stub
111	2		\|a WALCOM \|n 7. \|d 2013 \|c Kharagpur \|j Verfasser \|0 (DE-588)1032022426 \|4 aut
245	1	0	\|a WALCOM: algorithms and computation \|b 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings \|c Subir Kumar Ghosh ... (eds.)
264		1	\|a Berlin [u.a.] \|b Springer \|c 2013
300			\|a XIII, 348 S. \|b Ill., graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 7748
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|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 Graphenzeichnen \|0 (DE-588)4706480-8 \|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 Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2013 \|z Kharagpur West Bengal \|2 gnd-content
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0	1	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	0		\|5 DE-604
689	1	0	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|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 Algorithmische Geometrie \|0 (DE-588)4130267-9 \|D s
689	4		\|5 DE-604
689	5	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	5	1	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	5		\|8 1\p \|5 DE-604
700	1		\|a Ghosh, Subir Kumar \|e Sonstige \|0 (DE-588)140888969 \|4 oth
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|z 978-3-642-36065-7
830		0	\|a Lecture notes in computer science \|v 7748 \|w (DE-604)BV000000607 \|9 7748
856	4		\|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=4212975&prov=M&dok_var=1&dok_ext=htm \|3 Inhaltstext
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=025782280&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-025782280

Datensatz im Suchindex

_version_	1820875446002122752
adam_text	IMAGE 1 T A B L E O F C O N T E N T S I N V I T E D T A L K S MOBILITY AND COMPUTATIONS: SOME OPEN RESEARCH DIRECTIONS (ABSTRACT) 1 NICOLA SANTORO ADVERSARIAL PREDICTION: LOSSLESS PREDICTORS AND FRACTAL LIKE ADVERSARIES (ABSTRACT) 4 RINA PANIGRAHY C O M P U T A T I O N A L G E O M E T R Y A NOVEL EFFICIENT APPROACH FOR SOLVING THE A R T GALLERY PROBLEM 5 ALEXANDER KROLLER, MAHDI MOEINI, AND CHRISTIANE SCHMIDT FIXED-ORIENTATION EQUILATERAL TRIANGLE MATCHING OF POINT SETS 17 JASINE BABU, AHMAD BINIAZ, ANIL MAHESHWARI, AND MICHIEL SMID ONLINE EXPLORATION AND TRIANGULATION IN ORTHOGONAL POLYGONAL REGIONS 29 SANDOR P. FEKETE, SOPHIA REX, AND CHRISTIANE SCHMIDT A COMPETITIVE STRATEGY FOR DISTANCE-AWARE ONLINE SHAPE ALLOCATION . . . 41 SANDOR P. FEKETE, NILS SCHWEER, AND JAN-MARC REINHARDT BASE LOCATION PROBLEMS FOR BASE-MONOTONE REGIONS 53 JINHEE CHUN, TAKASHI HORIYAMA, TAKEHIRO ITO, NATSUDA KAOTHANTHONG, HIROTAKA ONO, YOTA OTACHI, TAKESHI TOKUYAMA, RYUHEI UEHARA, AND TAKEAKI UNO COUNTING MAXIMAL POINTS IN A QUERY ORTHOGONAL RECTANGLE 65 ANANDA SWARUP DAS, PROSENJIT GUPTA, AND KANNAN SRINATHAN VORONOI GAME ON GRAPHS 77 SAYAN BANDYAPADHYAY, A N T R A BANIK, SANDIP DAS, AND HIRAK SARKAR A P P R O X I M A T I O N A N D R A N D O M I Z E D A L G O R I T H M S APPROXIMATION SCHEMES FOR COVERING AND PACKING 89 R O M ASCHNER, MATTHEW J. KATZ, GILA MORGENSTERN, AND YELENA YUDITSKY HTTP://D-NB.INFO/1028990642 IMAGE 2 XII TABLE OF CONTENTS A RANDOMISED APPROXIMATION ALGORITHM FOR THE HITTING SET PROBLEM 101 MOURAD EL OUALI, HELENA FOLILIN, AND ANAND SRIVASTAV EXACT AND APPROXIMATION ALGORITHMS FOR DENSEST FC-SUBGRAPH (EXTENDED ABSTRACT) 114 NICOLAS BOURGEOIS, ARISTOTELIS GIANNAKOS, GIORGIO LUCARELLI, IOANNIS MILIS, AND VANGELIS TH. PASCHOS LINEAR-TIME CONSTANT-RATIO APPROXIMATION ALGORITHM AND TIGHT BOUNDS FOR THE CONTIGUITY OF COGRAPHS 126 CHRISTOPHE CRESPELLE AND PHILIPPE GAMBETTE APPROXIMATION ALGORITHMS FOR THE PARTITION VERTEX COVER PROBLEM 137 SUMAN KALYAN BERN, SHALMOLI GUPTA, A M I T KUMAR, AND SAMBUDDHA ROY P A R A L L E L A N D D I S T R I B U T E D C O M P U T I N G DAEMON CONVERSIONS IN DISTRIBUTED SELF-STABILIZING ALGORITHMS 146 WAYNE GODDARD AND PRADIP K. SRIMANI BROADCASTING IN CONFLICT-AWARE MULTI-CHANNEL NETWORKS 158 FRANCISCO CLAUDE, REZA DORRIGIV, SHAHIN KAMALI, ALEJANDRO LOPEZ-ORTIZ, PAWEL PRALAT, JAZMIN ROMERO, ALEJANDRO SALINGER, AND DIEGO SECO SHARED-MEMORY PARALLEL FRONTIER-BASED SEARCH 170 SHOGO TAKEUCHI, JUN KAWAHARA, AKIHIRO KISHIMOTO, AND SHIN-ICHI MINATO G R A P H A L G O R I T H M S SMOOTHED ANALYSIS OF BELIEF PROPAGATION FOR MINIMUM-COST FLOW AND MATCHING 182 TOBIAS BRUNSCH, KAMIEL CORNELISSEN, BODO MANTHEY, AND HEIKO ROGLIN TRIANGLE-PARTITIONING EDGES OF PLANAR GRAPHS, TOROIDAL GRAPHS AND FC-PLANAR GRAPHS 194 JIAWEI GAO, TON KLOKS, AND SHEUNG-HUNG POON ALLIANCES AND BISECTION WIDTH FOR PLANAR GRAPHS 206 MARTIN OLSEN AND MORTEN REVSBCEK T H E CYCLICAL SCHEDULING PROBLEM 217 BINAY BHATTACHARYA, SOUDIPTA CHAKRABORTY, EHSAN IRANMANESH, AND RAMESH KRISHNAMURTI IMAGE 3 TABLE OF CONTENTS XIII C O M P L E X I T Y A N D B O U N D S GENERALIZED RAINBOW CONNECTIVITY OF GRAPHS 233 KEI UCHIZAWA, TAKANORI AOKI, TAKEHIRO ITO, AND XIAO ZHOU FIXED-PARAMETER TRACTABILITY OF ERROR CORRECTION IN GRAPHICAL LINEAR SYSTEMS 245 PETER DAMASCHKE, OMER EGECIOGLU, AND LEONID MOLOKOV LOWER BOUNDS FOR RAMSEY NUMBERS FOR COMPLETE BIPARTITE AND 3-UNIFORM TRIPARTITE SUBGRAPHS 257 TAPAS K U M A R MISHRA AND SUDEBKUMAR PRASANT PAL IMPROVED FIXED-PARAMETER ALGORITHM FOR THE MINIMUM WEIGHT 3-SAT PROBLEM 265 VENKATESH RAMAN AND BAL SRI SHANKAR ON DIRECTED TREE REALIZATIONS OF DEGREE SETS 274 PRASUN KUMAR, JAYALAL SARMA M.N., AND SAURABH SAWLANI AN F P T ALGORITHM FOR T R E E D E L E T I O N S E T 2 8 6 VENKATESH RAMAN, SAKET SAURABH, AND ONDFEJ SUCHY G R A P H D R A W I N G CIRCULAR GRAPH DRAWINGS WITH LARGE CROSSING ANGLES 298 HOOMAN REISI DEHKORDI, QUAN NGUYEN, PETER EADES, AND SEOK-HEE HONG ON GRAPHS T H A T ARE NOT PCGS 310 STEPHANE DUROCHER, DEBAJYOTI MONDAL, AND MD. SAIDUR RAHMAN ON EMBEDDING OF CERTAIN RECURSIVE TREES AND STARS INTO HYPERCUBE . . . 322 INDHUMATHI RAMAN BOX-RECTANGULAR DRAWINGS OF PLANAR GRAPHS (EXTENDED ABSTRACT) 334 MD. MANZURUL HASAN, MD. SAIDUR RAHMAN, AND MD. REZAUL KARIM A U T H O R I N D E X 347
any_adam_object	1
author_GND	(DE-588)140888969
author_corporate	WALCOM Kharagpur
author_corporate_role	aut
author_facet	WALCOM Kharagpur
author_sort	WALCOM Kharagpur
building	Verbundindex
bvnumber	BV040802198
classification_rvk	SS 4800
classification_tum	DAT 530f
ctrlnum	(OCoLC)835369818 (DE-599)DNB1028990642
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
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">BV040802198</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150216</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">130307s2013 xx ad\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1028990642</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642360640</subfield><subfield code="9">978-3-642-36064-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)835369818</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1028990642</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</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">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">7.</subfield><subfield code="d">2013</subfield><subfield code="c">Kharagpur</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1032022426</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">WALCOM: algorithms and computation</subfield><subfield code="b">7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings</subfield><subfield code="c">Subir Kumar Ghosh ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 348 S.</subfield><subfield code="b">Ill., graph. Darst.</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">7748</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">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">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">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">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">2013</subfield><subfield code="z">Kharagpur West Bengal</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="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" 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="5" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ghosh, Subir Kumar</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)140888969</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-642-36065-7</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7748</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7748</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=4212975&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=025782280&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025782280</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2013 Kharagpur West Bengal gnd-content
genre_facet	Konferenzschrift 2013 Kharagpur West Bengal
id	DE-604.BV040802198
illustrated	Illustrated
indexdate	2025-01-10T15:15:45Z
institution	BVB
institution_GND	(DE-588)1032022426
isbn	9783642360640
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-025782280
oclc_num	835369818
open_access_boolean
owner	DE-11 DE-83 DE-91G DE-BY-TUM
owner_facet	DE-11 DE-83 DE-91G DE-BY-TUM
physical	XIII, 348 S. Ill., graph. Darst.
publishDate	2013
publishDateSearch	2013
publishDateSort	2013
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spelling	WALCOM 7. 2013 Kharagpur Verfasser (DE-588)1032022426 aut WALCOM: algorithms and computation 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings Subir Kumar Ghosh ... (eds.) Berlin [u.a.] Springer 2013 XIII, 348 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 7748 Graph (DE-588)4021842-9 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2013 Kharagpur West Bengal gnd-content Algorithmus (DE-588)4001183-5 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Approximationsalgorithmus (DE-588)4500954-5 s Graphenzeichnen (DE-588)4706480-8 s Graph (DE-588)4021842-9 s Algorithmische Geometrie (DE-588)4130267-9 s Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Ghosh, Subir Kumar Sonstige (DE-588)140888969 oth Erscheint auch als Online-Ausgabe 978-3-642-36065-7 Lecture notes in computer science 7748 (DE-604)BV000000607 7748 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=4212975&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025782280&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	WALCOM: algorithms and computation 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings Lecture notes in computer science Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4021842-9 (DE-588)4500954-5 (DE-588)4120591-1 (DE-588)4130267-9 (DE-588)4706480-8 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417
title	WALCOM: algorithms and computation 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings
title_auth	WALCOM: algorithms and computation 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings
title_exact_search	WALCOM: algorithms and computation 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings
title_full	WALCOM: algorithms and computation 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings Subir Kumar Ghosh ... (eds.)
title_fullStr	WALCOM: algorithms and computation 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings Subir Kumar Ghosh ... (eds.)
title_full_unstemmed	WALCOM: algorithms and computation 7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings Subir Kumar Ghosh ... (eds.)
title_short	WALCOM: algorithms and computation
title_sort	walcom algorithms and computation 7th international workshop walcom 2013 kharagpur india february 14 16 2013 proceedings
title_sub	7th international workshop, WALCOM 2013, Kharagpur, India, February 14 - 16, 2013 ; proceedings
topic	Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Graph Approximationsalgorithmus Komplexitätstheorie Algorithmische Geometrie Graphenzeichnen Berechnungskomplexität Algorithmus Konferenzschrift 2013 Kharagpur West Bengal
url	http://deposit.dnb.de/cgi-bin/dokserv?id=4212975&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025782280&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT walcomkharagpur walcomalgorithmsandcomputation7thinternationalworkshopwalcom2013kharagpurindiafebruary14162013proceedings AT ghoshsubirkumar walcomalgorithmsandcomputation7thinternationalworkshopwalcom2013kharagpurindiafebruary14162013proceedings

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Beschreibung

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge