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 78 matches
- 2024
- Vidya Sagar Sharma:
A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton. AAAI 2024: 20532-20539 - Szymon Torunczyk:
Structurally Tractable Graph Classes (Invited Talk). STACS 2024: 3:1-3:1 - 2023
- Russell Tsuchida, Cheng Soon Ong, Dino Sejdinovic:
Squared Neural Families: A New Class of Tractable Density Models. NeurIPS 2023 - Russell Tsuchida, Cheng Soon Ong, Dino Sejdinovic:
Squared Neural Families: A New Class of Tractable Density Models. CoRR abs/2305.13552 (2023) - Vidya Sagar Sharma:
A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton. CoRR abs/2310.04218 (2023) - Vidya Sagar Sharma:
Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons. CoRR abs/2312.17626 (2023) - 2022
- Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, Martin C. Cooper, Nicholas Asher, João Marques-Silva:
Tractable Explanations for d-DNNF Classifiers. AAAI 2022: 5719-5728 - 2020
- M. R. Rani, R. Subashini, Mohith Jagalmohanan:
Simultaneous consecutive ones submatrix and editing problems: Classical complexity and fixed-parameter tractable results. Theor. Comput. Sci. 812: 13-38 (2020) - 2019
- Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
A Tractable Class of Binary VCSPs via M-Convex Intersection. ACM Trans. Algorithms 15(3): 44:1-44:41 (2019) - Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA 2019: 37:1-37:15 - 2018
- Yazid Boumarafi, Yakoub Salhi:
Tractable Classes in Exactly-One-SAT. AIMSA 2018: 197-206 - Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS 2018: 39:1-39:14 - Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
A tractable class of binary VCSPs via M-convex intersection. CoRR abs/1801.02199 (2018) - Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. CoRR abs/1806.02771 (2018) - 2017
- Jannis Bulian, Anuj Dawar:
Fixed-Parameter Tractable Distances to Sparse Graph Classes. Algorithmica 79(1): 139-158 (2017) - Achref El Mouelhi:
Tractable classes for CSPs of arbitrary arity: from theory to practice. Constraints An Int. J. 22(1): 97-98 (2017) - Pablo Barceló, Andreas Pieris, Miguel Romero:
Semantic Optimization in Tractable Classes of Conjunctive Queries. SIGMOD Rec. 46(2): 5-17 (2017) - Yazid Boumarafi, Lakhdar Sais, Yakoub Salhi:
From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes. LPAR 2017: 286-299 - Martin C. Cooper, Stanislav Zivný:
Hybrid Tractable Classes of Constraint Problems. The Constraint Satisfaction Problem 2017: 113-135 - 2016
- Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini:
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. Artif. Intell. 234: 196-218 (2016) - Gildas Mazo, Stéphane Girard, Florence Forbes:
A flexible and tractable class of one-factor copulas. Stat. Comput. 26(5): 965-979 (2016) - Marco Benjumeda, Concha Bielza, Pedro Larrañaga:
Learning Tractable Multidimensional Bayesian Network Classifiers. Probabilistic Graphical Models 2016: 13-24 - Wady Naanaa:
Extending the Broken Triangle Property tractable class of binary CSPs. SETN 2016: 3:1-3:6 - 2015
- Samuel Stuart Wilson:
Characterising parameterized graph classes : certifying algorithms for fixed-parameter tractable problems. University of Leeds, UK, 2015 - Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
A hybrid tractable class for non-binary CSPs. Constraints An Int. J. 20(4): 383-413 (2015) - Philippe Jégou, Cyril Terrioux:
The Extendable-Triple Property: A New CSP Tractable Class beyond BTP. AAAI 2015: 3746-3754 - Martin C. Cooper, Philippe Jégou, Cyril Terrioux:
A Microstructure-Based Family of Tractable Classes for CSPs. CP 2015: 74-88 - Alban Derrien, Jean-Guillaume Fages, Thierry Petit, Charles Prud'homme:
A Global Constraint for a Tractable Class of Temporal Optimization Problems. CP 2015: 105-120 - David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. IJCAI 2015: 1945-1951 - Jannis Bulian, Anuj Dawar:
Fixed-parameter Tractable Distances to Sparse Graph Classes. IPEC 2015: 236-247
skipping 48 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-09-25 08:08 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