Author of the publication

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.

, , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 554-565. 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

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights., , , , and . WALCOM, volume 12635 of Lecture Notes in Computer Science, page 52-64. Springer, (2021)A Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 554-565. Springer, (2015)A Satisfiability Algorithm for Deterministic Width-2 Branching Programs., , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1298-1308 (September 2022)Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges., , , and . CoRR, (2023)Red-Black Spanners for Mixed-Charging Vehicular Networks., , , , , and . COCOON (1), volume 14422 of Lecture Notes in Computer Science, page 220-231. Springer, (2023)Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges., , , and . COCOA (1), volume 14461 of Lecture Notes in Computer Science, page 29-42. Springer, (2023)Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs., , and . ISAAC, volume 92 of LIPIcs, page 58:1-58:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Small Complexity Gaps for Comparison-Based Sorting., , and . Adventures Between Lower Bounds and Higher Altitudes, volume 11011 of Lecture Notes in Computer Science, page 280-296. Springer, (2018)Locating Evacuation Centers Optimally in Path and Cycle Networks., , , , , and . ATMOS, volume 96 of OASIcs, page 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom., , , and . Electron. Colloquium Comput. Complex., (2015)