Остановите войну!
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 45 matches
- 2021
- Florian Auer, Michael Felderer:
An Infrastructure for Platform-Independent Experimentation of Software Changes. SOFSEM 2021: 445-457 - Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted Microscopic Image Reconstruction. SOFSEM 2021: 373-386 - Bahar Ghadiri Bashardoost, Kelly A. Lyons, Renée J. Miller:
Towards Knowledge Exchange: State-of-the-Art and Open Problems. SOFSEM 2021: 13-27 - Firas Bayram, Davide Garbarino, Annalisa Barla:
Predicting Tennis Match Outcomes with Network Analysis and Machine Learning. SOFSEM 2021: 505-518 - Sebastian Berndt, Klaus Jansen, Alexandra Lassota:
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. SOFSEM 2021: 349-360 - Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg:
Balanced Independent and Dominating Sets on Colored Interval Graphs. SOFSEM 2021: 89-103 - Sara Bonfitto, Luca Cappelletti, Fabrizio Trovato, Giorgio Valentini, Marco Mesiti:
Semi-automatic Column Type Inference for CSV Table Understanding. SOFSEM 2021: 535-549 - Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené:
Complexity of Limit-Cycle Problems in Boolean Networks. SOFSEM 2021: 135-146 - Guido Brückner, Vera Chekan:
Drawing Two Posets. SOFSEM 2021: 410-420 - Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz:
Sorting by Multi-cut Rearrangements. SOFSEM 2021: 593-607 - 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. SOFSEM 2021: 519-534 - Ferdinando Cicalese, Massimiliano Rossi:
On the Redundancy of D-Ary Fano Codes. SOFSEM 2021: 263-277 - Yuriy Dementiev, Artur Ignatiev, Vyacheslav Sidelnik, Alexander Smal, Mikhail Ushakov:
New Bounds on the Half-Duplex Communication Complexity. SOFSEM 2021: 233-248 - Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Hierarchical b-Matching. SOFSEM 2021: 189-202 - Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. SOFSEM 2021: 608-622 - Thomas Erlebach:
Algorithms that Access the Input via Queries. SOFSEM 2021: 3-12 - Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots: Single Chains. SOFSEM 2021: 400-409 - Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio:
Distance Hedonic Games. SOFSEM 2021: 159-174 - Pamela Fleischmann, Lukas Haschke, Florin Manea, Dirk Nowotka, Cedric Tsatia Tsida, Judith Wiedenbeck:
Blocksequences of k-local Words. SOFSEM 2021: 119-134 - Fabian Frank, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff:
Using the Metro-Map Metaphor for Drawing Hypergraphs. SOFSEM 2021: 361-372 - Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
The Balanced Satisfactory Partition Problem. SOFSEM 2021: 322-336 - 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. SOFSEM 2021: 249-262 - Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Independent Sets in Interval and Segment Intersection Graphs. SOFSEM 2021: 175-188 - Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh:
Parameterized Complexity of d-Hitting Set with Quotas. SOFSEM 2021: 293-307 - Khaled Jawhar, Evangelos Kranakis:
Bike Assisted Evacuation on a Line. SOFSEM 2021: 104-118 - Liam Jordon, Philippe Moser:
A Normal Sequence Compressed by PPM* But Not by Lempel-Ziv 78. SOFSEM 2021: 389-399 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM 2021: 218-232 - Yaxiong Liu, Kohei Hatano, Eiji Takimoto:
Improved Algorithms for Online Load Balancing. SOFSEM 2021: 203-217 - Imen Megdiche, Franck Ravat, Yan Zhao:
Metadata Management on Data Processing in Data Lakes. SOFSEM 2021: 553-562 - Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
On the Terminal Connection Problem. SOFSEM 2021: 278-292
skipping 15 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-28 17:50 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