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 32 matches
- 2017
- Jiong Guo, Danny Hermelin:
11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark. LIPIcs 63, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-023-1 [contents] - 2016
- Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma:
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC 2016: 2:1-2:14 - Gábor Bacsó, Dániel Marx, Zsolt Tuza:
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. IPEC 2016: 3:1-3:12 - Max Bannach, Till Tantau:
Parallel Multivariate Meta-Theorems. IPEC 2016: 4:1-4:17 - René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. IPEC 2016: 5:1-5:16 - Andreas Björklund:
Determinant Sums for Hamiltonicity (Invited Talk). IPEC 2016: 1:1-1:1 - Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Parameterized Complexity of Dependency Detection in Relational Databases. IPEC 2016: 6:1-6:13 - Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC 2016: 7:1-7:12 - Glencora Borradaile, Hung Le:
Optimal Dynamic Program for r-Domination Problems over Tree Decompositions. IPEC 2016: 8:1-8:23 - Cornelius Brand, Holger Dell, Marc Roth:
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. IPEC 2016: 9:1-9:14 - Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC 2016: 10:1-10:14 - L. Sunil Chandran, Davis Issac, Andreas Karrenbauer:
On the Parameterized Complexity of Biclique Cover and Partition. IPEC 2016: 11:1-11:13 - Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond:
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC 2016: 30:1-30:9 - Khaled M. Elbassioni:
Exact Algorithms for List-Coloring of Intersecting Hypergraphs. IPEC 2016: 12:1-12:15 - Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. IPEC 2016: 13:1-13:13 - Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle:
On Satisfiability Problems with a Linear Structure. IPEC 2016: 14:1-14:14 - Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. IPEC 2016: 15:1-15:13 - Thore Husfeldt:
Computing Graph Distances Parameterized by Treewidth and Diameter. IPEC 2016: 16:1-16:11 - Bart M. P. Jansen, Jules J. H. M. Wulms:
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. IPEC 2016: 17:1-17:12 - Yasuaki Kobayashi, Hisao Tamaki:
Treedepth Parameterized by Vertex Cover Number. IPEC 2016: 18:1-18:11 - R. Krithika, Abhishek Sahu, Prafullkumar Tale:
Dynamic Parameterized Problems. IPEC 2016: 19:1-19:14 - Mithilesh Kumar, Daniel Lokshtanov:
A 2lk Kernel for l-Component Order Connectivity. IPEC 2016: 20:1-20:14 - Diptapriyo Majumdar:
Structural Parameterizations of Feedback Vertex Set. IPEC 2016: 21:1-21:16 - Kitty Meeks:
Randomised Enumeration of Small Witnesses Using a Decision Oracle. IPEC 2016: 22:1-22:12 - Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler:
Backdoors for Linear Temporal Logic. IPEC 2016: 23:1-23:17 - Matthias Mnich, Eva-Lotta Teutrine:
Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. IPEC 2016: 24:1-24:10 - Mateus de Oliveira Oliveira:
Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth. IPEC 2016: 25:1-25:12 - Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization Faster Than 2k. IPEC 2016: 26:1-26:13 - Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij:
Cut and Count and Representative Sets on Branch Decompositions. IPEC 2016: 27:1-27:12 - Blair D. Sullivan, Andrew van der Poel:
A Fast Parameterized Algorithm for Co-Path Set. IPEC 2016: 28:1-28:13
skipping 2 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-09-13 10:02 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