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 37 matches
- 2021
- Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. IPEC 2021: 19:1-19:14 - Yixin Cao, Yuping Ke:
Improved Kernels for Edge Modification Problems. IPEC 2021: 13:1-13:14 - Akanksha Agrawal, Aditya Anand, Saket Saurabh:
A Polynomial Kernel for Deletion to Ptolemaic Graphs. IPEC 2021: 1:1-1:15 - Akanksha Agrawal, Ravi Kiran Allumalla, Varun Teja Dhanekula:
Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH. IPEC 2021: 2:1-2:12 - Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, Maria Paula Parga Nina:
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties. IPEC 2021: 3:1-3:15 - Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau:
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. IPEC 2021: 4:1-4:19 - Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. IPEC 2021: 5:1-5:15 - Jakub Balabán, Petr Hlinený:
Twin-Width Is Linear in the Poset Width. IPEC 2021: 6:1-6:13 - Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. IPEC 2021: 7:1-7:18 - Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto:
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. IPEC 2021: 29:1-29:4 - Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto:
PACE Solver Description: μSolver - Heuristic Track. IPEC 2021: 33:1-33:3 - Gabriel Bathie, Nicolas Bousquet, Théo Pierron:
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. IPEC 2021: 8:1-8:14 - Alexander Bille, Dominik Brandenstein, Emanuel Herrendorf:
PACE Solver Description: ADE-Solver. IPEC 2021: 28:1-28:4 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. IPEC 2021: 27:1-27:3 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. IPEC 2021: 31:1-31:4 - Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis:
Parameterized Complexities of Dominating and Independent Set Reconfiguration. IPEC 2021: 9:1-9:16 - Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-Width and Polynomial Kernels. IPEC 2021: 10:1-10:16 - Laurent Bulteau, Bertrand Marchand, Yann Ponty:
A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics. IPEC 2021: 11:1-11:15 - Elisabet Burjons, Peter Rossmanith:
Lower Bounds for Conjunctive and Disjunctive Turing Kernels. IPEC 2021: 12:1-12:17 - Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, Maximilian Sonneborn:
PACE Solver Description: PACA-JAVA. IPEC 2021: 30:1-30:4 - Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk:
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. IPEC 2021: 14:1-14:18 - Guillaume Ducoffe:
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. IPEC 2021: 15:1-15:17 - Guillaume Ducoffe:
Optimal Centrality Computations Within Bounded Clique-Width Graphs. IPEC 2021: 16:1-16:16 - Maël Dumas, Anthony Perez, Ioan Todinca:
Polynomial Kernels for Strictly Chordal Edge Modification Problems. IPEC 2021: 17:1-17:16 - Andreas Emil Feldmann, Ashutosh Rai:
On Extended Formulations For Parameterized Steiner Trees. IPEC 2021: 18:1-18:16 - Martin Josef Geiger:
PACE Solver Description: A Simplified Threshold Accepting Approach for the Cluster Editing Problem. IPEC 2021: 34:1-34:2 - Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros:
Dynamic Data Structures for Timed Automata Acceptance. IPEC 2021: 20:1-20:18 - Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close Relatives (Of Feedback Vertex Set), Revisited. IPEC 2021: 21:1-21:15 - Vít Jelínek, Michal Opler, Jakub Pekárek:
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. IPEC 2021: 22:1-22:17 - Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC 2021: 23:1-23:18
skipping 7 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-03 09:39 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