{"id":512,"date":"2019-10-24T12:55:45","date_gmt":"2019-10-24T12:55:45","guid":{"rendered":"http:\/\/cyprusconferences.org\/sofsem2020\/?page_id=512"},"modified":"2019-10-24T12:55:46","modified_gmt":"2019-10-24T12:55:46","slug":"accepted","status":"publish","type":"page","link":"https:\/\/cyprusconferences.org\/sofsem2020\/accepted\/","title":{"rendered":"Accepted Papers"},"content":{"rendered":"

[et_pb_section fb_built=”1″ _builder_version=”3.17.6″][et_pb_row _builder_version=”3.17.6″][et_pb_column type=”4_4″ _builder_version=”3.17.6″ parallax=”off” parallax_method=”on”][et_pb_text _builder_version=”3.17.6″]<\/p>\n

Accepted Papers<\/h2>\n
\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”3.17.6″][et_pb_column type=”4_4″ _builder_version=”3.17.6″ parallax=”off” parallax_method=”on”][et_pb_code _builder_version=”3.17.6″]<\/p>\n <\/p>\n<\/p>\n<\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n
\n
FULL PAPERS<\/strong><\/h5>\n<\/td>\n

<\/tr>\n

<\/p>\n

Title<\/strong><\/td>\n

<\/p>\n

Authors<\/strong><\/td>\n

<\/tr>\n

<\/p>\n

The HyperBagGraph DataEdron: An Enriched Browsing Experience of Datasets<\/td>\n

<\/p>\n

Xavier Ouvrard, Jean-Marie Le Goff and Stephane Marchand-Maillet<\/td>\n

<\/tr>\n

<\/p>\n

Explaining single predictions : a faster method<\/td>\n

<\/p>\n

Gabriel Ferrettini, Julien Aligon and Chantal Soul\u00e9-Dupuy<\/td>\n

<\/tr>\n

<\/p>\n

On Synthesis of Specifications with Arithmetic<\/td>\n

<\/p>\n

Rachel Faran and Orna Kupferman<\/td>\n

<\/tr>\n

<\/p>\n

Do People Use Naming Conventions in SQL Programming?<\/td>\n

<\/p>\n

Aggelos Papamichail, Apostolos Zarras and Panos Vassiliadis<\/td>\n

<\/tr>\n

<\/p>\n

Recommending Trips in the Archipelago of Refactorings<\/td>\n

<\/p>\n

Theofanis Vartziotis, Apostolos Zarras, Anastasios Tsimakis and Panos Vassiliadis<\/td>\n

<\/tr>\n

<\/p>\n

Scanning Phylogenetic Networks is NP-hard<\/td>\n

<\/p>\n

Vincent Berry, Celine Scornavacca and Mathias Weller<\/td>\n

<\/tr>\n

<\/p>\n

POI Recommendation based on Locality-specific Seasonality and Long-term Trends<\/td>\n

<\/p>\n

Elena Stefancova and Ivan Srba<\/td>\n

<\/tr>\n

<\/p>\n

On the Average State Complexity of Partial Derivative Transducers<\/td>\n

<\/p>\n

Stavros Konstantinidis, Ant\u00f3nio Machiavelo, Nelma Moreira and Rog\u00e9rio Reis<\/td>\n

<\/tr>\n

<\/p>\n

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window<\/td>\n

<\/p>\n

Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda<\/td>\n

<\/tr>\n

<\/p>\n

A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity<\/td>\n

<\/p>\n

Thomas Erlebach and Jakob Spooner<\/td>\n

<\/tr>\n

<\/p>\n

An Extension of Linear-size Suffix Tries for Parameterized Strings<\/td>\n

<\/p>\n

Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara<\/td>\n

<\/tr>\n

<\/p>\n

The order type of scattered context-free orderings of rank one is computable<\/td>\n

<\/p>\n

Kitti Gelle and Szabolcs Ivan<\/td>\n

<\/tr>\n

<\/p>\n

Approximating Weighted Completion Time for Order Scheduling with Setup Times<\/td>\n

<\/p>\n

Simon Pukrop, Alexander M\u00e4cker and Friedhelm Meyer Auf der Heide<\/td>\n

<\/tr>\n

<\/p>\n

AOBA: An Online Benchmark tool for Algorithms in stringology<\/td>\n

<\/p>\n

Ryu Wakimoto, Satoshi Kobayashi, Yuki Igarashi, Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara<\/td>\n

<\/tr>\n

<\/p>\n

A Light-weight Tool for the Self-Assessment of Security Compliance in Software Development \u2013 An Industry Case<\/td>\n

<\/p>\n

Fabiola Moy\u00f3n, Christoph Bayr, Daniel Mendez, Sebastian D\u00e4nnart and Kristian Beckers<\/td>\n

<\/tr>\n

<\/p>\n

Online scheduling with machine cost and a quadratic objective function<\/td>\n

<\/p>\n

Janos Csirik, Gyorgy Dosa and David Koszo<\/td>\n

<\/tr>\n

<\/p>\n

A Characterization of The Context-Free Languages by Stateless Ordered Restart-Delete Automata<\/td>\n

<\/p>\n

Friedrich Otto<\/td>\n

<\/tr>\n

<\/p>\n

PointNet with Spin Images<\/td>\n

<\/p>\n

Jakub St\u0159elsk\u00fd<\/td>\n

<\/tr>\n

<\/p>\n

Simple Distributed Spanners in Dense Congest Networks<\/td>\n

<\/p>\n

Leonid Barenboim and Tzalik Maimon<\/td>\n

<\/tr>\n

<\/p>\n

Linearizing Genomes: Exact Methods and Local Search<\/td>\n

<\/p>\n

Tom Davot, Annie Chateau, Rodolphe Giroudeau and Mathias Weller<\/td>\n

<\/tr>\n

<\/p>\n

Fast Indexes for Gapped Pattern Matching<\/td>\n

<\/p>\n

Manuel Caceres, Simon Puglisi and Bella Zhukova<\/td>\n

<\/tr>\n

<\/p>\n

Parallel duel-and-sweep algorithm for the order-preserving pattern matching<\/td>\n

<\/p>\n

Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara<\/td>\n

<\/tr>\n

<\/p>\n

Faster STR-EC-LCS Computation<\/td>\n

<\/p>\n

Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda<\/td>\n

<\/tr>\n

<\/p>\n

Vietnamese Punctuation Prediction Using Deep Neural Networks<\/td>\n

<\/p>\n

Thuy Pham, Thao Nhu Nguyen, Quang Pham, Ky Han Cao and Binh Thanh Nguyen<\/td>\n

<\/tr>\n

<\/p>\n

Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing<\/td>\n

<\/p>\n

Nader Bshouty, Catherine Haddad-Zaknoon and George Haddad<\/td>\n

<\/tr>\n

<\/p>\n

A novel hybrid genetic algorithm for the two-stage transportation problem with fixed charges associated to the routes<\/td>\n

<\/p>\n

Ovidiu Cosma, Petrica Pop and Cosmin Sabo<\/td>\n

<\/tr>\n

<\/p>\n

The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps<\/td>\n

<\/p>\n

Radu-Stefan Mincu and Alexandru Popa<\/td>\n

<\/tr>\n

<\/p>\n

Crowd Detection for Drone Safe Landing through Fully-Convolutional Neural Networks<\/td>\n

<\/p>\n

Giovanna Castellano, Ciro Castiello, Corrado Mencar and Gennaro Vessio<\/td>\n

<\/tr>\n

<\/p>\n

On the Difference Between Finite-State and Pushdown Depth<\/td>\n

<\/p>\n

Liam Jordon and Philippe Moser<\/td>\n

<\/tr>\n

<\/p>\n

A Constructive Arboricity Approximation Scheme<\/td>\n

<\/p>\n

Markus Blumenstock and Frank Fischer<\/td>\n

<\/tr>\n

<\/p>\n

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs<\/td>\n

<\/p>\n

Nils Morawietz, Niels Gr\u00fcttemeier, Christian Komusiewicz and Frank Sommer<\/td>\n

<\/tr>\n

<\/p>\n

Approximating Sorting by Reversals for Trees<\/td>\n

<\/p>\n

Nicolas Bousquet and Alice Joffard<\/td>\n

<\/tr>\n

<\/p>\n

Kernels of Sub-Classes of Context-Free Languages<\/td>\n

<\/p>\n

Martin Kutrib<\/td>\n

<\/tr>\n

<\/p>\n

String Representations of Java Objects: An Empirical Study<\/td>\n

<\/p>\n

Mat\u00fa\u0161 Sul\u00edr<\/td>\n

<\/tr>\n

<\/p>\n

Up-to Techniques for Branching Bisimilarity<\/td>\n

<\/p>\n

Rick Erkens, Jurriaan Rot and Bas Luttik<\/td>\n

<\/tr>\n

<\/p>\n

Parameterized Dynamic Variants of Red-Blue Dominating Set<\/td>\n

<\/p>\n

Faisal Abu-Khzam, Cristina Bazgan and Henning Fernau<\/td>\n

<\/tr>\n

<\/p>\n

Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs<\/td>\n

<\/p>\n

Shahin Kamali, Avery Miller and Kenny Zhang<\/td>\n

<\/tr>\n

<\/p>\n

Maintainability of automatic acceptance tests for web applications – A case study comparing two approaches to organizing code of test cases<\/td>\n

<\/p>\n

Aleksander Sadaj, Sylwia Kopczy\u0144ska, Jerzy Nawrocki and Miros\u0142aw Ochodek<\/td>\n

<\/tr>\n

<\/p>\n

Parameterized complexity of synthesizing b-bounded (m,n)-T-systems<\/td>\n

<\/p>\n

Ronny Tredup<\/td>\n

<\/tr>\n

<\/p>\n

Employing Costs in Multiagent Systems with Timed Migration and Timed Communication<\/td>\n

<\/p>\n

Bogdan Aman and Gabriel Ciobanu<\/td>\n

<\/tr>\n

<\/p>\n

Selection of Green Logical Data Warehouse Schema by Anti-Monotonicity Constraint<\/td>\n

<\/p>\n

Issam Ghabri, Ladjel Bellatreche and Sadok Ben Yahia<\/td>\n

<\/tr>\n

<\/p>\n

Towards the named Entity Recognition Methods in biomedical field<\/td>\n

<\/p>\n

Anna \u015aniegula, Aneta Poniszewska-Maranda and \u0141ukasz Chom\u0105tek<\/td>\n

<\/tr>\n

<\/p>\n

Inferring Deterministic Regular Expression with Unorder<\/td>\n

<\/p>\n

Xiaofan Wang<\/td>\n

<\/tr>\n

<\/p>\n

<\/td>\n

<\/p>\n

<\/td>\n

<\/tr>\n

<\/p>\n

 <\/td>\n

<\/tr>\n

<\/p>\n

\n
SHORT PAPERS<\/strong><\/h5>\n<\/td>\n

<\/tr>\n

<\/p>\n

Title<\/strong><\/td>\n

<\/p>\n

Authors<\/strong><\/td>\n

<\/tr>\n

<\/p>\n

Practical Implementation of a Quantum Backtracking Algorithm<\/td>\n

<\/p>\n

Maxime Remaud and Simon Martiel<\/td>\n

<\/tr>\n

<\/p>\n

GRaCe: a Relaxed Approach for Graph Query Caching<\/td>\n

<\/p>\n

Francesco De Fino, Barbara Catania and Giovanna Guerrini<\/td>\n

<\/tr>\n

<\/p>\n

Connecting Galaxies: Bridging the Gap between Databases and Applications<\/td>\n

<\/p>\n

Henrietta Dombrovskaya, Boris Novikov and Jeff Czaplewski<\/td>\n

<\/tr>\n

<\/p>\n

Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points<\/td>\n

<\/p>\n

Bardia Hamedmohseni, Zahed Rahmati and Debajyoti Mondal<\/td>\n

<\/tr>\n

<\/p>\n

Counting infinitely by oritatami co-transcriptional folding<\/td>\n

<\/p>\n

Kohei Maruyama and Shinnosuke Seki<\/td>\n

<\/tr>\n

<\/p>\n

Does live regression testing help?<\/td>\n

<\/p>\n

Karol R\u00e1sto\u010dn\u00fd and Marek Bruchat\u00fd<\/td>\n

<\/tr>\n

<\/p>\n

Simultaneous FPQ-Ordering and Hybrid Planarity Testing<\/td>\n

<\/p>\n

Giuseppe Liotta, Ignaz Rutter and Alessandra Tappini<\/td>\n

<\/tr>\n

<\/p>\n

Modelling of the Fake Posting Recognition in On-line Media using Machine Learning<\/td>\n

<\/p>\n

Kristina Machova, Gabriela Demkova and Marian Mach<\/td>\n

<\/tr>\n

<\/p>\n

Computing Directed Steiner Path Covers for Directed Co-Graphs<\/td>\n

<\/p>\n

Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann and Egon Wanke<\/td>\n

<\/tr>\n

<\/p>\n

On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching<\/td>\n

<\/p>\n

\u0160t\u011bp\u00e1n Plach\u00fd and Jan Janousek<\/td>\n

<\/tr>\n

<\/p>\n

A New Heuristic to Find Overlapping Dense Subgraphs in Biological Networks<\/td>\n

<\/p>\n

Mohammad Mehdi Hosseinzadeh<\/td>\n

<\/tr>\n

<\/p>\n

A Calculus for Language Transformations<\/td>\n

<\/p>\n

Benjamin Mourad and Matteo Cimini<\/td>\n

<\/tr>\n

<\/p>\n

Two-step Memory Networks for Deep Semantic Parsing of Geometry Word Problems<\/td>\n

<\/p>\n

Ishadi Jayasinghe and Surangika Ranathunga<\/td>\n

<\/tr>\n

<\/p>\n

Two-player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium<\/td>\n

<\/p>\n

Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono and Ryogo Yamaguchi<\/td>\n

<\/tr>\n

<\/p>\n

A case study on a hybrid approach to assessing the maturity of Requirements Engineering practices in agile projects (REMMA)<\/td>\n

<\/p>\n

Miros\u0142aw Ochodek, Sylwia Kopczy\u0144ska and Jerzy Nawrocki<\/td>\n

<\/tr>\n

<\/p>\n

Automatic Text Generation in Slovak Language<\/td>\n

<\/p>\n

Dominik Vasko, Samuel Pec\u00e1r and Mari\u00e1n \u0160imko<\/td>\n

<\/tr>\n

<\/p>\n

On the Hardness of Energy Minimisation for Crystal Structure Prediction<\/td>\n

<\/p>\n

Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev and Igor Potapov<\/td>\n

<\/tr>\n

<\/table>\n

[\/et_pb_code][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"

Accepted Papers<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":""},"_links":{"self":[{"href":"https:\/\/cyprusconferences.org\/sofsem2020\/wp-json\/wp\/v2\/pages\/512"}],"collection":[{"href":"https:\/\/cyprusconferences.org\/sofsem2020\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/cyprusconferences.org\/sofsem2020\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/cyprusconferences.org\/sofsem2020\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/cyprusconferences.org\/sofsem2020\/wp-json\/wp\/v2\/comments?post=512"}],"version-history":[{"count":2,"href":"https:\/\/cyprusconferences.org\/sofsem2020\/wp-json\/wp\/v2\/pages\/512\/revisions"}],"predecessor-version":[{"id":515,"href":"https:\/\/cyprusconferences.org\/sofsem2020\/wp-json\/wp\/v2\/pages\/512\/revisions\/515"}],"wp:attachment":[{"href":"https:\/\/cyprusconferences.org\/sofsem2020\/wp-json\/wp\/v2\/media?parent=512"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}