Остановите войну!
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 36 matches
- 2015
- Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Block Graph Deletion. IPEC 2015: 270-281 - Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC 2015: 78-89 - Max Bannach, Christoph Stockhusen, Till Tantau:
Fast Parallel Fixed-parameter Algorithms via Color Coding. IPEC 2015: 224-235 - Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. IPEC 2015: 43-54 - Ilario Bonacina, Navid Talebanfard:
Strong ETH and Resolution via Games and the Multiplicity of Strategies. IPEC 2015: 248-257 - Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC 2015: 199-211 - Edouard Bonnet, Florian Sikora:
The Graph Motif Problem Parameterized by the Structure of the Input Graph. IPEC 2015: 319-330 - Chiel B. Ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender:
Practical Algorithms for Linear Boolean-width. IPEC 2015: 187-198 - Jannis Bulian, Anuj Dawar:
Fixed-parameter Tractable Distances to Sparse Graph Classes. IPEC 2015: 236-247 - Hubie Chen:
Parameter Compilation. IPEC 2015: 127-137 - Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
On the Workflow Satisfiability Problem with Class-independent Constraints. IPEC 2015: 66-77 - Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. IPEC 2015: 294-306 - Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar:
Fast Biclustering by Dual Parameterization. IPEC 2015: 402-413 - Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using Well-structured Modulators. IPEC 2015: 114-126 - Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC 2015: 102-113 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch:
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. IPEC 2015: 307-318 - Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos:
Variants of Plane Diameter Completion. IPEC 2015: 30-42 - Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon:
Parameterized Complexity of Critical Node Cuts. IPEC 2015: 343-354 - Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger:
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. IPEC 2015: 55-65 - Lars Jaffke, Hans L. Bodlaender:
Definability Equals Recognizability for k-Outerplanar Graphs. IPEC 2015: 175-186 - Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. IPEC 2015: 163-174 - Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle:
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. IPEC 2015: 212-223 - Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC 2015: 138-150 - Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Quick but Odd Growth of Cacti. IPEC 2015: 258-269 - Stefan Kratsch, Manuel Sorge:
On Kernelization and Approximation for the Vector Connectivity Problem. IPEC 2015: 377-388 - Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh:
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. IPEC 2015: 331-342 - Fahad Panolan, Geevarghese Philip, Saket Saurabh:
B-Chromatic Number: Beyond NP-Hardness. IPEC 2015: 389-401 - Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. IPEC 2015: 90-101 - R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. IPEC 2015: 365-376 - Ondrej Suchý:
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. IPEC 2015: 151-162
skipping 6 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-08-30 11:06 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