Algorithms and computation: 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2009
|
| Schriftenreihe: | Lecture notes in computer science
5878 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XIX, 1228 S. graph. Darst. 24 cm |
| ISBN: | 9783642106309 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035853399 | ||
| 003 | DE-604 | ||
| 005 | 20100915 | ||
| 007 | t| | ||
| 008 | 091201s2009 xx d||| |||| 10||| eng d | ||
| 015 | |a 09,N46,0007 |2 dnb | ||
| 016 | 7 | |a 997727160 |2 DE-101 | |
| 020 | |a 9783642106309 |c kart. : EUR 135.89 (freier Pr.), sfr 197.50 (freier Pr.) |9 978-3-642-10630-9 | ||
| 024 | 3 | |a 9783642106309 | |
| 028 | 5 | 2 | |a 12805785 |
| 035 | |a (OCoLC)471802611 | ||
| 035 | |a (DE-599)DNB997727160 | ||
| 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.A43 | |
| 082 | 0 | |a 004 | |
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Algorithms and computation |b 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings |c Yingfei Dong ... (ed.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2009 | |
| 300 | |a XIX, 1228 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 5878 | |
| 500 | |a Literaturangaben | ||
| 650 | 4 | |a Algorithmische Geometrie - Kongress - Honolulu <Hawaii, 2009> | |
| 650 | 4 | |a Algorithmus - Kongress - Honolulu <Hawaii, 2009> | |
| 650 | 4 | |a Graphenzeichnen - Kongress - Honolulu <Hawaii, 2009> | |
| 650 | 4 | |a Kombinatorische Optimierung - Kongress - Honolulu <Hawaii, 2009> | |
| 650 | 4 | |a Komplexitätstheorie - Kongress - Honolulu <Hawaii, 2009> | |
| 650 | 4 | |a Computer algorithms |v Congresses | |
| 650 | 4 | |a Numerical calculations |v Congresses | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |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 Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2009 |z Honolulu Hawaii |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 Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 4 | |5 DE-604 | |
| 700 | 1 | |a Dong, Yingfei |e Sonstige |0 (DE-588)139929509 |4 oth | |
| 711 | 2 | |a ISAAC |n 20 |d 2009 |c Honolulu, Hawaii |j Sonstige |0 (DE-588)16048723-7 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 5878 |w (DE-604)BV000000607 |9 5878 | |
| 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=018711412&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-018711412 | |
Datensatz im Suchindex
| _version_ | 1820875192751095808 |
|---|---|
| adam_text |
TABLE OF CONTENTS BUBBLESORT AND JUGGLING SEQUENCES 1 RONALD L. GRAHAM A
PROOF OF THE MOLECULAR CONJECTURE 2 NAOKI KATOH EXACT ALGORITHMS FOR
DOMINATING CLIQUE PROBLEMS (EXTENDED ABSTRACT) 4 N. BOURGEOIS, F. DELLA
CROCE, B. ESCOFFIER, AND V.TH. PASCHOS ENUMERATING STEREOISOMERS OF TREE
STRUCTURED MOLECULES USING DYNAMIC PROGRAMMING 14 TOMOKI IMADA, SHUNSUKE
OTA, HIROSHI NAGAMOCHI, AND TATSUYA AKUTSU EXACT ALGORITHMS FOR THE
BOTTLENECK STEINER TREE PROBLEM (EXTENDED ABSTRACT) 24 SANG WON ***,
SUNGHEE CHOI, CHUNSEOK LEE, AND SHIN-ICHI TANIGAWA EXACT ALGORITHMS FOR
SET MULTICOVER AND MULTISET MULTICOVER PROBLEMS 34 QIANG-SHENG HUA,
DONGXIAO YU, FRANCIS CM. LAU, AND YUEXUAN WANG PRACTICAL DISCRETE UNIT
DISK COVER USING AN EXACT LINE-SEPARABLE ALGORITHM 45 FRANCISCO CLAUDE,
REZA DORRIGIV, STEPHANE DUROCHER, ROBERT FRASER, ALEJANDRO LOPEZ-ORTIZ,
AND ALEJANDRO SALINGER DIVIDE-AND-CONQUER ALGORITHMS FOR PARTITIONING
HYPERGRAPHS AND SUBMODULAR SYSTEMS 55 KAZUMASA OKUMOTO, TAKURO FUKUNAGA,
AND HIROSHI NAGAMOCHI ON PROTEIN STRUCTURE ALIGNMENT UNDER DISTANCE
CONSTRAINT 65 SHUAI CHENG LI AND YEN KAOW NG A STRUCTURAL LEMMA IN
2-DIMENSIONAL PACKING, AND ITS IMPLICATIONS ON APPROXIMABILIT
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/997727160 DIGITALISIERT
DURCH XII TABLE OF CONTENTS FRECHET DISTANCE PROBLEMS IN WEIGHTED
REGIONS 97 YAM KI CHEUNG AND OVIDIU DAESCU THE COMPLEXITY OF SOLVING
STOCHASTIC GAMES ON GRAPHS 112 DANIEL ANDERSSON AND PETER BRO MILTERSEN
COMPUTATIONAL COMPLEXITY OF CAST PUZZLES 122 CHUZO IWAMOTO, KENTO
SASAKI, KENJI NISHIO, AND KENICHI MORITA NEW BOUNDS ON THE AVERAGE
DISTANCE FROM THE FERMAT-WEBER CENTER OF A PLANAR CONVEX BODY 132 ADRIAN
DUMITRESCU AND CSABA D. TOTH RECONSTRUCTING NUMBERS FROM PAIRWISE
FUNCTION VALUES 142 SHITENG CHEN, ZHIYI HUANG, AND SAMPATH KANNAN
HUBERT'S THIRTEENTH PROBLEM AND CIRCUIT COMPLEXITY 153 KRISTOFFER
ARNSFELT HANSEN, ODED LACHISH, AND PETER BRO MILTERSEN INTERVAL STABBING
PROBLEMS IN SMALL INTEGER RANGES 163 JENS M. SCHMIDT ONLINE SORTED RANGE
REPORTING 173 GERTH ST0LTING BRODAL, ROLF FAGERBERG, MARK GREVE, AND
ALEJANDRO LOPEZ-ORTIZ DATA STRUCTURES FOR APPROXIMATE ORTHOGONAL RANGE
COUNTING 183 YAKOV NEKRICH DYNAMIC 3-SIDED PLANAR RANGE QUERIES WITH
EXPECTED DOUBLY LOGARITHMIC TIME 193 GERTH ST0LTING BRODAI, ALEXIS C.
KAPORIS, SPYROS SIOUTAS, KONSTANTINOS TSAKALIDIS, AND KOSTAS TSICHLAS
UNTANGLED MONOTONIE CHAINS AND ADAPTIVE RANGE SEARCH 203 DIEGO
ARROYUELO, FRANCISCO CLAUDE, REZA DORRIGIV, STEPHANE TABLE OF CONTENTS
XIII COMPUTING THE MAP OF GEOMETRIC MINIMAL CUTS 244 JINHUI XU, LEI XU,
AND EVANTHIA PAPADOPOULOU ON THE CAMERA PLACEMENT PROBLEM 255 RUDOLF
FLEISCHER AND YIHUI WANG GRAPH ORIENTATIONS WITH SET CONNECTIVITY
REQUIREMENTS 265 TAKURO FUKUNAGA A LINEAR VERTEX KERNEL FOR MAXIMUM
INTERNAL SPANNING TREE 275 FEDOR V. FOMIN, SERGE GASPERS, SAKET SAURABH,
AND STEPHAN THOMASSE GEOMETRIC MINIMUM DIAMETER MINIMUM COST SPANNING
TREE PROBLEM 283 DAE YOUNG SEO, D.T. LEE, AND TIEN-CHING LIN ON SHORTEST
DISJOINT PATHS IN PLANAR GRAPHS 293 YUSUKE KOBAYASHI AND CHRISTIAN
SOMMER AN OPTIMAL LABELING FOR NODE CONNECTIVITY 303 TAI-HSIN HSU AND
HSUEH-I LU SOFA: STRATEGYPROOF ONLINE FREQUENCY ALLOCATION FOR MULTIHOP
WIRELESS NETWORKS 311 PING XU AND XIANG- YANG LI 1-BOUNDED SPACE
ALGORITHMS FOR 2-DIMENSIONAL BIN PACKING 321 FRANCIS Y.L. CHIN,
HING-FUNG TING, AND YONG ZHANG ON THE ADVICE COMPLEXITY OF ONLINE
PROBLEMS (EXTENDED ABSTRACT). 331 HANS-JOACHIM BOECKENHAUER, DENNIS
KOMM, RASTISLAV KRDLOVIC, RICHARD KRALOVIC, AND TOBIAS MOEMKE ONLINE
KNAPSACK PROBLEMS WITH LIMITED CUTS 341 XIN HAN AND KAZUHISA MAKINO
ONLINE PAGING FOR FLASH MEMORY DEVICES 352 ANNAMARIA XIV TABLE OF
CONTENTS MINIMUM COVERING WITH TRAVEL COST 393 SANDOR P. FEKETE, JOSEPH
S.B. MITCHELL, AND CHRISTIANE SCHMIDT ROUTE-ENABLING GRAPH ORIENTATION
PROBLEMS 403 TAKEHIRO ITO, YUICHIRO MIYAMOTO, HIROTAKA ONO, HISAO
TAMAKI, AND RYUHEI UEHARA COMPLEXITY OF APPROXIMATING THE VERTEX
CENTROID OF A POLYHEDRON 413 KHALED ELBASSIONI AND HANS RAJ TIWARY
POPULAR MATCHINGS WITH VARIABLE JOB CAPACITIES 423 TELIKEPALLI KAVITHA
AND MEGHANA NASRE ON THE TIGHTNESS OF THE BUHRMAN-CLEVE-WIGDERSON
SIMULATION 434 SHENGYU ZHANG BOUNDS ON CONTENTION MANAGEMENT ALGORITHMS
441 JOHANNES SCHNEIDER AND ROGER WATTENHOFER ALGORITHMIC FOLDING
COMPLEXITY 452 JEAN CARDINAL, ERIK D. DEMAINE, MARTIN L. DEMAINE, SHINJI
IMAHORI, STEFAN LANGERMAN, AND RYUHEI UEHARA MIN-ENERGY SCHEDULING FOR
ALIGNED JOBS IN ACCELERATE MODEL 462 WEIWEI WU, MINMING LI, AND ENHONG
CHEN POSI-MODULAR SYSTEMS WITH MODULOTONE REQUIREMENTS UNDER PERMUTATION
CONSTRAINTS 473 TOSHIMASA ISHII AND KAZUHISA MAKINO GENERALIZED
REDUCTION TO COMPUTE TORIC IDEALS 483 DEEPANJAN KESH AND SHASHANK K.
MEHTA LINEAR AND SUBLINEAR TIME ALGORITHMS FOR BASIS OF ABELIAN GROUPS
. 493 LI CHEN AND BIN FU GOOD PROGRAMMING IN TRANSACTIONAL MEMORY
GAME THEORY MEETS MULTICOR TABLE OF CONTENTS XV PARAMETERIZED COMPLEXITY
OF ARC-WEIGHTED DIRECTED STEINER PROBLEMS 544 JIONG GUO, ROLF
NIEDERMEIER, AND ONDFEJ SUCHY WORST CASE ANALYSIS FOR PICKUP AND
DELIVERY PROBLEMS WITH CONSECUTIVE PICKUPS AND DELIVERIES 554 YOSHITAKA
NAKAO AND HIROSHI NAGAMOCHI MINIMUM CYCLE BASES OF WEIGHTED OUTERPLANAR
GRAPHS 564 TSUNG-HAO LIU AND HSUEH-I. LU BANDWIDTH ON AT-FREE GRAPHS 573
PETR GOLOVACH, PINAR HEGGERNES, DIETER KRATSCH, DANIEL LOKSHTANOV,
DANIEL MEISTER, AND SAKET SAURABH EDITING GRAPHS INTO DISJOINT UNIONS OF
DENSE CLUSTERS 583 JIONG GUO, IYAD A. KANJ, CHRISTIAN KOMUSIEWICZ, AND
JOHANNES UHLMANN A CERTIFYING ALGORITHM FOR 3-COLORABILITY OF P 5 -FREE
GRAPHS 594 DANIEL BRUCE, CHINH T. HOANG, AND JOE SAWADA PARAMETERIZING
CUT SETS IN A GRAPH BY THE NUMBER OF THEIR COMPONENTS 605 TAKEHIRO ITO,
MARCIN KAMINSKI, DANIEL PAULUSMA, AND DIMITRIOS M. THILIKOS
INAPPROXIMABILITY OF MAXIMAL STRIP RECOVERY 616 MINGHUI JIANG THE
COMPLEXITY OF PERFECT MATCHING PROBLEMS ON DENSE HYPERGRAPHS 626 MAREK
KARPINSKI, ANDRZEJ RUCINSKI, AND EDYTA SZYMANSKA ON LOWER BOUNDS FOR
CONSTANT WIDTH ARITHMETIC CIRCUITS 637 V. ARVIND, PUSHKAR S. JOGLEKAR,
AND SRIKANTH SRINIVASAN SPENDIN XVI TABLE OF CONTENTS AN IMPROVED
APPROXIMATION ALGORITHM FOR THE TRAVELING TOURNAMENT PROBLEM 679 DAISUKE
YAMAGUCHI, SHINJI IMAHORI, RYUHEI MIYASHIRO, AND TOMOMI MATSUI THE
FAULT-TOLERANT FACILITY ALLOCATION PROBLEM 689 SHIHONG XU AND HONG SHEN
TIGHTER APPROXIMATION BOUNDS FOR MINIMUM CDS IN WIRELESS AD HOC NETWORKS
699 MINMING LI, PENG-JUN WAN, AND FRANCES YAO MAXIMAL STRIP RECOVERY
PROBLEM WITH GAPS: HARDNESS AND APPROXIMATION ALGORITHMS 710 LAURENT
BULTEAU, GUILLAUME FERTIN, AND IRENA RUSU THE DIRECTED HAUSDORFF
DISTANCE BETWEEN IMPRECISE POINT SETS 720 CHRISTIAN KNAUER, MAARTEN
LOEFFLER, MARC SCHERFENBERG, AND THOMAS WOLLE COMPUTING MULTIDIMENSIONAL
PERSISTENCE 730 GUNNAR CARLSSON, GURJEET SINGH, AND AFRA ZOMORODIAN
LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS 740 DANNY Z. CHEN AND
HAITAO WANG FINDING FULLERENE PATCHES IN POLYNOMIAL TIME 750 PAUL BONSMA
AND FELIX BREUER CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS
ON O(N 2 ) GRIDS 760 XIAO ZHOU AND TAKAO NISHIZEKI A SELF-STABILIZING
AND LOCAL DELAUNAY GRAPH CONSTRUCTION 771 RIKO JACOB, STEPHAN RITSCHER,
CHRISTIAN SCHEIDELER, AND STEFAN SCHMID SUCCINCT GREEDY GEOMETRIC
ROUTING IN THE EUCLIDEAN PLANE 781 MICHAEL TABLE OF CONTENTS XVII DATA
STRUCTURES FOR RANGE MEDIAN QUERIES 822 GERTH ST0LTING BRODAL AND ALLAN
GR0NLUND J0RGENSEN DELETION WITHOUT REBALANCING IN MULTIWAY SEARCH TREES
832 SIDDHARTHA SEN AND ROBERT E. TARJAN COUNTING IN THE PRESENCE OF
MEMORY FAULTS 842 GERTH ST0LTING BRODAI, ALLAN GR0NLUND J0RGENSEN,
GABRIEL MORUZ, AND THOMAS M0LHAVE A SIMPLE, FAST, AND COMPACT STATIC
DICTIONARY 852 SCOTT SCHNEIDER AND MICHAEL SPERTUS RECONSTRUCTING
POLYGONS FROM SCANNER DATA 862 THERESE BIEDL, STEPHANE DUROCHER, AND
JACK SNOEYINK COMPUTING LARGE MATCHINGS IN PLANAR GRAPHS WITH FIXED
MINIMUM DEGREE 872 ROBERT FRANKE, IGNAZ RUTTER, AND DOROTHEA WAGNER
CROSSING-FREE ACYCLIC HAMILTONIAN PATH COMPLETION FOR PLANAR SI-DIGRAPHS
882 TAMARA MCHEDLIDZE AND ANTONIOS SYMVONIS COVERING A GRAPH WITH A
CONSTRAINED FOREST (EXTENDED ABSTRACT) 892 CRISTINA BAZGAN, BASILE
COUETOUX, AND ZSOLT TUZA TRI-EDGE-CONNECTIVITY AUGMENTATION FOR PLANAR
STRAIGHT LINE GRAPHS 902 MARWAN AL-JUBEH, MASHHOOD ISHAQUE, KRISTOF
REDEI, DIANE L. SOUVAINE, AND CSABA D. TOTH UPWARD STAR-SHAPED
POLYHEDRAL GRAPHS 913 SEOK-HEE HONG AND HIROSHI NAGAMOCHI CONDITIONAL
HARDNESS OF APPROXIMATING SATISFIABLE MAX 3CSP- 7 923 LINQING TANG TH
XVIII TABLE OF CONTENTS LOWER BOUNDS ON FAST SEARCHING 964 DONALD
STANLEY AND BOTING YANG APPROXIMATION ALGORITHMS FOR THE FIREFIGHTER
PROBLEM: CUTS OVER TIME AND SUBMODULARITY 974 ELLIOT ANSHELEVICH,
DEEPARNAB CHAKRABARTY, AMEYA HATE, AND CHAITANYA SWAMY CONSTANT-FACTOR
APPROXIMATIONS OF BRANCH-DECOMPOSITION AND LARGEST GRID MINOR OF PLANAR
GRAPHS IN O(N 1+* ) TIME 984 QIAN-PING GU AND HISAO TAMAKI PTAS FOR
FC-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OIK 994
ANNA ADAMASZEK, ARTUR CZUMAJ, AND ANDRZEJ LINGAS OPTIMAL RANDOMIZED
ALGORITHM FOR THE DENSITY SELECTION PROBLEM 1004 TIEN-CHING LIN AND D.T.
LEE NEW RESULTS ON SIMPLE STOCHASTIC GAMES 1014 DECHENG DAI AND RONG GE
WORST-CASE AND SMOOTHED ANALYSIS OF &-MEANS CLUSTERING WITH BREGMAN
DIVERGENCES 1024 BODO MANTHEY AND HEIKO ROEGLIN SUCCINCT INDEX FOR
DYNAMIC DICTIONARY MATCHING 1034 WING-KAI HON, TAK- WAH LAM, RAHUL SHAH,
SIU-LUNG TARN, AND JEFFREY SCOTT VITTER RANGE NON-OVERLAPPING INDEXING
1044 HAGAI COHEN AND ELY PORAT QUERYING TWO BOUNDARY POINTS FOR SHORTEST
PATHS IN A POLYGONAL DOMAIN (EXTENDED ABSTRACT) 1054 SANG TABLE OF
CONTENTS XIX RANDOM GENERATION AND ENUMERATION OF BIPARTITE PERMUTATION
GRAPHS 1104 TOSHIKI SAITOH, YOTA OTACHI, KATSUHISA YAMANAKA, AND RYUHEI
UEHARA A COMBINATORIAL ALGORITHM FOR HORN PROGRAMS 1114 R.
CHANDRASEKARAN AND K. SUBRAMANI ONLINE MAXIMUM DIRECTED CUT 1124 AMOTZ
BAR-NOY AND MICHAEL LAMPIS MAINTAINING NETS AND NET TREES UNDER
INCREMENTAL MOTION 1134 MINKYOUNG CHO, DAVID M. MOUNT, AND EUNHUI PARK
DISTRIBUTED SCHEDULING OF PARALLEL HYBRID COMPUTATIONS 1144 SHIVALI
AGARWAL, ANKUR NARANG, AND RUDRAPATNA K. SHYAMASUNDAR I/O-EFFICIENT
CONTOUR TREE SIMPLIFICATION 1155 LARS ARGE AND MORTEN REVSB*K ALGORITHMS
FOR COMPUTING THE MAXIMUM WEIGHT REGION DECOMPOSABLE INTO ELEMENTARY
SHAPES 1166 JINHEE CHUN, RYOSEI KASAI, MATIAS KORMAN, AND TAKESHI
TOKUYAMA I/O AND SPACE-EFFICIENT PATH TRAVERSAL IN PLANAR GRAPHS 1175
CRAIG DILLABAUGH, MENG HE, ANIL MAHESHWARI, AND NORBERT ZEH IMPROVED
ALGORITHMS FOR FINDING CONSISTENT SUPERSTRINGS BASED ON A NEW GRAPH
MODEL 1185 JIN WOOK KIM, SIWON CHOI, JOONG CHAE NA, AND JEONG SEOP SIM
TWO-VERTEX CONNECTIVITY AUGMENTATIONS FOR GRAPHS WITH A PARTITION
CONSTRAINT (EXTENDED ABSTRACT) 1195 PEI-CHI HUANG, HSIN-WEN WEI,
YEN-CHIU CHEN, MING-YANG KAO, WEI-KUAN SHIH, AND TSAN-SHENG HSU COMPUTIN |
| any_adam_object | 1 |
| author_GND | (DE-588)139929509 |
| building | Verbundindex |
| bvnumber | BV035853399 |
| 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 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)471802611 (DE-599)DNB997727160 |
| dewey-full | 004 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004 |
| dewey-search | 004 |
| dewey-sort | 14 |
| 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">BV035853399</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100915</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">091201s2009 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09,N46,0007</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">997727160</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642106309</subfield><subfield code="c">kart. : EUR 135.89 (freier Pr.), sfr 197.50 (freier Pr.)</subfield><subfield code="9">978-3-642-10630-9</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642106309</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12805785</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)471802611</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB997727160</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.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</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">20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings</subfield><subfield code="c">Yingfei Dong ... (ed.)</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">XIX, 1228 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">5878</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 - Honolulu <Hawaii, 2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmus - Kongress - Honolulu <Hawaii, 2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphenzeichnen - Kongress - Honolulu <Hawaii, 2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Kombinatorische Optimierung - Kongress - Honolulu <Hawaii, 2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Komplexitätstheorie - Kongress - Honolulu <Hawaii, 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">Numerical calculations</subfield><subfield code="v">Congresses</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">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</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">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">Honolulu Hawaii</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">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-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">Dong, Yingfei</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)139929509</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ISAAC</subfield><subfield code="n">20</subfield><subfield code="d">2009</subfield><subfield code="c">Honolulu, Hawaii</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16048723-7</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">5878</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">5878</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=018711412&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-018711412</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2009 Honolulu Hawaii gnd-content |
| genre_facet | Konferenzschrift 2009 Honolulu Hawaii |
| id | DE-604.BV035853399 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:11:44Z |
| institution | BVB |
| institution_GND | (DE-588)16048723-7 |
| isbn | 9783642106309 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018711412 |
| oclc_num | 471802611 |
| 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 | XIX, 1228 S. graph. Darst. 24 cm |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Algorithms and computation 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings Yingfei Dong ... (ed.) Berlin [u.a.] Springer 2009 XIX, 1228 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 5878 Literaturangaben Algorithmische Geometrie - Kongress - Honolulu <Hawaii, 2009> Algorithmus - Kongress - Honolulu <Hawaii, 2009> Graphenzeichnen - Kongress - Honolulu <Hawaii, 2009> Kombinatorische Optimierung - Kongress - Honolulu <Hawaii, 2009> Komplexitätstheorie - Kongress - Honolulu <Hawaii, 2009> Computer algorithms Congresses Numerical calculations Congresses Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2009 Honolulu Hawaii gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Algorithmische Geometrie (DE-588)4130267-9 s Graphenzeichnen (DE-588)4706480-8 s Kombinatorische Optimierung (DE-588)4031826-6 s Komplexitätstheorie (DE-588)4120591-1 s Dong, Yingfei Sonstige (DE-588)139929509 oth ISAAC 20 2009 Honolulu, Hawaii Sonstige (DE-588)16048723-7 oth Lecture notes in computer science 5878 (DE-604)BV000000607 5878 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018711412&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Algorithms and computation 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings Lecture notes in computer science Algorithmische Geometrie - Kongress - Honolulu <Hawaii, 2009> Algorithmus - Kongress - Honolulu <Hawaii, 2009> Graphenzeichnen - Kongress - Honolulu <Hawaii, 2009> Kombinatorische Optimierung - Kongress - Honolulu <Hawaii, 2009> Komplexitätstheorie - Kongress - Honolulu <Hawaii, 2009> Computer algorithms Congresses Numerical calculations Congresses Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4031826-6 (DE-588)4130267-9 (DE-588)4706480-8 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithms and computation 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings |
| title_auth | Algorithms and computation 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings |
| title_exact_search | Algorithms and computation 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings |
| title_full | Algorithms and computation 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings Yingfei Dong ... (ed.) |
| title_fullStr | Algorithms and computation 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings Yingfei Dong ... (ed.) |
| title_full_unstemmed | Algorithms and computation 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings Yingfei Dong ... (ed.) |
| title_short | Algorithms and computation |
| title_sort | algorithms and computation 20th international symposium isaac 2009 honolulu hawaii usa december 16 18 2009 proceedings |
| title_sub | 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16 - 18, 2009 ; proceedings |
| topic | Algorithmische Geometrie - Kongress - Honolulu <Hawaii, 2009> Algorithmus - Kongress - Honolulu <Hawaii, 2009> Graphenzeichnen - Kongress - Honolulu <Hawaii, 2009> Kombinatorische Optimierung - Kongress - Honolulu <Hawaii, 2009> Komplexitätstheorie - Kongress - Honolulu <Hawaii, 2009> Computer algorithms Congresses Numerical calculations Congresses Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmische Geometrie - Kongress - Honolulu <Hawaii, 2009> Algorithmus - Kongress - Honolulu <Hawaii, 2009> Graphenzeichnen - Kongress - Honolulu <Hawaii, 2009> Kombinatorische Optimierung - Kongress - Honolulu <Hawaii, 2009> Komplexitätstheorie - Kongress - Honolulu <Hawaii, 2009> Computer algorithms Congresses Numerical calculations Congresses Komplexitätstheorie Kombinatorische Optimierung Algorithmische Geometrie Graphenzeichnen Algorithmus Konferenzschrift 2009 Honolulu Hawaii |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018711412&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT dongyingfei algorithmsandcomputation20thinternationalsymposiumisaac2009honoluluhawaiiusadecember16182009proceedings AT isaachonoluluhawaii algorithmsandcomputation20thinternationalsymposiumisaac2009honoluluhawaiiusadecember16182009proceedings |