Остановите войну!
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 44 matches
- 2016
- Shijie Xiao:
Improved low rank representation : kernelization, efficient optimization and applications. Nanyang Technological University, Singapore, 2016 - Taehoon Lee, Taesup Moon, Seung Jean Kim, Sungroh Yoon:
Regularization and Kernelization of the Maximin Correlation Approach. IEEE Access 4: 1385-1392 (2016) - Minghui Jiang, Yong Zhang:
Kernelization of edge perfect code and its variants. Discret. Appl. Math. 214: 145-152 (2016) - Christoph Brause, Ingo Schiermeyer:
Kernelization of the 3-path vertex cover problem. Discret. Math. 339(7): 1935-1939 (2016) - Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. J. ACM 63(5): 44:1-44:69 (2016) - Qilong Feng, Qian Zhou, Jianxin Wang:
Kernelization and randomized Parameterized algorithms for Co-path Set problem. J. Comb. Optim. 32(1): 67-78 (2016) - Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-win kernelization for degree sequence completion problems. J. Comput. Syst. Sci. 82(6): 1100-1111 (2016) - Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with structural parameters. J. Comput. Syst. Sci. 82(2): 333-346 (2016) - Leo van Iersel, Steven Kelk, Céline Scornavacca:
Kernelizations for the hybridization number problem on multiple nonbinary trees. J. Comput. Syst. Sci. 82(6): 1075-1089 (2016) - Marcelo Rodrigo Portela Ferreira, Francisco de A. T. de Carvalho, Eduardo C. Simões:
Kernel-based hard clustering methods with kernelization of the metric and automatic weighting of the variables. Pattern Recognit. 51: 310-321 (2016) - Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. 30(1): 383-410 (2016) - Palash Dey, Neeldhara Misra, Y. Narahari:
Kernelization complexity of possible winner and coalitional manipulation problems in voting. Theor. Comput. Sci. 616: 111-125 (2016) - Petr Hlinený, Marek Dernár:
Crossing Number is Hard for Kernelization. SoCG 2016: 42:1-42:10 - Clément Carbonnel, Emmanuel Hebrard:
Propagation via Kernelization: The Vertex Cover Constraint. CP 2016: 147-156 - Stefan Kratsch:
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter. ESA 2016: 59:1-59:17 - Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo:
Kernelization of Two Path Searching Problems on Split Graphs. FAW 2016: 238-249 - Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP 2016: 26:1-26:14 - Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP 2016: 25:1-25:14 - T. K. Satish Kumar:
Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems. ISAIM 2016 - Yuchi Kanzawa:
On Bezdek-Type Possibilistic Clustering for Spherical Data, Its Kernelization, and Spectral Clustering Approach. MDAI 2016: 178-190 - Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. SODA 2016: 1326-1344 - Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar:
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - Hans L. Bodlaender:
Kernelization, Exponential Lower Bounds. Encyclopedia of Algorithms 2016: 1013-1017 - Jianer Chen:
Vertex Cover Kernelization. Encyclopedia of Algorithms 2016: 2327-2330 - Henning Fernau:
Kernelization, Turing Kernels. Encyclopedia of Algorithms 2016: 1043-1045 - Gregory Z. Gutin:
Kernelization, Constraint Satisfaction Problems Parameterized above Average. Encyclopedia of Algorithms 2016: 1011-1013 - Gregory Z. Gutin:
Kernelization, Permutation CSPs Parameterized above Average. Encyclopedia of Algorithms 2016: 1031-1033 - Mark Jones:
Kernelization, Max-Cut Above Tight Bounds. Encyclopedia of Algorithms 2016: 1021-1024 - Christian Komusiewicz:
Kernelization, Partially Polynomial Kernels. Encyclopedia of Algorithms 2016: 1028-1031 - Stefan Kratsch:
Kernelization, Polynomial Lower Bounds. Encyclopedia of Algorithms 2016: 1036-1039
skipping 14 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-13 00:49 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