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 377 matches
- 2024
- Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. Algorithmica 86(8): 2448-2478 (2024) - David Dekker, Bart M. P. Jansen:
Kernelization for feedback vertex set via elimination distance to a forest. Discret. Appl. Math. 346: 192-214 (2024) - Yunlong Liu, Yixuan Li, Jingui Huang:
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover. Int. J. Found. Comput. Sci. 35(6): 609-629 (2024) - Manuel Lafond:
Improved kernelization and fixed-parameter algorithms for bicluster editing. J. Comb. Optim. 47(5): 90 (2024) - René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko:
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. J. Comput. Syst. Sci. 139: 103479 (2024) - Steven Kelk, Simone Linz, Ruben Meuwese:
Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics. J. Comput. Syst. Sci. 142: 103519 (2024) - Steven Kelk, Ruben Meuwese:
Agreement forests of caterpillar trees: Complexity, kernelization and branching. Theor. Comput. Sci. 1003: 114608 (2024) - Zimo Sheng, Mingyu Xiao:
Kernelization for edge triangle packing and covering via a discharging method. Theor. Comput. Sci. 1004: 114635 (2024) - Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. ICALP 2024: 33:1-33:20 - Hanting Chen, Liuzhi Cheng, Xutao Wang, Yuchuan Tian, Yunhe Wang:
DiJiang: Efficient Large Language Models through Compact Kernelization. ICML 2024 - Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. ITCS 2024: 77:1-77:23 - Frank Kammer, Andrej Sajenko:
Space-Efficient Graph Kernelizations. TAMC 2024: 260-271 - Matthias Bentert, Fedor V. Fomin, Petr A. Golovach:
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR abs/2402.15348 (2024) - Yixin Cao, Jingyi Liu, Jianxin Wang:
Minimum sum vertex cover: kernelization and parameterized algorithms. CoRR abs/2403.18497 (2024) - Hanting Chen, Zhicheng Liu, Xutao Wang, Yuchuan Tian, Yunhe Wang:
DiJiang: Efficient Large Language Models through Compact Kernelization. CoRR abs/2403.19928 (2024) - Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity:
Kernelization Algorithms for the Eigenvalue Deletion Problems. CoRR abs/2404.10023 (2024) - Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. CoRR abs/2404.16695 (2024) - Stefan Kratsch, Van Bang Le:
On polynomial kernelization for Stable Cutset. CoRR abs/2407.02086 (2024) - Ishay Haviv, Dror Rabinovich:
Kernelization for Orthogonality Dimension. CoRR abs/2408.08380 (2024) - Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, Sebastian Siebertz:
Kernelization Complexity of Solution Discovery Problems. CoRR abs/2409.17250 (2024) - 2023
- Guilherme C. M. Gomes, Matheus R. Guedes, Vinícius Fernandes dos Santos:
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization. Algorithmica 85(7): 1912-1947 (2023) - Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67(4): 785-824 (2023) - Abhishek Sahu, Saket Saurabh:
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. Theory Comput. Syst. 67(2): 221-233 (2023) - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. ESA 2023: 48:1-48:16 - Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14 - Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser:
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. FCT 2023: 392-405 - Chao Xu, Liting Dai, Kang Liu:
Bloomfilter-Based Practical Kernelization Algorithms for Minimum Satisfiability. ICONIP (9) 2023: 38-47 - Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma:
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC 2023: 5:1-5:14 - Maël Dumas, Anthony Perez:
An Improved Kernelization Algorithm for Trivially Perfect Editing. IPEC 2023: 15:1-15:17 - Bart M. P. Jansen, Bart van der Steenhoven:
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. IPEC 2023: 27:1-27:15
skipping 347 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-11-03 00:26 CET 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