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 23 matches
- 2010
- Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan:
On the Kernelization Complexity of Colorful Motifs. IPEC 2010: 14-25 - Nadja Betzler, Robert Bredereck, Rolf Niedermeier:
Partial Kernelization for Rank Aggregation: Theory and Experiments. IPEC 2010: 26-37 - Daniel Binkele-Raible, Henning Fernau:
Enumerate and Measure: Improving Parameter Budget Management. IPEC 2010: 38-49 - Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k-CNF. IPEC 2010: 50-59 - Yixin Cao, Jianer Chen:
Cluster Editing: Kernelization Based on Edge Cuts. IPEC 2010: 60-71 - Katarína Cechlárová, Ildikó Schlotter:
Computing the Deficiency of Housing Markets with Duplicate Houses. IPEC 2010: 72-83 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application. IPEC 2010: 84-94 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. IPEC 2010: 95-106 - Anuj Dawar:
The Complexity of Satisfaction on Sparse Graphs. IPEC 2010: 1-2 - Britta Dorn, Ildikó Schlotter:
Multivariate Complexity Analysis of Swap Bribery. IPEC 2010: 107-122 - Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. IPEC 2010: 123-134 - Fedor V. Fomin:
Protrusions in Graphs and Their Applications. IPEC 2010: 3 - Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are There Any Good Digraph Width Measures? IPEC 2010: 135-146 - Sylvain Guillemot, Christophe Paul, Anthony Perez:
On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems. IPEC 2010: 147-157 - Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC 2010: 158-169 - Frédéric Havet, Leonardo Sampaio Rocha:
On the Grundy Number of a Graph. IPEC 2010: 170-179 - Christian Hoffmann:
Exponential Time Complexity of Weighted Counting of Independent Sets. IPEC 2010: 180-191 - Thore Husfeldt, Nina Taslaman:
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. IPEC 2010: 192-203 - Jesper Nederlof, Johan M. M. van Rooij:
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. IPEC 2010: 204-215 - M. Praveen:
Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier. IPEC 2010: 216-227 - Yngve Villanger:
Proper Interval Vertex Deletion. IPEC 2010: 228-238 - Toby Walsh:
Parameterized Complexity Results in Symmetry Breaking. IPEC 2010: 4-13 - Venkatesh Raman, Saket Saurabh:
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6478, Springer 2010, ISBN 978-3-642-17492-6 [contents]
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-10-08 15:01 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