![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 60 matches
- 2014
- Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra:
Vertex Cover Gets Faster and Harder on Low Degree Graphs. COCOON 2014: 179-190 - Chunyu Ai, Wei Zhong, Mingyuan Yan, Feng Gu
:
Partner Matching Applications of Social Networks. COCOON 2014: 647-656 - Vikraman Arvind, S. Raja:
The Complexity of Bounded Register and Skew Arithmetic Computation. COCOON 2014: 572-583 - Georgios Askalidis, Randall A. Berry
, Vijay G. Subramanian
:
Explaining Snapshots of Network Diffusions: Structural and Hardness Results. COCOON 2014: 616-625 - Manu Basavaraju, Fahad Panolan
, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
On the Kernelization Complexity of String Problems. COCOON 2014: 141-153 - Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi
, Samuel McCauley, Yuan Tang:
The Range 1 Query (R1Q) Problem. COCOON 2014: 116-128 - Suman Kalyan Bera, Syamantak Das, Amit Kumar
:
Minimizing Average Flow-Time under Knapsack Constraint. COCOON 2014: 584-595 - Binay K. Bhattacharya, Minati De
, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song:
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON 2014: 417-428 - Vittorio Bilò
:
On Linear Congestion Games with Altruistic Social Context. COCOON 2014: 547-558 - Vittorio Bilò
, Mauro Paladini:
On the Performance of Mildly Greedy Players in Cut Games. COCOON 2014: 513-524 - Vladimir Braverman, Gregory Vorsanger:
Sampling from Dense Streams without Penalty - Improved Bounds for Frequency Moments and Heavy Hitters. COCOON 2014: 13-24 - Benjamin A. Burton
, William Pettersson
:
Fixed Parameter Tractable Algorithms in Combinatorial Topology. COCOON 2014: 300-311 - Xujin Chen, Changjun Wang:
Approximability of the Minimum Weighted Doubly Resolving Set Problem. COCOON 2014: 357-368 - Christine Chung
, Shenoda Guirguis, Anastasia Kurdia:
Competitive Cost-Savings in Data Stream Management Systems. COCOON 2014: 129-140 - Konrad Kazimierz Dabrowski
, Daniël Paulusma
:
Classifying the Clique-Width of H-Free Bipartite Graphs. COCOON 2014: 489-500 - Zhenhua Duan, Cong Tian, Nan Zhang:
Normal Form Expressions of Propositional Projection Temporal Logic. COCOON 2014: 84-93 - Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
Scheduling over Scenarios on Two Machines. COCOON 2014: 559-571 - Pierre-Alain Fouque
, Jean-Christophe Zapalowicz:
Statistical Properties of Short RSA Distribution and Their Cryptographic Applications. COCOON 2014: 525-536 - Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflection Radius in a Simple Polygon. COCOON 2014: 239-250 - François Le Gall, Harumichi Nishimura, Seiichiro Tani
:
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. COCOON 2014: 429-440 - Kumar Gaurav
, Bartlomiej Blaszczyszyn, Holger Paul Keeler:
Pioneers of Influence Propagation in Social Networks. COCOON 2014: 626-636 - Jiong Guo, Yash Raj Shrestha
:
Parameterized Complexity of Edge Interdiction Problems. COCOON 2014: 166-178 - Farzad Farnoud Hassanzadeh, Eitan Yaakobi, Jehoshua Bruck
:
Approximate Sorting of Data Streams with Limited Storage. COCOON 2014: 465-476 - Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers
, Scott M. Summers:
The Power of Duples (in Self-Assembly): It's Not So Hip to Be Square. COCOON 2014: 215-226 - Thomas Holenstein, Robin Künzler:
A Protocol for Generating Random Elements with Their Probabilities. COCOON 2014: 191-202 - Thomas Holenstein, Robin Künzler:
A New View on Worst-Case to Average-Case Reductions for NP Problems. COCOON 2014: 203-214 - Seok-Hee Hong, Hiroshi Nagamochi:
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. COCOON 2014: 477-488 - Kayleigh Hyde, Bjørn Kjos-Hanssen:
Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words. COCOON 2014: 61-70 - Ming Jia, Jie Wang:
Handling Big Data of Online Social Networks on a Small Machine. COCOON 2014: 676-685 - Minghui Jiang, Haitao Wang:
Shortest Color-Spanning Intervals. COCOON 2014: 288-299
skipping 30 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-07-19 15:42 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