Остановите войну!
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 51 matches
- 2016
- Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren:
Robust Recoverable Path Using Backup Nodes. SOFSEM 2016: 95-106 - Muhammad Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov:
On Contact Graphs with Cubes and Proportional Boxes. SOFSEM 2016: 107-120 - Muhammad Jawaherul Alam, Stephen G. Kobourov, Debajyoti Mondal:
Orthogonal Layout with Optimal Face Complexity. SOFSEM 2016: 121-133 - Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis:
L-Drawings of Directed Graphs. SOFSEM 2016: 134-147 - Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. SOFSEM 2016: 148-160 - Kfir Barhum, Juraj Hromkovic:
On the Power of Laconic Advice in Communication Complexity. SOFSEM 2016: 161-170 - Roman Barták:
Using Attribute Grammars to Model Nested Workflows with Extra Constraints. SOFSEM 2016: 171-182 - Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
A Natural Counting of Lambda Terms. SOFSEM 2016: 183-194 - Nikolaos Bezirgiannis, Frank S. de Boer:
ABS: A High-Level Modeling Language for Cloud-Aware Programming. SOFSEM 2016: 433-444 - Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice - (Extended Abstract). SOFSEM 2016: 195-207 - Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Subsequence Automata with Default Transitions. SOFSEM 2016: 208-216 - Frank S. de Boer, Stijn de Gouw:
Run-Time Checking Multi-threaded Java Programs. SOFSEM 2016: 217-228 - Gilles Brassard:
Cryptography in a Quantum World. SOFSEM 2016: 3-16 - Elisabet Burjons, Juraj Hromkovic, Xavier Muñoz, Walter Unger:
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). SOFSEM 2016: 229-240 - Veronica Oliveira de Carvalho, Renan de Padua, Solange Oliveira Rezende:
Solving the Problem of Selecting Suitable Objective Measures by Clustering Association Rules Through the Measures Themselves. SOFSEM 2016: 505-517 - Karel Cemus, Tomás Cerný, Lubos Matl, Michael J. Donahoo:
Aspect, Rich, and Anemic Domain Models in Enterprise Information Systems. SOFSEM 2016: 445-456 - Tomás Cerný, Michael J. Donahoo:
Survey on Concern Separation in Service Integration. SOFSEM 2016: 518-531 - Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Pseudoknot-Generating Operation. SOFSEM 2016: 241-252 - Jakub Danek, Premek Brada:
Finding Optimal Compatible Set of Software Components Using Integer Linear Programming. SOFSEM 2016: 457-468 - Maksims Dimitrijevs:
Capabilities of Ultrametric Automata with One, Two, and Three States. SOFSEM 2016: 253-264 - Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke:
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM 2016: 265-276 - Tomás Farkas, Peter Kubán, Mária Lucká:
Effective Parallel Multicore-Optimized K-mers Counting Algorithm. SOFSEM 2016: 469-477 - Ladislav Gallay, Marián Simko:
Utilizing Vector Models for Automatic Text Lemmatization. SOFSEM 2016: 532-543 - Maciej Gazda, Tim A. C. Willemse:
On Parity Game Preorders and the Logic of Matching Plays. SOFSEM 2016: 277-289 - Jan Clemens Gehrke, Klaus Jansen, Stefan Erich Julius Kraft, Jakob Schikowski:
A PTAS for Scheduling Unrelated Machines of Few Different Types. SOFSEM 2016: 290-301 - Adel Hassan, Mourad Oussalah:
Meta-Evolution Style for Software Architecture Evolution. SOFSEM 2016: 478-489 - Sebastian Holtappels, Michael Striewe, Michael Goedicke:
From ESSENCE to Theory Oriented Software Engineering. SOFSEM 2016: 43-50 - Heikki Hyyrö, Shunsuke Inenaga:
Compacting a Dynamic Edit Distance Table by RLE Compression. SOFSEM 2016: 302-313 - Tatsuya Imai, Osamu Watanabe:
Relating Sublinear Space Computability Among Graph Connectivity and Related Problems. SOFSEM 2016: 17-28 - Sanjay Jain, Frank Stephan:
Learning Automatic Families of Languages. SOFSEM 2016: 29-40
skipping 21 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-04-25 02:46 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