default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarry O'Sullivan
- > Home > Persons > Barry O'Sullivan
Publications
- 2014
[i11]Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon:
Soft Constraints of Difference and Equality. CoRR abs/1401.3879 (2014)- 2013
- [j25]Dániel Marx, Barry O'Sullivan
, Igor Razgon:
Finding small separators in linear time via treewidth reduction. ACM Trans. Algorithms 9(4): 30:1-30:35 (2013) - 2011
- [j18]Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon:
Soft Constraints of Difference and Equality. J. Artif. Intell. Res. 41: 97-130 (2011) - [i7]Dániel Marx, Barry O'Sullivan, Igor Razgon:
Finding small separators in linear time via treewidth reduction. CoRR abs/1110.4765 (2011) - 2010
- [c87]Dániel Marx, Barry O'Sullivan, Igor Razgon:
Treewidth Reduction for Constrained Separation and Bipartization Problems. STACS 2010: 561-572 - 2009
- [j13]Igor Razgon, Barry O'Sullivan:
Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci. 75(8): 435-450 (2009) - [c83]Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon:
Constraints of Difference and Equality: A Complete Taxonomic Characterisation. CP 2009: 424-438 - [i5]Dániel Marx, Barry O'Sullivan, Igor Razgon:
Treewidth reduction for constrained separation and bipartization problems. CoRR abs/0902.3780 (2009) - 2008
- [j10]Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon:
A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5): 21:1-21:19 (2008) - [c67]Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon:
A Soft Constraint of Equality: Complexity and Approximability. CP 2008: 358-371 - [c60]Igor Razgon, Barry O'Sullivan:
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract). ICALP (1) 2008: 551-562 - [c56]Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon:
A fixed-parameter algorithm for the directed feedback vertex set problem. STOC 2008: 177-186 - [i3]Igor Razgon, Barry O'Sullivan:
Almost 2-SAT is Fixed-Parameter Tractable. CoRR abs/0801.1300 (2008) - 2007
- [c52]Igor Razgon, Barry O'Sullivan, Gregory M. Provan:
Generalizing Global Constraints Based on Network Flows. CSCLP 2007: 127-141 - [i2]Igor Razgon, Barry O'Sullivan:
Directed Feedback Vertex Set is Fixed-Parameter Tractable. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - [i1]Igor Razgon, Barry O'Sullivan:
Directed Feedback Vertex Set is Fixed-Parameter Tractable. CoRR abs/0707.0282 (2007) - 2006
- [c38]Igor Razgon, Barry O'Sullivan:
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems. CSCLP 2006: 154-168
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.
last updated on 2024-09-02 01:02 CEST 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:
