부산대학교 도서관

{\bf Papers in this collection include the following:}\tpar\{For the 26th Symposium see [MR3489533].\} \tparAmirali\Abdullah, Samira Daruki, Chitradeep Dutta Roy and Suresh\Venkatasubramanian, ``Streaming verification of graph properties'',\nbp{Art. No. 3, 14 pp.}. 3598382\tparFaisal Abu-Khzam, Cristina Bazgan, Katrin Casel and Henning\Fernau, ``Building clusters with lower-bounded sizes'', \nbp{Art. No.4, 13 pp.}. 3598383\tparAkanksha Agrawal, Fahad Panolan, Saket Saurabh and Meirav Zehavi,``Simultaneous feedback edge set: a parameterized perspective'',\nbp{Art. No. 5, 13 pp.}. 3598384\tparAkanksha Agrawal, Saket Saurabh, Roohani Sharma and Meirav Zehavi,``Kernels for deletion to classes of acyclic digraphs'', \nbp{Art. No.6, 12 pp.}. 3598385\tparPankaj K. Agarwal, Jiangwei Pan and Will Victor, ``An efficientalgorithm for placing electric vehicle charging stations'', \nbp{Art.No. 7, 12 pp.}. 3598386\tparUdit Agarwal and Vijaya Ramachandran, ``Finding $k$ simple shortestpaths and cycles'', \nbp{Art. No. 8, 12 pp.}. 3598387\tparOswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz,Günter Rote, André van Renssen, Marcel Roeloffzen and Birgit\Vogtenhuber, ``Packing short plane spanning trees in complete geometricgraphs'', \nbp{Art. No. 9, 12 pp.}. 3598388\tparHugo A. Akitaya and Csaba D. Tóth, ``Reconstruction of weaklysimple polygons from their edges'', \nbp{Art. No. 10, 13 pp.}. 3598389\tparHelmut Alt and Nadja Scharf, ``Approximating smallest containers forpacking three-dimensional convex objects'', \nbp{Art. No. 11, 14 pp.}.3598390\tparAmihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely\Porat and B. Riva Shalom, ``Mind the gap: essentially optimalalgorithms for online dictionary matching with one gap'', \nbp{Art. No.12, 12 pp.}. 3598391\tparPatrizio Angelini and Giordano Da Lozzo, ``Clustered planarity withpipes'', \nbp{Art. No. 13, 13 pp.}. 3598392\tparSang Won Bae, ``$L_1$ geodesic farthest neighbors in a simple polygonand related problems'', \nbp{Art. No. 14, 12 pp.}. 3598393\tparSayan Bandyapadhyay and Kasturi Varadarajan, ``Approximateclustering via metric partitioning'', \nbp{Art. No. 15, 13 pp.}. 3598394\tparSebastian Berndt and Maciej Liśkiewicz, ``Hard communicationchannels for steganography'', \nbp{Art. No. 16, 13 pp.}. 3598395\tparTherese Biedl and Saeed Mehrabi, ``On $r$-guarding thin orthogonalpolygons'', \nbp{Art. No. 17, 13 pp.}. 3598396\tparPhilip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik\Rye Skjoldjensen, Hjalte Wedel Vildhøj and Søren Vind,``Dynamic relative compression, dynamic partial sums, and substringconcatenation'', \nbp{Art. No. 18, 13 pp.}. 3598397\tparAhmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille,Anil Maheshwari and Michiel Smid, ``Towards plane spanners of degree3'', \nbp{Art. No. 19, 14 pp.}. 3598398\tparHans L. Bodlaender, Hirotaka Ono and Yota Otachi,``Degree-constrained orientation of maximum satisfaction: graph classesand parameterized complexity'', \nbp{Art. No. 20, 12 pp.}. 3598399\tparMartin Böhm, Marek Chrobak, Łukasz Jeż, Fei Li, Jiří\Sgall and Pavel Veselý, ``Online packet scheduling with boundeddelay and lookahead'', \nbp{Art. No. 21, 13 pp.}. 3598400\tparSankardeep Chakraborty, Venkatesh Raman and Srinivasa Rao Satti,``Biconnectivity, chain decomposition and $st$-numbering using $O(n)$bits'', \nbp{Art. No. 22, 13 pp.}. 3598401\tparT.-H. Hubert Chan, Zhihao Gavin Tang and Xiaowei Wu, ``On$(1,\epsilon)$-restricted max-min fair allocation problem'', \nbp{Art.No. 23, 13 pp.}. 3598402\tparTimothy M. Chan and Dimitrios Skrepetos, ``All-pairs shortest pathsin unit-disk graphs in slightly subquadratic time'', \nbp{Art. No. 24,13 pp.}. 3598403\tparDi Chen and Mordecai Golin, ``Sink evacuation on trees with dynamicconfluent flows'', \nbp{Art. No. 25, 13 pp.}. 3598404\tparLijie Chen, ``Adaptivity vs. postselection, and hardness amplificationfor polynomial approximation'', \nbp{Art. No. 26, 12 pp.}. 3598405\tparJurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny\Krizanc, Lata Narayanan, Jaroslav Opatrny and Sunil Shende,``Search on a line by Byzantine robots'', \nbp{Art. No. 27, 12 pp.}.3598406\tparNevzat Onur Domaniç, Chi-Kit Lam and C. Gregory Plaxton,``Bipartite matching with linear edge weights'', \nbp{Art. No. 28, 13pp.}. 3598407\tparHicham El-Zein, J. Ian Munro and Matthew Robertson, ``Raisingpermutations to powers in place'', \nbp{Art. No. 29, 12 pp.}. 3598408\tparAmr Elmasry and Frank Kammer, ``Space-efficient plane-sweepalgorithms'', \nbp{Art. No. 30, 13 pp.}. 3598409\tparMichael Etscheid and Matthias Mnich, ``Linear kernels andlinear-time algorithms for finding large cuts'', \nbp{Art. No. 31, 13pp.}. 3598410\tparSándor P. Fekete, Qian Li, Joseph S. B. Mitchell and Christian\Scheffer, ``Universal guard problems'', \nbp{Art. No. 32, 13 pp.}.3598411\tparAndreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich\and Laura Sanità, ``Fast approximation algorithms for thegeneralized survivable network design problem'', \nbp{Art. No. 33, 12pp.}. 3598412\tparArnab Ganguly, Wing-Kai Hon, Rahul Shah and Sharma V. Thankachan,``Space-time trade-offs for the shortest unique substring problem'',\nbp{Art. No. 34, 13 pp.}. 3598413\tparShahram Ghandeharizadeh, Sandy Irani and Jenny Lam, ``The subsetassignment problem for data placement in caches'', \nbp{Art. No. 35, 12pp.}. 3598414\tparLucy Ham, ``A gap trichotomy for Boolean constraint problems:extending Schaefer's theorem'', \nbp{Art. No. 36, 12 pp.}. 3598415\tparDuc A. Hoang and Ryuhei Uehara, ``Sliding tokens on a cactus'',\nbp{Art. No. 37, 26 pp.}. 3598416\tparDmitry Itsykson, Alexander Knop and Dmitry Sokolov, ``Complexity ofdistributions and average-case hardness'', \nbp{Art. No. 38, 12 pp.}.3598417\tparKai Jin, ``Computing the pattern waiting time: a revisit of theintuitive approach'', \nbp{Art. No. 39, 12 pp.}. 3598418\tparMong-Jen Kao, Hai-Lun Tu and D. T. Lee, ``$O(f)$ bi-approximationfor capacitated covering with hard capacities'', \nbp{Art. No. 40, 12pp.}. 3598419\tparYasushi Kawase and Kazuhisa Makino, ``Surrogate optimization for$p$-norms'', \nbp{Art. No. 41, 13 pp.}. 3598420\tparYasushi Kawase, Kazuhisa Makino and Kento Seimi, ``Optimalcomposition ordering problems for piecewise linear functions'',\nbp{Art. No. 42, 13 pp.}. 3598421\tparYasushi Kawase, Tomomi Matsui and Atsushi Miyauchi, ``Additiveapproximation algorithms for modularity maximization'', \nbp{Art. No.43, 13 pp.}. 3598422\tparYasushi Kawase and Atsushi Miyauchi, ``The densest subgraph problemwith a convex/concave size function'', \nbp{Art. No. 44, 12 pp.}.3598423\tparPavel Klavík, Yota Otachi and Jiří Šejnoha, ``On theclasses of interval graphs of limited nesting and count of lengths'',\nbp{Art. No. 45, 13 pp.}. 3598424\tparTomasz Kociumaka, Solon P. Pissis and Jakub Radoszewski, ``Patternmatching and consensus problems on weighted sequences and profiles'',\nbp{Art. No. 46, 12 pp.}. 3598425\tparSpyros Kontogiannis, Dorothea Wagner and Christos Zaroliagis,``Hierarchical time-dependent oracles'', \nbp{Art. No. 47, 13 pp.}.3598426\tparMarc van Kreveld, Maarten Löffler, Frank Staals and Lionov\Wiratma, ``A refined definition for groups of moving entities and itscomputation'', \nbp{Art. No. 48, 12 pp.}. 3598427\tparDenis Kurz and Petra Mutzel, ``A sidetrack-based algorithm forfinding the $k$ shortest simple paths in a directed graph'', \nbp{Art.No. 49, 13 pp.}. 3598428\tparHoang-Oanh Le and Van Bang Le, ``On the complexity of matching cutin graphs of fixed diameter'', \nbp{Art. No. 50, 12 pp.}. 3598429\tparQian Li, Xiaoming Sun and Jialin Zhang, ``On the optimality of tapemerge of two lists with similar size'', \nbp{Art. No. 51, 17 pp.}.3598430\tparShimin Li and Haitao Wang, ``Dispersing points on intervals'',\nbp{Art. No. 52, 12 pp.}. 3598431\tparFu-Hong Liu, Hsiang-Hsuan Liu and Prudence W. H. Wong, ``Optimalnonpreemptive scheduling in a smart grid model'', \nbp{Art. No. 53, 13pp.}. 3598432\tparYangwei Liu, Hu Ding, Ziyun Huang and Jinhui Xu, ``Distributed androbust support vector machine'', \nbp{Art. No. 54, 13 pp.}. 3598433\tparWenchang Luo, Yao Xu, Weitian Tong and Guohui Lin, ``Singlemachine scheduling with job-dependent machine deterioration'',\nbp{Art. No. 55, 13 pp.}. 3598434\tparChristopher S. Martin and Mohammad R. Salavatipour,``Approximation algorithms for capacitated $k$-travelling repairmenproblems'', \nbp{Art. No. 56, 12 pp.}. 3598435\tparSatoko Moriguchi, Kazuo Murota, Akihisa Tamura and Fabio Tardella,``Scaling and proximity properties of integrally convex functions'',\nbp{Art. No. 57, 13 pp.}. 3598436\tparEunjin Oh and Hee-Kap Ahn, ``Assigning weights to minimize thecovering radius in the plane'', \nbp{Art. No. 58, 12 pp.}. 3598437\tparEunjin Oh and Hee-Kap Ahn, ``A near-optimal algorithm for finding anoptimal shortcut of a tree'', \nbp{Art. No. 59, 12 pp.}. 3598438\tparChristian Scheffer and Jan Vahrenhold, ``Approximate shortestdistances among smooth obstacles in 3D'', \nbp{Art. No. 60, 13 pp.}.3598439\tparTe-Li Wang, Chih-Kuan Yeh and Ho-Lin Chen, ``An improved tax schemefor selfish routing'', \nbp{Art. No. 61, 12 pp.}. 3598440\tparMingyu Xiao and Hiroshi Nagamochi, ``A linear-time algorithm forintegral multiterminal flows in trees'', \nbp{Art. No. 62, 12 pp.}.3598441\tparYutaro Yamaguchi, ``Shortest disjoint $\Cal S$-paths via weightedlinear matroid parity'', \nbp{Art. No. 63, 13 pp.}. 3598442\tparHung-I Yu, Tien-Ching Lin and Der-Tsai Lee, ``The $(1|1)$-centroidproblem on the plane concerning distance constraints'', \nbp{Art. No.64, 12 pp.}. 3598443\tpar