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 23 matches
- 2008
- Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction. Algorithmica 51(2): 160-182 (2008) - Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag:
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. Algorithmica 51(2): 129-159 (2008) - Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
Treewidth Lower Bounds with Brambles. Algorithmica 51(1): 81-98 (2008) - Christian Boulinier, Franck Petit, Vincent Villain:
Synchronous vs. Asynchronous Unison. Algorithmica 51(1): 61-80 (2008) - Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Tight Results on Minimum Entropy Set Cover. Algorithmica 51(1): 49-60 (2008) - Zhi-Zhong Chen:
Approximation Algorithms for Bounded Degree Phylogenetic Roots. Algorithmica 51(1): 1-23 (2008) - Camil Demetrescu, Giuseppe F. Italiano:
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. Algorithmica 51(4): 387-427 (2008) - Xiaotie Deng, Ding-Zhu Du:
Preface. Algorithmica 51(3): 237-238 (2008) - Jianxi Fan, Xiaohua Jia, Xiaola Lin:
Embedding of Cycles in Twisted Cubes with Edge-Pancyclic. Algorithmica 51(3): 264-282 (2008) - Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica 51(2): 183-199 (2008) - Bernd Gärtner, Walter D. Morris Jr., Leo Rüst:
Unique Sink Orientations of Grids. Algorithmica 51(2): 200-235 (2008) - Shirley Halevy, Eyal Kushilevitz:
Distribution-Free Connectivity Testing for Sparse Graphs. Algorithmica 51(1): 24-48 (2008) - Yijie Han:
An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path. Algorithmica 51(4): 428-434 (2008) - Li-Sha Huang:
A Primal-Dual Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions. Algorithmica 51(3): 357-366 (2008) - Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. Algorithmica 51(3): 342-356 (2008) - Wojciech Jawor, Marek Chrobak, Christoph Dürr:
Competitive Analysis of Scheduling Algorithms for Aggregated Links. Algorithmica 51(4): 367-386 (2008) - Iyad A. Kanj, Luay Nakhleh, Ge Xia:
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51(2): 99-128 (2008) - Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51(3): 239-263 (2008) - Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong:
Improved Approximate String Matching Using Compressed Suffix Data Structures. Algorithmica 51(3): 298-314 (2008) - Guojun Li, Zhijie Liu, Jun-tao Guo, Ying Xu:
An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing. Algorithmica 51(4): 435-450 (2008) - Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis:
A Network Game with Attackers and a Defender. Algorithmica 51(3): 315-341 (2008) - Natalia V. Shakhlevich, Vitaly A. Strusevich:
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. Algorithmica 51(4): 451-473 (2008) - Lusheng Wang, Kaizhong Zhang:
Space Efficient Algorithms for Ordered Tree Comparison. Algorithmica 51(3): 283-297 (2008)
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-10-04 04:35 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