default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGordon Hoi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j2]Gordon Hoi, Frank Stephan:
Improved algorithms for the general exact satisfiability problem. Theor. Comput. Sci. 889: 60-84 (2021)- 2015
- [j1]C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky:
Partial functions and domination. Log. Methods Comput. Sci. 11(3) (2015)
Conference and Workshop Papers
- 2024
- [c7]Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili, Frank Stephan:
A Bisection Approach to Subcubic Maximum Induced Matching. WALCOM 2024: 257-272 - 2023
- [c6]Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan:
Languages Given by Finite Automata over the Unary Alphabet. FSTTCS 2023: 22:1-22:20 - 2020
- [c5]Gordon Hoi:
An Improved Exact Algorithm for the Exact Satisfiability Problem. COCOA 2020: 304-319 - [c4]Gordon Hoi, Sanjay Jain
, Frank Stephan:
A Faster Exact Algorithm to Count X3SAT Solutions. CP 2020: 375-391 - 2019
- [c3]Gordon Hoi, Sanjay Jain, Frank Stephan:
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. FSTTCS 2019: 17:1-17:14 - [c2]Gordon Hoi, Frank Stephan:
Measure and Conquer for Max Hamming Distance XSAT. ISAAC 2019: 15:1-15:19 - [c1]Gordon Hoi, Sanjay Jain, Sibylle Schwarz, Frank Stephan:
Exact Satisfiabitity with Jokers. TAMC 2019: 279-294
Informal and Other Publications
- 2023
- [i6]Gordon Hoi, Sanjay Jain, Frank Stephan, Christopher Tan:
Languages given by Finite Automata over the Unary Alphabet. CoRR abs/2302.06435 (2023) - 2022
- [i5]Gordon Hoi, Ammar Fathin Sabili, Frank Stephan:
An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs. CoRR abs/2201.03220 (2022) - 2021
- [i4]Gordon Hoi, Frank Stephan:
Improved Algorithms for the General Exact Satisfiability Problem. CoRR abs/2101.08637 (2021) - 2020
- [i3]Gordon Hoi, Sanjay Jain, Frank Stephan:
A Faster Exact Algorithm to Count X3SAT Solutions. CoRR abs/2007.07553 (2020) - [i2]Gordon Hoi:
An Improved Exact Algorithm for the Exact Satisfiability Problem. CoRR abs/2010.03850 (2020) - 2019
- [i1]Gordon Hoi, Sanjay Jain, Frank Stephan:
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. CoRR abs/1910.01293 (2019)
Coauthor Index
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-04-24 23:05 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:
