Holdings: Computing and combinatorics

Computing and combinatorics: 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings

Saved in:

Bibliographic Details
Format:	Conference Proceeding Book
Language:	English
Published:	Berlin [u.a.] Springer 2013
Series:	Lecture notes in computer science 7936
Subjects:	Graph Theoretische Informatik Kombinatorik Berechenbarkeit Algorithmus Konferenzschrift > 2013 > Hangzhou
Online Access:	Inhaltstext Inhaltsverzeichnis
Physical Description:	XVIII, 861 S. 235 mm x 155 mm
ISBN:	9783642387678 3642387675 9783642387685

Staff View

MARC


LEADER	00000nam a2200000 cb4500
001	BV041104257
003	DE-604
005	20140130
007	t\|
008	130624s2013 gw \|\|\|\| 10\|\|\| eng d
015			\|a 13,N21 \|2 dnb
016	7		\|a 1034514857 \|2 DE-101
020			\|a 9783642387678 \|c Pb. : ca. EUR 101.65 (DE) (freier Pr.), ca. EUR 104.50 (AT) (freier Pr.), ca. sfr 126.50 (freier Pr.) \|9 978-3-642-38767-8
020			\|a 3642387675 \|9 3-642-38767-5
020			\|a 9783642387685 \|9 978-3-642-38768-5
024	3		\|a 9783642387678
035			\|a (OCoLC)852506647
035			\|a (DE-599)DNB1034514857
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a gw \|c XA-DE-BE
049			\|a DE-83 \|a DE-91G
082	0		\|a 004.0151 \|2 22/ger
084			\|a 004 \|2 sdnb
084			\|a DAT 537f \|2 stub
084			\|a MAT 050f \|2 stub
084			\|a DAT 517f \|2 stub
245	1	0	\|a Computing and combinatorics \|b 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings \|c Ding-Zhu Du ... (eds.)
264		1	\|a Berlin [u.a.] \|b Springer \|c 2013
300			\|a XVIII, 861 S. \|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 7936
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Theoretische Informatik \|0 (DE-588)4196735-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Kombinatorik \|0 (DE-588)4031824-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Berechenbarkeit \|0 (DE-588)4138368-0 \|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 Hangzhou \|2 gnd-content
689	0	0	\|a Theoretische Informatik \|0 (DE-588)4196735-5 \|D s
689	0		\|5 DE-604
689	1	0	\|a Kombinatorik \|0 (DE-588)4031824-2 \|D s
689	1	1	\|a Berechenbarkeit \|0 (DE-588)4138368-0 \|D s
689	1		\|5 DE-604
689	2	0	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	2	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	2		\|5 DE-604
700	1		\|a Du, Ding-Zhu \|e Sonstige \|4 oth
711	2		\|a COCOON \|n 19. \|d 2013 \|c Hangzhou \|j Sonstige \|0 (DE-588)103638487X \|4 oth
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|t Computing and Combinatorics
830		0	\|a Lecture notes in computer science \|v 7936 \|w (DE-604)BV000000607 \|9 7936
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=4327699&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=026080583&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-026080583

Record in the Search Index

_version_	1820875464656289792
adam_text	IMAGE 1 TABLE O F C O N T E N T S K E Y N O T E RECENT RESULTS FOR ONLINE MAKESPAN MINIMIZATION 1 SUSANNE ALBERS OPTIMAL STOPPING MEETS COMBINATORIAL OPTIMIZATION 4 ROBERT KLEINBERG G A M E T H E O R Y NEW BOUNDS FOR THE BALLOON POPPING PROBLEM 5 DAVIDE BILD AND VITTORIO BILD ON THE SEQUENTIAL PRICE OF ANARCHY OF ISOLATION GAMES 17 ANNA ANGELUCCI, VITTORIO BILD, MICHELE FLAMMINI, AND LUCA MOSCARDELLI SOCIAL EXCHANGE NETWORKS WITH DISTANT BARGAINING 29 KONSTANTINOS GEORGIOU, GEORGE KARAKOSTAS, JOCHEN KONEMANN, AND ZUZANNA STAMIROWSKA THE 1/4-CORE OF THE UNIFORM BIN PACKING GAME IS NONEMPTY 41 WALTER KERN AND XIAN QIU R A N D O M I Z E D A L G O R I T H M S ON THE ADVICE COMPLEXITY OF THE ONLINE L( 2, L)-COLORING PROBLEM ON PATHS AND CYCLES 53 MARIA PAOLA BIANCHI, HANS-JOACHIM BOCKENHAUER, JURAJ HROMKOVIC, SACHA KRUG, AND BJORN STEFFEN ON RANDOMIZED FICTITIOUS PLAY FOR APPROXIMATING SADDLE POINTS OVER CONVEX SETS 65 KHALED ELBASSIONI, KAZUHISA MAKINO, KURT MEHLHORN, AND FAHIMEH RAMEZANI A FAST ALGORITHM FOR D A T A COLLECTION ALONG A FIXED TRACK . 77 OTFRIED CHEONG, RADWA EL SHAWI, AND JOACHIM GUDMUNDSSON RANDOM METHODS FOR PARAMETERIZED PROBLEMS 89 QILONG FENG, JIANXIN WANG, SHAOHUA LI, AND JIANER CHEN HTTP://D-NB.INFO/1034514857 IMAGE 2 XII TABLE OF CONTENTS S C H E D U L I N G A L G O R I T H M S DVS SCHEDULING IN A LINE OR A STAR NETWORK OF PROCESSORS 101 ZONGXU M U AND MINMING L I ONLINE ALGORITHMS FOR BATCH MACHINES SCHEDULING WITH DELIVERY TIMES 114 PEIHAI LIU AND XIWEN L U HOW T O SCHEDULE THE MARKETING OF PRODUCTS WITH NEGATIVE EXTERNALITIES 122 ZHIGANG CAO, XUJIN CHEN, AND CHANGJUN WANG FROM PREEMPTIVE T O NON-PREEMPTIVE SPEED-SCALING SCHEDULING 134 EVRIPIDIS BAMPIS, ALEXANDER KONONOV, DIMITRIOS LETSIOS, GIORGIO LUCARELLI, AND IOANNIS NEMPARIS C O M P U T A T I O N A L T H E O R Y SELECTION FROM READ-ONLY MEMORY WITH LIMITED WORKSPACE 147 A M R ELMASRY, DANIEL DAHL JUHL, JYRKI KATAJAINEN, AND SRINIVASA RAO SATTI DETERNIMIZATION OF BIICHI AUTOMATA AS PARTITIONED AUTOMATA 158 CONG TIAN, ZHENHUA DUAN, AND MENGFEI YANG O N LINEAR-SIZE PSEUDORANDOM GENERATORS AND HARDCORE FUNCTIONS 169 JOSHUA BARON, YUVAL ISHAI, AND RAFAIL OSTROVSKY A FAST ALGORITHM FINDING THE SHORTEST RESET WORDS 182 ANDRZEJ KISIELEWICZ, JAKUB KOWALSKI, AND MAREK SZYKULA C O M P U T A T I O N A L G E O M E T R Y THE DISCRETE VORONOI GAME IN A SIMPLE POLYGON 197 ARITRA BANIK, SANDIP DAS, ANIL MAHESHWARI, AND MICHIEL SMID FACETS FOR ART GALLERY PROBLEMS 208 SANDOR P. FEKETE, STEPHAN FRIEDRICHS, ALEXANDER KROLLER, AND CHRISTIANE SCHMIDT HITTING AND PIERCING RECTANGLES INDUCED BY A POINT SET 221 NINAD RAJGOPAL, PRADEESHA ASHOK, SATHISH GOVINDARAJAN, ABHIJIT KHOPKAR, AND NEELDHARA MISRA IMAGE 3 TABLE OF CONTENTS XIII REALISTIC ROOFS OVER A RECTILINEAR POLYGON REVISITED 233 JESSICA SHERETTE AND SANG DUK YOON G R A P H A L G O R I T H M S I PARAMETRIC POWER SUPPLY NETWORKS (EXTENDED ABSTRACT) 245 SHIHO MORISHITA AND TAKAO NISHIZEKI APPROXIMATING THE MINIMUM INDEPENDENT DOMINATING SET IN PERTURBED GRAPHS 257 WEITIAN TONG, RANDY GOEBEL, AND GUOHUI L I N A LINEAR-TIME ALGORITHM FOR THE MINIMUM DEGREE HYPERGRAPH PROBLEM WITH THE CONSECUTIVE ONES PROPERTY 268 CHIH-HSUAN LI, JHIH-HONG YE, AND BIING-FENG WANG ON THE CONJUNCTIVE CAPACITY OF GRAPHS 280 MIROSLAV CHLEBIK AND JANKA CHLEBTKOVA A P P R O X I M A T I O N A L G O R I T H M S IMPROVED APPROXIMATION ALGORITHMS FOR THE FACILITY LOCATION PROBLEMS WITH LINEAR/SUBMODULAR PENALTY 292 YU LI, DONGLEI DU, NAIHUA XIU, AND DACHUAN X U AN IMPROVED SEMIDEFINITE PROGRAMMING HIERARCHIES ROUNDING APPROXIMATION ALGORITHM FOR MAXIMUM GRAPH BISECTION PROBLEMS . . . . 304 CHENCHEN WU, DONGLEI DU, AND DACHUAN X U IMPROVED LOCAL SEARCH FOR UNIVERSAL FACILITY LOCATION 316 ERIC ANGEL, NGUYEN K I M THANG, AND DAMIEN REGNAULT IMPROVED APPROXIMATION ALGORITHMS FOR COMPUTING K DISJOINT P A T H S SUBJECT TO TWO CONSTRAINTS 325 LONGKUN GUO, HONG SHEN, AND KEWEN LIAO G R A P H A L G O R I T H M S I I THE FC-SEPARATOR PROBLEM 337 WALID BEN-AMEUR, MOHAMED-AHMED MOHAMED-SIDI, AND JOSE NETO ON THE TREEWIDTH OF DYNAMIC GRAPHS 349 BERNARD MANS AND LUKE MATHIESON SQUARE-ORTHOGONAL DRAWING WITH FEW BENDS PER EDGE 361 YU-AN LIN AND SHEUNG-HUNG POON IMAGE 4 XIV TABLE OF CONTENTS COVERING TREE WITH STARS 373 JAN BAUMBACH, JIONG GUO, AND RASHID IBRAGIMOV C O M P U T A T I O N A L BIOLOGY A POLYNOMIAL TIME APPROXIMATION SCHEME FOR THE CLOSEST SHARED CENTER PROBLEM 385 WEIDONG LI, LUSHENG WANG, AND WENJUAN CUI AN IMPROVED APPROXIMATION ALGORITHM FOR SCAFFOLD FILLING T O MAXIMIZE THE COMMON ADJACENCIES 397 NAN LIU, HAITAO JIANG, DARNING ZHU, AND BINHAI ZHU AN EFFICIENT ALGORITHM FOR ONE-SIDED BLOCK ORDERING PROBLEM WITH BLOCK-INTERCHANGE DISTANCE 409 KUN-TZE CHEN, CHI-LONG LI, CHUNG-HAN YANG, AND CHIN LUNG L U A COMBINATORIAL APPROACH FOR MULTIPLE RNA INTERACTION: FORMULATIONS, APPROXIMATIONS, AND HEURISTICS 421 SYED ALI AHMED, SAAD MNEIMNEH, AND NANCY L. GREENBAUM G R A P H A L G O R I T H M S I I I MAXIMUM BALANCED SUBGRAPH PROBLEM PARAMETERIZED ABOVE LOWER BOUND 434 ROBERT CROWSTON, GREGORY GUTIN, MARK JONES, AND GABRIELE MUCIACCIA A TOOLBOX FOR PROVABLY OPTIMAL MULTISTAGE STRICT GROUP TESTING STRATEGIES 446 PETER DAMASCHKE AND A Z A M SHEIKH MUHAMMAD A LINEAR EDGE KERNEL FOR TWO-LAYER CROSSING MINIMIZATION 458 YASUAKI KOBAYASHI, HIROKAZU MARUTA, YUSUKE NAKAE, AND HISAO TAMAKI A LINEAR-TIME ALGORITHM FOR COMPUTING THE PRIME DECOMPOSITION OF A DIRECTED GRAPH WITH REGARD TO THE CARTESIAN PRODUCT 469 CHRISTOPHE CRESPELLE, ERIC THIERRY, AND THOMAS LAMBERT O N L I N E A L G O R I T H M S METRICAL SERVICE SYSTEMS WITH MULTIPLE SERVERS . ASHISH CHIPLUNKAR AND SUNDAR VISHWANATHAN 4 8 1 IMAGE 5 TABLE OF CONTENTS XV THE STRING GUESSING PROBLEM AS A METHOD TO PROVE LOWER BOUNDS ON THE ADVICE COMPLEXITY (EXTENDED ABSTRACT) 493 HANS-JOACHIM BOCKENHAUER, JURAJ HROMKOVIC, DENNIS K O M M , SACHA KRUG, JASMIN SRNULA, AND ANDREAS SPI'OCK ONLINE ALGORITHMS FOR 1-SPACE BOUNDED 2-DIMENSIONAL BIN PACKING AND SQUARE PACKING 506 YONG ZHANG, FRANCIS Y.L. CHIN, HING-FUNG TING, X I N HAN, CHUNG KEUNG POON, YUNG H. TSIN, AND DESHI YE IMPROVED LOWER BOUNDS FOR THE ONLINE BIN PACKING PROBLEM WITH CARDINALITY CONSTRAINTS 518 HIROSHI FUJIWARA AND KOJI KOBAYASHI P A R A M E T E R I Z E D A L G O R I T H M S PARAMETERIZED COMPLEXITY OF FLOOD-FILLING GAMES ON TREES 531 UEVERTON DOS SANTOS SOUZA, FABIO PROTTI, AND MAISE DANTAS DA SILVA PARAMETERIZED APPROXIMABILITY OF MAXIMIZING THE SPREAD OF INFLUENCE IN NETWORKS 543 CRISTINA BAZGAN, MORGAN CHOPIN, ANDRE NICHTERLEIN, AND FLORIAN SIKORA AN EFFECTIVE BRANCHING STRATEGY FOR SOME PARAMETERIZED EDGE MODIFICATION PROBLEMS WITH MULTIPLE FORBIDDEN INDUCED SUBGRAPHS . . . . 555 YUNLONG LIU, JIANXIN WANG, CHAO XU, JIONG GUO, AND JIANER CHEN PARAMETERIZED ALGORITHMS FOR MAXIMUM AGREEMENT FOREST ON MULTIPLE TREES 567 FENG SHI, JIANER CHEN, QIIONG FENG, AND JIANXIN WANG C O M P U T A T I O N A L C O M P L E X I T Y SMALL ^-COLORING PROBLEMS FOR BOUNDED DEGREE DIGRAPHS 579 PAVOL HELL AND AUROSISH MISHRA BOUNDED MODEL CHECKING FOR PREPOSITIONAL PROJECTION TEMPORAL LOGIC 591 ZHENHUA DUAN, CONG TIAN, MENGFEI YANG, AND JIA HE PACKING CUBES INTO A CUBE IS NP-HARD IN THE STRONG SENSE 603 YIPING LU, DANNY Z. CHEN, AND JIANZHONG CHA ON THE COMPLEXITY OF SOLVING OR APPROXIMATING CONVEX RECOLORING PROBLEMS 614 MANOEL B. CAMPELO, CRISTIANA G. HUIBAN, RUDINI M. SAMPAIO, AND YOSHIKO WAKABAYASHI IMAGE 6 XVI TABLE OF CONTENTS A L G O R I T H M S 2-CONNECTING OUTERPLANAR GRAPHS WITHOUT BLOWING UP THE PATHWIDTH 626 JASINE BABU, MANU BASAVARAJU, SUNIL CHANDRAN LEELA, AND DEEPAK RAJENDRAPRASAD HOW T O CATCH L2-HEAVY-HITTERS ON SLIDING WINDOWS 638 VLADIMIR BRAVERMAN, R A N GELLES, AND RAFAIL OSTROVSKY TIME/MEMORY/DATA TRADEOFFS FOR VARIANTS OF THE RSA PROBLEM 651 PIERRE-ALAIN FOUQUE, DAMIEN VERGNAUD, AND JEAN- CHRISTOPHE ZAPALOWICZ AN IMPROVED ALGORITHM FOR EXTRACTION OF EXACT BOUNDARIES AND BOUNDARIES INCLUSION RELATIONSHIP 663 TAO HU, XIANYI REN, AND JIHONG ZHANG W O R K S H O P I STRAIGHT-LINE MONOTONE GRID DRAWINGS OF SERIES-PARALLEL GRAPHS 672 MD. IQBAL HOSSAIN AND MD. SAIDUR RAHMAN COMBINATION OF TWO-MACHINE FLOW SHOP SCHEDULING AND SHORTEST P A T H PROBLEMS 680 KAMENG NIP AND ZHENBO WANG THE PROGRAM DOWNLOAD PROBLEM: COMPLEXITY AND ALGORITHMS 688 CHAO PENG, JIE ZHOU, BINHAI ZHU, AND HONG ZHU FINDING THEOREMS IN NBG SET THEORY BY AUTOMATED FORWARD DEDUCTION BASED ON STRONG RELEVANT LOGIC 697 HONGBIAO GAO, KAI SHI, YUICHI GOTO, AND JINGDE CHENG W O R K S H O P I I PERTURBATION ANALYSIS OF MAXIMUM-WEIGHTED BIPARTITE MATCHINGS WITH LOW RANK D A T A 705 XINGWU LIU AND SHANG-HUA TENG SUBLINEAR TIME APPROXIMATE SUM VIA UNIFORM RANDOM SAMPLING 713 BIN FU, WENFENG LI, AND ZHIYONG PENG TRACTABLE CONNECTED DOMINATION FOR RESTRICTED BIPARTITE GRAPHS 721 ZHAO LU, TIAN LIU, AND K E X U IMAGE 7 TABLE OF CONTENTS XVII ON THE MINIMUM CATERPILLAR PROBLEM IN DIGRAPHS 729 TAKU OKADA, AKIRA SUZUKI, TAKEHIRO ITO, AND XIAO ZHOU C S O N E T I A NEW MODEL FOR PRODUCT ADOPTION OVER SOCIAL NETWORKS 737 LIDAN FAN, ZAIXIN LU, WEILI WU, YUANJUN BI, AND AILIAN WANG GENERATING UNCERTAIN NETWORKS BASED ON HISTORICAL NETWORK SNAPSHOTS 747 MENG HAN, MINGYUAN YAN, JINBAO LI, SHOULING JI, AND YINGSHU L I A SHORT-TERM PREDICTION MODEL OF TOPIC POPULARITY ON MICROBLOGS 759 JUANJUAN ZHAO, WEILI WU, XIAOLONG ZHANG, YAN QIANG, TAO LIU, AND LIDONG W U SOCIAL NETWORK P A T H ANALYSIS BASED ON HBASE 770 YAN QIANG, JUNZUO LU, WEILI WU, JUANJUAN ZHAO, XIAOLONG ZHANG, YUE LI, AND LIDONG W U C S O N E T I I COMMUNITY EXPANSION MODEL BASED ON CHARGED SYSTEM THEORY 780 YUANJUN BI, WEILI WU, AILIAN WANG, AND LIDAN FAN CENTRALITY AND SPECTRAL RADIUS IN DYNAMIC COMMUNICATION NETWORKS 791 DANICA VUKADINOVIC GREETHAM, ZHIVKO STOYANOV, AND PETER GRINDROD FINDING NETWORK COMMUNITIES USING RANDOM WALKERS WITH IMPROVED ACCURACY 801 YOU LI, JIE WANG, BENYUAN LIU, AND QILIAN LIANG HOMOPHILIES AND COMMUNITIES DETECTION AMONG A SUBSET OF BLOGFA PERSIAN WEBLOGS: COMPUTER AND INTERNET CATEGORY 811 ADIB RASTEGARNIA, MEYSAM MOHAJER, AND VAHID SOLOUK C S O N E T I I I NEIGHBORHOOD-BASED DYNAMIC COMMUNITY DETECTION WITH GRAPH TRANSFORM FOR 0-1 OBSERVED NETWORKS 821 L I WANG, YUANJUN BI, WEILI WU, BIAO LIAN, AND WEN X U EFFECTS OF INOCULATION BASED ON STRUCTURAL CENTRALITY ON RUMOR DYNAMICS IN SOCIAL NETWORKS 831 ANURAG SINGH, RAHUL KUMAR, AND YATINDRA NATH SINGH IMAGE 8 XVIII TABLE OF CONTENTS A DOMINATING SET BASED APPROACH TO IDENTIFY EFFECTIVE LEADER GROUP OF SOCIAL NETWORK 841 DONGHYUN KIM, DEYING LI, OMID ASGARI, YINGSHU LI, AND ALADE 0 . TOKUTA USING NETWORK SCIENCES T O EVALUATE THE BRAZILIAN AIRLINE NETWORK 849 DOUGLAS OLIVEIRA, MARCO CARVALHO, AND RONALDO MENEZES A U T H O R I N D E X 859
any_adam_object	1
building	Verbundindex
bvnumber	BV041104257
classification_rvk	SS 4800
classification_tum	DAT 537f MAT 050f DAT 517f
ctrlnum	(OCoLC)852506647 (DE-599)DNB1034514857
dewey-full	004.0151
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.0151
dewey-search	004.0151
dewey-sort	14.0151
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">BV041104257</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140130</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">130624s2013 gw \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">13,N21</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1034514857</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642387678</subfield><subfield code="c">Pb. : ca. EUR 101.65 (DE) (freier Pr.), ca. EUR 104.50 (AT) (freier Pr.), ca. sfr 126.50 (freier Pr.)</subfield><subfield code="9">978-3-642-38767-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642387675</subfield><subfield code="9">3-642-38767-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642387685</subfield><subfield code="9">978-3-642-38768-5</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642387678</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)852506647</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1034514857</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</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">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 050f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing and combinatorics</subfield><subfield code="b">19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings</subfield><subfield code="c">Ding-Zhu Du ... (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">XVIII, 861 S.</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">7936</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">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</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">Hangzhou</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-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">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Du, Ding-Zhu</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">COCOON</subfield><subfield code="n">19.</subfield><subfield code="d">2013</subfield><subfield code="c">Hangzhou</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)103638487X</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="t">Computing and Combinatorics</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7936</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7936</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=4327699&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=026080583&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-026080583</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2013 Hangzhou gnd-content
genre_facet	Konferenzschrift 2013 Hangzhou
id	DE-604.BV041104257
illustrated	Not Illustrated
indexdate	2025-01-10T15:16:02Z
institution	BVB
institution_GND	(DE-588)103638487X
isbn	9783642387678 3642387675 9783642387685
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-026080583
oclc_num	852506647
open_access_boolean
owner	DE-83 DE-91G DE-BY-TUM
owner_facet	DE-83 DE-91G DE-BY-TUM
physical	XVIII, 861 S. 235 mm x 155 mm
publishDate	2013
publishDateSearch	2013
publishDateSort	2013
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spelling	Computing and combinatorics 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings Ding-Zhu Du ... (eds.) Berlin [u.a.] Springer 2013 XVIII, 861 S. 235 mm x 155 mm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 7936 Graph (DE-588)4021842-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2013 Hangzhou gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Kombinatorik (DE-588)4031824-2 s Berechenbarkeit (DE-588)4138368-0 s Graph (DE-588)4021842-9 s Algorithmus (DE-588)4001183-5 s Du, Ding-Zhu Sonstige oth COCOON 19. 2013 Hangzhou Sonstige (DE-588)103638487X oth Erscheint auch als Online-Ausgabe Computing and Combinatorics Lecture notes in computer science 7936 (DE-604)BV000000607 7936 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=4327699&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=026080583&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Computing and combinatorics 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings Lecture notes in computer science Graph (DE-588)4021842-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd Kombinatorik (DE-588)4031824-2 gnd Berechenbarkeit (DE-588)4138368-0 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4021842-9 (DE-588)4196735-5 (DE-588)4031824-2 (DE-588)4138368-0 (DE-588)4001183-5 (DE-588)1071861417
title	Computing and combinatorics 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings
title_auth	Computing and combinatorics 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings
title_exact_search	Computing and combinatorics 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings
title_full	Computing and combinatorics 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings Ding-Zhu Du ... (eds.)
title_fullStr	Computing and combinatorics 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings Ding-Zhu Du ... (eds.)
title_full_unstemmed	Computing and combinatorics 19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings Ding-Zhu Du ... (eds.)
title_short	Computing and combinatorics
title_sort	computing and combinatorics 19th international conference cocoon 2013 hangzhou china june 21 23 2013 proceedings
title_sub	19th international conference, COCOON 2013, Hangzhou, China, June 21 - 23, 2013 ; proceedings
topic	Graph (DE-588)4021842-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd Kombinatorik (DE-588)4031824-2 gnd Berechenbarkeit (DE-588)4138368-0 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Graph Theoretische Informatik Kombinatorik Berechenbarkeit Algorithmus Konferenzschrift 2013 Hangzhou
url	http://deposit.dnb.de/cgi-bin/dokserv?id=4327699&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=026080583&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT dudingzhu computingandcombinatorics19thinternationalconferencecocoon2013hangzhouchinajune21232013proceedings AT cocoonhangzhou computingandcombinatorics19thinternationalconferencecocoon2013hangzhouchinajune21232013proceedings

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Description

MARC

Record in the Search Index

There is no print copy available.

Similar Items