Author of the publication

Languages Given by Finite Automata over the Unary Alphabet.

, , , , , , , and . FSTTCS, volume 284 of LIPIcs, page 22:1-22:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs., , and . CoRR, (2022)Measure and Conquer for Max Hamming Distance XSAT., and . ISAAC, volume 149 of LIPIcs, page 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Exact Satisfiabitity with Jokers., , , and . TAMC, volume 11436 of Lecture Notes in Computer Science, page 279-294. Springer, (2019)Languages given by Finite Automata over the Unary Alphabet., , , and . CoRR, (2023)Languages Given by Finite Automata over the Unary Alphabet., , , , , , , and . FSTTCS, volume 284 of LIPIcs, page 22:1-22:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Improved Algorithms for the General Exact Satisfiability Problem., and . CoRR, (2021)Partial functions and domination., , , and . Logical Methods in Computer Science, (2015)A Bisection Approach to Subcubic Maximum Induced Matching., , , and . WALCOM, volume 14549 of Lecture Notes in Computer Science, page 257-272. Springer, (2024)An Improved Exact Algorithm for the Exact Satisfiability Problem.. COCOA, volume 12577 of Lecture Notes in Computer Science, page 304-319. Springer, (2020)A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT., , and . FSTTCS, volume 150 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)