zbMATH — the first resource for mathematics

Algorithms – ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11–13, 2006. Proceedings. (English) Zbl 1130.68002
Lecture Notes in Computer Science 4168. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). xviii, 843 p. (2006).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1086.68003).
Indexed articles:
Demaine, Erik D., Origami, linkages, and polyhedra: Folding with algorithms, 1 [Zbl 1131.68564]
Mehlhorn, Kurt, Reliable and efficient geometric computing, 2 [Zbl 1131.68565]
Shamir, Ron, Some computational challenges in today’s bio-medicine, 3 [Zbl 1131.92307]
Abam, M. A.; de Berg, M.; Poon, S.-H.; Speckmann, B., Kinetic collision detection for convex fat objects, 4-15 [Zbl 1131.68560]
Afshani, Peyman; Chan, Timothy M., Dynamic connectivity for axis-parallel rectangles, 16-27 [Zbl 1131.68422]
Ambühl, Christoph; Mastrolilli, Monaldo, Single machine precedence constrained scheduling is a vertex cover problem, 28-39 [Zbl 1131.90347]
Armon, Amitai; Avidor, Adi; Schwartz, Oded, Cooperative TSP, 40-51 [Zbl 1131.90453]
Aronov, Boris; Har-Peled, Sariel; Knauer, Christian; Wang, Yusu; Wenk, Carola, Fréchet distance for curves, revisited, 52-63 [Zbl 1131.68561]
Bar-Yehuda, Reuven; Beder, Michael; Cohen, Yuval; Rawitz, Dror, Resource allocation in bounded degree trees, 64-75 [Zbl 1131.68478]
Baswana, Surender, Dynamic algorithms for graph spanners, 76-87 [Zbl 1131.68479]
Becchetti, Luca; Korteweg, Peter; Marchetti-Spaccamela, Alberto; Skutella, Martin; Stougie, Leen; Vitaletti, Andrea, Latency constrained aggregation in sensor networks, 88-99 [Zbl 1131.68591]
Ben-Aroya, Avraham; Toledo, Sivan, Competitive analysis of flash-memory algorithms, 100-111 [Zbl 1131.68597]
Bender, Michael A.; Fineman, Jeremy T.; Gilbert, Seth, Contention resolution with heterogeneous job sizes, 112-123 [Zbl 1131.90349]
Berke, Robert; Szabó, Tibor, Deciding relaxed two-colorability – a hardness jump, 124-135 [Zbl 1131.68480]
Bezáková, Ivona; Sinclair, Alistair; Štefankovič, Daniel; Vigoda, Eric, Negative examples for sequential importance sampling of binary contingency tables, 136-147 [Zbl 1131.68598]
Bhuvanagiri, Lakshminath; Ganguly, Sumit, Estimating entropy over data streams, 148-159 [Zbl 1131.68457]
Bremner, David; Chan, Timothy M.; Demaine, Erik D.; Erickson, Jeff; Hurtado, Ferran; Iacono, John; Langerman, Stefan; Taslakian, Perouz, Necklaces, convolutions, and \(X + Y\), 160-171 [Zbl 1131.68580]
Brodal, Gerth Stølting; Makris, Christos; Tsichlas, Kostas, Purely functional worst case constant time catenable sorted lists, 172-183 [Zbl 1131.68425]
Caragiannis, Ioannis; Kaklamanis, Christos; Kanellopoulos, Panagiotis, Taxes for linear atomic congestion games, 184-195 [Zbl 1131.91303]
Chan, T.-H. Hubert; Dinitz, Michael; Gupta, Anupam, Spanners with slack, 196-207 [Zbl 1131.68482]
Chan, Ho-Leung; Lam, Tak-Wah; Sung, Wing-Kin; Tam, Siu-Lung; Wong, Swee-Seong, Compressed indexes for approximate string matching, 208-219 [Zbl 1131.68581]
Chen, Danny Z.; Fleischer, Rudolf; Li, Jian; Wang, Haitao; Zhu, Hong, Traversing the machining graph, 220-231 [Zbl 1131.90374]
Codenotti, Bruno; Leoncini, Mauro; Resta, Giovanni, Efficient computation of Nash equilibria for very sparse win-lose bimatrix games, 232-243 [Zbl 1131.91301]
Czygrinow, Andrzej; Hańćkowiak, Michał, Distributed almost exact approximations for minor-closed families, 244-255 [Zbl 1131.68483]
Dasgupta, Anirban; Hopcroft, John; Kannan, Ravi; Mitra, Pradipta, Spectral clustering by recursive partitioning, 256-267 [Zbl 1131.05313]
Dean, Brian C.; Goemans, Michel X.; Immorlica, Nicole, Finite termination of “augmenting path” algorithms in the presence of irrational problem data, 268-279 [Zbl 1131.05314]
Dorn, Frederic, Dynamic programming and fast matrix multiplication, 280-291 [Zbl 1131.68484]
Douïeb, Karim; Langerman, Stefan, Near-entropy hotlink assignments, 292-303 [Zbl 1131.68315]
Drineas, Petros; Mahoney, Michael W.; Muthukrishnan, S., Subspace sampling and relative-error matrix approximation: Column-row-based methods, 304-314 [Zbl 1131.68589]
Dürr, Christoph; Hurand, Mathilde, Finding total unimodularity in optimization problems solved by linear programs, 315-326 [Zbl 1131.90441]
Ebenlendr, Tomáš; Jawor, Wojciech; Sgall, Jiří, Preemptive online scheduling: Optimal algorithms for all speeds, 327-339 [Zbl 1131.90356]
Elbassioni, Khaled M., On the complexity of the multiplication method for monotone CNF/DNF dualization, 340-351 [Zbl 1131.68463]
Englert, Matthias; Westermann, Matthias, Lower and upper bounds on FIFO buffer management in QoS switches, 352-363 [Zbl 1131.68317]
Epstein, Leah; Levin, Asaf; Woeginger, Gerhard J., Graph coloring with rejection, 364-375 [Zbl 1131.05302]
Fraigniaud, Pierre; Lebhar, Emmanuelle; Lotker, Zvi, A doubling dimension threshold \(\Theta (\log \log n)\) for augmented graph navigability, 376-386 [Zbl 1131.68486]
Gärtner, Bernd; Matoušek, Jiří; Rüst, Leo; Škovroň, Petr, Violator spaces: Structure and algorithms, 387-398 [Zbl 1131.90428]
Gudmundsson, Joachim; van Kreveld, Marc; Narasimhan, Giri, Region-restricted clustering for geographic data mining, 399-410 [Zbl 1131.68501]
Han, Yijie, An \(O(n^{3} (\log \log n/\log n)^{5/4})\) time algorithm for all pairs shortest paths, 411-417 [Zbl 1131.68464]
Huang, Chien-Chung, Cheating by men in the Gale-Shapley stable matching algorithm, 418-431 [Zbl 1131.05319]
Kaporis, A. C.; Kirousis, L. M.; Stavropoulos, E. C., Approximating almost all instances of Max-Cut within a ratio above the Håstad threshold, 432-443 [Zbl 1131.05315]
Khachiyan, L.; Boros, E.; Borys, K.; Elbassioni, K.; Gurvich, V.; Makino, K., Enumerating spanning and connected subsets in graphs and matroids, 444-455 [Zbl 1131.05305]
Kirsch, Adam; Mitzenmacher, Michael, Less hashing, same performance: Building a better Bloom filter, 456-467 [Zbl 1131.68429]
Könemann, Jochen; Parekh, Ojas; Segev, Danny, A unified approach to approximating partial covering problems, 468-479 [Zbl 1131.90443]
Kumar, Ravi; Liben-Nowell, David; Tomkins, Andrew, Navigating low-dimensional and hierarchical population networks, 480-491 [Zbl 1131.91384]
Manlove, David F.; Sng, Colin T. S., Popular matchings in the capacitated house allocation problem, 492-503 [Zbl 1131.05320]
Matias, Yossi; Urieli, Daniel, Inner-product based wavelet synopses for range-sum queries, 504-515 [Zbl 1131.68439]
Megow, Nicole; Vredeveld, Tjark, Approximation in preemptive stochastic online scheduling, 516-527 [Zbl 1131.90367]
Mestre, Julián, Greedy in approximation algorithms, 528-539 [Zbl 1131.68594]
Meyer, Ulrich; Zeh, Norbert, I/O-efficient undirected shortest paths with unbounded edge lengths, 540-551 [Zbl 1131.05316]
Nikolova, Evdokia; Kelner, Jonathan A.; Brand, Matthew; Mitzenmacher, Michael, Stochastic shortest paths via quasi-convex maximization, 552-563 [Zbl 1131.05317]
Parekh, Ojas; Segev, Danny, Path hitting in acyclic graphs, 564-575 [Zbl 1131.05318]
Sakashita, Mariko; Makino, Kazuhisa; Nagamochi, Hiroshi; Fujishige, Satoru, Minimum transversals in posi-modular systems, 576-587 [Zbl 1131.05321]
Scott, Alexander D.; Sorkin, Gregory B., An LP-designed algorithm for constraint satisfaction, 588-599 [Zbl 1131.90429]
Segev, Danny; Segev, Gil, Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing, 600-611 [Zbl 1131.68595]
Tarjan, Robert; Ward, Julie; Zhang, Bin; Zhou, Yunhong; Mao, Jia, Balancing applied to maximum network flow problems (extended abstract), 612-623 [Zbl 1131.90458]
Abam, Mohammad Ali; Agarwal, Pankaj K.; de Berg, Mark; Yu, Hai, Out-of-order event processing in kinetic data structures, 624-635 [Zbl 1131.68421]
Acar, Umut A.; Blelloch, Guy E.; Tangwongsan, Kanat; Vittes, Jorge L., Kinetic algorithms via self-adjusting computation, 636-647 [Zbl 1131.68576]
van den Akker, J. M.; Hoogeveen, J. A.; van Kempen, J. W., Parallel machine scheduling through column generation: Minimax objective functions, 648-659 [Zbl 1131.90366]
Benkert, Marc; Gudmundsson, Joachim; Hübner, Florian; Wolle, Thomas, Reporting flock patterns, 660-671 [Zbl 1131.68592]
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M., On exact algorithms for treewidth, 672-683 [Zbl 1131.68481]
Bonomi, Flavio; Mitzenmacher, Michael; Panigrahy, Rina; Singh, Sushil; Varghese, George, An improved construction for counting Bloom filters, 684-695 [Zbl 1131.68424]
Bragalli, Cristiana; D’Ambrosio, Claudia; Lee, Jon; Lodi, Andrea; Toth, Paolo, An MINLP solution method for a water network problem, 696-707 [Zbl 1131.90314]
Brodal, Gerth Stølting; Moruz, Gabriel, Skewed binary search trees, 708-719 [Zbl 1131.68426]
Cabello, S.; Haverkort, H.; van Kreveld, M.; Speckmann, B., Algorithmic aspects of proportional symbol maps, 720-731 [Zbl 1131.68563]
Demetrescu, C.; Faruolo, P.; Italiano, G. F.; Thorup, M., Does path cleaning help in dynamic all-pairs shortest paths?, 732-743 [Zbl 1131.90454]
Eisenbrand, Friedrich; Karrenbauer, Andreas; Skutella, Martin; Xu, Chihao, Multiline addressing by network flow, 744-755 [Zbl 1131.90316]
Ferragina, Paolo; Giancarlo, Raffaele; Manzini, Giovanni, The engineering of a compression boosting library: Theory vs practice in BWT compression, 756-767 [Zbl 1131.68458]
Ferraro-Petrillo, Umberto; Finocchi, Irene; Italiano, Giuseppe F., The price of resiliency: A case study on sorting with memory faults, 768-779 [Zbl 1131.68434]
Kaligosi, Kanela; Sanders, Peter, How branch mispredictions affect quicksort, 780-791 [Zbl 1131.68435]
Meyerovitch, Michal, Robust, generic and efficient construction of envelopes of surfaces in three-dimensional spaces, 792-803 [Zbl 1131.68566]
Sanders, Peter; Schultes, Dominik, Engineering highway hierarchies, 804-816 [Zbl 1131.90324]
Tsigaridas, Elias P.; Emiris, Ioannis Z., Univariate polynomial real root isolation: Continued fractions revisited, 817-828 [Zbl 1131.68596]
Wein, Ron, Exact and efficient construction of planar Minkowski sums using the convolution method, 829-840 [Zbl 1131.52300]

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