Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15–17, 2014. Proceedings. (English) Zbl 1318.68007

Ahn, Hee-Kap (ed.); Shin, Chan-Su (ed.)

Lecture Notes in Computer Science 8889. Cham: Springer (ISBN 978-3-319-13074-3/pbk; 978-3-319-13075-0/ebook). xxii, 781 p. (2014).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding symposium see [Zbl 1277.68005].
Indexed articles:
Wang, Haitao; Zhang, Jingru, Line-constrained \(k\)-median, \(k\)-means, and \(k\)-center problems in the plane, 3-14 [Zbl 1432.68529]
Aichholzer, Oswin; Cardinal, Jean; Kusters, Vincent; Langerman, Stefan; Valtr, Pavel, Reconstructing point set order types from radial orderings, 15-26 [Zbl 1372.68246]
Bohler, Cecilia; Liu, Chih-Hung; Papadopoulou, Evanthia; Zavershynskyi, Maksym, A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams, 27-37 [Zbl 1432.68492]
Fong, Ken; Li, Minming; Liang, Hongyu; Yang, Linji; Yuan, Hao, Average-case complexity of the min-sum matrix product problem, 41-52 [Zbl 1433.68170]
Gąsieniec, Leszek; Levcopoulos, Christos; Lingas, Andrzej, Efficiently correcting matrix products, 53-64 [Zbl 1370.68336]
Floderus, Peter; Jansson, Jesper; Levcopoulos, Christos; Lingas, Andrzej; Sledneu, Dzmitry, 3D rectangulations and geometric matrix multiplication, 65-78 [Zbl 1386.68194]
Droschinsky, Andre; Heinemann, Bernhard; Kriege, Nils; Mutzel, Petra, Enumeration of maximum common subtree isomorphisms with polynomial-delay, 81-93 [Zbl 1435.05105]
Wasa, Kunihiro; Arimura, Hiroki; Uno, Takeaki, Efficient enumeration of induced subtrees in a K-degenerate graph, 94-102 [Zbl 1435.05109]
Inoue, Yuma; Minato, Shin-ichi, An efficient method for indexing all topological orders of a directed graph, 103-114 [Zbl 1435.05094]
Biedl, Therese; Huber, Stefan; Palfrader, Peter, Planar matchings for weighted straight skeletons, 117-127 [Zbl 1407.68503]
He, Meng; Tang, Ganggui; Zeh, Norbert, Orienting dynamic graphs, with applications to maximal matchings and adjacency queries, 128-140 [Zbl 1412.68169]
Dahlgaard, Søren; Knudsen, Mathias Bæk Tejs; Rotbart, Noy, Dynamic and multi-functional labeling schemes, 141-153 [Zbl 1435.05172]
Policriti, Alberto; Prezza, Nicola, Hashing and indexing: succinct data structures and smoothed analysis, 157-168 [Zbl 1432.68101]
Munro, J. Ian; Navarro, Gonzalo; Nielsen, Jesper Sindahl; Shah, Rahul; Thankachan, Sharma V., Top-\(k\) term-proximity in succinct space, 169-180 [Zbl 1366.68039]
Bose, Presenjit; Douïeb, Karim; Iacono, John; Langerman, Stefan, The power and limitations of static binary search trees with lazy finger, 181-192 [Zbl 1351.68082]
Ito, Takehiro; Kakimura, Naonori; Kamiyama, Naoyuki; Kobayashi, Yusuke; Okamoto, Yoshio, Minimum-cost \(b\)-edge dominating sets on trees, 195-207 [Zbl 1432.68181]
Ito, Takehiro; Kamiński, Marcin; Ono, Hirotaka, Fixed-parameter tractability of token jumping on planar graphs, 208-219 [Zbl 1432.68195]
Crochemore, Maxime; Iliopoulos, Costas S.; Kociumaka, Tomasz; Radoszewski, Jakub; Rytter, Wojciech; Waleń, Tomasz, Covering problems for partial words and for indeterminate strings, 220-232 [Zbl 1380.68467]
Gavruskin, Alexander; Khoussainov, Bakhadyr; Kokho, Mikhail; Liu, Jiamou, Dynamic interval scheduling for multiple machines, 235-246 [Zbl 1351.90094]
Angel, Eric; Bampis, Evripidis; Chau, Vincent; Nguyen Kim Thang, Throughput maximization in multiprocessor speed-scaling, 247-258 [Zbl 1433.68063]
Bampis, Evripidis; Letsios, Dimitrios; Lucarelli, Giorgio, Speed-scaling with no preemptions, 259-269 [Zbl 1433.68064]
Kane, Daniel M.; Watanabe, Osamu, A short implicant of a CNF formula with many satisfying assignments, 273-284 [Zbl 1351.68118]
Drange, Pål Grønås; Dregi, Markus Sortland; van’t Hof, Pim, On the computational complexity of vertex integrity and component order connectivity, 285-297 [Zbl 1352.68103]
Bulteau, Laurent; Froese, Vincent; Hartung, Sepp; Niedermeier, Rolf, Co-clustering under the maximum norm, 298-309 [Zbl 1432.68171]
Bose, Prosenjit; Morin, Pat; van Renssen, André, The price of order, 313-325 [Zbl 1435.05191]
Li, Jian; Wang, Haitao, Range queries on uncertain data, 326-337 [Zbl 1432.68096]
Suri, Subhash; Verbeek, Kevin, On the most likely Voronoi diagram and nearest neighbor searching, 338-350 [Zbl 1391.68117]
Tong, Weitian; Lin, Guohui, An improved approximation algorithm for the minimum common integer partition problem, 353-364 [Zbl 1432.68585]
Matsui, Tomomi; Kohira, Yukihide; Kodama, Chikaaki; Takahashi, Atsushi, Positive semidefinite relaxation and approximation algorithm for triple patterning lithography, 365-375 [Zbl 1432.68581]
Ando, Ei; Kijima, Shuji, An FPTAS for the volume computationof 0-1 knapsack polytopes based on approximate convolution integral, 376-386 [Zbl 1352.68287]
Demaine, Erik D.; Demaine, Martin L.; Fox-Epstein, Eli; Hoang, Duc A.; Ito, Takehiro; Ono, Hirotaka; Otachi, Yota; Uehara, Ryuhei; Yamada, Takeshi, Polynomial-time algorithm for sliding tokens on trees, 389-400 [Zbl 1435.05189]
Klavík, Pavel; Saumell, Maria, Minimal obstructions for partial representations of interval graphs, 401-413 [Zbl 1435.05147]
Jansson, Jesper; Sung, Wing-Kin; Vu, Hoa; Yiu, Siu-Ming, Faster algorithms for computing the R* consensus tree, 414-425 [Zbl 1352.68280]
Xiao, Mingyu; Nagamochi, Hiroshi, Complexity and kernels for bipartition into degree-bounded induced graphs, 429-440 [Zbl 1432.68197]
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian, Faster existential FO model checking on posets, 441-451 [Zbl 1433.68216]
Mouawad, Amer E.; Nishimura, Naomi; Raman, Venkatesh, Vertex cover reconfiguration and beyond, 452-463 [Zbl 1432.68164]
Li, Xingfu; Zhu, Daming, Approximating the maximum internal spanning tree problem via a maximum path-cycle cover, 467-478 [Zbl 1432.68361]
Abu-Khzam, Faisal N.; Bazgan, Cristina; Chopin, Morgan; Fernau, Henning, Approximation algorithms inspired by kernelization methods, 479-490 [Zbl 1432.68565]
Jiang, Haitao; Feng, Haodi; Zhu, Daming, An 5/4-approximation algorithm for sorting permutations by short block moves, 491-503 [Zbl 1432.68578]
Gutowski, Grzegorz; Kozik, Jakub; Micek, Piotr; Zhu, Xuding, Lower bounds for on-line graph colorings, 507-515 [Zbl 1435.05141]
Micek, Piotr; Wiechert, Veit, An on-line competitive algorithm for coloring \(P_8\)-free bipartite graphs, 516-527 [Zbl 1359.05126]
Huang, Norman; Borodin, Allan, Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization, 528-539 [Zbl 1433.68620]
El-Zein, Hicham; Munro, J. Ian; Raman, Venkatesh, Tradeoff between label space and auxiliary space for representation of equivalence classes, 543-552 [Zbl 1433.68103]
Asano, Tetsuo; Izumi, Taisuke; Kiyomi, Masashi; Konagaya, Matsuo; Ono, Hirotaka; Otachi, Yota; Schweitzer, Pascal; Tarui, Jun; Uehara, Ryuhei, Depth-first search using \(O(n)\) bits, 553-564 [Zbl 1430.68172]
He, Meng; Munro, J. Ian; Zhou, Gelin, Dynamic path counting and reporting in linear space, 565-577 [Zbl 1432.68092]
Cheng, Zhanpeng; Eppstein, David, Linear-time algorithms for proportional apportionment, 581-592 [Zbl 1432.91065]
Ghosal, Pratik; Nasre, Meghana; Nimbhorkar, Prajakta, Rank-maximal matchings – structure and algorithms, 593-605 [Zbl 1435.05160]
Wu, Yen-Wei; Lin, Wei-Yin; Wang, Hung-Lung; Chao, Kun-Mao, The generalized popular condensation problem, 606-617 [Zbl 1435.91129]
Kolev, Pavel; Sun, He, Dirichlet eigenvalues, local random walks, and analyzing clusters in graphs, 621-632 [Zbl 1435.05186]
Da Lozzo, Giordano; Jelínek, Vít; Kratochvíl, Jan; Rutter, Ignaz, Planar embeddings with small and uniform faces, 633-645 [Zbl 1432.68347]
Domaniç, Nevzat Onur; Plaxton, C. Gregory, Scheduling unit jobs with a common deadline to minimize the sum of weighted completion times and rejection penalties, 646-657 [Zbl 1432.90053]
Sun, Xiaoming; Zhang, Jia; Zhang, Jialin, Solving multi-choice secretary problem in parallel: an optimal observation-selection protocol, 661-673 [Zbl 1433.91080]
Aurora, Pawan; Mehta, Shashank K., A geometric approach to graph isomorphism, 674-685 [Zbl 1435.05142]
Lehre, Per Kristian; Witt, Carsten, Concentrated hitting times of randomized search heuristics with variable drift, 686-697 [Zbl 1342.68309]
Gawrychowski, Paweł; Rusak, Damian, Euclidean TSP with few inner points in linear space, 701-713 [Zbl 1433.68494]
Henze, Matthias; Jaume, Rafel, Bottleneck partial-matching Voronoi diagrams and applications, 714-725 [Zbl 1405.68421]
Felsner, Stefan; Pilz, Alexander, Ham-sandwich cuts for abstract order types, 726-737 [Zbl 1386.68192]
Arulselvan, Ashwin; Groß, Martin; Skutella, Martin, Graph orientation and flows over time, 741-752 [Zbl 1435.90035]
Becker, Ruben; Karrenbauer, Andreas, A simple efficient interior point method for min-cost flow, 753-765 [Zbl 1435.90036]
Nasre, Meghana; Pontecorvi, Matteo; Ramachandran, Vijaya, Decremental all-pairs ALL shortest paths and betweenness centrality, 766-778 [Zbl 1435.05066]

MSC:

68-06	Proceedings, conferences, collections, etc. pertaining to computer science
68Wxx	Algorithms in computer science
00B25	Proceedings of conferences of miscellaneous specific interest