Author of the publication

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.

, , and . ISAAC, volume 64 of LIPIcs, page 22:1-22:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs., , , and . COCOA, volume 13135 of Lecture Notes in Computer Science, page 416-430. Springer, (2021)Succinct Data Structure for Path Graphs., , , and . DCC, page 262-271. IEEE, (2022)Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number., and . DCC, page 103-112. IEEE, (2022)Space Efficient Algorithms for Breadth-Depth Search., , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 201-212. Springer, (2019)Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits., , and . ISAAC, volume 64 of LIPIcs, page 22:1-22:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Improved Space Efficient Algorithms for BFS, DFS and Applications., , and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 119-130. Springer, (2016)Succinct Data Structures for Small Clique-Width Graphs., , , and . DCC, page 133-142. IEEE, (2021)Lower Bounds for Lexicographical DFS Data Structures., and . DCC, page 449. IEEE, (2022)Space-Efficient Data Structure for Posets with Applications., , , and . SWAT, volume 227 of LIPIcs, page 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage., , , and . SWAT, volume 294 of LIPIcs, page 4:1-4:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)