FULL PAPERS |
| Title |
Authors |
| The HyperBagGraph DataEdron: An Enriched Browsing Experience of Datasets |
Xavier Ouvrard, Jean-Marie Le Goff and Stephane Marchand-Maillet |
| Explaining single predictions : a faster method |
Gabriel Ferrettini, Julien Aligon and Chantal Soulé-Dupuy |
| On Synthesis of Specifications with Arithmetic |
Rachel Faran and Orna Kupferman |
| Do People Use Naming Conventions in SQL Programming? |
Aggelos Papamichail, Apostolos Zarras and Panos Vassiliadis |
| Recommending Trips in the Archipelago of Refactorings |
Theofanis Vartziotis, Apostolos Zarras, Anastasios Tsimakis and Panos Vassiliadis |
| Scanning Phylogenetic Networks is NP-hard |
Vincent Berry, Celine Scornavacca and Mathias Weller |
| POI Recommendation based on Locality-specific Seasonality and Long-term Trends |
Elena Stefancova and Ivan Srba |
| On the Average State Complexity of Partial Derivative Transducers |
Stavros Konstantinidis, António Machiavelo, Nelma Moreira and Rogério Reis |
| Minimal Unique Substrings and Minimal Absent Words in a Sliding Window |
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda |
| A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity |
Thomas Erlebach and Jakob Spooner |
| An Extension of Linear-size Suffix Tries for Parameterized Strings |
Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara |
| The order type of scattered context-free orderings of rank one is computable |
Kitti Gelle and Szabolcs Ivan |
| Approximating Weighted Completion Time for Order Scheduling with Setup Times |
Simon Pukrop, Alexander Mäcker and Friedhelm Meyer Auf der Heide |
| AOBA: An Online Benchmark tool for Algorithms in stringology |
Ryu Wakimoto, Satoshi Kobayashi, Yuki Igarashi, Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara |
| A Light-weight Tool for the Self-Assessment of Security Compliance in Software Development – An Industry Case |
Fabiola Moyón, Christoph Bayr, Daniel Mendez, Sebastian Dännart and Kristian Beckers |
| Online scheduling with machine cost and a quadratic objective function |
Janos Csirik, Gyorgy Dosa and David Koszo |
| A Characterization of The Context-Free Languages by Stateless Ordered Restart-Delete Automata |
Friedrich Otto |
| PointNet with Spin Images |
Jakub Střelský |
| Simple Distributed Spanners in Dense Congest Networks |
Leonid Barenboim and Tzalik Maimon |
| Linearizing Genomes: Exact Methods and Local Search |
Tom Davot, Annie Chateau, Rodolphe Giroudeau and Mathias Weller |
| Fast Indexes for Gapped Pattern Matching |
Manuel Caceres, Simon Puglisi and Bella Zhukova |
| Parallel duel-and-sweep algorithm for the order-preserving pattern matching |
Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara |
| Faster STR-EC-LCS Computation |
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda |
| Vietnamese Punctuation Prediction Using Deep Neural Networks |
Thuy Pham, Thao Nhu Nguyen, Quang Pham, Ky Han Cao and Binh Thanh Nguyen |
| Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing |
Nader Bshouty, Catherine Haddad-Zaknoon and George Haddad |
| A novel hybrid genetic algorithm for the two-stage transportation problem with fixed charges associated to the routes |
Ovidiu Cosma, Petrica Pop and Cosmin Sabo |
| The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps |
Radu-Stefan Mincu and Alexandru Popa |
| Crowd Detection for Drone Safe Landing through Fully-Convolutional Neural Networks |
Giovanna Castellano, Ciro Castiello, Corrado Mencar and Gennaro Vessio |
| On the Difference Between Finite-State and Pushdown Depth |
Liam Jordon and Philippe Moser |
| A Constructive Arboricity Approximation Scheme |
Markus Blumenstock and Frank Fischer |
| Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs |
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz and Frank Sommer |
| Approximating Sorting by Reversals for Trees |
Nicolas Bousquet and Alice Joffard |
| Kernels of Sub-Classes of Context-Free Languages |
Martin Kutrib |
| String Representations of Java Objects: An Empirical Study |
Matúš Sulír |
| Up-to Techniques for Branching Bisimilarity |
Rick Erkens, Jurriaan Rot and Bas Luttik |
| Parameterized Dynamic Variants of Red-Blue Dominating Set |
Faisal Abu-Khzam, Cristina Bazgan and Henning Fernau |
| Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs |
Shahin Kamali, Avery Miller and Kenny Zhang |
| Maintainability of automatic acceptance tests for web applications - A case study comparing two approaches to organizing code of test cases |
Aleksander Sadaj, Sylwia Kopczyńska, Jerzy Nawrocki and Mirosław Ochodek |
| Parameterized complexity of synthesizing b-bounded (m,n)-T-systems |
Ronny Tredup |
| Employing Costs in Multiagent Systems with Timed Migration and Timed Communication |
Bogdan Aman and Gabriel Ciobanu |
| Selection of Green Logical Data Warehouse Schema by Anti-Monotonicity Constraint |
Issam Ghabri, Ladjel Bellatreche and Sadok Ben Yahia |
| Towards the named Entity Recognition Methods in biomedical field |
Anna Śniegula, Aneta Poniszewska-Maranda and Łukasz Chomątek |
| Inferring Deterministic Regular Expression with Unorder |
Xiaofan Wang |
|
|
| |
SHORT PAPERS |
| Title |
Authors |
| Practical Implementation of a Quantum Backtracking Algorithm |
Maxime Remaud and Simon Martiel |
| GRaCe: a Relaxed Approach for Graph Query Caching |
Francesco De Fino, Barbara Catania and Giovanna Guerrini |
| Connecting Galaxies: Bridging the Gap between Databases and Applications |
Henrietta Dombrovskaya, Boris Novikov and Jeff Czaplewski |
| Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points |
Bardia Hamedmohseni, Zahed Rahmati and Debajyoti Mondal |
| Counting infinitely by oritatami co-transcriptional folding |
Kohei Maruyama and Shinnosuke Seki |
| Does live regression testing help? |
Karol Rástočný and Marek Bruchatý |
| Simultaneous FPQ-Ordering and Hybrid Planarity Testing |
Giuseppe Liotta, Ignaz Rutter and Alessandra Tappini |
| Modelling of the Fake Posting Recognition in On-line Media using Machine Learning |
Kristina Machova, Gabriela Demkova and Marian Mach |
| Computing Directed Steiner Path Covers for Directed Co-Graphs |
Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann and Egon Wanke |
| On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching |
Štěpán Plachý and Jan Janousek |
| A New Heuristic to Find Overlapping Dense Subgraphs in Biological Networks |
Mohammad Mehdi Hosseinzadeh |
| A Calculus for Language Transformations |
Benjamin Mourad and Matteo Cimini |
| Two-step Memory Networks for Deep Semantic Parsing of Geometry Word Problems |
Ishadi Jayasinghe and Surangika Ranathunga |
| Two-player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium |
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono and Ryogo Yamaguchi |
| A case study on a hybrid approach to assessing the maturity of Requirements Engineering practices in agile projects (REMMA) |
Mirosław Ochodek, Sylwia Kopczyńska and Jerzy Nawrocki |
| Automatic Text Generation in Slovak Language |
Dominik Vasko, Samuel Pecár and Marián Šimko |
| On the Hardness of Energy Minimisation for Crystal Structure Prediction |
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev and Igor Potapov |
