×

zbMATH — the first resource for mathematics

Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15–17, 2010. Proceedings, Part I. (English) Zbl 1202.68002
Lecture Notes in Computer Science 6506. Berlin: Springer (ISBN 978-3-642-17516-9/pbk). xviii, 465 p. (2010).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1178.68008). For Part II of this symposium see Zbl 1202.68003.
Indexed articles:
Karpinski, Marek; Schudy, Warren, Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament, 3-14 [Zbl 1310.68272]
Berman, Piotr; Karpinski, Marek; Zelikovsky, Alexander, A 3/2-approximation algorithm for generalized Steiner trees in complete graphs with edge lengths 1 and 2, 15-24 [Zbl 1310.68234]
Amir, Amihood; Eisenberg, Estrella; Levy, Avivit, Approximate periodicity, 25-36 [Zbl 1310.68264]
Cheng, Siu-Wing; Knauer, Christian; Langerman, Stefan; Smid, Michiel, Approximating the average stretch factor of geometric graphs, 37-48 [Zbl 1310.68238]
Liang, Hongyu; He, Jing, Satisfiability with index dependency, 49-60 [Zbl 1310.68114]
Cheung, David W.; Mamoulis, Nikos; Wong, W. K.; Yiu, S. M.; Zhang, Ye, Anonymous fuzzy identity-based encryption for similarity search, 61-72 [Zbl 1311.94074]
Iwama, Kazuo; Seto, Kazuhisa; Takai, Tadashi; Tamaki, Suguru, Improved randomized algorithms for 3-SAT, 73-84 [Zbl 1310.68230]
Iwama, Kazuo; Nishimura, Harumichi; Raymond, Rudy; Teruyama, Junichi, Quantum counterfeit coin problems, 85-96 [Zbl 1310.68081]
Goodrich, Michael T.; Strash, Darren, Priority range trees, 97-108 [Zbl 1310.68067]
Bose, Prosenjit; Douïeb, Karim, Should static search trees ever be unbalanced?, 109-120 [Zbl 1310.68061]
Miyamoto, Yuichiro; Uno, Takeaki; Kubo, Mikio, Levelwise mesh sparsification for shortest path queries, 121-132 [Zbl 1310.68068]
Brodnik, Andrej; Iacono, John, Unit-time predecessor queries on massive data sets, 133-144 [Zbl 1310.68064]
Kavitha, Telikepalli; Nasre, Meghana; Nimbhorkar, Prajakta, Popularity at minimum cost, 145-156 [Zbl 1310.68091]
Jirásek, Jozef; Klavík, Pavel, Structural and complexity aspects of line systems of graphs, 157-168 [Zbl 1311.05191]
Shioura, Akiyoshi, Neighbor systems, jump systems, and bisubmodular polyhedra, 169-181 [Zbl 1311.90127]
Zhuang, Bingbing; Nagamochi, Hiroshi, Generating trees on multisets, 182-193 [Zbl 1311.05199]
Limouzy, Vincent, Seidel minor, permutation graphs and combinatorial properties, 194-205 [Zbl 1311.05169]
Jampani, Krishnam Raju; Lubiw, Anna, Simultaneous interval graphs, 206-217 [Zbl 1311.05132]
Li, Angsheng; Zhang, Peng, Unbalanced graph partitioning, 218-229 [Zbl 1310.68244]
Mertzios, George B.; Zaks, Shmuel, On the intersection of tolerance and cocomparability graphs, 230-240 [Zbl 1311.05195]
Chambers, Erin; Eppstein, David, Flows in one-crossing-minor-free graphs, 241-252 [Zbl 1311.05185]
Cai, Jin-Yi; Huang, Sangxia; Lu, Pinyan, From Holant to #CSP and back: dichotomy for Holant\(^{c }\) problems, 253-265 [Zbl 1310.68101]
Giesbrecht, Mark; Roche, Daniel S.; Tilak, Hrushikesh, Computing sparse multiples of polynomials, 266-278 [Zbl 1310.68107]
Duchier, Denys; Durand-Lose, Jérôme; Senot, Maxime, Fractal parallelism: solving SAT in bounded space and time, 279-290 [Zbl 1310.68075]
Férée, Hugo; Hainry, Emmanuel; Hoyrup, Mathieu; Péchoux, Romain, Interpretation of stream programs: characterizing type 2 polynomial time complexity, 291-303 [Zbl 1311.03068]
Amano, Kazuyuki, New upper bounds on the average PTF density of Boolean functions, 304-315 [Zbl 1310.68082]
Carmi, Paz; Smid, Michiel, An optimal algorithm for computing angle-constrained spanners, 316-327 [Zbl 1310.68200]
Xu, Jinhui; Xu, Lei; Xie, Yulai, Approximating minimum bending energy path in a simple corridor, 328-339 [Zbl 1310.68211]
Sudholt, Dirk; Zarges, Christine, Analysis of an iterated local search algorithm for vertex coloring, 340-352 [Zbl 1310.68192]
Bampis, Evripidis; Kononov, Alexander; Lucarelli, Giorgio; Milis, Ioannis, Bounded max-colorings of graphs, 353-365 [Zbl 1310.68099]
Adiga, Abhijin; Chitnis, Rajesh; Saurabh, Saket, Parameterized algorithms for boxicity, 366-377 [Zbl 1310.68154]
Nichterlein, André; Niedermeier, Rolf; Uhlmann, Johannes; Weller, Mathias, On tractable cases of target set selection, 378-389 [Zbl 1310.68115]
Brankovic, Ljiljana; Fernau, Henning, Combining two worlds: parameterised approximation for vertex cover, 390-402 [Zbl 1310.68235]
Eppstein, David; Löffler, Maarten; Strash, Darren, Listing all maximal cliques in sparse graphs in near-optimal time, 403-414 [Zbl 1311.05187]
Hansen, Thomas Dueholm; Zwick, Uri, Lower bounds for Howard’s algorithm for finding minimum mean-cost cycles, 415-426 [Zbl 1311.90171]
Bomze, Immanuel; Chimani, Markus; Jünger, Michael; Ljubić, Ivana; Mutzel, Petra; Zey, Bernd, Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut, 427-439 [Zbl 1311.90085]
Spoerhase, Joachim, An optimal algorithm for single maximum coverage location on trees and related problems, 440-450 [Zbl 1311.90065]
Babenko, Maxim A., A faster algorithm for the maximum even factor problem, 451-462 [Zbl 1311.05181]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Wxx Algorithms in computer science
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI