Остановите войну!
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 58 matches
- 2005
- Marcos R. Q. de Andrade, Paulo M. F. de Andrade, Simone L. Martins, Alexandre Plastino:
GRASP with Path-Relinking for the Maximum Diversity Problem. WEA 2005: 558-569 - Maria I. Andreou, Vicky G. Papadopoulou, Paul G. Spirakis, B. Theodorides, Andreas Xeros:
Generating and Radiocoloring Families of Perfect Graphs. WEA 2005: 302-314 - Eyjolfur Ingi Asgeirsson, Clifford Stein:
Vertex Cover Approximations: Experiments and Observations. WEA 2005: 545-557 - Emgad H. Bachoore, Hans L. Bodlaender:
New Upper Bound Heuristics for Treewidth. WEA 2005: 216-227 - David A. Bader:
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology. WEA 2005: 16-21 - Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir:
A General Buffer Scheme for the Windows Scheduling Problem. WEA 2005: 139-151 - Hannah Bast, Ingmar Weber:
Don't Compare Averages. WEA 2005: 67-76 - Bernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer:
BDDs in a Branch and Cut Framework. WEA 2005: 452-463 - Henk Bekker, E. P. Braad, Boris Goldengorin:
Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching. WEA 2005: 610-613 - Yvonne Bleischwitz, Georg Kliewer:
Accelerating Vickrey Payment Computation in Combinatorial Auctions for an Airline Alliance. WEA 2005: 228-239 - Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani:
A Practical Minimal Perfect Hashing Method. WEA 2005: 488-500 - Dalila Boughaci, Habiba Drias:
Efficient and Experimental Meta-heuristics for MAX-SAT Problems. WEA 2005: 501-512 - Azzedine Boukerche, Jeferson G. Koch, Alba Cristina Magalhaes Alves de Melo:
Integrating Coordinated Checkpointing and Recovery Mechanisms into DSM Synchronization Barriers. WEA 2005: 403-414 - Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio Ayala-Rincón, Thomas Mailleux Santana:
Parallel Smith-Waterman Algorithm for Local DNA Comparison in a Cluster of Workstations. WEA 2005: 464-475 - Domenico Cantone, Salvatore Cristofaro, Simone Faro:
An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences. WEA 2005: 428-439 - Domenico Cantone, Alfredo Ferro, Rosalba Giugno, Giuseppe Lo Presti, Alfredo Pulvirenti:
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces. WEA 2005: 265-276 - Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, Bradley Huffaker, Kimberly C. Claffy, George F. Riley:
Inferring AS Relationships: Dead End or Lively Beginning? WEA 2005: 113-125 - Amr Elmasry, Abdelrahman Hammad:
An Empirical Study for Inversions-Sensitive Sorting Algorithms. WEA 2005: 597-601 - Torsten Fahle, Karsten Tiemann:
An Improved Branch-and-Bound Algorithm for the Test Cover Problem. WEA 2005: 89-100 - Eraldo L. R. Fernandes, Celso C. Ribeiro:
Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization. WEA 2005: 4-15 - Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. WEA 2005: 367-379 - Michele Flammini, Alfredo Navarra, Stéphane Pérennes:
The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting. WEA 2005: 22-31 - Anna Gambin, Damian Wójtowicz:
Almost FPRAS for Lattice Models of Protein Folding. WEA 2005: 534-544 - George F. Georgakopoulos:
How to Splay for loglog N-Competitiveness. WEA 2005: 570-579 - Filippo Geraci, Roberto Grossi:
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms. WEA 2005: 580-592 - Mark K. Goldberg, David L. Hollinger, Malik Magdon-Ismail:
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs. WEA 2005: 513-523 - Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich Theodor Vierhaus, Pawel Wlaz:
Synchronization Fault Cryptanalysis for Breaking A5/1. WEA 2005: 415-427 - Refael Hassin, Danny Segev:
Rounding to an Integral Program. WEA 2005: 44-54 - Laura Heinrich-Litan, Marco E. Lübbecke:
Rectangle Covers Revisited Computationally. WEA 2005: 55-66 - Falk Hüffner:
Algorithm Engineering for Optimal Graph Bipartization. WEA 2005: 240-252
skipping 28 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 05: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