Abstract is missing.
- Algorithms that Access the Input via QueriesThomas Erlebach. 3-12 [doi]
- Towards Knowledge Exchange: State-of-the-Art and Open ProblemsBahar Ghadiri Bashardoost, Kelly Lyons, Renée J. Miller. 13-27 [doi]
- Invited Talk: Resilient Distributed AlgorithmsMerav Parter. 28-42 [doi]
- Towards Minimally Conscious Cyber-Physical Systems: A ManifestoJirí Wiedermann, Jan van Leeuwen. 43-55 [doi]
- Amnesiac Flooding: Synchronous Stateless Information DisseminationVolker Turau. 59-73 [doi]
- Asymptotic Approximation by Regular LanguagesRyoma Sin'ya. 74-88 [doi]
- Balanced Independent and Dominating Sets on Colored Interval GraphsSujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li 0001, Martin Nöllenburg. 89-103 [doi]
- Bike Assisted Evacuation on a LineKhaled Jawhar, Evangelos Kranakis. 104-118 [doi]
- Blocksequences of k-local WordsPamela Fleischmann, Lukas Haschke, Florin Manea, Dirk Nowotka, Cedric Tsatia Tsida, Judith Wiedenbeck. 119-134 [doi]
- Complexity of Limit-Cycle Problems in Boolean NetworksFlorian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené. 135-146 [doi]
- Concatenation Operations and Restricted Variants of Two-Dimensional AutomataTaylor J. Smith, Kai Salomaa. 147-158 [doi]
- Distance Hedonic GamesMichele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio. 159-174 [doi]
- Distributed Independent Sets in Interval and Segment Intersection GraphsBarun Gorain, Kaushik Mondal 0001, Supantha Pandit. 175-188 [doi]
- Hierarchical b-MatchingYuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks. 189-202 [doi]
- Improved Algorithms for Online Load BalancingYaxiong Liu, Kohei Hatano, Eiji Takimoto. 203-217 [doi]
- Iterated Uniform Finite-State Transducers on Unary LanguagesMartin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano. 218-232 [doi]
- New Bounds on the Half-Duplex Communication ComplexityYuriy Dementiev, Artur Ignatiev, Vyacheslav Sidelnik, Alexander Smal, Mikhail Ushakov. 233-248 [doi]
- Novel Results on the Number of Runs of the Burrows-Wheeler-TransformSara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello. 249-262 [doi]
- On the Redundancy of D-Ary Fano CodesFerdinando Cicalese, Massimiliano Rossi 0001. 263-277 [doi]
- On the Terminal Connection ProblemAlexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza. 278-292 [doi]
- Parameterized Complexity of d-Hitting Set with QuotasSushmita Gupta, Pallavi Jain 0001, Aditya Petety, Sagar Singh. 293-307 [doi]
- Parameterizing Role Coloring on ForestsSukanya Pandey, Venkatesh Raman 0001, Vibha Sahlot. 308-321 [doi]
- The Balanced Satisfactory Partition ProblemAjinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi. 322-336 [doi]
- The Multiple Traveling Salesman Problem on SpidersPedro Pérez-Escalona, Ivan Rapaport, José Soto, Ian Vidal. 337-348 [doi]
- Tightness of Sensitivity and Proximity Bounds for Integer Linear ProgramsSebastian Berndt, Klaus Jansen, Alexandra Lassota. 349-360 [doi]
- Using the Metro-Map Metaphor for Drawing HypergraphsFabian Frank, Michael Kaufmann 0001, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff 0001. 361-372 [doi]
- Weighted Microscopic Image ReconstructionAmotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz. 373-386 [doi]
- A Normal Sequence Compressed by $\mathrm {PPM}^*$ But Not by Lempel-Ziv 78Liam Jordon, Philippe Moser. 389-399 [doi]
- Clusters of Repetition Roots: Single ChainsSzilárd Zsolt Fazekas, Robert Mercas. 400-409 [doi]
- Drawing Two PosetsGuido Brückner, Vera Chekan. 410-420 [doi]
- Fair Division Is Hard Even for Amicable AgentsNeeldhara Misra, Aditi Sethia. 421-430 [doi]
- The Complexity of Flow Expansion and Electrical Flow ExpansionDorothea Wagner, Matthias Wolf 0004. 431-441 [doi]
- An Infrastructure for Platform-Independent Experimentation of Software ChangesFlorian Auer, Michael Felderer. 445-457 [doi]
- Using Process Models to Understand Security StandardsFabiola Moyon, Daniel Méndez 0001, Kristian Beckers, Sebastian Klepper. 458-471 [doi]
- Web Test Automation: Insights from the Grey LiteratureFilippo Ricca, Andrea Stocco 0001. 472-485 [doi]
- A Pipeline for Measuring Brand Loyalty Through Social Media MiningHazem Samoaa, Barbara Catania. 489-504 [doi]
- Predicting Tennis Match Outcomes with Network Analysis and Machine LearningFiras Bayram, Davide Garbarino, Annalisa Barla. 505-518 [doi]
- Role-Based Access Control on Graph DatabasesJacques Chabin, Cristina Dutra de Aguiar Ciferri, Mirian Halfeld Ferrari Alves, Carmem S. Hara, Raqueline R. M. Penteado. 519-534 [doi]
- Semi-automatic Column Type Inference for CSV Table UnderstandingSara Bonfitto, Luca Cappelletti, Fabrizio Trovato, Giorgio Valentini, Marco Mesiti. 535-549 [doi]
- Metadata Management on Data Processing in Data LakesImen Megdiche, Franck Ravat, Yan Zhao 0022. 553-562 [doi]
- S2CFT: A New Approach for Paper Submission RecommendationDac H. Nguyen, Son Huynh, Phong Huynh, Dinh V. Cuong, Binh T. Nguyen. 563-573 [doi]
- Adding Matrix Control: Insertion-Deletion Systems with Substitutions IIIMartin Vu, Henning Fernau. 577-592 [doi]
- Sorting by Multi-cut RearrangementsLaurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz. 593-607 [doi]
- Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH FailsMassimo Equi, Veli Mäkinen, Alexandru I. Tomescu. 608-622 [doi]