Остановите войну!
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 541 matches
- 2023
- Mark Jones, Jannik Schestag:
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. IPEC 2023: 30:1-30:12 - Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Collective Graph Exploration Parameterized by Vertex Cover. IPEC 2023: 22:1-22:18 - Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. IPEC 2023: 23:1-23:22 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC 2023: 13:1-13:17 - Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf:
Cluster Editing with Overlapping Communities. IPEC 2023: 2:1-2:12 - Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, Petra Wolf:
PACE Solver Description: Zygosity. IPEC 2023: 39:1-39:3 - Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf:
Kernelizing Temporal Exploration Problems. IPEC 2023: 1:1-1:18 - Max Bannach, Sebastian Berndt:
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. IPEC 2023: 35:1-35:14 - Max Bannach, Florian Chudigiewitsch, Till Tantau:
Existential Second-Order Logic over Graphs: Parameterized Complexity. IPEC 2023: 3:1-3:15 - Matthias Bentert, Jannik Schestag, Frank Sommer:
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. IPEC 2023: 4:1-4:12 - Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton:
PACE Solver Description: Touiouidth. IPEC 2023: 38:1-38:4 - Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma:
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC 2023: 5:1-5:14 - Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth Is NP-Complete on Cubic Graphs. IPEC 2023: 7:1-7:13 - Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen:
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC 2023: 6:1-6:19 - Édouard Bonnet, Julien Duron:
Stretch-Width. IPEC 2023: 8:1-8:15 - Édouard Bonnet, Julien Duron:
PACE Solver Description: RedAlert - Heuristic Track. IPEC 2023: 40:1-40:5 - Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi:
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC 2023: 10:1-10:22 - Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma:
Parameterized Complexity Classification for Interval Constraints. IPEC 2023: 11:1-11:19 - Riccardo Dondi, Manuel Lafond:
An FPT Algorithm for Temporal Graph Untangling. IPEC 2023: 12:1-12:16 - Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl:
Computing Complexity Measures of Degenerate Graphs. IPEC 2023: 14:1-14:21 - Maël Dumas, Anthony Perez:
An Improved Kernelization Algorithm for Trivially Perfect Editing. IPEC 2023: 15:1-15:17 - Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC 2023: 16:1-16:14 - Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Approximate Monotone Local Search for Weighted Problems. IPEC 2023: 17:1-17:23 - Robert Ganian, Liana Khazaliya, Kirill Simonov:
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. IPEC 2023: 18:1-18:17 - Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller:
Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC 2023: 20:1-20:19 - Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller:
Finding Degree-Constrained Acyclic Orientations. IPEC 2023: 19:1-19:14 - Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC 2023: 21:1-21:15 - Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinícius Fernandes dos Santos, Tom C. van der Zanden:
Minimum Separator Reconfiguration. IPEC 2023: 9:1-9:12 - Klaus Heeger, Danny Hermelin, Dvir Shabtay:
Single Machine Scheduling with Few Deadlines. IPEC 2023: 24:1-24:15 - Irene Heinrich, Simon Raßmann:
Twin-Width of Graphs with Tree-Structured Decompositions. IPEC 2023: 25:1-25:17
skipping 511 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 09:59 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