Abstract is missing.
- Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power CircuiatsVolker Diekert, Alexei G. Myasnikov, Armin Weiß. 1-12 [doi]
- Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. Herrera de Figueiredo. 13-23 [doi]
- The Computational Complexity of the Game of Set and Its Theoretical ApplicationsMichael Lampis, Valia Mitsou. 24-34 [doi]
- Independent and Hitting Sets of Rectangles Intersecting a Diagonal LineJosé R. Correa, Laurent Feuilloley, José A. Soto. 35-46 [doi]
- Approximating Vector Scheduling: Almost Matching Upper and Lower BoundsNikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan. 47-59 [doi]
- False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial TimeAnja Rey, Jörg Rothe. 60-71 [doi]
- A Natural Generalization of Bounded Tree-Width and Bounded Clique-WidthMartin Fürer. 72-83 [doi]
- Optimal Algorithms for Constrained 1-Center ProblemsLuis Barba, Prosenjit Bose, Stefan Langerman. 84-95 [doi]
- A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing ClustersPanagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou. 96-107 [doi]
- Upper Bounds on the Spanning Ratio of Constrained Theta-GraphsProsenjit Bose, André van Renssen. 108-119 [doi]
- Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear TimeSang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang. 120-131 [doi]
- The Planar Slope Number of Subcubic GraphsEmilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. 132-143 [doi]
- Smooth Orthogonal Drawings of Planar GraphsMuhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff. 144-155 [doi]
- Drawing HV-Restricted Planar GraphsStephane Durocher, Stefan Felsner, Saeed Mehrabi 0001, Debajyoti Mondal. 156-167 [doi]
- Periodic Planar Straight-Frame Drawings with Polynomial ResolutionLuca Castelli Aleardi, Éric Fusy, Anatolii Kostrygin. 168-179 [doi]
- A Characterization of Those Automata That Structurally Generate Finite GroupsInes Klimann, Matthieu Picantin. 180-189 [doi]
- Linear Grammars with One-Sided Contexts and Their Automaton RepresentationMikhail Barash, Alexander Okhotin. 190-201 [doi]
- On the Computability of Relations on λ-Terms and Rice's Theorem - The Case of the Expansion Problem for Explicit SubstitutionsEdward Hermann Haeusler, Mauricio Ayala-Rincón. 202-213 [doi]
- Computing in the Presence of Concurrent Solo ExecutionsMaurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer. 214-225 [doi]
- Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths ProblemsTong-Wook Shinn, Tadao Takaoka. 226-237 [doi]
- (Total) Vector Domination for Graphs with Bounded BranchwidthToshimasa Ishii, Hirotaka Ono, Yushi Uno. 238-249 [doi]
- Computing the Degeneracy of Large GraphsMartin Farach-Colton, Meng-Tsung Tsai. 250-260 [doi]
- Approximation Algorithms for the Geometric Firefighter and Budget Fence ProblemsRolf Klein, Christos Levcopoulos, Andrzej Lingas. 261-272 [doi]
- An Improved Data Stream Algorithm for ClusteringSang-Sub Kim, Hee-Kap Ahn. 273-284 [doi]
- Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric SpacesRan Duan. 285-293 [doi]
- A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding CamerasStephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi 0001. 294-305 [doi]
- Helly-Type Theorems in Property TestingSourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf. 306-317 [doi]
- New Bounds for Online Packing LPsMatthias Englert, Nicolaos Matsakis, Marcin Mucha. 318-329 [doi]
- Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c CyclesBinay K. Bhattacharya, Tsunehiko Kameda, Zhao Song. 330-341 [doi]
- Collision-Free Network ExplorationJurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak. 342-354 [doi]
- Powers of Hamilton Cycles in Pseudorandom GraphsPeter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person. 355-366 [doi]
- Local Update Algorithms for Random GraphsPhilippe Duchon, Romaric Duvignau. 367-378 [doi]
- Odd Graphs Are Prism-Hamiltonian and Have a Long CycleFelipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen. 379-390 [doi]
- Relatively Bridge-Addable Classes of GraphsColin McDiarmid, Kerstin Weller. 391-398 [doi]
- O(n) Time Algorithms for Dominating Induced Matching ProblemsMin Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter. 399-408 [doi]
- Coloring Graph Powers: Graph Product Bounds and Hardness of ApproximationParinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai. 409-420 [doi]
- Convexity in Partial Cubes: The Hull NumberMarie Albenque, Kolja B. Knauer. 421-432 [doi]
- Connected Greedy ColouringsFabrício Benevides, Victor Campos, Mitre Dourado, Simon Griffiths, Robert Morris, Leonardo Sampaio, Ana Silva. 433-441 [doi]
- On the Number of Prefix and Border TablesJulien Clément, Laura Giambruno. 442-453 [doi]
- Probabilities of 2-Xor FunctionsElie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba. 454-465 [doi]
- Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability ProblemAntoine Genitrini, Cécile Mailler. 466-477 [doi]
- The Flip Diameter of Rectangulations and Convex SubdivisionsEyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth. 478-489 [doi]
- Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type RecurrencesPawel Hitczenko, Svante Janson. 490-501 [doi]
- Counting and Generating Permutations Using Timed LanguagesNicolas Basset. 502-513 [doi]
- Semantic Word Cloud Representations: Hardness and Approximation AlgorithmsLukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff. 514-525 [doi]
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint SatisfactionFlorent Foucaud, Reza Naserasr. 526-537 [doi]
- Complexity of Coloring Graphs without Paths and CyclesPavol Hell, Shenwei Huang. 538-549 [doi]
- Approximating Real-Time Scheduling on Identical MachinesNikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan. 550-561 [doi]
- Integrated Supply Chain Management via Randomized RoundingLehilton L. C. Pedrosa, Maxim Sviridenko. 562-573 [doi]
- The Online Connected Facility Location ProblemMário César San Felice, David P. Williamson, Orlando Lee. 574-585 [doi]
- Multiply Balanced k -PartitioningAmihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom. 586-597 [doi]
- On Some Recent Approximation Algorithms for MAX SATMatthias Poloczek, David P. Williamson, Anke van Zuylen. 598-609 [doi]
- Packet Forwarding Algorithms in a Line NetworkAntonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent, Kirk Pruhs. 610-621 [doi]
- Survivability of Swarms of Bouncing RobotsJurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Eduardo Pacheco. 622-633 [doi]
- Emergence of Wave Patterns on Kadanoff SandpilesKevin Perrot, Eric Rémila. 634-647 [doi]
- A Divide and Conquer Method to Compute Binomial IdealsDeepanjan Kesh, Shashank K. Mehta. 648-659 [doi]
- How Fast Can We Multiply Large Integers on an Actual Computer?Martin Fürer. 660-670 [doi]
- Sorting Permutations by Prefix and Suffix Versions of Reversals and TranspositionsCarla Negri Lintzmayer, Zanoni Dias. 671-682 [doi]
- Algorithmic and Hardness Results for the Colorful Components ProblemsAnna Adamaszek, Alexandru Popa. 683-694 [doi]
- On the Stability of Generalized Second Price Auctions with BudgetsJosep Díaz, Ioannis Giotis 0001, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna. 695-706 [doi]
- Approximation Algorithms for the Max-Buying Problem with Limited SupplyCristina G. Fernandes, Rafael C. S. Schouery. 707-718 [doi]
- Budget Feasible Mechanisms for Experimental DesignThibaut Horel, Stratis Ioannidis, S. Muthukrishnan. 719-730 [doi]
- LZ77-Based Self-indexing with Faster Pattern MatchingTravis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi. 731-742 [doi]
- Quad-K-d TreesNikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura. 743-754 [doi]
- Biased Predecessor SearchProsenjit Bose, Rolf Fagerberg, John Howat, Pat Morin. 755-764 [doi]