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
- 2024
- Karthik C. S., Euiwoong Lee, Pasin Manurangsi:
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. IPEC 2024: 6:1-6:18 - Paul Bastide, Carla Groenland:
Quasi-Linear Distance Query Reconstruction for Graphs of Bounded Treelength. IPEC 2024: 20:1-20:11 - Jakub Balabán, Robert Ganian, Mathis Rocton:
Twin-Width Meets Feedback Edges and Vertex Integrity. IPEC 2024: 3:1-3:22 - Max Bannach, Florian Chudigiewitsch, Kim-Manuel Klein, Marcel Wienöbst:
PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization. IPEC 2024: 28:1-28:4 - Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh:
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. IPEC 2024: 14:1-14:23 - Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Kick the Cliques. IPEC 2024: 13:1-13:17 - Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo:
On Controlling Knockout Tournaments Without Perfect Information. IPEC 2024: 7:1-7:15 - Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. IPEC 2024: 4:1-4:20 - Kimon Boehmer, Lukas Lee George, Fanny Hauser, Jesse Palarus:
PACE Solver Description: Arcee. IPEC 2024: 33:1-33:4 - Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad:
Parameterized Shortest Path Reconfiguration. IPEC 2024: 23:1-23:14 - Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif:
Combining Crown Structures for Vulnerability Measures. IPEC 2024: 1:1-1:15 - Alexander Dobler:
PACE Solver Description: CRGone. IPEC 2024: 29:1-29:4 - Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik:
Unsplittable Flow on a Short Path. IPEC 2024: 5:1-5:22 - Henning Fernau, Kevin Mann:
Roman Hitting Functions. IPEC 2024: 24:1-24:15 - Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis:
Parameterised Distance to Local Irregularity. IPEC 2024: 18:1-18:15 - Jaroslav Garvardt, Christian Komusiewicz:
Modularity Clustering Parameterized by Max Leaf Number. IPEC 2024: 16:1-16:14 - Martin Josef Geiger:
PACE Solver Description: Martin_J_Geiger. IPEC 2024: 32:1-32:4 - Guilherme C. M. Gomes, Emanuel Juliano, Gabriel Martins, Vinícius Fernandes dos Santos:
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration. IPEC 2024: 25:1-25:15 - Jakob Greilhuber, Roohani Sharma:
Component Order Connectivity Admits No Polynomial Kernel Parameterized by the Distance to Subdivided Comb Graphs. IPEC 2024: 21:1-21:17 - Carla Groenland, Jesper Nederlof, Tomohiro Koana:
A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor. IPEC 2024: 12:1-12:17 - Ishay Haviv, Dror Rabinovich:
Kernelization for Orthogonality Dimension. IPEC 2024: 8:1-8:17 - Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh:
Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. IPEC 2024: 17:1-17:17 - Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh:
Preprocessing to Reduce the Search Space for Odd Cycle Transversal. IPEC 2024: 15:1-15:18 - Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt:
PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. IPEC 2024: 27:1-27:4 - Matthias Kaul, Matthias Mnich, Hendrik Molter:
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. IPEC 2024: 19:1-19:15 - Philipp Kindermann, Fabian Klute, Soeren Terziadis:
The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization. IPEC 2024: 26:1-26:20 - Tomohiro Koana, Nidhi Purohit, Kirill Simonov:
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. IPEC 2024: 10:1-10:17 - Ragnar Groot Koerkamp, Mees J. de Vries:
PACE Solver Description: OCMu64, a Solver for One-Sided Crossing Minimization. IPEC 2024: 35:1-35:5 - Marvin Künnemann, Mirza Redzic:
Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs. IPEC 2024: 9:1-9:18 - Kenneth Langedal, Matthias Bentert, Thorgal Blanco, Pål Grønås Drange:
PACE Solver Description: LUNCH - Linear Uncrossing Heuristics. IPEC 2024: 34:1-34:4
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-12-22 12:43 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: