Остановите войну!
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 66 matches
- 2018
- Ming Li:
Challenges from Cancer Immunotherapy. COCOON 2018: xii-x - Eunjin Oh, Hee-Kap Ahn:
Polygon Queries for Convex Hulls of Points. COCOON 2018: 143-155 - R. Krithika, Pranabendu Misra, Prafullkumar Tale:
An FPT Algorithm for Contraction to Cactus. COCOON 2018: 341-352 - Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma:
New Bounds for Energy Complexity of Boolean Functions. COCOON 2018: 738-750 - Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. COCOON 2018: 615-625 - Sepideh Aghamolaei, Fatemeh Baharifard, Mohammad Ghodsi:
Geometric Spanners in the MapReduce Model. COCOON 2018: 675-687 - Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh:
Hitting and Covering Partially. COCOON 2018: 751-763 - Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON 2018: 567-578 - Niranka Banerjee, Varunkumar Jayapaul, Srinivasa Rao Satti:
Minimum Transactions Problem. COCOON 2018: 650-661 - Jérémy Barbay, Carlos Ochoa:
Synergistic Solutions for Merging and Computing Planar Convex Hulls. COCOON 2018: 156-167 - Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing Coverage Kernels Under Restricted Settings. COCOON 2018: 180-191 - Gill Barequet, Gil Ben-Shachar:
Properties of Minimal-Perimeter Polyominoes. COCOON 2018: 120-129 - Gill Barequet, Minati De, Michael T. Goodrich:
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. COCOON 2018: 130-142 - Debajyoti Bera:
Amplitude Amplification for Operator Identification and Randomized Classes. COCOON 2018: 579-591 - Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal:
Improved Learning of k-Parities. COCOON 2018: 542-553 - Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
On Colorful Bin Packing Games. COCOON 2018: 280-292 - Johannes Blum, Sabine Storandt:
Computation and Growth of Road Network Dimensions. COCOON 2018: 230-241 - Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang:
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. COCOON 2018: 205-217 - Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow:
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. COCOON 2018: 365-377 - Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza:
Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem. COCOON 2018: 84-95 - Raffaello Carosi, Gianpiero Monaco:
Generalized Graph k-Coloring Games. COCOON 2018: 268-279 - T.-H. Hubert Chan, Zhibin Liang:
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators. COCOON 2018: 441-453 - T.-H. Hubert Chan, Bintao Sun:
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. COCOON 2018: 688-700 - Chun-Hsiang Chan, Hsu-Chun Yen:
On Contact Representations of Directed Planar Graphs. COCOON 2018: 218-229 - Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite Graphs of Small Readability. COCOON 2018: 467-479 - Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. COCOON 2018: 328-340 - Evgeny Dantsin, Alexander Wolpert:
Reconstruction of Boolean Formulas in Conjunctive Normal Form. COCOON 2018: 592-601 - Yunyun Deng, Longkun Guo, Peihuang Huang:
Exact Algorithms for Finding Partial Edge-Disjoint Paths. COCOON 2018: 14-25 - Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy:
Minimum Spanning Tree of Line Segments. COCOON 2018: 529-541 - Bin Fu:
Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage. COCOON 2018: 492-503
skipping 36 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-05-17 05: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