Остановите войну!
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 35 matches
- 2012
- Benjamin Albrecht, Volker Heun:
Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns. SEA 2012: 27-38 - Eric Angel, Romain Campigotto, Christian Laforest:
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs. SEA 2012: 39-50 - Annabell Berger, Matthias Müller-Hannemann:
How to Attack the NP-Complete Dag Realization Problem in Practice. SEA 2012: 51-62 - Christina Büsing, Fabio D'Andreagiovanni:
New Results about Multi-band Uncertainty in Robust Optimization. SEA 2012: 63-74 - Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine:
Compact Relaxations for Polynomial Programming Problems. SEA 2012: 75-86 - Alberto Costa, Leo Liberti:
Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal. SEA 2012: 87-98 - Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA 2012: 99-110 - Annalisa D'Andrea, Guido Proietti:
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications. SEA 2012: 111-122 - Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA 2012: 123-134 - Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale:
Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA 2012: 135-147 - Martin Dietzfelbinger, Hendrik Peilke, Michael Rink:
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. SEA 2012: 148-159 - Amr Elmasry, Jyrki Katajainen, Max Stenmark:
Branch Mispredictions Don't Affect Mergesort. SEA 2012: 160-171 - Simone Faro, Thierry Lecroq:
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. SEA 2012: 172-183 - Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu:
Algorithms for Subnetwork Mining in Heterogeneous Networks. SEA 2012: 184-194 - Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi, Federico Santaroni:
Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs. SEA 2012: 195-207 - Giorgos Georgiadis, Marina Papatriantafilou:
Adaptive Distributed b-Matching in Overlays with Preferences. SEA 2012: 208-223 - Stelios Joannou, Rajeev Raman:
Dynamizing Succinct Tree Representations. SEA 2012: 224-235 - Barbara Kempkes, Friedhelm Meyer auf der Heide:
Continuous Local Strategies for Robotic Formation Problems. SEA 2012: 9-17 - Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo:
A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network. SEA 2012: 236-247 - Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh:
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. SEA 2012: 248-259 - Marco E. Lübbecke:
Automatic Decomposition and Branch-and-Price - A Status Report. SEA 2012: 1-8 - Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks. SEA 2012: 260-270 - David F. Manlove, Gregg O'Malley:
Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation. SEA 2012: 271-282 - Farnaz Moradi, Tomas Olovsson, Philippas Tsigas:
An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic. SEA 2012: 283-294 - Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert:
Engineering Efficient Paging Algorithms. SEA 2012: 320-331 - Gonzalo Navarro, Eliana Providel:
Fast, Small, Simple Rank/Select on Bitmaps. SEA 2012: 295-306 - Gonzalo Navarro, Daniel Valenzuela:
Space-Efficient Top-k Document Retrieval. SEA 2012: 307-319 - Vitaly Osipov, Peter Sanders, Christian Schulz:
Engineering Graph Partitioning Algorithms. SEA 2012: 18-26 - Pierre Pesneau, Ruslan Sadykov, François Vanderbeck:
Feasibility Pump Heuristics for Column Generation Approaches. SEA 2012: 332-343 - Michael N. Rice, Vassilis J. Tsotras:
Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems. SEA 2012: 344-355
skipping 5 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-06-06 04:37 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