Abstract is missing.
- Colorful StripsGreg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian. 2-13 [doi]
- The Mono- and Bichromatic Empty Rectangle and Square Problems in All DimensionsJonathan Backer, J. Mark Keil. 14-25 [doi]
- Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating SetQianping Gu, Navid Imani. 26-37 [doi]
- Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel MachinesEric Angel, Evripidis Bampis, Nicolas Thibault. 38-48 [doi]
- Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-WidthMartin Fürer. 49-59 [doi]
- Average Parameterization and Partial Kernelization for Computing MediansNadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier. 60-71 [doi]
- Sharp Separation and Applications to Exact and Parameterized AlgorithmsFedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh. 72-83 [doi]
- Finding the Minimum-Distance Schedule for a Boundary Searcher with a FlashlightTsunehiko Kameda, Ichiro Suzuki, John Z. Zhang. 84-95 [doi]
- The Language Theory of Bounded Context-SwitchingSalvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato. 96-107 [doi]
- Local Search Performance Guarantees for Restricted Related Parallel Machine SchedulingDiego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld. 108-119 [doi]
- Packet Routing on the GridBritta Peis, Martin Skutella, Andreas Wiese. 120-130 [doi]
- Faithful Representations of Graphs by Islands in the Extended GridMichael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil. 131-142 [doi]
- The I/O Complexity of Sparse Matrix Dense Matrix MultiplicationGero Greiner, Riko Jacob. 143-156 [doi]
- Sparse Recovery Using Sparse Random MatricesPiotr Indyk. 157 [doi]
- Optimal Succinctness for Range Minimum QueriesJohannes Fischer. 158-169 [doi]
- Compact Rich-Functional Binary Relation RepresentationsJérémy Barbay, Francisco Claude, Gonzalo Navarro. 170-183 [doi]
- Radix Cross-Sections for Length MorphismsSylvain Lombardy, Jacques Sakarovitch. 184-195 [doi]
- Pairs of Complementary Unary Languages with Balanced Nondeterministic AutomataViliam Geffert, Giovanni Pighizzini. 196-207 [doi]
- Quotient Complexity of Ideal LanguagesJanusz A. Brzozowski, Galina Jirásková, Baiyu Li. 208-221 [doi]
- Complexity of Operations on Cofinite LanguagesFrédérique Bassino, Laura Giambruno, Cyril Nicaud. 222-233 [doi]
- Fast Set Intersection and Two-Patterns MatchingHagai Cohen, Ely Porat. 234-242 [doi]
- Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite FieldsJoachim von zur Gathen, Alfredo Viola, Konstantin Ziegler. 243-254 [doi]
- A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of MultiplicationBeate Bollig. 255-266 [doi]
- Modelling the LLL Algorithm by SandpilesManfred G. Madritsch, Brigitte Vallée. 267-281 [doi]
- Communication-Efficient Construction of the Plane Localized Delaunay GraphProsenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu. 282-293 [doi]
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph LinearizationDominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig. 294-305 [doi]
- Randomised Broadcasting: Memory vs. RandomnessPetra Berenbrink, Robert Elsässer, Thomas Sauerwald. 306-319 [doi]
- Limit Theorems for Random MAX-2-XORSATVonjy Rasendrahasina, Vlady Ravelomanana. 320-331 [doi]
- On Quadratic Threshold CSPsPer Austrin, Siavosh Benabbas, Avner Magen. 332-343 [doi]
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear ProgrammingCarles Padró, Leonor Vázquez. 344-355 [doi]
- Finding the Best CAFE Is NP-HardElizabeth Maltais, Lucia Moura. 356-371 [doi]
- The Size and Depth of Layered Boolean CircuitsAnna Gál, Jing-Tang Jang. 372-383 [doi]
- Lipschitz Unimodal and Isotonic Regression on Paths and TreesPankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri. 384-396 [doi]
- Ambiguity and Deficiency in Costas Arrays and APN PermutationsDaniel Panario, Brett Stevens, Qiang Wang. 397-406 [doi]
- Iterated Shared Memory ModelsSergio Rajsbaum. 407-416 [doi]
- Optimal Polygonal Representation of Planar GraphsEmden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov. 417-432 [doi]
- Minimum-Perimeter Intersecting PolygonsAdrian Dumitrescu, Minghui Jiang. 433-445 [doi]
- Finding the Smallest Gap between Sums of Square RootsQi Cheng, Yu-Hsin Li. 446-455 [doi]
- Matching Points with ThingsGreg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian. 456-467 [doi]
- Homotopic Rectilinear Routing with Few Links and Thick EdgesBettina Speckmann, Kevin Verbeek. 468-479 [doi]
- Tilings Robust to ErrorsAlexis Ballier, Bruno Durand, Emmanuel Jeandel. 480-491 [doi]
- Visiting a Sequence of Points with a Bevel-Tip NeedleSteven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk. 492-502 [doi]
- Kernelization through TidyingRené van Bevern, Hannes Moser, Rolf Niedermeier. 527-538 [doi]
- Gradual Sub-lattice Reduction and a New Complexity for Factoring PolynomialsMark van Hoeij, Andrew Novocin. 539-553 [doi]
- The Power of Fair Pricing MechanismsChristine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth. 554-564 [doi]
- Quasi-Proportional Mechanisms: Prior-Free Revenue MaximizationVahab S. Mirrokni, S. Muthukrishnan, Uri Nadav. 565-576 [doi]
- Some Observations on Holographic AlgorithmsLeslie G. Valiant. 577-590 [doi]
- The Interval Constrained 3-Coloring ProblemJaroslaw Byrka, Andreas Karrenbauer, Laura Sanità. 591-602 [doi]
- Counting Hexagonal Patches and Independent Sets in Circle GraphsPaul S. Bonsma, Felix Breuer. 603-614 [doi]
- Approximating Maximum Diameter-Bounded SubgraphsYuichi Asahiro, Eiji Miyano, Kazuaki Samizo. 615-626 [doi]
- Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point ConcentrationKunal Dutta, C. R. Subramanian. 627-637 [doi]
- The Complexity of Counting Eulerian Tours in 4-Regular GraphsQi Ge, Daniel Stefankovic. 638-649 [doi]
- Efficient Edge Domination on Hole-Free Graphs in Polynomial TimeAndreas Brandstädt, Christian Hundt, Ragnar Nevries. 650-661 [doi]
- Computational Complexity of the Hamiltonian Cycle Problem in Dense HypergraphsMarek Karpinski, Andrzej Rucinski, Edyta Szymanska. 662-673 [doi]
- Rank Selection in Multidimensional DataAmalia Duch, Rosa M. Jiménez, Conrado Martínez. 674-685 [doi]
- Layered Working-Set TreesProsenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat. 686-696 [doi]
- Lightweight Data Indexing and Compression in External MemoryPaolo Ferragina, Travis Gagie, Giovanni Manzini. 697-710 [doi]