Abstract is missing.
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex DeletionAkanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh. 1-13 [doi]
- A Middle Curve Based on Discrete Fréchet DistanceHee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk. 14-26 [doi]
- Comparison-Based FIFO Buffer Management in QoS SwitchesKamal Al-Bawani, Matthias Englert, Matthias Westermann. 27-40 [doi]
- Scheduling on Power-Heterogeneous ProcessorsSusanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz. 41-54 [doi]
- Period Recovery over the Hamming and Edit DistancesAmihood Amir, Mika Amit, Gad M. Landau, Dina Sokol. 55-67 [doi]
- Chasing Convex Bodies and FunctionsAntonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato. 68-81 [doi]
- Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification ProblemsN. R. Aravind, R. B. Sandeep, Naveen Sivadasan. 82-95 [doi]
- Parameterized Complexity of Red Blue Set Cover for LinesPradeesha Ashok, Sudeshna Kolay, Saket Saurabh. 96-109 [doi]
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear PolygonsSang Won Bae, Chan-Su Shin, Antoine Vigneron. 110-122 [doi]
- On Mobile Agent Verifiable ProblemsEvangelos Bampas, David Ilcinkas. 123-137 [doi]
- f(n)Indranil Banerjee, Dana Richards. 138-151 [doi]
- On the Total Number of Bends for Planar Octilinear DrawingsMichael A. Bekos, Michael Kaufmann 0001, Robert Krug 0001. 152-163 [doi]
- Bidirectional Variable-Order de Bruijn GraphsDjamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi. 164-178 [doi]
- The Read/Write Protocol Complex Is CollapsibleFernando Benavides, Sergio Rajsbaum. 179-191 [doi]
- The I/O Complexity of Computing Prime TablesMichael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton, Pramod Ganapathi, Rob Johnson, Samuel McCauley, Bertrand Simon, Shikha Singh 0002. 192-206 [doi]
- Increasing DiamondsOlivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang. 207-219 [doi]
- Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-OffsKaterina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek. 220-234 [doi]
- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite GraphsÉdouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis. 235-248 [doi]
- Improved Spanning Ratio for Low Degree Plane SpannersProsenjit Bose, Darryl Hill, Michiel H. M. Smid. 249-262 [doi]
- Constructing Consistent Digital Line SegmentsIffat Chowdhury, Matt Gibson. 263-274 [doi]
- Faster Information Gathering in Ad-Hoc Radio Tree NetworksMarek Chrobak, Kevin P. Costello. 275-289 [doi]
- Stabbing Circles for Sets of Segments in the PlaneMercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara. 290-305 [doi]
- Faster Algorithms to Enumerate Hypergraph TransversalsManfred Cochefert, Jean-François Couturier 0001, Serge Gaspers, Dieter Kratsch. 306-318 [doi]
- Listing Acyclic Orientations of Graphs with Single and Multiple SourcesAlessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi. 319-333 [doi]
- Linear-Time Sequence Comparison Using Minimal Absent Words & ApplicationsMaxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis. 334-346 [doi]
- The Grandmama de Bruijn Sequence for Binary StringsPatrick Baxter Dragon, Oscar I. Hernandez, Aaron Williams. 347-361 [doi]
- Compressing Bounded Degree GraphsPål Grønås Drange, Markus S. Dregi, R. B. Sandeep. 362-375 [doi]
- Random Partial Match in Quad-K-d TreesAmalia Duch, Gustavo Lau, Conrado Martínez. 376-389 [doi]
- From Discrepancy to MajorityDavid Eppstein, Daniel S. Hirschberg. 390-402 [doi]
- On the Planar Split Thickness of GraphsDavid Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath. 403-415 [doi]
- A Bounded-Risk Mechanism for the Kidney Exchange GameHossein Esfandiari, Guy Kortsarz. 416-428 [doi]
- Tight Approximations of Degeneracy in Large GraphsMartin Farach-Colton, Meng-Tsung Tsai. 429-440 [doi]
- Improved Approximation Algorithms for Capacitated Fault-Tolerant k-CenterCristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa. 441-453 [doi]
- Bundled Crossings in Embedded GraphsMartin Fink 0001, John Hershberger, Subhash Suri, Kevin Verbeek. 454-468 [doi]
- Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin CoveringCarsten Fischer, Heiko Röglin. 469-482 [doi]
- Deterministic Sparse Suffix Sorting on Rewritable TextsJohannes Fischer 0001, Tomohiro I, Dominik Köppl. 483-496 [doi]
- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi OrderingsPierre Fraigniaud, Sergio Rajsbaum, Corentin Travers. 497-508 [doi]
- Unshuffling PermutationsSamuele Giraudo, Stéphane Vialette. 509-521 [doi]
- Generating Random Spanning Trees via Fast Matrix MultiplicationNicholas J. A. Harvey, Keyulu Xu. 522-535 [doi]
- Routing in Unit Disk GraphsHaim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth. 536-548 [doi]
- Graph Drawings with One Bend and Few SlopesKolja Knauer, Bartosz Walczak. 549-561 [doi]
- Edge-Editing to a Dense and a Sparse Graph ClassMichal Kotrbcík, Rastislav Královic, Sebastian Ordyniak. 562-575 [doi]
- Containment and Evasion in Stochastic Point DataNirman Kumar, Subhash Suri. 576-589 [doi]
- Tree Compression Using String GrammarsMoses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth. 590-604 [doi]
- Trees and Languages with Periodic SignatureVictor Marsault, Jacques Sakarovitch. 605-618 [doi]
- Rank Reduction of Directed Graphs by Vertex and Edge DeletionsSyed Mohammad Meesum, Saket Saurabh. 619-633 [doi]
- New Deterministic Algorithms for Solving Parity GamesMatthias Mnich, Heiko Röglin, Clemens Rösner. 634-645 [doi]
- Computing a Geodesic Two-Center of Points in a Simple PolygonEunjin Oh, Sang Won Bae, Hee-Kap Ahn. 646-658 [doi]
- Simple Approximation Algorithms for Balanced MAX 2SATAlice Paul, Matthias Poloczek, David P. Williamson. 659-671 [doi]
- A Parameterized Algorithm for Mixed-CutAshutosh Rai 0001, M. S. Ramanujan, Saket Saurabh. 672-685 [doi]
- p)-Time Algorithm and a Polynomial KernelSaket Saurabh, Meirav Zehavi. 686-699 [doi]
- ϵ to 1+ϵ via ShrinkingAndreas Wiese. 700-711 [doi]