default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID46th SOFSEM 2020: Limassol, Cyprus
- Alexander Chatzigeorgiou
, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora:
SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings. Lecture Notes in Computer Science 12011, Springer 2020, ISBN 978-3-030-38918-5
Invited Papers
- Ernesto Damiani, Claudio A. Ardagna:
Certified Machine-Learning Models. 3-15 - Gunnar W. Klau:
The Lost Recipes from the Four Schools of Amathus. 16-23 - Erol Gelenbe, Yunxiao Zhang:
Sharing Energy for Optimal Edge Performance. 24-36
Foundations of Computer Science - Regular Papers
- Friedrich Otto:
A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata. 39-50 - Markus Blumenstock, Frank Fischer:
A Constructive Arboricity Approximation Scheme. 51-63 - Thomas Erlebach, Jakob T. Spooner:
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. 64-75 - Nicolas Bousquet, Alice Joffard:
Approximating Shortest Connected Graph Transformation for Trees. 76-87 - Alexander Mäcker, Friedhelm Meyer auf der Heide, Simon Pukrop:
Approximating Weighted Completion Time for Order Scheduling with Setup Times. 88-100 - Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon:
Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing. 101-112 - Shahin Kamali, Avery Miller, Kenny Zhang:
Burning Two Worlds. 113-124 - Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. 125-135 - Martin Kutrib:
Kernels of Sub-classes of Context-Free Languages. 136-147 - Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. 148-160 - Rachel Faran, Orna Kupferman:
On Synthesis of Specifications with Arithmetic. 161-173 - Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average State Complexity of Partial Derivative Transducers. 174-186 - Liam Jordon, Philippe Moser:
On the Difference Between Finite-State and Pushdown Depth. 187-198 - János Csirik, György Dósa, Dávid Kószó:
Online Scheduling with Machine Cost and a Quadratic Objective Function. 199-210 - Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching. 211-222 - Ronny Tredup:
Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems. 223-235 - Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau:
Parameterized Dynamic Variants of Red-Blue Dominating Set. 236-247 - Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. 248-259 - Leonid Barenboim, Tzalik Maimon:
Simple Distributed Spanners in Dense Congest Networks. 260-272 - Kitti Gelle, Szabolcs Iván:
The Order Type of Scattered Context-Free Orderings of Rank One Is Computable. 273-284 - Rick Erkens, Jurriaan Rot, Bas Luttik:
Up-to Techniques for Branching Bisimilarity. 285-297
Foundations of Data Science and Engineering - Regular Papers
- Giovanna Castellano, Ciro Castiello, Corrado Mencar, Gennaro Vessio:
Crowd Detection for Drone Safe Landing Through Fully-Convolutional Neural Networks. 301-312 - Gabriel Ferrettini, Julien Aligon, Chantal Soulé-Dupuy:
Explaining Single Predictions: A Faster Method. 313-324 - Xiaofan Wang, Haiming Chen:
Inferring Deterministic Regular Expression with Unorder. 325-337 - Elena Stefancova, Ivan Srba:
POI Recommendation Based on Locality-Specific Seasonality and Long-Term Trends. 338-349 - Issam Ghabri, Ladjel Bellatreche, Sadok Ben Yahia:
Selection of a Green Logical Data Warehouse Schema by Anti-monotonicity Constraint. 350-361 - Xavier Ouvrard, Jean-Marie Le Goff, Stéphane Marchand-Maillet:
The HyperBagGraph DataEdron: An Enriched Browsing Experience of Datasets. 362-374 - Anna Sniegula, Aneta Poniszewska-Maranda, Lukasz Chomatek:
Towards the Named Entity Recognition Methods in Biomedical Field. 375-387 - Thuy Pham, Nhu Nguyen, Quang Pham, Han Cao, Binh T. Nguyen:
Vietnamese Punctuation Prediction Using Deep Neural Networks. 388-400
Foundations of Software Engineering - Regular Papers
- Fabiola Moyón Constante, Christoph Bayr, Daniel Méndez Fernández, Sebastian Dännart, Kristian Beckers:
A Light-Weight Tool for the Self-assessment of Security Compliance in Software Development - An Industry Case. 403-416 - Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo:
A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes. 417-428 - Aggelos Papamichail, Apostolos V. Zarras, Panos Vassiliadis:
Do People Use Naming Conventions in SQL Programming? 429-440 - Bogdan Aman, Gabriel Ciobanu:
Employing Costs in Multiagent Systems with Timed Migration and Timed Communication. 441-453 - Aleksander Sadaj, Miroslaw Ochodek, Sylwia Kopczynska, Jerzy R. Nawrocki:
Maintainability of Automatic Acceptance Tests for Web Applications - A Case Study Comparing Two Approaches to Organizing Code of Test Cases. 454-466 - Theofanis Vartziotis, Apostolos V. Zarras, Anastasios Tsimakis, Panos Vassiliadis:
Recommending Trips in the Archipelago of Refactorings. 467-478 - Matús Sulír:
String Representations of Java Objects: An Empirical Study. 479-490
Foundations of Algorithmic Computational Biology - Regular Papers
- Manuel Cáceres, Simon J. Puglisi, Bella Zhukova:
Fast Indexes for Gapped Pattern Matching. 493-504 - Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Linearizing Genomes: Exact Methods and Local Search. 505-518 - Vincent Berry, Céline Scornavacca, Mathias Weller:
Scanning Phylogenetic Networks Is NP-hard. 519-530 - Radu Stefan Mincu, Alexandru Popa:
The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps. 531-543
Foundations of Computer Science - Short Papers
- Benjamin Mourad, Matteo Cimini:
A Calculus for Language Transformations. 547-555 - Frank Gurski, Stefan Hoffmann, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). 556-565 - Kohei Maruyama, Shinnosuke Seki:
Counting Infinitely by Oritatami Co-transcriptional Folding. 566-575 - Stepán Plachý, Jan Janousek:
On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching. 576-586 - Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. 587-596 - Simon Martiel, Maxime Remaud:
Practical Implementation of a Quantum Backtracking Algorithm. 597-606 - Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal:
Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points. 607-616 - Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. 617-626 - Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi:
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. 627-635
Foundations of Data Science and Engineering - Short Papers
- Dominik Vasko, Samuel Pecar, Marián Simko:
Automatic Text Generation in Slovak Language. 639-647 - Henrietta Dombrovskaya, Jeff Czaplewski, Boris Novikov:
Connecting Galaxies: Bridging the Gap Between Databases and Applications. 648-656 - Francesco De Fino, Barbara Catania, Giovanna Guerrini:
GRaCe: A Relaxed Approach for Graph Query Caching. 657-666 - Kristína Machová, Marián Mach, Gabriela Demková:
Modelling of the Fake Posting Recognition in On-Line Media Using Machine Learning. 667-675 - Ishadi Jayasinghe, Surangika Ranathunga:
Two-Step Memory Networks for Deep Semantic Parsing of Geometry Word Problems. 676-685
Foundations of Software Engineering - Short Papers
- Miroslaw Ochodek, Sylwia Kopczynska, Jerzy R. Nawrocki:
A Case Study on a Hybrid Approach to Assessing the Maturity of Requirements Engineering Practices in Agile Projects (REMMA). 689-698 - Marek Bruchatý, Karol Rástocný:
Does Live Regression Testing Help? 699-707
Foundations of Algorithmic Computational Biology - Short Paper
- Mohammad Mehdi Hosseinzadeh:
Dense Subgraphs in Biological Networks. 711-719
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-24 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
