Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 49 matches
- 2018
- Clemens Hoffmann, Hendrik Molter, Manuel Sorge:
The Parameterized Complexity of Centrality Improvement in Networks. SOFSEM 2018: 111-124 - Safa Abdellatif, Mohamed Ali Ben Hassine, Sadok Ben Yahia, Amel Bouzeghoub:
ARCID: A New Approach to Deal with Imbalanced Datasets Classification. SOFSEM 2018: 569-580 - Farid M. Ablayev, Andris Ambainis, Kamil Khadiev, Aliya Khadieva:
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test. SOFSEM 2018: 197-211 - Hayam Alamro, Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Mismatches and Applications. SOFSEM 2018: 636-649 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Encoding Pictures with Maximal Codes of Pictures. SOFSEM 2018: 552-565 - Maxim A. Babenko, Ignat I. Kolesnichenko:
External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs. SOFSEM 2018: 295-304 - Harald Beck, Minh Dao-Tran, Thomas Eiter:
LARS: A Logic-Based Framework for Analytic Reasoning over Streams - (Extended Abstract). SOFSEM 2018: 87-93 - Luigi Bellomarini, Georg Gottlob, Andreas Pieris, Emanuel Sallinger:
Swift Logic for Big Data and Knowledge Graphs - Overview of Requirements, Language, and System. SOFSEM 2018: 3-16 - Michele Boreale:
Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE'S. SOFSEM 2018: 442-455 - Manfred Broy:
On Architecture Specification. SOFSEM 2018: 19-39 - Kamil Burda, Daniela Chudá:
Influence of Body Postures on Touch-Based Biometric User Authentication. SOFSEM 2018: 459-468 - Elisabet Burjons, Dennis Komm, Marcel Schöngens:
The k-Server Problem with Advice in d Dimensions and on the Sphere. SOFSEM 2018: 396-409 - Jacques Chabin, Mírian Halfeld Ferrari, Béatrice Markhoff, Thanh Binh Nguyen:
Validating Data from Semantic Web Providers. SOFSEM 2018: 682-695 - Michel R. V. Chaudron, Ana Fernandes-Saez, Regina Hebig, Truong Ho-Quang, Rodi Jolak:
Diversity in UML Modeling Explained: Observations, Classifications and Theorizations. SOFSEM 2018: 47-66 - Huda Chuangpishit, Jurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou, Tomasz Jurdzinski, Evangelos Kranakis:
Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits. SOFSEM 2018: 367-380 - Flavio Corradini, Chiara Muzi, Barbara Re, Lorenzo Rossi, Francesco Tiezzi:
Global vs. Local Semantics of BPMN 2.0 OR-Join. SOFSEM 2018: 321-336 - Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, Euripides Markou:
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. SOFSEM 2018: 381-395 - Peter Damaschke, Alexander Schliep:
An Optimization Problem Related to Bloom Filters with Bit Patterns. SOFSEM 2018: 525-538 - Ioannis Dematis, Eirini D. Karapistoli, Athena Vakali:
Fake Review Detection via Exploitation of Spam Indicators and Reviewer Behavior Characteristics. SOFSEM 2018: 581-595 - David Doty, Shaopeng Zhu:
Computational Complexity of Atomic Chemical Reaction Networks. SOFSEM 2018: 212-226 - Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith:
Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications. SOFSEM 2018: 125-136 - Victor da C. Luna Freire, João Brunet, Jorge C. A. de Figueiredo:
Automatic Decomposition of Java Open Source Pull Requests: A Replication Study. SOFSEM 2018: 255-268 - Barbara Geissmann, Paolo Penna:
Inversions from Sorting with Distance-Based Errors. SOFSEM 2018: 508-522 - Antonia Gogoglou, Theodora Tsikrika, Yannis Manolopoulos:
Network Analysis of the Science of Science: A Case Study in SOFSEM Conference. SOFSEM 2018: 94-108 - Martin Haeusler, Thomas Trojer, Johannes Kessler, Matthias Farwick, Emmanuel Nowakowski, Ruth Breu:
Combining Versioning and Metamodel Evolution in the ChronoSphere Model Repository. SOFSEM 2018: 153-167 - Tim A. Hartmann:
Target Set Selection Parameterized by Clique-Width and Maximum Threshold. SOFSEM 2018: 137-149 - Monika Henzinger:
The State of the Art in Dynamic Graph Algorithms. SOFSEM 2018: 40-44 - Bogumila Hnatkowska, Pawel Woroniecki:
Transformation of OWL2 Property Axioms to Groovy. SOFSEM 2018: 269-282 - Miroslava Hresková, Kristína Machová:
Michiko: Poem Models used in Automated Haiku Poetry Generation. SOFSEM 2018: 469-476 - Yuki Igarashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
New Variants of Pattern Matching with Constants and Variables. SOFSEM 2018: 611-623
skipping 19 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-31 12:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint