SOFSEM
unibz
47th International Conference on Current Trends in Theory and Practice of Computer Science    Bolzano-Bozen, Italy    January 25 - 28, 2021

Accepted Papers


Foundations of Computer Science (Full Papers)
  • Amnesiac Flooding: Synchronous Stateless Information Dissemination
    Volker Turau
  • Asymptotic Approximation by Regular Languages
    Ryoma Sin'ya
  • Balanced Independent and Dominating Sets on Colored Interval Graphs
    Sujoy Bhore and Jan-Henrik Haunert and Fabian Klute and Guangping Li and Martin Nöllenburg
  • Bike Assisted Evacuation on a Line
    Khaled Jawhar and Evangelos Kranakis
  • Blocksequences of k-local Words
    Pamela Fleischmann and Lukas Haschke and Florin Manea and Dirk Nowotka and Cedric Tsatia Tsida and Judith Wiedenbeck
  • Complexity of limit-cycle problems in Boolean networks
    Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot and Sylvain Sené
  • Concatenation Operations and Restricted Variants of Two-Dimensional Automata
    Taylor J. Smith and Kai Salomaa
  • Distance Hedonic Games
    Michele Flammini and Bojana Kodric and Martin Olsen and Giovanna Varricchio
  • Distributed Independent Set in Interval and Segment Intersection Graphs
    Barun Gorain and Kaushik Mondal and Supantha Pandit
  • Hierarchical b-Matching
    Yuval Emek and Shay Kutten and Mordechai Shalom and Shmuel Zaks
  • Improved algorithms for online load balancing
    Yaxiong Liu and Kohei Hatano and Eiji Takimoto
  • Iterated Uniform Finite-State Transducers on Unary Languages
    Martin Kutrib and Andreas Malcher and Carlo Mereghetti and Beatrice Palano
  • New bounds on the half-duplex communication complexity
    Yuriy Dementiev and Artur Ignatiev and Vyacheslav Sidelnik and Alexander Smal and Mikhail Ushakov
  • Novel Results on the Number of Runs of the Burrows-Wheeler-Transform 1
    Sara Giuliani and Shunsuke Inenaga and Zsuzsanna Lipták and Nicola Prezza and Marinella Sciortino and Anna Toffanello
  • On the Redundancy of D-ary Fano Codes
    Ferdinando Cicalese and Massimiliano Rossi
  • On the Terminal Connection Problem
    Alexsander A. de Melo and Celina M. H. de Figueiredo and Uéverton S. Souza
  • Parameterized Complexity of d-Hitting Set with Quotas
    Sushmita Gupta and Pallavi Jain and Aditya Petety and Sagar Singh
  • Parameterizing Role Coloring on Forests
    Sukanya Pandey and Venkatesh Raman and Vibha Sahlot
  • The Balanced Satisfactory Partition Problem
    Ajinkya Gaikwad and Soumen Maity and Shuvam Kant Tripathi
  • The Multiple Traveling Salesman Problem on Spiders
    Pedro Pérez-Escalona and Ivan Rapaport and José Soto and Ian Vidal
  • Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
    Sebastian Berndt and Klaus Jansen and Alexandra Lassota
  • Using the Metro-Map Metaphor for Drawing Hypergraphs
    Fabian Frank and Michael Kaufmann and Stephen Kobourov and Tamara Mchedlidze and Sergey Pupyrev and Torsten Ueckerdt and Alexander Wolff
  • Weighted Microscopic Image Reconstruction
    Amotz Bar-Noy and Toni Böhnlein and Zvi Lotker and David Peleg and Dror Rawitz
Foundations of Computer Science (Short Papers)
  • A Normal Sequence Compressed by PPM* but not by Lempel-Ziv 78
    Liam Jordon and Philippe Moser
  • Clusters of repetition roots: single chains
    Szilárd Zsolt Fazekas and Robert Mercaş
  • Drawing Two Posets
    Guido Brückner and Vera Chekan
  • Fair Division is Hard even for Amicable Agents
    Neeldhara Misra and Aditi Sethia
  • The Complexity of Flow Expansion and Electrical Flow Expansion
    Dorothea Wagner and Matthias Wolf
Foundations of Software Engineering (Full Papers)
  • An Infrastructure for Platform-Independent Experimentation of Software Changes
    Florian Auer and Michael Felderer
  • Using Process Models to understand Security Standards
    Fabiola Moyón and Daniel Méndez and Kristian Beckers and Sebastian Klepper
  • Web Test Automation: Insights from the Grey Literature
    Filippo Ricca and Andrea Stocco
Foundations of Data Science and Engineering (Full Papers)
  • A Pipeline for Measuring Brand Loyalty through Social Media Mining
    Hazem Samoaa and Barbara Catania
  • Predicting Tennis Match Outcomes With Network Analysis and Machine Learning
    Firas Bayram and Davide Garbarino and Annalisa Barla
  • Role-Based Access Control on Graph Databases
    Jacques Chabin and Cristina D. A. Ciferri and Mirian Halfeld-Ferrari and Carmem S. Hara and Raqueline R. M. Penteado
  • Semi-Automatic Column Type Inference for CSV Table Understanding
    Sara Bonfitto and Luca Cappelletti and Fabrizio Trovato and Giorgio Valentini and Marco Mesiti
Foundations of Data Science and Engineering (Short Papers)
  • Metadata Management on Data Processing in Data Lakes
    Imen Megdiche and Franck Ravat and Yan Zhao
  • S2CFT: A new approach for paper submission recommendation
    Dac Nguyen and Son Huynh and Phong Huynh and Cuong V. Dinh and Binh T. Nguyen
Foundations of Algorithmic Computational Biology (Full Papers)
  • Adding Matrix Control: Insertion-Deletion Systems With Substitutions III
    Martin Vu and Henning Fernau
  • Sorting by Multi-Cut Rearrangements
    Laurent Bulteau and Guillaume Fertin and Géraldine Jean and Christian Komusiewicz
  • Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
    Massimo Equi and Veli Mäkinen and Alexandru I. Tomescu