Остановите войну!
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 34 matches
- 2022
- Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz:
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC 2022: 5:1-5:23 - Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. IPEC 2022: 1:1-1:16 - Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu:
Parameterized Complexity of Perfectly Matched Sets. IPEC 2022: 2:1-2:13 - Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt:
PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. IPEC 2022: 28:1-28:4 - Brage I. K. Bakkane, Lars Jaffke:
On the Hardness of Generalized Domination Problems Parameterized by Mim-Width. IPEC 2022: 3:1-3:19 - Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
FPT Approximation for Fair Minimum-Load Clustering. IPEC 2022: 4:1-4:14 - Gabriel Bathie, Gaétan Berthe, Yoann Coudert-Osmont, David Desobry, Amadeus Reinald, Mathis Rocton:
PACE Solver Description: DreyFVS. IPEC 2022: 31:1-31:4 - Moritz Bergenthal, Jona Dirks, Thorben Freese, Jakob Gahde, Enna Gerhard, Mario Grobler, Sebastian Siebertz:
PACE Solver Description: GraPA-JAVA. IPEC 2022: 30:1-30:4 - Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the Parameterized Complexity of Computing Tree-Partitions. IPEC 2022: 7:1-7:20 - Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima:
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. IPEC 2022: 8:1-8:18 - Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-Structured Graphs. IPEC 2022: 6:1-6:17 - Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-Width VIII: Delineation and Win-Wins. IPEC 2022: 9:1-9:18 - Yuming Du, Qingyun Zhang, Junzhou Xu, Shungen Zhang, Chao Liao, Zhihuai Chen, Zhibo Sun, Zhouxing Su, Junwen Ding, Chen Wu, Pinyan Lu, Zhi-Peng Lv:
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem. IPEC 2022: 29:1-29:3 - Guillaume Ducoffe:
Obstructions to Faster Diameter Computation: Asteroidal Sets. IPEC 2022: 10:1-10:24 - Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the Parameterized Complexity of Symmetric Directed Multicut. IPEC 2022: 11:1-11:17 - Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. IPEC 2022: 12:1-12:22 - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. IPEC 2022: 13:1-13:14 - Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC 2022: 14:1-14:24 - Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. IPEC 2022: 15:1-15:18 - Ernestine Großmann, Tobias Heuer, Christian Schulz, Darren Strash:
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set. IPEC 2022: 26:1-26:18 - Ishay Haviv:
A Fixed-Parameter Algorithm for the Schrijver Problem. IPEC 2022: 16:1-16:16 - Falko Hegerfeld, Stefan Kratsch:
Towards Exact Structural Thresholds for Parameterized Complexity. IPEC 2022: 17:1-17:20 - Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. IPEC 2022: 18:1-18:16 - Leon Kellerhals, Tomohiro Koana, Pascal Kunz:
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. IPEC 2022: 19:1-19:14 - Rafael Kiesel, André Schidler:
PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT. IPEC 2022: 32:1-32:4 - Christian Komusiewicz, Nils Morawietz:
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial. IPEC 2022: 20:1-20:18 - Maher Mallem, Claire Hanen, Alix Munier Kordon:
Parameterized Complexity of a Parallel Machine Scheduling Problem. IPEC 2022: 21:1-21:21 - Dániel Marx, Govind S. Sankar, Philipp Schepper:
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC 2022: 22:1-22:23 - Yosuke Mizutani, Blair D. Sullivan:
Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph. IPEC 2022: 23:1-23:18 - Jelle J. Oostveen, Erik Jan van Leeuwen:
Parameterized Complexity of Streaming Diameter and Connectivity Problems. IPEC 2022: 24:1-24:16
skipping 4 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-05-13 04:34 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