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 78 matches
- 1995
- Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi:
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. COCOON 1995: 161-170 - Roman Bacik, Sanjeev Mahajan:
Semidefinite Programming and its Applications to NP Problems. COCOON 1995: 566-575 - Leqiang Bai, Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakando:
A Broadcasting Algorithm on the Arrangement Graph. COCOON 1995: 462-471 - Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
A Construction for Enumerating k-coloured Motzkin Paths. COCOON 1995: 254-263 - Jay Belanger, Jie Wang:
Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. COCOON 1995: 410-419 - Liming Cai, Jianer Chen:
On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract). COCOON 1995: 282-291 - Tiziana Calamoneri, Rossella Petreschi:
An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. COCOON 1995: 31-40 - Svante Carlsson, Jingsen Chen:
Searching Rigid Data Structures (Extended Abstract). COCOON 1995: 446-451 - Julien Cassaigne, Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). COCOON 1995: 244-253 - Edward P. F. Chan, Ron van der Meyden:
Testing Containment of Object-Oriented Conjunctive Queries is Pi_2p-hard. COCOON 1995: 81-90 - Chi-lok Chan, Gilbert H. Young:
Single-vehicle Scheduling Problem on a Straight Line with Time Window Constraints. COCOON 1995: 617-626 - C. F. Chang, J. X. Chang, X. C. Lu, Peter Che Bor Lam, J. F. Wang:
Edge-Face Total Chromatic Number of Outerplanar Graphs with Delta(G)=6. COCOON 1995: 396-399 - Jianer Chen:
Algorithmic Graph Embeddings (Extended Abstract). COCOON 1995: 151-160 - Zhixiang Chen:
An Optimal Algorithm for Proper Learning of Unions of Two Rectangles with Queries. COCOON 1995: 334-343 - Zhixiang Chen:
Disjunctions of Negated Counting Functions Are Efficiently Learnable with Equivalence Queries. COCOON 1995: 344-349 - Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks:
Minimum Dominating Sets of Intervals on Lines (Extended Abstract). COCOON 1995: 520-529 - Siu-Wing Cheng, Yin-Feng Xu:
Constrained Independence System and Triangulations of Planar Point Sets. COCOON 1995: 41-50 - Qi Cheng, Hong Zhu:
MNP: A Class of NP Optimization Problems (Extended Abstract). COCOON 1995: 559-565 - Shyh-Chain Chern, Tai-Ching Tuan, Jung-Sing Jwo:
Uni-directional Alternating Group Graphs. COCOON 1995: 490-495 - Shyue-Horng Shiau, Chang-Biau Yang:
A Fast Maximum Finding Algorithm on Broadcast Communication. COCOON 1995: 472-481 - Ying Choi, Tak Wah Lam:
Two-Dimensional Pattern Matching on a Dynamic Library of Texts. COCOON 1995: 530-538 - Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes (Extended Abstract). COCOON 1995: 539-548 - Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán:
Efficient Parallel Algorithms for some Tree Layout Problems. COCOON 1995: 313-323 - Jiyu Ding, Chngxiang Qing, Guodong Song:
Limit Property of Unbalanced Development in Economic Network. COCOON 1995: 643-646 - Jean Hardouin Duparc, Philippe Rolland:
Transformations for Maximal Planar Graphs with Minimum Degree Five. COCOON 1995: 366-371 - Qing-Wen Feng, Robert F. Cohen, Peter Eades:
How to Draw a Planar Clustered Graph. COCOON 1995: 21-30 - Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe:
The Multi-Weighted Spanning Tree Problem (Extended Abstract). COCOON 1995: 141-150 - Wen Gao, Baocai Yin:
Sequence Decomposition Method for Computing a Gröbner Basis and Its Application to Bivariate Spline. COCOON 1995: 456-461 - Yijie Han, Xiaojun Shen:
Conservative Algorithms for Parallel and Sequential Integer Sorting. COCOON 1995: 324-333 - Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani:
Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON 1995: 229-234
skipping 48 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-09-29 22:58 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