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 28 matches
- 2006
- Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons:
Scalable Parallel Algorithms for FPT Problems. Algorithmica 45(3): 269-284 (2006) - Susanne Albers, Tomasz Radzik:
Foreword. Algorithmica 45(1): 1-2 (2006) - Carlos E. R. Alves, Edson Cáceres, Siang Wun Song:
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem. Algorithmica 45(3): 301-335 (2006) - Amihood Amir, Estrella Eisenberg, Ely Porat:
Swap and Mismatch Edit Distance. Algorithmica 45(1): 109-120 (2006) - Yossi Azar, Arik Litichevskey:
Maximizing Throughput in Multi-Queue Switches. Algorithmica 45(1): 69-90 (2006) - René Beier, Berthold Vöcking:
An Experimental Study of Random Knapsack Problems. Algorithmica 45(1): 121-136 (2006) - Mehul Bhatt, Andrew Flahive, Carlo Wouters, J. Wenny Rahayu, David Taniar:
MOVE: A Distributed Framework for Materialized Ontology View Extraction. Algorithmica 45(3): 457-481 (2006) - Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir:
General Perfectly Periodic Scheduling. Algorithmica 45(2): 183-208 (2006) - Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
Direct Routing: Algorithms and Complexity. Algorithmica 45(1): 45-68 (2006) - Geeta Chaudhry, Thomas H. Cormen:
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters. Algorithmica 45(3): 483-508 (2006) - Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Recognizing Hole-Free 4-Map Graphs in Cubic Time. Algorithmica 45(2): 227-262 (2006) - Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45(2): 209-226 (2006) - Joseph Cheriyan, Mohammad R. Salavatipour:
Hardness and Approximation Results for Packing Steiner Trees. Algorithmica 45(1): 21-43 (2006) - Jie Chi, Mehmet Koyutürk, Ananth Grama:
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets. Algorithmica 45(3): 377-401 (2006) - James Chilson, Raymond T. Ng, Alan Wagner, Ruben H. Zamar:
Parallel Computation of High-Dimensional Robust Correlation and Covariance Matrices. Algorithmica 45(3): 403-431 (2006) - Frank K. H. A. Dehne:
Guest Editor's Introduction. Algorithmica 45(3): 263-267 (2006) - Adrian Driga, Paul Lu, Jonathan Schaeffer, Duane Szafron, Kevin Charter, Ian Parsons:
FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment. Algorithmica 45(3): 337-375 (2006) - Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006) - Michael Elkin, Guy Kortsarz:
An Approximation Algorithm for the Directed Telephone Multicast Problem. Algorithmica 45(4): 569-583 (2006) - Rudolf Fleischer, Mordecai J. Golin, Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line. Algorithmica 45(4): 549-567 (2006) - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) - Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan:
Data Migration on Parallel Disks: Algorithms and Evaluation. Algorithmica 45(1): 137-158 (2006) - Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45(4): 585-614 (2006) - Daniel J. Harvey, Sajal K. Das, Rupak Biswas:
Design and Performance of a Heterogeneous Grid Partitioner. Algorithmica 45(3): 509-530 (2006) - Thomas M. Keane, Andrew J. Page, Thomas J. Naughton, Simon A. A. Travers, James O. McInerney:
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines. Algorithmica 45(3): 285-300 (2006) - Marc J. van Kreveld, A. Frank van der Stappen:
Approximate Unions of Lines and Minkowski Sums. Algorithmica 45(1): 91-107 (2006) - Marcin Mucha, Piotr Sankowski:
Maximum Matchings in Planar Graphs via Gaussian Elimination. Algorithmica 45(1): 3-20 (2006) - Jerffeson Teixeira de Souza, Stan Matwin, Nathalie Japkowicz:
Parallelizing Feature Selection. Algorithmica 45(3): 433-456 (2006)
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-09-28 16:22 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