Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding symposium see [Zbl 1376.68013].
Indexed articles:
Björklund, Andreas, Exploiting sparsity for bipartite Hamiltonicity, Article 3, 11 p. [Zbl 1533.05141]
Zehmakan Ahad, N., Opinion forming in Erdős-Rényi random graph and expanders, Article 4, 13 p. [Zbl 1532.05152]
Klimošová, Tereza; Malík, Josef; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Slívová, Veronika, Colouring \((P_r+P_s)\)-free graphs, Article 5, 13 p. [Zbl 1532.68068]
Ducoffe, Guillaume; Popa, Alexandru, The use of a pruned modular decomposition for maximum matching algorithms on some graph classes, Article 6, 13 p. [Zbl 1532.68064]
Bilò, Davide; Papadopoulos, Kleitos, A novel algorithm for the all-best-swap-edge problem on tree spanners, Article 7, 12 p. [Zbl 1532.68063]
Kurita, Kazuhiro; Wasa, Kunihiro; Arimura, Hiroki; Uno, Takeaki, Efficient enumeration of dominating sets for sparse graphs, Article 8, 13 p. [Zbl 1532.05089]
Rahman, Md Lutfar; Watson, Thomas, Complexity of unordered CNF games, Article 9, 12 p. [Zbl 1499.68134]
Hoover, Kenneth; Impagliazzo, Russell; Mihajlin, Ivan; Smal, Alexander V., Half-duplex communication complexity, Article 10, 12 p. [Zbl 1532.68020]
Ishizuka, Takashi; Kamiyama, Naoyuki, On the complexity of stable fractional hypergraph matching, Article 11, 12 p. [Zbl 1532.68066]
Johnson, Matthew P., Deciding the closure of inconsistent rooted triples is NP-complete, Article 12, 13 p. [Zbl 1532.68022]
Preißer, Johanna E.; Schmidt, Jens M., Computing vertex-disjoint paths in large graphs using MAOs, Article 13, 12 p. [Zbl 1532.68070]
Bhattacharya, Binay; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki, An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks, Article 14, 13 p. [Zbl 1532.68062]
Garijo, Delia; Márquez, Alberto; Rodríguez, Natalia; Silveira, Rodrigo I., Computing optimal shortcuts for networks, Article 15, 12 p. [Zbl 1532.90022]
Avarikioti, Georgia; Wang, Yuyi; Wattenhofer, Roger, Algorithmic channel design, Article 16, 12 p. [Zbl 1533.91512]
Björklund, Andreas; Husfeldt, Thore; Kaski, Petteri; Koivisto, Mikko, Counting connected subgraphs with maximum-degree-aware sieving, Article 17, 12 p. [Zbl 1535.05245]
Dvořák, Pavel; Knop, Dušan; Toufar, Tomáš, Target set selection in dense graph classes, Article 18, 13 p. [Zbl 1533.68234]
Björklund, Andreas; Husfeldt, Thore, Counting shortest two disjoint paths in cubic planar graphs with an NC algorithm, Article 19, 13 p. [Zbl 1533.68210]
Kim, Eun Jung; Serna, Maria; Thilikos, Dimitrios M., Data-compression for parametrized counting problems on sparse graphs, Article 20, 13 p. [Zbl 1524.68156]
Datta, Samir; Kulkarni, Raghav; Kumar, Ashish; Mukherjee, Anish, Planar maximum matching: towards a parallel algorithm, Article 21, 13 p. [Zbl 1533.68227]
Czygrinow, Andrzej; Hanćkowiak, Michal; Wawrzyniak, Wojciech; Witkowski, Marcin, Distributed approximation algorithms for the minimum dominating set in \(k_h\)-minor-free graphs, Article 22, 12 p. [Zbl 1533.68222]
Geary, Cody; Meunier, Pierre-Étienne; Schabanel, Nicolas; Seki, Shinnosuke, Proving the Turing universality of oritatami co-transcriptional folding, Article 23, 13 p. [Zbl 1524.68136]
Chen, Jiehua; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej, Cluster editing in multi-layer and temporal graphs, Article 24, 13 p. [Zbl 1533.68219]
Bishnu, Arijit; Ghosh, Arijit; Kolay, Sudeshna; Mishra, Gopinath; Saurabh, Saket, Parameterized query complexity of hitting set using stability of sunflowers, Article 25, 12 p. [Zbl 1533.68209]
Agarwal, Pankaj K.; Kaplan, Haim; Kipper, Geva; Mulzer, Wolfgang; Rote, Günter; Sharir, Micha; Xiao, Allen, Approximate minimum-weight matching with outliers under translation, Article 26, 13 p. [Zbl 1533.68399]
Akutsu, Tatsuya; Jansson, Jesper; Li, Ruiming; Takasu, Atsuhiro; Tamura, Takeyuki, New and improved algorithms for unordered tree inclusion, Article 27, 12 p. [Zbl 1517.68268]
Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Pfister, Maximilian; Ueckerdt, Torsten, Beyond-planarity: Turán-type results for non-planar bipartite graphs, Article 28, 13 p. [Zbl 1535.05072]
Chen, Yen-Ting; Tsai, Meng-Tsung; Tsai, Shi-Chun, A dichotomy result for cyclic-order traversing games, Article 29, 13 p. [Zbl 1533.68220]
Ducoffe, Guillaume; Popa, Alexandru, The \(b\)-matching problem in distance-hereditary graphs and beyond, Article 30, 13 p. [Zbl 1533.68233]
Feng, Qilong; Tan, Guanlan; Zhu, Senmin; Fu, Bin; Wang, Jianxin, New algorithms for edge induced König-Egerváry subgraph based on Gallai-Edmonds decomposition, Article 31, 12 p. [Zbl 1535.05247]
Matheny, Michael; Phillips, Jeff M., Computing approximate statistical discrepancy, Article 32, 13 p. [Zbl 1533.68407]
Cevallos, Alfonso; Eisenbrand, Friedrich; Morell, Sarah, Diversity maximization in doubling metrics, Article 33, 12 p. [Zbl 1533.68403]
Bshouty, Nader H.; Makhoul, Waseem, On polynomial time constructions of minimum height decision tree, Article 34, 12 p. [Zbl 1533.68402]
Aggarwal, Divesh; Mukhopadhyay, Priyanka, Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm, Article 35, 13 p. [Zbl 1533.68195]
Bentert, Matthias; Dittmann, Alexander; Kellerhals, Leon; Nichterlein, André; Niedermeier, Rolf, An adaptive version of Brandes’ algorithm for betweenness centrality, Article 36, 13 p. [Zbl 1533.68206]
Osawa, Hiroki; Suzuki, Akira; Ito, Takehiro; Zhou, Xiao, Algorithms for coloring reconfiguration under recolorability constraints, Article 37, 13 p. [Zbl 1533.68262]
Lo, On-Hei S.; Schmidt, Jens M., A cut tree representation for pendant pairs, Article 38, 9 p. [Zbl 1535.05144]
Di Giacomo, Emilio; Eades, Peter; Liotta, Giuseppe; Meijer, Henk; Montecchiani, Fabrizio, Polyline drawings with topological constraints, Article 39, 13 p. [Zbl 1533.68228]
Bilò, Davide, Almost optimal algorithms for diameter-optimally augmenting trees, Article 40, 13 p. [Zbl 1514.68200]
Da Lozzo, Giordano; Rutter, Ignaz, Approximation algorithms for facial cycles in planar embeddings, Article 41, 13 p. [Zbl 1533.68224]
Kunysz, Adam, An algorithm for the maximum weight strongly stable matching problem, Article 42, 13 p. [Zbl 1533.68247]
Hong, Eunpyeong; Kao, Mong-Jen, Approximation algorithm for vertex cover with multiple covering constraints, Article 43, 11 p. [Zbl 1518.68266]
Gleich, David F.; Veldt, Nate; Wirth, Anthony, Correlation clustering generalized, Article 44, 13 p. [Zbl 1533.68406]
Ficker, Annette M. C.; Erlebach, Thomas; Mihalák, Matúš; Spieksma, Frits C. R., Partitioning vectors into quadruples: worst-case analysis of a matching-based algorithm, Article 45, 12 p. [Zbl 1533.68404]
Blömer, Johannes; Brauer, Sascha; Bujna, Kathrin, Coresets for fuzzy \(K\)-means with applications, Article 46, 12 p. [Zbl 1533.68401]
Farach-Colton, Martín; Li, Meng; Tsai, Meng-Tsung, Streaming algorithms for planar convex hulls, Article 47, 13 p. [Zbl 1533.68412]
Bouchard, Sébastien; Dieudonné, Yoann; Pelc, Andrzej; Petit, Franck, Deterministic treasure hunt in the plane with angular hints, Article 48, 13 p. [Zbl 1533.68350]
Bouts, Quirijn; Castermans, Thom; van Goethem, Arthur; van Kreveld, Marc; Meulemans, Wouter, Competitive searching for a line on a line arrangement, Article 49, 12 p. [Zbl 1533.68351]
Har-Peled, Sariel; Kaplan, Haim; Mulzer, Wolfgang; Roditty, Liam; Seiferth, Paul; Sharir, Micha; Willert, Max, Stabbing pairwise intersecting disks by five points, Article 50, 12 p. [Zbl 1535.52003]
Oh, Eunjin, Point location in incremental planar subdivisions, Article 51, 12 p. [Zbl 1533.68380]
Keikha, Vahideh; van de Kerkhof, Mees; van Kreveld, Marc; Kostitsyna, Irina; Löffler, Maarten; Staals, Frank; Urhausen, Jérôme; Vermeulen, Jordi L.; Wiratma, Lionov, Convex partial transversals of planar regions, Article 52, 12 p. [Zbl 1533.68372]
Pilz, Alexander; Schnider, Patrick, Extending the centerpoint theorem to multiple points, Article 53, 13 p. [Zbl 1533.68383]
Ben, Basat Ran; Jo, Seungbum; Satti, Srinivasa Rao; Ugare, Shubham, Approximate query processing over static sets and sliding windows, Article 54, 12 p. [Zbl 1514.68058]
Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol, Multi-finger binary search trees, Article 55, 26 p. [Zbl 1533.68043]
Bezáková, Ivona; Searns, Andrew, On counting oracles for path problems, Article 56, 12 p. [Zbl 1503.68206]
Hirai, Hiroshi; Iwamasa, Yuni, Reconstructing phylogenetic tree from multipartite quartet system, Article 57, 13 p. [Zbl 1533.68196]
Arseneva, Elena; Chiu, Man-Kwun; Korman, Matias; Markovic, Aleksandar; Okamoto, Yoshio; Ooms, Aurélien; van Renssen, André; Roeloffzen, Marcel, Rectilinear link diameter and radius in a rectilinear polygonal domain, Article 58, 13 p. [Zbl 1533.68345]
Oh, Eunjin, Minimizing distance-to-sight in polygonal domains, Article 59, 12 p. [Zbl 1533.68381]
Aurenhammer, Franz; Steinkogler, Michael; Klein, Rolf, Partially walking a polygon, Article 60, 9 p. [Zbl 1533.68347]
Chan, Timothy M.; van Dijk, Thomas C.; Fleszar, Krzysztof; Spoerhase, Joachim; Wolff, Alexander, Stabbing rectangles by line segments – how decomposition reduces the shallow-cell complexity, Article 61, 13 p. [Zbl 1533.68355]
Liu, Xingwu; Pan, Zhida; Wang, Yuyi; Wattenhofer, Roger, Impatient online matching, Article 62, 12 p. [Zbl 1533.68419]
Cheng, Siu-Wing; Yan, Lie, Extensions of self-improving sorters, Article 63, 12 p. [Zbl 1533.68048]
Luo, Kelin; Erlebach, Thomas; Xu, Yinfeng, Online scheduling of car-sharing requests between two locations with many cars and flexible advance bookings, Article 64, 13 p. [Zbl 1535.90061]
Hoefer, Martin; Wilhelmi, Lisa, Packing returning secretaries, Article 65, 12 p. [Zbl 1535.90126]
Kammer, Frank; Sajenko, Andrej, Simple \(2^f\)-color choice dictionaries, Article 66, 12 p. [Zbl 1533.68046]
Munro, J. Ian; Wu, Kaiyu, Succinct data structures for chordal graphs, Article 67, 12 p. [Zbl 1533.68047]
Gagie, Travis; He, Meng; Navarro, Gonzalo, Tree path majority data structures, Article 68, 12 p. [Zbl 1533.68045]
Jo, Seungbum; Satti, Srinivasa Rao, Encoding two-dimensional range top-\(k\) queries revisited, Article 69, 13 p. [Zbl 1518.68077]
Kociumaka, Tomasz; Kundu, Ritu; Mohamed, Manal; Pissis, Solon P., Longest unbordered factor in quasilinear time, Article 70, 13 p. [Zbl 1533.68424]
Chen, Jian-Jia; Bansal, Nikhil; Chakraborty, Samarjit; von Der, Brüggen Georg, Packing sporadic real-time tasks on identical multiprocessor systems, Article 71, 14 p. [Zbl 1533.68020]
Shabtai, Galia; Raz, Danny; Shavitt, Yuval, A relaxed FPTAS for chance-constrained knapsack, Article 72, 12 p. [Zbl 1533.68409]
Fotakis, Dimitris; Gourvès, Laurent; Mathieu, Claire; Srivastav, Abhinav, Covering clients with types and budgets, Article 73, 12 p. [Zbl 1535.90082]