Author of the publication

Enumerating Eulerian Trails via Hamiltonian Path Enumeration.

, , , , , , and . WALCOM, volume 8973 of Lecture Notes in Computer Science, page 161-174. Springer, (2015)

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

Implementation of sequence BDDs in Erlang., , and . Erlang Workshop, page 90-91. ACM, (2011)Approximated ZDD Construction Considering Inclusion Relations of Models., , , , and . SEA², volume 11544 of Lecture Notes in Computer Science, page 265-282. Springer, (2019)Counterexamples to the long-standing conjecture on the complexity of BDD binary operations., , , , and . Inf. Process. Lett., 112 (16): 636-640 (2012)Storing Set Families More Compactly with Top ZDDs., , and . Algorithms, 14 (6): 172 (2021)Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations., , , and . Discret. Appl. Math., (2016)New Algorithms for Manipulating Sequence BDDs.. CIAA, volume 11601 of Lecture Notes in Computer Science, page 108-120. Springer, (2019)Storing Set Families More Compactly with Top ZDDs., , and . SEA, volume 160 of LIPIcs, page 6:1-6:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Single Family Algebra Operation on ZDDs Leads To Exponential Blow-Up., , and . CoRR, (2024)Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams ., , , and . Stringology, page 157-167. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)DenseZDD: A Compact and Fast Index for Families of Sets., , , , , and . SEA, volume 8504 of Lecture Notes in Computer Science, page 187-198. Springer, (2014)