External Links

    Journal: Algorithmica

    Volume 81, Issue 9

    3245 -- 3390Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay. Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation
    3391 -- 3421Spyros Angelopoulos 0001, Giorgio Lucarelli, Nguyen Kim Thang. Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
    3422 -- 3463Piotr Krysta, David Manlove, Baharak Rastegari, Jinshan Zhang 0002. Size Versus Truthfulness in the House Allocation Problem
    3464 -- 3493Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini. NodeTrix Planarity Testing with Small Clusters
    3494 -- 3518Luis Barba, Malte Milatz, Jerri Nummenpalo, Xiaoming Sun, Antonis Thomas, Jialin Zhang, Zhijie Zhang. The Complexity of Optimization on Grids
    3519 -- 3533Timothy M. Chan, John Hershberger 0001, Simon Pratt. Two Approaches to Building Time-Windowed Geometric Data Structures
    3534 -- 3585Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan. Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities
    3586 -- 3629Geevarghese Philip, Varun Rajan, Saket Saurabh 0001, Prafullkumar Tale. Subset Feedback Vertex Set in Chordal and Split Graphs
    3630 -- 3654Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski. Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
    3655 -- 3691Tomasz Kociumaka, Marcin Pilipczuk. Deleting Vertices to Graphs of Bounded Genus
    3692 -- 3706David Bryant, Céline Scornavacca. An $$O(n \log n)$$ O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees
    3707 -- 3724Megha Khosla, Avishek Anand. A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs
    3725 -- 3745Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott. A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
    3746 -- 3764Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley. Non-clairvoyantly Scheduling to Minimize Convex Functions
    3765 -- 3802Eldar Fischer, Oded Lachish, Yadu Vasudev. Improving and Extending the Testing of Distributions for Shape-Restricted Properties
    3803 -- 3841R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Meirav Zehavi. The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue

    Volume 81, Issue 8

    3075 -- 3098Timothy M. Chan, Dimitrios Skrepetos. Faster Approximate Diameter and Distance Oracles in Planar Graphs
    3099 -- 3113Mourad Baïou, Francisco Barahona. An Algorithm to Compute the Nucleolus of Shortest Path Games
    3114 -- 3135Robert T. Schweller, Andrew Winslow, Tim Wylie. Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly
    3136 -- 3161Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky. Stable Secretaries
    3162 -- 3185Tobias Maier, Peter Sanders 0001, Stefan Walzer. Dynamic Space Efficient Hashing
    3186 -- 3199Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong. Approximately Coloring Graphs Without Long Induced Paths
    3200 -- 3216Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý. A Tight Lower Bound for Planar Steiner Orientation
    3217 -- 3244Dmitriy Katz, Baruch Schieber, Hadas Shachnai. Flexible Resource Allocation to Interval Jobs

    Volume 81, Issue 7

    2653 -- 2681Hugo Gilbert, Olivier Spanjaard. Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case
    2682 -- 2715Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira. Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles)
    2716 -- 2737Pierre-Louis Giscard, Nils M. Kriege, Richard C. Wilson 0001. A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length
    2738 -- 2764Florian Brandl, Telikepalli Kavitha. Two Problems in Max-Size Popular Matchings
    2765 -- 2794K. Subramani, Piotr Wojciechowki. A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints
    2795 -- 2828Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2
    2829 -- 2856Eunjin Oh 0001, Hee-Kap Ahn. A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms
    2857 -- 2875Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat. Can We Recover the Cover?
    2876 -- 2898Shaojiang Wang, Kun He 0011, Yicheng Pan, Mingji Xia. Rectangle Transformation Problem
    2899 -- 2916Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter. Full Characterization of a Class of Graphs Tailored for Software Watermarking
    2917 -- 2933Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato. A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
    2934 -- 2962Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak. The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
    2963 -- 2990Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak. The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds
    2991 -- 3024Marvin Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider 0003. Subquadratic Algorithms for Succinct Stable Matching
    3025 -- 3046Ishai Kones, Asaf Levin. A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines
    3047 -- 3073Édouard Bonnet, Pawel Rzazewski. Optimality Program in Segment and String Graphs
    3074 -- 0Tomasz Kociumaka, Jakub Radoszewski, Tatiana A. Starikovskaya. Correction to: Longest Common Substring with Approximately k Mismatches

    Volume 81, Issue 6

    2123 -- 2157Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom. Mind the Gap! - Online Dictionary Matching with One Gap
    2158 -- 2195Tsuyoshi Ito, Stacey Jeffery. Approximate Span Programs
    2196 -- 2221Patrizio Angelini, Michael A. Bekos. Hierarchical Partial Planarity
    2222 -- 2243Zengfeng Huang, Ke Yi, Qin Zhang 0001. Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
    2244 -- 2269Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren. Optimization with Demand Oracles
    2270 -- 2316Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi. Improved Parameterized Algorithms for Network Query Problems
    2317 -- 2345Cecilia Bohler, Rolf Klein, Chih-Hung Liu. An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
    2346 -- 2376Haitao Wang 0001, Jingru Zhang. Covering Uncertain Points in a Tree
    2377 -- 2429Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy. A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs
    2430 -- 2483Danny Z. Chen, Haitao Wang 0001. 1 Shortest Paths Among Polygonal Obstacles in the Plane
    2484 -- 2526Patrizio Angelini, Giordano Da Lozzo. Clustered Planarity with Pipes
    2527 -- 2556Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani. Universal Slope Sets for 1-Bend Planar Drawings
    2557 -- 2591Ágnes Cseh, Jannik Matuschke. New and Simple Algorithms for Stable Flow Problems
    2592 -- 2605Samir Khuller, Sheng Yang. Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm
    2606 -- 2632Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan. On the Complexity Landscape of Connected f-Factor Problems
    2633 -- 2652Tomasz Kociumaka, Jakub Radoszewski, Tatiana A. Starikovskaya. Longest Common Substring with Approximately k Mismatches

    Volume 81, Issue 5

    1757 -- 1780Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis. Binary Search in Graphs Revisited
    1781 -- 1799Niv Buchbinder, Danny Segev, Yevgeny Tkach. Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
    1800 -- 1817Mong-Jen Kao, Hai-Lun Tu, D. T. Lee. O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities
    1818 -- 1843Franz J. Brandenburg. Characterizing and Recognizing 4-Map Graphs
    1844 -- 1858Viresh Patel, Guus Regts. Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph
    1859 -- 1880Elisabet Burjons, Dennis Komm, Marcel Schöngens. The k-Server Problem with Advice in d Dimensions and on the Sphere
    1881 -- 1900Lena Schlipf, Jens M. Schmidt. Edge-Orders
    1901 -- 1920Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari. Deterministic Leader Election Takes Θ(D+log n) Bit Rounds
    1921 -- 1937Xiaocheng Hu, Cheng Sheng 0001, Yufei Tao. Building an Optimal Point-Location Structure in O( sort (n)) I/Os
    1938 -- 1964Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen. Online Dominating Set
    1965 -- 1987Zengfeng Huang, Pan Peng. Dynamic Graph Stream Algorithms in o(n) Space
    1988 -- 2015Shay Golan, Tsvi Kopelowitz, Ely Porat. Streaming Pattern Matching with d Wildcards
    2016 -- 2045Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon. When Can Graph Hyperbolicity be Computed in Linear Time?
    2046 -- 2071Michael A. Bekos, Henry Förster, Michael Kaufmann 0001. On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
    2072 -- 2091Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner. Succinct Summing over Sliding Windows
    2092 -- 2121Oguz Kaya, Yves Robert. Computing Dense Tensor Decompositions with Optimal Dimension Trees

    Volume 81, Issue 4

    1319 -- 1341Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot. Dynamic Graph Coloring
    1342 -- 1369Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma. 5-Free Graphs
    1370 -- 1391Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi. Fixed Block Compression Boosting in FM-Indexes: Theory and Practice
    1392 -- 1415Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot. On Plane Constrained Bounded-Degree Spanners
    1416 -- 1449George B. Mertzios, Othon Michail, Paul G. Spirakis. Temporal Network Optimization Subject to Connectivity Constraints
    1450 -- 1489Dirk Sudholt, Carsten Witt. On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization
    1490 -- 1511Pavel Klavík, Yota Otachi, Jirí Sejnoha. On the Classes of Interval Graphs of Limited Nesting and Count of Lengths
    1512 -- 1534Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid. Maximum Plane Trees in Multipartite Geometric Graphs
    1535 -- 1560Pietro Cenciarelli, Daniele Gorla, Ivano Salvo. A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
    1561 -- 1583Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood. Track Layouts, Layered Path Decompositions, and Leveled Planarity
    1584 -- 1614Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier. A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
    1615 -- 1656Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Explicit Linear Kernels for Packing Problems
    1657 -- 1683Eduard Eiben, Robert Ganian, K. Kangas, Sebastian Ordyniak. Counting Linear Extensions: Parameterizations by Treewidth
    1684 -- 1698Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi. Parameterized Algorithms and Kernels for Rainbow Matching
    1699 -- 1727Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivny. On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
    1728 -- 1755Masoud Seddighin, Majid Farhadi, Mohammad Ghodsi, Reza Alijani, Ahmad S. Tajik. Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts

    Volume 81, Issue 3

    917 -- 966Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna. Edge Bipartization Faster than $$2^k$$ 2 k
    967 -- 985Surender Baswana, Keerti Choudhary, Liam Roditty. An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
    986 -- 1005Mathieu Liedloff, Pedro Montealegre, Ioan Todinca. Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques
    1006 -- 1030Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar. Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median
    1031 -- 1052Andreas Emil Feldmann. Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
    1053 -- 1074T. Karthick, Frédéric Maffray, Lucas Pastor. Polynomial Cases for the Vertex Coloring Problem
    1075 -- 1095Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto. LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
    1096 -- 1125Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong. Station Assignment with Reallocation
    1126 -- 1151Yann Disser, Stefan Kratsch, Manuel Sorge. The Minimum Feasible Tileset Problem
    1152 -- 1179Spyros Angelopoulos 0001, Reza Dorrigiv, Alejandro López-Ortiz. On the Separation and Equivalence of Paging Strategies and Other Online Algorithms
    1180 -- 1204Frank Kammer, Dieter Kratsch, Moritz Laudahn. Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
    1205 -- 1231Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani. Distributed Methods for Computing Approximate Equilibria
    1232 -- 1246Mourad Baïou, Francisco Barahona. Faster Algorithms for Security Games on Matroids
    1247 -- 1266Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. The Power and Limitations of Uniform Samples in Testing Properties of Figures
    1267 -- 1287Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. Parameterized Algorithms for List K-Cycle
    1288 -- 1318David G. Harris. Deterministic Parallel Algorithms for Bilinear Objective Functions

    Volume 81, Issue 2

    419 -- 420Jiong Guo, Danny Hermelin. Foreword: Special Issue on Parameterized and Exact Computation
    421 -- 438Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen. Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs
    439 -- 475Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele. Turbocharging Treewidth Heuristics
    476 -- 496Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler. Backdoors for Linear Temporal Logic
    497 -- 518Michal Wlodarczyk 0001. Clifford Algebras Meet Tree Decompositions
    519 -- 540Kitty Meeks. Randomised Enumeration of Small Witnesses Using a Decision Oracle
    541 -- 556Cornelius Brand, Holger Dell, Marc Roth. Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP
    557 -- 588Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. Cutwidth: Obstructions and Algorithmic Aspects
    589 -- 592Carola Doerr, Dirk Sudholt. Preface to the Special Issue on Theory of Genetic and Evolutionary Computation
    593 -- 631Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang 0016. The ( $$1+\lambda $$ 1 + λ ) Evolutionary Algorithm with Self-Adjusting Mutation Rate
    632 -- 667Carsten Witt. Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax
    668 -- 702Duc-Cuong Dang, Per Kristian Lehre, Phan Trung Hai Nguyen. Level-Based Analysis of the Univariate Marginal Distribution Algorithm
    703 -- 748Benjamin Doerr, Carola Doerr, Timo Kötzing. Solving Problems with Unknown Solution Length at Almost No Extra Cost
    749 -- 795Chao Qian, Chao Bian, Wu Jiang, Ke Tang. Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise
    796 -- 827Tomas Gavenciak, Barbara Geissmann, Johannes Lengler. Sorting by Swaps with Noisy Comparisons
    828 -- 857Feng Shi, Martin Schirneck, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001. Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints
    858 -- 885Samadhi Nallaperuma, Pietro Simone Oliveto, Jorge Pérez Heredia, Dirk Sudholt. On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements?
    886 -- 915Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich 0001, Timo Kötzing, Martin Schirneck. Island Models Meet Rumor Spreading

    Volume 81, Issue 11-12

    4165 -- 4166Yixin Cao 0001, Jianer Chen. Preface to the Special Issue on Computing and Combinatorics
    4167 -- 4199Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang. Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
    4200 -- 4237Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You. Information Complexity of the AND Function in the Two-Party and Multi-party Settings
    4238 -- 4257Stanley P. Y. Fung. Optimal Online Two-Way Trading with Bounded Number of Transactions
    4258 -- 4274Hoàng-Oanh Le, Van Bang Le. Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs
    4275 -- 4292Sumedh Tirodkar, Sundar Vishwanathan. Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models

    Volume 81, Issue 10

    3843 -- 0. Editor's Note: Special Issue on Parameterized and Exact Computation
    3844 -- 3864Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas. A Fixed-Parameter Perspective on #BIS
    3865 -- 3889Bart M. P. Jansen, Astrid Pieterse. Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
    3890 -- 3935Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx. Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
    3936 -- 3967Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna. Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
    3968 -- 3992Lech Duraj, Marvin Künnemann, Adam Polak. Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
    3993 -- 4009Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof. New Tools and Connections for Exponential-Time Approximation
    4010 -- 4028Andreas Björklund, Petteri Kaski, Ryan Williams 0001. Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
    4029 -- 4042Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz. An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
    4043 -- 4068Marin Bougeret, Ignasi Sau. How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
    4069 -- 0. Preface: Special Issue on WADS 2017
    4070 -- 4097Sebastian Brandt 0002, Roger Wattenhofer. Approximating Small Balanced Vertex Separators in Almost Linear Time
    4098 -- 4117Philip Dasler, David M. Mount. Modular Circulation and Applications to Traffic Management
    4118 -- 4133Ziyun Huang, Hu Ding, Jinhui Xu 0001. A Faster Algorithm for Truth Discovery via Range Cover
    4134 -- 4164Klaus Jansen, Marten Maack. An EPTAS for Scheduling on Unrelated Machines of Few Different Types

    Volume 81, Issue 1

    1 -- 25Susanne Albers, Achim Passen. New Online Algorithms for Story Scheduling in Web Advertising
    26 -- 46Neeldhara Misra, Fahad Panolan, Ashutosh Rai 0001, Venkatesh Raman 0001, Saket Saurabh 0001. Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
    47 -- 68Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson. On Almost Monge All Scores Matrices
    69 -- 97Therese C. Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi 0001, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu. Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
    98 -- 123Julien Lesca, Michel Minoux, Patrice Perny. The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases
    124 -- 166Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang 0002. Network Pollution Games
    167 -- 178Tomonari Kitahara, Noriyoshi Sukegawa. A Simple Projection Algorithm for Linear Programming Problems
    179 -- 200Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin. Sparse Selfreducible Sets and Nonuniform Lower Bounds
    201 -- 223Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa 0001. Parameterized Complexity of Asynchronous Border Minimization
    224 -- 237Cédric Bentz. An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
    238 -- 288Yoann Dieudonné, Andrzej Pelc. Impact of Knowledge on Election Time in Anonymous Networks
    289 -- 316Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang 0001. An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
    317 -- 342Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak. Linear Search by a Pair of Distinct-Speed Robots
    343 -- 366Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto. Minimum-Cost b-Edge Dominating Sets on Trees
    367 -- 392Marc Bury, Elena Grigorescu, Andrew McGregor 0001, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, Samson Zhou. Structural Results on Matching Estimation with Applications to Streaming
    393 -- 417Danny Segev. Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States?
    418 -- 0Koyo Hayashi, Satoru Iwata 0001. Correction to: Counting Minimum Weight Arborescences
    runs on