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
- 2018
- Daniel Lokshtanov, Naomi Nishimura:
12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria. LIPIcs 89, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-051-4 [contents] - 2017
- Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Contraction to Generalization of Trees. IPEC 2017: 1:1-1:12 - Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. IPEC 2017: 2:1-2:13 - Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC 2017: 3:1-3:12 - Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC 2017: 4:1-4:12 - Julien Baste, Dimitrios M. Thilikos:
Contraction-Bidimensionality of Geometric Intersection Graphs. IPEC 2017: 5:1-5:13 - Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The Dominating Set Problem in Geometric Intersection Graphs. IPEC 2017: 14:1-14:12 - Andreas Björklund, Petteri Kaski, R. Ryan Williams:
Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants. IPEC 2017: 6:1-6:13 - Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. IPEC 2017: 7:1-7:13 - Édouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the Parameterized Complexity of Red-Blue Points Separation. IPEC 2017: 8:1-8:13 - Ralph Bottesch:
Relativization and Interactive Proof Systems in Parameterized Complexity Theory. IPEC 2017: 9:1-9:12 - Marin Bougeret, Ignasi Sau:
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. IPEC 2017: 10:1-10:13 - Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. IPEC 2017: 11:1-11:12 - Karthekeyan Chandrasekaran, Sahand Mozaffari:
Odd Multiway Cut in Directed Acyclic Graphs. IPEC 2017: 12:1-12:12 - Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. IPEC 2017: 13:1-13:13 - Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller:
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. IPEC 2017: 30:1-30:12 - Lech Duraj, Marvin Künnemann, Adam Polak:
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. IPEC 2017: 15:1-15:13 - David Eppstein, Denis Kurz:
K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. IPEC 2017: 16:1-16:13 - Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. IPEC 2017: 17:1-17:13 - Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. IPEC 2017: 18:1-18:13 - Petr Hlinený, Filip Pokrývka, Bodhayan Roy:
FO Model Checking of Geometric Graphs. IPEC 2017: 19:1-19:12 - Eva-Maria C. Hols, Stefan Kratsch:
Smaller Parameters for Vertex Cover Kernelization. IPEC 2017: 20:1-20:12 - Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. IPEC 2017: 21:1-21:13 - Bart M. P. Jansen, Astrid Pieterse:
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. IPEC 2017: 22:1-22:12 - Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. IPEC 2017: 23:1-23:13 - Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. IPEC 2017: 24:1-24:11 - Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki:
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. IPEC 2017: 25:1-25:12 - Michael Lampis, Valia Mitsou:
Treewidth with a Quantifier Alternation Revisited. IPEC 2017: 26:1-26:12 - George Manoussakis:
An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs. IPEC 2017: 27:1-27:8 - Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt:
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. IPEC 2017: 28:1-28:12
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-10-02 14:20 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