Abstract is missing.
- Certified Machine-Learning ModelsErnesto Damiani, Claudio Agostino Ardagna. 3-15 [doi]
- The Lost Recipes from the Four Schools of AmathusGunnar W. Klau. 16-23 [doi]
- Sharing Energy for Optimal Edge PerformanceErol Gelenbe, Yunxiao Zhang. 24-36 [doi]
- A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete AutomataFriedrich Otto. 39-50 [doi]
- A Constructive Arboricity Approximation SchemeMarkus Blumenstock, Frank Fischer 0002. 51-63 [doi]
- A Game of Cops and Robbers on Graphs with Periodic Edge-ConnectivityThomas Erlebach, Jakob T. Spooner. 64-75 [doi]
- Approximating Shortest Connected Graph Transformation for TreesNicolas Bousquet, Alice Joffard. 76-87 [doi]
- Approximating Weighted Completion Time for Order Scheduling with Setup TimesAlexander Mäcker, Friedhelm Meyer auf der Heide, Simon Pukrop. 88-100 [doi]
- Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group TestingNader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon. 101-112 [doi]
- Burning Two WorldsShahin Kamali, Avery Miller, Kenny Zhang. 113-124 [doi]
- Faster STR-EC-LCS ComputationKohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 125-135 [doi]
- Kernels of Sub-classes of Context-Free LanguagesMartin Kutrib. 136-147 [doi]
- Minimal Unique Substrings and Minimal Absent Words in a Sliding WindowTakuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 148-160 [doi]
- On Synthesis of Specifications with ArithmeticRachel Faran, Orna Kupferman. 161-173 [doi]
- On the Average State Complexity of Partial Derivative TransducersStavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis. 174-186 [doi]
- On the Difference Between Finite-State and Pushdown DepthLiam Jordon, Philippe Moser. 187-198 [doi]
- Online Scheduling with Machine Cost and a Quadratic Objective FunctionJános Csirik, György Dósa, Dávid Kószó. 199-210 [doi]
- Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern MatchingDavaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara. 211-222 [doi]
- Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-SystemsRonny Tredup. 223-235 [doi]
- Parameterized Dynamic Variants of Red-Blue Dominating SetFaisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau. 236-247 [doi]
- Refined Parameterizations for Computing Colored Cuts in Edge-Colored GraphsNils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer. 248-259 [doi]
- Simple Distributed Spanners in Dense Congest NetworksLeonid Barenboim, Tzalik Maimon. 260-272 [doi]
- The Order Type of Scattered Context-Free Orderings of Rank One Is ComputableKitti Gelle, Szabolcs Iván. 273-284 [doi]
- Up-to Techniques for Branching BisimilarityRick Erkens, Jurriaan Rot, Bas Luttik. 285-297 [doi]
- Crowd Detection for Drone Safe Landing Through Fully-Convolutional Neural NetworksGiovanna Castellano, Ciro Castiello, Corrado Mencar, Gennaro Vessio. 301-312 [doi]
- Explaining Single Predictions: A Faster MethodGabriel Ferrettini, Julien Aligon, Chantal Soulé-Dupuy. 313-324 [doi]
- Inferring Deterministic Regular Expression with UnorderXiaofan Wang, Haiming Chen. 325-337 [doi]
- POI Recommendation Based on Locality-Specific Seasonality and Long-Term TrendsElena Stefancova, Ivan Srba. 338-349 [doi]
- Selection of a Green Logical Data Warehouse Schema by Anti-monotonicity ConstraintIssam Ghabri, Ladjel Bellatreche, Sadok Ben Yahia. 350-361 [doi]
- The HyperBagGraph DataEdron: An Enriched Browsing Experience of DatasetsXavier Ouvrard, Jean-Marie Le Goff, Stéphane Marchand-Maillet. 362-374 [doi]
- Towards the Named Entity Recognition Methods in Biomedical FieldAnna Sniegula, Aneta Poniszewska-Maranda, Lukasz Chomatek. 375-387 [doi]
- Vietnamese Punctuation Prediction Using Deep Neural NetworksThuy Pham, Nhu Nguyen, Quang Pham, Han Cao, Binh T. Nguyen. 388-400 [doi]
- A Light-Weight Tool for the Self-assessment of Security Compliance in Software Development - An Industry CaseFabiola Moyón Constante, Christoph Bayr, Daniel Méndez Fernández, Sebastian Dännart, Kristian Beckers. 403-416 [doi]
- A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the RoutesOvidiu Cosma, Petrica C. Pop, Cosmin Sabo. 417-428 [doi]
- Do People Use Naming Conventions in SQL Programming?Aggelos Papamichail, Apostolos V. Zarras, Panos Vassiliadis. 429-440 [doi]
- Employing Costs in Multiagent Systems with Timed Migration and Timed CommunicationBogdan Aman, Gabriel Ciobanu. 441-453 [doi]
- Maintainability of Automatic Acceptance Tests for Web Applications - A Case Study Comparing Two Approaches to Organizing Code of Test CasesAleksander Sadaj, Miroslaw Ochodek, Sylwia Kopczynska, Jerzy R. Nawrocki. 454-466 [doi]
- Recommending Trips in the Archipelago of RefactoringsTheofanis Vartziotis, Apostolos V. Zarras, Anastasios Tsimakis, Panos Vassiliadis. 467-478 [doi]
- String Representations of Java Objects: An Empirical StudyMatús Sulír. 479-490 [doi]
- Fast Indexes for Gapped Pattern MatchingManuel Cáceres, Simon J. Puglisi, Bella Zhukova. 493-504 [doi]
- Linearizing Genomes: Exact Methods and Local SearchTom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. 505-518 [doi]
- Scanning Phylogenetic Networks Is NP-hardVincent Berry, Céline Scornavacca, Mathias Weller. 519-530 [doi]
- The Maximum Equality-Free String Factorization Problem: Gaps vs. No GapsRadu Stefan Mincu, Alexandru Popa 0001. 531-543 [doi]
- A Calculus for Language TransformationsBenjamin Mourad, Matteo Cimini. 547-555 [doi]
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)Frank Gurski, Stefan Hoffmann 0002, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke. 556-565 [doi]
- Counting Infinitely by Oritatami Co-transcriptional FoldingKohei Maruyama, Shinnosuke Seki. 566-575 [doi]
- On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern MatchingStepán Plachý, Jan Janousek. 576-586 [doi]
- On the Hardness of Energy Minimisation for Crystal Structure PredictionDuncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov. 587-596 [doi]
- Practical Implementation of a Quantum Backtracking AlgorithmSimon Martiel, Maxime Remaud. 597-606 [doi]
- Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner PointsBardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal. 607-616 [doi]
- Simultaneous FPQ-Ordering and Hybrid Planarity TestingGiuseppe Liotta, Ignaz Rutter, Alessandra Tappini. 617-626 [doi]
- Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash EquilibriumNaoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi. 627-635 [doi]
- Automatic Text Generation in Slovak LanguageDominik Vasko, Samuel Pecar, Marián Simko. 639-647 [doi]
- Connecting Galaxies: Bridging the Gap Between Databases and ApplicationsHenrietta Dombrovskaya, Jeff Czaplewski, Boris Novikov 0001. 648-656 [doi]
- GRaCe: A Relaxed Approach for Graph Query CachingFrancesco De Fino, Barbara Catania, Giovanna Guerrini. 657-666 [doi]
- Modelling of the Fake Posting Recognition in On-Line Media Using Machine LearningKristína Machová, Marián Mach, Gabriela Demková. 667-675 [doi]
- Two-Step Memory Networks for Deep Semantic Parsing of Geometry Word ProblemsIshadi Jayasinghe, Surangika Ranathunga. 676-685 [doi]
- A Case Study on a Hybrid Approach to Assessing the Maturity of Requirements Engineering Practices in Agile Projects (REMMA)Miroslaw Ochodek, Sylwia Kopczynska, Jerzy R. Nawrocki. 689-698 [doi]
- Does Live Regression Testing Help?Marek Bruchatý, Karol Rástocný. 699-707 [doi]
- Dense Subgraphs in Biological NetworksMohammad Mehdi Hosseinzadeh. 711-719 [doi]