Остановите войну!
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 31 matches
- 2013
- Vikraman Arvind:
The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups. IPEC 2013: 4-15 - Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC 2013: 16-27 - Jaroslaw Blasiok, Marcin Kaminski:
Chain Minors Are FPT. IPEC 2013: 78-83 - Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. IPEC 2013: 28-40 - Hans L. Bodlaender, Paul S. Bonsma, Daniel Lokshtanov:
The Fine Details of Fast Dynamic Programming over Tree Decompositions. IPEC 2013: 41-53 - Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. IPEC 2013: 54-65 - Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. IPEC 2013: 66-77 - Leizhen Cai, Yufei Cai:
Incompressibility of H-Free Edge Modification. IPEC 2013: 84-96 - Leizhen Cai, Chengwei Guo:
Contracting Few Edges to Remove Forbidden Induced Subgraphs. IPEC 2013: 97-109 - Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Exact Algorithms for Some Terminal Set Problems. IPEC 2013: 150-162 - Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz:
Fixed-Parameter and Approximation Algorithms: A New Look. IPEC 2013: 110-122 - Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. IPEC 2013: 321-334 - Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2 n. IPEC 2013: 137-149 - Jakub Gajarský, Michael Lampis, Sebastian Ordyniak:
Parameterized Algorithms for Modular-Width. IPEC 2013: 163-176 - Sylvain Guillemot, Dániel Marx:
A Faster FPT Algorithm for Bipartite Contraction. IPEC 2013: 177-188 - Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. IPEC 2013: 189-201 - Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu:
A Completeness Theory for Polynomial (Turing) Kernelization. IPEC 2013: 202-215 - Russell Impagliazzo, Ramamohan Paturi:
Exact Complexity and Satisfiability - (Invited Talk). IPEC 2013: 1-3 - Bart M. P. Jansen:
On Sparsification for Computing Treewidth. IPEC 2013: 216-229 - Dieter Kratsch, Stefan Kratsch:
The Jump Number Problem: Exact and Parameterized. IPEC 2013: 230-242 - Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh:
Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC 2013: 255-267 - Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. IPEC 2013: 243-254 - Lukás Mach, Tomas Toufar:
Amalgam Width of Matroids. IPEC 2013: 268-280 - Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. IPEC 2013: 281-294 - N. S. Narayanaswamy, R. Subashini:
FPT Algorithms for Consecutive Ones Submatrix Problems. IPEC 2013: 295-307 - Mateus de Oliveira Oliveira:
Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs. IPEC 2013: 123-136 - Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle:
Upper Bounds on Boolean-Width with Applications to Exact Algorithms. IPEC 2013: 308-320 - Christoph Stockhusen, Till Tantau:
Completeness Results for Parameterized Space Classes. IPEC 2013: 335-347 - Antonis Thomas, Jan van Leeuwen:
Treewidth and Pure Nash Equilibria. IPEC 2013: 348-360 - Meirav Zehavi:
Algorithms for k-Internal Out-Branching. IPEC 2013: 361-373
skipping 1 more match
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-06-14 17:35 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