![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 35 matches
- 2012
- Barbara M. Anthony
, Christine Chung
:
Online Bottleneck Matching. COCOA 2012: 257-268 - Karin Arikushi, Csaba D. Tóth:
Crossing Angles of Geometric Graphs. COCOA 2012: 103-114 - Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
, Dimitrios M. Thilikos:
Characterizing Graphs of Small Carving-Width. COCOA 2012: 360-370 - Sudip Biswas, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat
:
Hamiltonian Paths and Cycles in Planar Graphs. COCOA 2012: 83-94 - Jin-Yi Cai, Xi Chen
, Heng Guo, Pinyan Lu
:
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. COCOA 2012: 336-347 - Xujin Chen, Xiaodong Hu, Weidong Ma, Changjun Wang:
Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines. COCOA 2012: 312-323 - Zhi-Zhong Chen, Lusheng Wang
:
An Improved Approximation Algorithm for the Bandpass-2 Problem. COCOA 2012: 188-199 - Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
The Edge-Centered Surface Area of the Arrangement Graph. COCOA 2012: 49-60 - Basile Couëtoux, Jérôme Monnot, Sonia Toubaline:
Complexity Results for the Empire Problem in Collection of Stars. COCOA 2012: 73-82 - Wei Ding
, Guoliang Xue:
On the Minimum Diameter Cost-Constrained Steiner Tree Problem. COCOA 2012: 37-48 - Hiroshi Eto, Fengrui Guo, Eiji Miyano
:
Distance-d Independent Set Problems for Bipartite and Chordal Graphs. COCOA 2012: 234-244 - Neng Fan, Jean-Paul Watson:
Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming. COCOA 2012: 371-383 - Zheng Fang, You Li, Jie Wang:
Measuring Structural Similarities of Graphs in Linear Time. COCOA 2012: 384-395 - Yelena Frid, Dan Gusfield:
Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method. COCOA 2012: 176-187 - Jing He, Shouling Ji, Yi Pan
, Zhipeng Cai:
Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks. COCOA 2012: 1-12 - Yumei Huo, Boris Reznichenko, Hairong Zhao:
Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability. COCOA 2012: 291-300 - Ken Ibara, Hiroshi Nagamochi:
Characterizing Mechanisms in Obnoxious Facility Game. COCOA 2012: 301-311 - Iyad A. Kanj, Ge Xia:
On Certain Geometric Properties of the Yao-Yao Graphs. COCOA 2012: 223-233 - Adrian Kosowski, Alfredo Navarra
, Dominik Pajak
, Maria Cristina Pinotti
:
Maximum Matching in Multi-Interface Networks. COCOA 2012: 13-24 - Evangelos Kranakis
, Fraser MacQuarrie, Oscar Morales-Ponce:
Stretch Factor in Wireless Sensor Networks with Directional Antennae. COCOA 2012: 25-36 - Martin Lackner
, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Multicut on Graphs of Bounded Clique-Width. COCOA 2012: 115-126 - Zhewei Liang, Kaizhong Zhang:
Algorithms for Forest Local Similarity. COCOA 2012: 163-175 - Hong Liu, Peng Zhang:
On the Generalized Multiway Cut in Trees Problem. COCOA 2012: 151-162 - Guanqun Ni, Yinfeng Xu:
Online Joint Pricing and Booking Policies in Airline Revenue Management. COCOA 2012: 281-290 - Mourad El Ouali, Gerold Jäger:
The b-Matching Problem in Hypergraphs: Hardness and Approximability. COCOA 2012: 200-211 - Luís Paquete
, Mathias Jaschob, Kathrin Klamroth
, Jochen Gorski:
Dynamic Programming for a Biobjective Search Problem in a Line. COCOA 2012: 348-359 - Sheung-Hung Poon
, William Chung-Kung Yen, Chin-Ting Ung:
Domatic Partition on Several Classes of Graphs. COCOA 2012: 245-256 - Chung Keung Poon
, Binhai Zhu:
Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls. COCOA 2012: 269-280 - Chaoyi Wang, Tian Liu, Wei Jiang, Ke Xu:
Feedback Vertex Sets on Tree Convex Bipartite Graphs. COCOA 2012: 95-102 - Boting Yang:
Fast-Mixed Searching on Graphs. COCOA 2012: 324-335
skipping 5 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-27 17:18 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