Остановите войну!
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 42 matches
- 2023
- Tomoko Komiyama, Tomohiro Suzuki:
Problem Relaxation Methods for Quantum Minimum Fill-in Algorithm. IEEE Access 11: 114424-114431 (2023) - 2020
- Yixin Cao, R. B. Sandeep:
Minimum fill-in: Inapproximability and almost tight lower bounds. Inf. Comput. 271: 104514 (2020) - Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk, Lukás Mach:
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. ACM Trans. Algorithms 16(2): 25:1-25:31 (2020) - 2017
- Yixin Cao, R. B. Sandeep:
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. SODA 2017: 875-880 - 2016
- Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk:
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. SODA 2016: 1132-1151 - Yixin Cao, R. B. Sandeep:
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. CoRR abs/1606.08141 (2016) - Liang Sun, Jason Mielens, Jason Baldridge:
Fill it up: Exploiting partial dependency annotations in a minimum spanning tree parser. CoRR abs/1611.08765 (2016) - 2015
- Fedor V. Fomin, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica 71(1): 1-20 (2015) - Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk:
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems. CoRR abs/1508.05282 (2015) - 2014
- Masanobu Furuse, Koichi Yamazaki:
A revisit of the scheme for computing treewidth and minimum fill-in. Theor. Comput. Sci. 531: 66-76 (2014) - 2013
- Fedor V. Fomin, Yngve Villanger:
Subexponential Parameterized Algorithm for Minimum Fill-In. SIAM J. Comput. 42(6): 2197-2216 (2013) - 2012
- Fedor V. Fomin, Yngve Villanger:
Subexponential parameterized algorithm for minimum fill-in. SODA 2012: 1737-1746 - 2011
- Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger:
Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61(4): 817-838 (2011) - Fedor V. Fomin, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS 2011: 164-175 - Fedor V. Fomin, Yngve Villanger:
Subexponential Parameterized Algorithm for Minimum Fill-in. CoRR abs/1104.2230 (2011) - 2010
- Federico Mancini:
Minimum fill-in and treewidth of split+ke and split+kv graphs. Discret. Appl. Math. 158(7): 747-754 (2010) - Daniel Meister:
Treewidth and minimum fill-in on permutation graphs in linear time. Theor. Comput. Sci. 411(40-42): 3685-3700 (2010) - 2009
- H. Martin Bücker, Michael Lülfesmann, Arno Rasch:
Assessing an approximation algorithm for the minimum fill-in problem in practice. Combinatorial Scientific Computing 2009 - 2008
- Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger:
Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008) - Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger:
Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293 - 2007
- Federico Mancini:
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. ISAAC 2007: 881-892 - 2006
- Yngve Villanger:
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. LATIN 2006: 800-811 - 2005
- Daniel Meister:
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. WG 2005: 91-102 - 2004
- Fedor V. Fomin, Dieter Kratsch, Ioan Todinca:
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580 - 2003
- Hans L. Bodlaender, Udi Rotics:
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003) - 2002
- Hans L. Bodlaender, Udi Rotics:
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT 2002: 388-397 - 2001
- Vincent Bouchitté, Ioan Todinca:
Treewidth and Minimum Fill-in: Grouping the Minimal Separators. SIAM J. Comput. 31(1): 212-232 (2001) - 2000
- Hajo Broersma, Elias Dahlhaus, Ton Kloks:
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discret. Appl. Math. 99(1-3): 367-400 (2000) - Assaf Natanzon, Ron Shamir, Roded Sharan:
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem. SIAM J. Comput. 30(4): 1067-1079 (2000) - 1999
- Vincent Bouchitté, Ioan Todinca:
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. STACS 1999: 197-206
skipping 12 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-04-24 02:44 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