Gordon Hoi

According to our database1, Gordon Hoi authored at least 11 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Bisection Approach to Subcubic Maximum Induced Matching.
Proceedings of the WALCOM: Algorithms and Computation, 2024

2023
Languages given by Finite Automata over the Unary Alphabet.
CoRR, 2023

Languages Given by Finite Automata over the Unary Alphabet.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs.
CoRR, 2022

2021
Improved algorithms for the general exact satisfiability problem.
Theor. Comput. Sci., 2021

2020
A Faster Exact Algorithm to Count X3SAT Solutions.
Proceedings of the Principles and Practice of Constraint Programming, 2020

An Improved Exact Algorithm for the Exact Satisfiability Problem.
Proceedings of the Combinatorial Optimization and Applications, 2020

2019
Exact Satisfiabitity with Jokers.
Proceedings of the Theory and Applications of Models of Computation, 2019

Measure and Conquer for Max Hamming Distance XSAT.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2015
Partial functions and domination.
Log. Methods Comput. Sci., 2015


  Loading...