×

zbMATH — the first resource for mathematics

Algorithms – ESA 2014. 22nd annual European symposium, Wrocław, Poland, September 8–10, 2014. Proceedings. (English) Zbl 1295.68031
Lecture Notes in Computer Science 8737. Berlin: Springer (ISBN 978-3-662-44776-5/pbk). xviii, 859 p. (2014).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding symposium see [Zbl 1270.68017].
Indexed articles:
Abboud, Amir; Lewi, Kevin; Williams, Ryan, Losing weight by gaining edges, 1-12 [Zbl 1423.68197]
Abed, Fidaa; Correa, José R.; Huang, Chien-Chung, Optimal coordination mechanisms for multi-job scheduling games, 13-24 [Zbl 1425.90036]
Acar, Umut A.; Charguéraud, Arthur; Rainey, Mike, Theory and practice of chunked sequences, 25-36 [Zbl 1423.68114]
Agarwal, Pankaj K.; Har-Peled, Sariel; Suri, Subhash; Yıldız, Hakan; Zhang, Wuzhou, Convex hulls under uncertainty, 37-48 [Zbl 1370.68291]
Agarwal, Rachit, The space-stretch-time tradeoff in distance oracles, 49-60 [Zbl 1423.68198]
Alewijnse, Sander P. A.; Bouts, Quirijn W.; Ten Brink, Alex P., Distribution-sensitive construction of the greedy spanner, 61-73 [Zbl 1423.68531]
Attali, Dominique; Devillers, Olivier; Glisse, Marc; Lazard, Sylvain, Recognizing shrinkable complexes is NP-complete, 74-86 [Zbl 1423.68535]
Bekos, Michael A.; van Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander, Improved approximation algorithms for box contact representations, 87-99 [Zbl 1423.68588]
Ben-Avraham, Rinat; Henze, Matthias; Jaume, Rafel; Keszegh, Balázs; Raz, Orit E.; Sharir, Micha; Tubis, Igor, Minimum partial-matching and Hausdorff RMS-distance under translation: combinatorics and algorithms, 100-111 [Zbl 1423.68538]
Bender, Michael A.; Farach-Colton, Martín; Goswami, Mayank; Medjedovic, Dzejla; Montes, Pablo; Tsai, Meng-Tsung, The batched predecessor problem in external memory, 112-124 [Zbl 1423.68145]
Bhattacharyya, Arnab, Polynomial decompositions in polynomial time, 125-136 [Zbl 1423.68614]
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido, Fault-tolerant approximate shortest-path trees, 137-148 [Zbl 1422.68181]
Björklund, Andreas; Kaski, Petteri; Kowalik, Łukasz, Fast witness extraction using a decision oracle, 149-160 [Zbl 1423.68203]
Bläsius, Thomas; Brückner, Guido; Rutter, Ignaz, Complexity of higher-degree orthogonal graph embedding in the Kandinsky model, 161-172 [Zbl 1423.68204]
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał, A subexponential parameterized algorithm for proper interval completion, 173-184 [Zbl 1330.68101]
Boissonnat, Jean-Daniel; Maria, Clément, Computing persistent homology with various coefficient fields in a single pass, 185-196 [Zbl 1432.55010]
Bringmann, Karl; Friedrich, Tobias; Krohmer, Anton, De-anonymization of heterogeneous random graphs in quasilinear time, 197-208 [Zbl 1425.05143]
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi), Competitive algorithms for restricted caching and matroid caching, 209-221 [Zbl 1423.68146]
Chakaravarthy, Venkatesan T.; Choudhury, Anamitra R.; Gupta, Shalmoli; Roy, Sambuddha; Sabharwal, Yogish, Improved algorithms for resource allocation under varying capacity, 222-234 [Zbl 1425.90041]
Chalermsook, Parinya; Heydrich, Sandy; Holm, Eugenia; Karrenbauer, Andreas, Nearly tight approximability results for minimum biclique cover and partition, 235-246 [Zbl 1423.68590]
Chan, Timothy M.; He, Meng; Munro, J. Ian; Zhou, Gelin, Succinct indices for path minimum, with applications to path reporting, 247-259 [Zbl 1365.68174]
Charikar, Moses; Henzinger, Monika; Nguyêñ, Huy L., Online bipartite matching with decomposable weights, 260-271 [Zbl 1423.68607]
Cheng, Siu-Wing; Mencel, Liam; Vigneron, Antoine, A faster algorithm for computing straight skeletons, 272-283 [Zbl 1423.68541]
Darwish, Omar; Elmasry, Amr, Optimal time-space tradeoff for the 2D convex-hull problem, 284-295 [Zbl 1423.68543]
Davoodi, Pooya; Fineman, Jeremy T.; Iacono, John; Özkan, Özgür, Cache-oblivious persistence, 296-308 [Zbl 1423.68122]
Dean, Brian C.; Jalasutram, Rommel; Waters, Chad, Lightweight approximate selection, 309-320 [Zbl 1423.68623]
Delling, Daniel; Goldberg, Andrew V.; Pajor, Thomas; Werneck, Renato F., Robust distance queries on massive networks, 321-333 [Zbl 1423.68332]
Dvořák, Zdeněk; Kupec, Martin; Tůma, Vojtěch, A dynamic data structure for MSO properties in graphs with bounded tree-depth, 334-345 [Zbl 1423.68123]
Dvořák, Zdeněk; Mnich, Matthias, Large independent sets in triangle-free planar graphs, 346-357 [Zbl 1371.68110]
Efentakis, Alexandros; Pfoser, Dieter, GRASP. Extending graph separators for the single-source shortest-path problem, 358-370 [Zbl 1423.68336]
Efthymiou, Charilaos, Switching colouring of \(G(n,d/n)\) for sampling up to Gibbs uniqueness threshold, 371-381 [Zbl 1423.68337]
Ene, Alina; Nguyêñ, Huy L., From graph to hypergraph multiway partition: is the single threshold the only route?, 382-393 [Zbl 1425.68455]
Even, Guy; Medina, Moti; Ron, Dana, Deterministic stateless centralized local algorithms for bounded degree graphs, 394-405 [Zbl 1425.68456]
Farruggia, Andrea; Ferragina, Paolo; Venturini, Rossano, Bicriteria data compression: efficient and usable, 406-417 [Zbl 1421.68042]
Ferreira, Rui; Grossi, Roberto; Rizzi, Romeo; Sacomoto, Gustavo; Sagot, Marie-France, Amortized \(\tilde{O}(|V|)\)-delay algorithm for listing chordless cycles in undirected graphs, 418-429 [Zbl 1423.68571]
Fiorini, Samuel; Krithika, R.; Narayanaswamy, N. S.; Raman, Venkatesh, LP approaches to improved approximation for clique transversal in perfect graphs, 430-442 [Zbl 1390.68761]
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket, Representative sets of product families, 443-454 [Zbl 1425.68448]
Gawrychowski, Paweł; Lewenstein, Moshe; Nicholson, Patrick K., Weighted ancestors in suffix trees, 455-466 [Zbl 1425.68087]
Ghashami, Mina; Desai, Amey; Phillips, Jeff M., Improved practical matrix sketching with guarantees, 467-479 [Zbl 1425.68346]
Gibson, Matt; Varadarajan, Kasturi; Wu, Xiaodong, Computing regions decomposable into \(m\) stars, 480-491 [Zbl 1425.68311]
Golovach, Petr A.; Kamiński, Marcin; Maniatis, Spyridon; Thilikos, Dimitrios M., The parameterized complexity of graph cyclability, 492-504 [Zbl 1425.05033]
Grohe, Martin; Kersting, Kristian; Mladenov, Martin; Selman, Erkal, Dimension reduction via colour refinement, 505-516 [Zbl 1425.68313]
Gupta, Anupam; Molinaro, Marco, How experts can solve LPs online, 517-529 [Zbl 1425.90066]
Gutin, Gregory; Jones, Mark; Sheng, Bin, Parameterized complexity of the \(k\)-arc Chinese postman problem, 530-541 [Zbl 1425.68143]
Har-Peled, Sariel; Roy, Subhro, Approximating the maximum overlap of polygons under translation, 542-553 [Zbl 1359.68283]
Hell, Pavol; Mohar, Bojan; Rafiey, Arash, Ordering without forbidden patterns, 554-565 [Zbl 1425.05134]
Hoffmann, Michael; Kusters, Vincent; Miltzow, Tillmann, Halving balls in deterministic linear time, 566-578 [Zbl 1425.68433]
Jansen, Bart M. P., Turing kernelization for finding long paths and cycles in restricted graph classes, 579-591 [Zbl 1425.68144]
Jeffery, Stacey; Magniez, Frederic; de Wolf, Ronald, Optimal parallel quantum query algorithms, 592-604 [Zbl 1370.68101]
Kociumaka, Tomasz; Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel, Sublinear space algorithms for the longest common substring problem, 605-617 [Zbl 1425.68469]
Larkin, Daniel H.; Tarjan, Robert E., Nested set union, 618-629 [Zbl 1425.68089]
Lewenstein, Moshe; Munro, J. Ian; Nicholson, Patrick K.; Raman, Venkatesh, Improved explicit data structures in the bitprobe model, 630-641 [Zbl 1425.68090]
Li, Wenjun; Chen, Jianer; Wang, Jianxin, Deeper local search for better approximation on maximum internal spanning trees, 642-653 [Zbl 1425.68317]
Liu, Jingcheng; Lu, Pinyan; Zhang, Chihao, FPTAS for counting weighted edge covers, 654-665 [Zbl 1425.68457]
Lokshtanov, Daniel; Saurabh, Saket; Suchý, Ondřej, Solving multicut faster than \(2^{n }\), 666-676 [Zbl 1425.05154]
Malchik, Caleb; Winslow, Andrew, Tight bounds for active self-assembly using an insertion primitive, 677-688 [Zbl 1421.68049]
McGregor, Andrew; Price, Eric; Vorotnikova, Sofya, Trace reconstruction revisited, 689-700 [Zbl 1425.68470]
Merz, Florian; Sanders, Peter, PReaCH: a fast lightweight reachability index using pruning and contraction hierarchies, 701-712 [Zbl 1425.68318]
Miyazawa, Flávio K.; Pedrosa, Lehilton L. C.; Schouery, Rafael C. S.; Sviridenko, Maxim; Wakabayashi, Yoshiko, Polynomial-time approximation schemes for circle packing problems, 713-724 [Zbl 1425.68437]
Navarro, Gonzalo; Puglisi, Simon J.; Sirén, Jouni, Document retrieval on repetitive collections, 725-736 [Zbl 1425.68099]
Newman, Alantha, An improved analysis of the Mömke-Svensson algorithm for graph-TSP on subquartic graphs, 737-749 [Zbl 1425.68475]
Pagh, Rasmus; Stöckel, Morten, The input/output complexity of sparse matrix multiplication, 750-761 [Zbl 1425.68147]
Rizzi, Romeo; Tomescu, Alexandru I., Faster FPTASes for counting and random generation of knapsack solutions, 762-773 [Zbl 1425.68459]
Räcke, Harald; Shah, Chintan, Improved guarantees for tree cut sparsifiers, 774-785 [Zbl 1425.05156]
Shachnai, Hadas; Zehavi, Meirav, Representative families: a unified tradeoff-based approach, 786-797 [Zbl 1333.68265]
van Brink, Martijn; van der Zwaan, Ruben, A branch and price procedure for the container premarshalling problem, 798-809 [Zbl 1425.90063]
Wang, Joshua R., Space-efficient randomized algorithms for \(k\)-sum, 810-829 [Zbl 1425.68453]
Wei, Zhewei; Yi, Ke, Equivalence between priority queues and sorting in external memory, 830-841 [Zbl 1425.68093]
Wilkinson, Bryan T., Amortized bounds for dynamic orthogonal range reporting, 842-856 [Zbl 1425.68442]

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