Journal: Algorithmica

Volume 82, Issue 7

1741 -- 1783Bhaskar DasGupta, Mano Vikash Janardhanan, Farzane Yahyanejad. Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures)
1784 -- 1812Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid 0001. Walking Through Waypoints
1813 -- 1832John Hershberger 0001, Neeraj Kumar 0004, Subhash Suri. Shortest Paths in the Plane with Obstacle Violations
1833 -- 1858Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová. s)-Free Graphs
1859 -- 1880Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos. Subgraph Complementation
1881 -- 1908Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg. Placing Labels in Road Maps: Algorithms and Complexity
1909 -- 1938Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora. Parameterized Orientable Deletion
1939 -- 1965Akanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001. Parameterized Complexity of Conflict-Free Matchings and Paths
1966 -- 1988Keshav Goyal, Tobias Mömke. Robust Reoptimization of Steiner Trees
1989 -- 2005Andreas Emil Feldmann, Dániel Marx. The Parameterized Hardness of the k-Center Problem in Transportation Networks
2006 -- 2038Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos. Parameterized Aspects of Strong Subgraph Closure
2039 -- 2062Huang-Ting Chan, Hsuan-Tsung Chiu, Chang-Biau Yang, Yung-Hsing Peng. The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems
2063 -- 2086Travis Gagie, Meng He 0001, Gonzalo Navarro. Compressed Dynamic Range Majority and Minority Data Structures
2087 -- 2106Naoyuki Kamiyama. The Distance-Constrained Matroid Median Problem
2107 -- 2132Qian Li 0012, Xiaoming Sun, Jialin Zhang. On the Optimality of Tape Merge of Two Lists with Similar Size