Journal: Algorithmica

Volume 82, Issue 4

681 -- 720Gerardo Berbeglia, Gwenaël Joret. Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
721 -- 746Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho. Weak Coverage of a Rectangular Barrier
747 -- 786Reut Levi, Dana Ron, Ronitt Rubinfeld. Local Algorithms for Sparse Spanning Graphs
787 -- 807Tatsuya Matsuoka, Shun Sato 0001. Making Bidirected Graphs Strongly Connected
808 -- 852Hu Ding, Jinhui Xu 0001. A Unified Framework for Clustering Constrained Data Without Locality Property
853 -- 880Niels Grüttemeier, Christian Komusiewicz. On the Relation of Strong Triadic Closure and Cluster Deletion
881 -- 897Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi. Quadratic Vertex Kernel for Rainbow Matching
898 -- 914Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri. On Bubble Generators in Directed Graphs
915 -- 937Chih-Hung Liu. A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
938 -- 965Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson. Online Clique Clustering
966 -- 978Yijie Han. Sorting Real Numbers in $O\big (n\sqrt{\log n}\big )$ Time and Linear Space
979 -- 0Yijie Han. Correction to: Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space
980 -- 1005Titouan Carette, Mathieu Laurière, Frédéric Magniez. Extended Learning Graphs for Triangle Finding
1006 -- 1032Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida. Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
1033 -- 1056Torben Hagerup. Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster
1057 -- 1080Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger. Deterministic Dynamic Matching in O(1) Update Time