default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID47th SOFSEM 2021: Bolzano-Bozen, Italy
- Tomás Bures, Riccardo Dondi, Johann Gamper
, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. H. Wong:
SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings. Lecture Notes in Computer Science 12607, Springer 2021, ISBN 978-3-030-67730-5
Invited Papers
- Thomas Erlebach:
Algorithms that Access the Input via Queries. 3-12 - Bahar Ghadiri Bashardoost, Kelly A. Lyons, Renée J. Miller:
Towards Knowledge Exchange: State-of-the-Art and Open Problems. 13-27 - Merav Parter:
Invited Talk: Resilient Distributed Algorithms. 28-42 - Jirí Wiedermann, Jan van Leeuwen:
Towards Minimally Conscious Cyber-Physical Systems: A Manifesto. 43-55
Foundations of Computer Science - Full Papers
- Volker Turau:
Amnesiac Flooding: Synchronous Stateless Information Dissemination. 59-73 - Ryoma Sin'ya:
Asymptotic Approximation by Regular Languages. 74-88 - Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg:
Balanced Independent and Dominating Sets on Colored Interval Graphs. 89-103 - Khaled Jawhar, Evangelos Kranakis:
Bike Assisted Evacuation on a Line. 104-118 - Pamela Fleischmann, Lukas Haschke, Florin Manea, Dirk Nowotka, Cedric Tsatia Tsida, Judith Wiedenbeck:
Blocksequences of k-local Words. 119-134 - Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené:
Complexity of Limit-Cycle Problems in Boolean Networks. 135-146 - Taylor J. Smith, Kai Salomaa:
Concatenation Operations and Restricted Variants of Two-Dimensional Automata. 147-158 - Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio:
Distance Hedonic Games. 159-174 - Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Independent Sets in Interval and Segment Intersection Graphs. 175-188 - Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Hierarchical b-Matching. 189-202 - Yaxiong Liu, Kohei Hatano, Eiji Takimoto:
Improved Algorithms for Online Load Balancing. 203-217 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers on Unary Languages. 218-232 - Yuriy Dementiev, Artur Ignatiev, Vyacheslav Sidelnik, Alexander Smal, Mikhail Ushakov:
New Bounds on the Half-Duplex Communication Complexity. 233-248 - Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. 249-262 - Ferdinando Cicalese, Massimiliano Rossi:
On the Redundancy of D-Ary Fano Codes. 263-277 - Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
On the Terminal Connection Problem. 278-292 - Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh:
Parameterized Complexity of d-Hitting Set with Quotas. 293-307 - Sukanya Pandey, Venkatesh Raman, Vibha Sahlot:
Parameterizing Role Coloring on Forests. 308-321 - Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
The Balanced Satisfactory Partition Problem. 322-336 - Pedro Pérez-Escalona, Ivan Rapaport, José A. Soto, Ian Vidal:
The Multiple Traveling Salesman Problem on Spiders. 337-348 - Sebastian Berndt, Klaus Jansen, Alexandra Lassota:
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. 349-360 - Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff:
Using the Metro-Map Metaphor for Drawing Hypergraphs. 361-372 - Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted Microscopic Image Reconstruction. 373-386
Foundations of Computer Science - Short Papers
- Liam Jordon, Philippe Moser:
A Normal Sequence Compressed by PPM* But Not by Lempel-Ziv 78. 389-399 - Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots: Single Chains. 400-409 - Guido Brückner, Vera Chekan:
Drawing Two Posets. 410-420 - Neeldhara Misra, Aditi Sethia:
Fair Division Is Hard Even for Amicable Agents. 421-430 - Dorothea Wagner, Matthias Wolf:
The Complexity of Flow Expansion and Electrical Flow Expansion. 431-441
Foundations of Software Engineering - Full papers
- Florian Auer, Michael Felderer:
An Infrastructure for Platform-Independent Experimentation of Software Changes. 445-457 - Fabiola Moyon, Daniel Méndez, Kristian Beckers, Sebastian Klepper:
Using Process Models to Understand Security Standards. 458-471 - Filippo Ricca, Andrea Stocco:
Web Test Automation: Insights from the Grey Literature. 472-485
Foundations of Data Science and Engineering - Full Papers
- Hazem Peter Samoaa, Barbara Catania:
A Pipeline for Measuring Brand Loyalty Through Social Media Mining. 489-504 - Firas Bayram, Davide Garbarino, Annalisa Barla:
Predicting Tennis Match Outcomes with Network Analysis and Machine Learning. 505-518 - Jacques Chabin, Cristina Dutra de Aguiar Ciferri, Mirian Halfeld Ferrari Alves, Carmem S. Hara, Raqueline R. M. Penteado:
Role-Based Access Control on Graph Databases. 519-534 - Sara Bonfitto, Luca Cappelletti, Fabrizio Trovato, Giorgio Valentini, Marco Mesiti:
Semi-automatic Column Type Inference for CSV Table Understanding. 535-549
Foundations of Data Science and Engineering - Short Papers
- Imen Megdiche, Franck Ravat, Yan Zhao:
Metadata Management on Data Processing in Data Lakes. 553-562 - Dac H. Nguyen, Son Huynh, Phong Huynh, Dinh V. Cuong, Binh T. Nguyen:
S2CFT: A New Approach for Paper Submission Recommendation. 563-573
Foundations of Algorithmic Computational Biology - Full Papers
- Martin Vu, Henning Fernau:
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. 577-592 - Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz:
Sorting by Multi-cut Rearrangements. 593-607 - Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. 608-622
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 2024-11-19 20:33 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:
