default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID45th SOFSEM 2019: Nový Smokovec, Slovakia
- Barbara Catania, Rastislav Královic, Jerzy R. Nawrocki, Giovanni Pighizzini:
SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings. Lecture Notes in Computer Science 11376, Springer 2019, ISBN 978-3-030-10800-7 - Uwe Aßmann
, Dominik Grzelak, Johannes Mey, Dmytro Pukhkaiev, René Schöne, Christopher Werner, Georg Püschel:
Cross-Layer Adaptation in Multi-layer Autonomic Systems (Invited Talk). 1-20 - Francesco Bonchi:
Distance-Based Community Search (Invited Talk Extended Abstract). 21-27 - Christos A. Kapoutsis:
Minicomplexity - Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract). 28-38 - Miroslaw Staron:
Action Research in Software Engineering: Metrics' Research Perspective (Invited Talk). 39-49 - Martin Theobald:
From Big Data to Big Knowledge - Large-Scale Information Extraction Based on Statistical Methods (Invited Talk). 50-53 - Indranil Banerjee, Dana Richards, Igor Shinkar:
Sorting Networks on Restricted Topologies. 54-66 - Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. 67-80 - Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
Stable Divisorial Gonality is in NP. 81-93 - Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco:
Coalition Resilient Outcomes in Max k-Cut Games. 94-107 - Milos Chromý, Petr Kucera:
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability. 108-121 - Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On Infinite Prefix Normal Words. 122-135 - Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra:
Priority Scheduling in the Bamboo Garden Trimming Problem. 136-149 - Shantanu Das, Giuseppe Antonio Di Luna, Leszek Antoni Gasieniec:
Patrolling on Dynamic Ring Networks. 150-163 - Shantanu Das, Nikos Giachoudis, Flaminia L. Luccio, Euripides Markou:
Gathering of Robots in a Grid with Mobile Faults. 164-178 - Nils Donselaar:
Probabilistic Parameterized Polynomial Time. 179-191 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On Matrix Ins-Del Systems of Small Sum-Norm. 192-205 - Chong Gao, Taolue Chen, Zhilin Wu:
Separation Logic with Linearly Compositional Inductive Predicates and Set Data Constraints. 206-220 - Manoj Gupta, Hitesh Kumar, Neeldhara Misra:
On the Complexity of Optimal Matching Reconfiguration. 221-233 - Frank Gurski, Carolin Rehs:
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. 234-246 - Lane A. Hemaspaandra, David E. Narváez:
Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption. 247-259 - Michael Kaufmann:
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge. 260-271 - Christian Komusiewicz, Frank Sommer:
Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. 272-284 - Martin Kutrib, Matthias Wendlandt:
Multi-stranded String Assembling Systems. 285-297 - Martin Labaj, Karol Rástocný, Daniela Chudá:
Towards Automatic Comparison of Cloud Service Security Certifications. 298-309 - Vladislav Makarov, Alexander Okhotin:
On the Expressive Power of GF(2)-Grammars. 310-323 - Isela Mendoza, Uéverton S. Souza, Marcos Kalinowski, Ruben Interian, Leonardo Gresta Paulino Murta:
An Efficient Algorithm for Combining Verification and Validation Methods. 324-340 - Neeldhara Misra, Chinmay Sonar:
Robustness Radius for Chamberlin-Courant on Restricted Domains. 341-353 - Roland Molontay, Kitti Varga:
On the Complexity of Color-Avoiding Site and Bond Percolation. 354-367 - Nikolajs Nahimovs:
Lackadaisical Quantum Walks with Multiple Marked Vertices. 368-378 - Hirotaka Ono, Hisato Yamanaka:
A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs. 379-391 - Dorota Osula:
Minimizing the Cost of Team Exploration. 392-405 - Benedek Nagy, Friedrich Otto:
Two-Head Finite-State Acceptors with Translucent Letters. 406-418 - Ali Parsai, Serge Demeyer:
Do Null-Type Mutation Operators Help Prevent Null-Type Faults? 419-434 - Matús Pikuliak, Marián Simko, Mária Bieliková:
Towards Combining Multitask and Multilingual Learning. 435-446 - Martin Raszyk:
On the Size of Logical Automata. 447-460 - Maciej Skorski:
Bayesian Root Cause Analysis by Separable Likelihoods. 461-472 - Sebastiaan B. van Rooij, Johan M. M. van Rooij:
Algorithms and Complexity Results for the Capacitated Vertex Cover Problem. 473-489 - Mahsa Varshosaz, Mohammad Reza Mousavi:
Comparative Expressiveness of Product Line Calculus of Communicating Systems and 1-Selecting Modal Transition Systems. 490-503 - Jouke Witteveen, Ralph Bottesch, Leen Torenvliet:
A Hierarchy of Polynomial Kernels. 504-518 - Tomoyuki Yamakami:
Behavioral Strengths and Weaknesses of Various Models of Limited Automata. 519-530
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-05 21:08 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:
