Остановите войну!
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 32 matches
- 2010
- Faisal N. Abu-Khzam, Michael A. Langston, Amer E. Mouawad, Clinton P. Nolan:
A Hybrid Graph Representation for Recursive Backtracking Algorithms. FAW 2010: 136-147 - Hee-Kap Ahn, Yoshio Okamoto:
Adaptive Algorithms for Planar Convex Hull Problems. FAW 2010: 316-326 - Mikhail J. Atallah:
Computational Geometry for Uncertain Data - (Abstract of Keynote Talk). FAW 2010: 6 - Gill Barequet, Shahar Tal:
Solving General Lattice Puzzles. FAW 2010: 124-135 - Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu:
On Tractable Exponential Sums. FAW 2010: 148-159 - Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang:
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. FAW 2010: 222-233 - Xiaotie Deng, Yang Sun, Ming Yin, Yunhong Zhou:
Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets. FAW 2010: 11-22 - Liang Ding, Bin Fu, Yunhui Fu:
Improved Sublinear Time Algorithm for Width-Bounded Separators. FAW 2010: 101-112 - Liang Ding, Bin Fu, Yunhui Fu, Zaixin Lu, Zhiyu Zhao:
O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems. FAW 2010: 250-261 - Emilie Diot, Cyril Gavoille:
Path Separability of Graphs. FAW 2010: 262-273 - Qizhi Fang, Han Xiao, Shanfeng Zhu:
Top-d Rank Aggregation in Web Meta-search Engine - (Extended Abstract). FAW 2010: 35-44 - Rudolf Fleischer, Xiaoming Xu:
Computing Minimum Diameter Color-Spanning Sets. FAW 2010: 285-292 - Bin Fu, Yumei Huo, Hairong Zhao:
Approximation Schemes for Scheduling with Availability Constraints. FAW 2010: 77-88 - Regant Y. S. Hung, Hing-Fung Ting:
An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding epsilon-Approximate Quantiles in a Data Stream. FAW 2010: 89-100 - Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW 2010: 274-284 - Minghui Jiang:
Inapproximability of Maximal Strip Recovery: II. FAW 2010: 53-64 - Minghui Jiang:
Recognizing d-Interval Graphs and d-Track Interval Graphs. FAW 2010: 160-171 - Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu:
Minimum Common String Partition Revisited. FAW 2010: 45-52 - Wenqi Ju, Jun Luo:
Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares. FAW 2010: 293-303 - Mong-Jen Kao, Han-Lin Chen:
Approximation Algorithms for the Capacitated Domination Problem. FAW 2010: 185-196 - Deyi Li, Haisu Zhang, Yuchao Liu, Guisheng Chen:
On Foundations of Services Interoperation in Cloud Computing. FAW 2010: 7-10 - Yunlong Liu, Xiaodong Wu:
Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy. FAW 2010: 65-76 - Kurt Mehlhorn, Pascal Schweitzer:
Progress on Certifying Algorithms. FAW 2010: 1-5 - Peter Sempolinski, Amitabh Chaudhary:
Online Algorithms for the Newsvendor Problem with and without Censored Demands. FAW 2010: 234-249 - Xuehou Tan, Bo Jiang:
Optimum Sweeps of Simple Polygons with Two Guards. FAW 2010: 304-315 - Xuehou Tan, Gangshan Wu:
New Algorithms for Barrier Coverage with Mobile Sensors. FAW 2010: 327-338 - Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi:
FPTAS's for Some Cut Problems in Weighted Trees. FAW 2010: 210-221 - Chaoxia Yang, Guojun Li:
A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle. FAW 2010: 197-209 - Zhen You, Jinyun Xue, Shi Ying:
Categorial Semantics of a Solution to Distributed Dining Philosophers Problem. FAW 2010: 172-184 - Qiang Zhang, Minming Li:
Truthful Auction for CPU Time Slots. FAW 2010: 23-34
skipping 2 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-04-25 16:29 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