Остановите войну!
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 55 matches
- 2007
- Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh:
On the Complexity of Finding an Unknown Cut Via Vertex Queries. COCOON 2007: 459-469 - Noga Alon, Shai Gutner:
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. COCOON 2007: 394-405 - Noga Alon, Asaf Shapira, Uri Stav:
Can a Graph Have Distinct Regular Partitions? COCOON 2007: 428-438 - Srinivas Aluru:
The Combinatorics of Sequencing the Corn Genome. COCOON 2007: 1 - Alberto Apostolico, Claudia Tagliacollo:
Optimal Offline Extraction of Irredundant Motif Bases. COCOON 2007: 360-371 - Jan Arpe, Rüdiger Reischuk:
When Does Greedy Learning of Relevant Attributes Succeed? COCOON 2007: 296-306 - Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov:
Approximation Algorithms for the Black and White Traveling Salesman Problem. COCOON 2007: 559-567 - Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Quadratic Kernelization for Convex Recoloring of Trees. COCOON 2007: 86-96 - Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf:
Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231 - Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel:
On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107 - Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. COCOON 2007: 210-221 - Ching-Lueh Chang, Yuh-Dauh Lyuu:
Efficient Testing of Forecasts. COCOON 2007: 285-295 - Danny Z. Chen, Mark A. Healy, Chao Wang, Xiaodong Wu:
A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy. COCOON 2007: 4-15 - Jianer Chen, Songjian Lu:
Improved Algorithms for Weighted and Unweighted Set Splitting Problems. COCOON 2007: 537-547 - Danny Z. Chen, Ewa Misiolek:
Finding Many Optimal Paths Without Growing Any Optimal Path Trees. COCOON 2007: 232-242 - Shihyen Chen, Kaizhong Zhang:
An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity. COCOON 2007: 482-492 - Francis Y. L. Chin:
Online Frequency Assignment in Wireless Communication Networks. COCOON 2007: 2 - Francis Y. L. Chin, Yong Zhang, Hong Zhu:
A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. COCOON 2007: 526-536 - Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir:
Connected Coloring Completion for General Graphs: Algorithms and Complexity. COCOON 2007: 75-85 - George Christodoulou, Laurent Gourvès, Fanny Pascual:
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. COCOON 2007: 187-197 - Andrzej Czygrinow, Michal Hanckowiak:
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families. COCOON 2007: 515-525 - Xiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, Toyotaka Tasaka:
Properties of Symmetric Incentive Compatible Auctions. COCOON 2007: 264-273 - Jean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabrouk:
Seed-Based Exclusion Method for Non-coding RNA Gene Search. COCOON 2007: 27-39 - Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun:
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. COCOON 2007: 439-447 - Alessandro Ferrante, Gopal Pandurangan, Kihong Park:
On the Hardness of Optimization in Power Law Graphs. COCOON 2007: 417-427 - Fedor V. Fomin, Serge Gaspers, Saket Saurabh:
Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74 - Fedor V. Fomin, Alexey A. Stepanov:
Counting Minimum Weighted Dominating Sets. COCOON 2007: 165-175 - Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Online Interval Scheduling: Randomized and Multiprocessor Cases. COCOON 2007: 176-186 - Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs. COCOON 2007: 307-317
skipping 25 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-08-24 12:53 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